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_init1_false-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:54:46,803 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:54:46,805 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:54:46,818 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:54:46,818 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:54:46,819 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:54:46,821 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:54:46,823 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:54:46,825 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:54:46,826 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:54:46,827 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:54:46,828 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:54:46,829 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:54:46,830 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:54:46,833 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:54:46,834 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:54:46,835 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:54:46,837 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:54:46,839 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:54:46,841 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:54:46,843 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:54:46,844 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:54:46,847 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:54:46,847 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:54:46,847 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:54:46,848 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:54:46,850 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:54:46,850 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:54:46,851 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:54:46,853 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:54:46,853 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:54:46,854 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:54:46,854 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:54:46,854 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:54:46,855 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:54:46,856 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:54:46,857 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:46,873 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:54:46,873 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:54:46,874 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:54:46,875 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:54:46,875 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:54:46,875 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:54:46,876 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:54:46,876 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:54:46,876 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:54:46,876 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 11:54:46,877 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:54:46,877 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:54:46,877 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:54:46,877 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:54:46,877 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:54:46,878 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:54:46,878 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:54:46,878 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:54:46,878 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:54:46,879 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:54:46,879 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:54:46,879 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:54:46,879 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:54:46,879 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:54:46,880 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:54:46,880 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:54:46,880 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:54:46,880 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 11:54:46,880 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:54:46,881 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 11:54:46,881 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:54:46,945 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:54:46,967 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:54:46,971 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:54:46,973 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:54:46,974 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:54:46,975 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_init1_false-unreach-call_ground.i [2018-11-23 11:54:47,049 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92cf1b7b1/e3ba5afa2f9d4411b6552b5a84be24cb/FLAG100586996 [2018-11-23 11:54:47,542 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:54:47,543 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_init1_false-unreach-call_ground.i [2018-11-23 11:54:47,551 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92cf1b7b1/e3ba5afa2f9d4411b6552b5a84be24cb/FLAG100586996 [2018-11-23 11:54:47,898 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92cf1b7b1/e3ba5afa2f9d4411b6552b5a84be24cb [2018-11-23 11:54:47,910 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:54:47,912 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:54:47,914 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:54:47,917 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:54:47,921 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:54:47,924 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:54:47" (1/1) ... [2018-11-23 11:54:47,927 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38704584 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:47, skipping insertion in model container [2018-11-23 11:54:47,927 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:54:47" (1/1) ... [2018-11-23 11:54:47,938 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:54:47,960 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:54:48,188 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:54:48,194 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:54:48,220 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:54:48,255 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:54:48,255 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,255 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:54:48,257 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:54:48,257 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:54:48,257 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:54:48,268 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,279 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,289 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:54:48,289 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:54:48,290 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:54:48,290 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:54:48,302 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,302 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,305 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,305 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,319 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,330 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,332 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,339 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:54:48,340 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:54:48,340 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:54:48,340 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:54:48,342 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,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 11:54:48,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:54:48,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:54:48,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:54:48,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:54:48,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:54:48,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 11:54:48,481 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:54:48,481 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:54:48,481 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:54:48,481 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:54:48,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:54:48,967 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:54:48,968 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 11:54:48,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:54:48 BoogieIcfgContainer [2018-11-23 11:54:48,969 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:54:48,970 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:54:48,970 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:54:48,973 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:54:48,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:54:47" (1/3) ... [2018-11-23 11:54:48,974 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32e9bcc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:54:48, skipping insertion in model container [2018-11-23 11:54:48,975 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:48,975 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32e9bcc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:54:48, skipping insertion in model container [2018-11-23 11:54:48,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:54:48" (3/3) ... [2018-11-23 11:54:48,977 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_init1_false-unreach-call_ground.i [2018-11-23 11:54:48,987 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:54:48,995 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:54:49,014 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:54:49,048 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:54:49,049 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:54:49,049 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:54:49,049 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:54:49,049 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:54:49,050 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:54:49,050 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:54:49,050 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:54:49,050 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:54:49,068 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-11-23 11:54:49,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 11:54:49,074 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:49,076 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:49,078 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:49,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:49,085 INFO L82 PathProgramCache]: Analyzing trace with hash -441053002, now seen corresponding path program 1 times [2018-11-23 11:54:49,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:49,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:49,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:49,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:54:49,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:49,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:49,287 INFO L256 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {26#true} is VALID [2018-11-23 11:54:49,291 INFO L273 TraceCheckUtils]: 1: Hoare triple {26#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26#true} is VALID [2018-11-23 11:54:49,292 INFO L273 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2018-11-23 11:54:49,292 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #48#return; {26#true} is VALID [2018-11-23 11:54:49,292 INFO L256 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret2 := main(); {26#true} is VALID [2018-11-23 11:54:49,293 INFO L273 TraceCheckUtils]: 5: Hoare triple {26#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {26#true} is VALID [2018-11-23 11:54:49,295 INFO L273 TraceCheckUtils]: 6: Hoare triple {26#true} assume !true; {27#false} is VALID [2018-11-23 11:54:49,296 INFO L273 TraceCheckUtils]: 7: Hoare triple {27#false} havoc ~x~0;~x~0 := 0; {27#false} is VALID [2018-11-23 11:54:49,296 INFO L273 TraceCheckUtils]: 8: Hoare triple {27#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {27#false} is VALID [2018-11-23 11:54:49,296 INFO L256 TraceCheckUtils]: 9: Hoare triple {27#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {27#false} is VALID [2018-11-23 11:54:49,297 INFO L273 TraceCheckUtils]: 10: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2018-11-23 11:54:49,297 INFO L273 TraceCheckUtils]: 11: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2018-11-23 11:54:49,298 INFO L273 TraceCheckUtils]: 12: Hoare triple {27#false} assume !false; {27#false} is VALID [2018-11-23 11:54:49,301 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,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:54:49,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:54:49,309 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 11:54:49,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:49,316 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:54:49,370 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:49,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:54:49,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:54:49,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:54:49,381 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2018-11-23 11:54:49,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:49,509 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2018-11-23 11:54:49,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:54:49,510 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 11:54:49,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:49,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:54:49,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 46 transitions. [2018-11-23 11:54:49,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:54:49,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 46 transitions. [2018-11-23 11:54:49,527 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 46 transitions. [2018-11-23 11:54:49,909 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:49,919 INFO L225 Difference]: With dead ends: 39 [2018-11-23 11:54:49,920 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 11:54:49,923 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:49,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 11:54:49,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 11:54:49,970 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:49,971 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-11-23 11:54:49,972 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 11:54:49,972 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 11:54:49,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:49,976 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-23 11:54:49,976 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 11:54:49,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:49,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:49,977 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 11:54:49,977 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 11:54:49,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:49,981 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-23 11:54:49,981 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 11:54:49,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:49,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:49,982 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:49,982 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:49,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:54:49,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-23 11:54:49,986 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2018-11-23 11:54:49,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:49,987 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-23 11:54:49,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:54:49,987 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 11:54:49,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 11:54:49,988 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:49,988 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:49,988 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:49,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:49,989 INFO L82 PathProgramCache]: Analyzing trace with hash 303899570, now seen corresponding path program 1 times [2018-11-23 11:54:49,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:49,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:49,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:49,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:54:49,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:50,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:50,088 INFO L256 TraceCheckUtils]: 0: Hoare triple {142#true} call ULTIMATE.init(); {142#true} is VALID [2018-11-23 11:54:50,089 INFO L273 TraceCheckUtils]: 1: Hoare triple {142#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {142#true} is VALID [2018-11-23 11:54:50,089 INFO L273 TraceCheckUtils]: 2: Hoare triple {142#true} assume true; {142#true} is VALID [2018-11-23 11:54:50,089 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {142#true} {142#true} #48#return; {142#true} is VALID [2018-11-23 11:54:50,089 INFO L256 TraceCheckUtils]: 4: Hoare triple {142#true} call #t~ret2 := main(); {142#true} is VALID [2018-11-23 11:54:50,091 INFO L273 TraceCheckUtils]: 5: Hoare triple {142#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {144#(= main_~i~0 0)} is VALID [2018-11-23 11:54:50,091 INFO L273 TraceCheckUtils]: 6: Hoare triple {144#(= main_~i~0 0)} assume !(~i~0 < 100000); {143#false} is VALID [2018-11-23 11:54:50,092 INFO L273 TraceCheckUtils]: 7: Hoare triple {143#false} havoc ~x~0;~x~0 := 0; {143#false} is VALID [2018-11-23 11:54:50,092 INFO L273 TraceCheckUtils]: 8: Hoare triple {143#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {143#false} is VALID [2018-11-23 11:54:50,093 INFO L256 TraceCheckUtils]: 9: Hoare triple {143#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {143#false} is VALID [2018-11-23 11:54:50,093 INFO L273 TraceCheckUtils]: 10: Hoare triple {143#false} ~cond := #in~cond; {143#false} is VALID [2018-11-23 11:54:50,094 INFO L273 TraceCheckUtils]: 11: Hoare triple {143#false} assume 0 == ~cond; {143#false} is VALID [2018-11-23 11:54:50,094 INFO L273 TraceCheckUtils]: 12: Hoare triple {143#false} assume !false; {143#false} is VALID [2018-11-23 11:54:50,095 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,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:54:50,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:54:50,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 11:54:50,098 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:50,098 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:54:50,158 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:50,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:54:50,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:54:50,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:54:50,160 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 3 states. [2018-11-23 11:54:50,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:50,337 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2018-11-23 11:54:50,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:54:50,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 11:54:50,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:50,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:54:50,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2018-11-23 11:54:50,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:54:50,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2018-11-23 11:54:50,343 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 32 transitions. [2018-11-23 11:54:50,436 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:54:50,438 INFO L225 Difference]: With dead ends: 30 [2018-11-23 11:54:50,438 INFO L226 Difference]: Without dead ends: 19 [2018-11-23 11:54:50,439 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,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-23 11:54:50,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-23 11:54:50,467 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:50,467 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2018-11-23 11:54:50,467 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 11:54:50,468 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 11:54:50,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:50,469 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-23 11:54:50,470 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 11:54:50,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:50,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:50,470 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 11:54:50,471 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 11:54:50,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:50,473 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-23 11:54:50,473 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 11:54:50,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:50,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:50,474 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:50,474 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:50,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:54:50,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-11-23 11:54:50,477 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 13 [2018-11-23 11:54:50,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:50,477 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-23 11:54:50,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:54:50,477 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 11:54:50,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:54:50,478 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:50,478 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:50,479 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:50,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:50,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1260126610, now seen corresponding path program 1 times [2018-11-23 11:54:50,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:50,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:50,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:50,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:54:50,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:50,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:50,587 INFO L256 TraceCheckUtils]: 0: Hoare triple {255#true} call ULTIMATE.init(); {255#true} is VALID [2018-11-23 11:54:50,587 INFO L273 TraceCheckUtils]: 1: Hoare triple {255#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {255#true} is VALID [2018-11-23 11:54:50,588 INFO L273 TraceCheckUtils]: 2: Hoare triple {255#true} assume true; {255#true} is VALID [2018-11-23 11:54:50,588 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {255#true} {255#true} #48#return; {255#true} is VALID [2018-11-23 11:54:50,588 INFO L256 TraceCheckUtils]: 4: Hoare triple {255#true} call #t~ret2 := main(); {255#true} is VALID [2018-11-23 11:54:50,590 INFO L273 TraceCheckUtils]: 5: Hoare triple {255#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {257#(= main_~i~0 0)} is VALID [2018-11-23 11:54:50,596 INFO L273 TraceCheckUtils]: 6: Hoare triple {257#(= 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; {258#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:50,597 INFO L273 TraceCheckUtils]: 7: Hoare triple {258#(<= main_~i~0 1)} assume !(~i~0 < 100000); {256#false} is VALID [2018-11-23 11:54:50,597 INFO L273 TraceCheckUtils]: 8: Hoare triple {256#false} havoc ~x~0;~x~0 := 0; {256#false} is VALID [2018-11-23 11:54:50,598 INFO L273 TraceCheckUtils]: 9: Hoare triple {256#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {256#false} is VALID [2018-11-23 11:54:50,598 INFO L256 TraceCheckUtils]: 10: Hoare triple {256#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {256#false} is VALID [2018-11-23 11:54:50,598 INFO L273 TraceCheckUtils]: 11: Hoare triple {256#false} ~cond := #in~cond; {256#false} is VALID [2018-11-23 11:54:50,598 INFO L273 TraceCheckUtils]: 12: Hoare triple {256#false} assume 0 == ~cond; {256#false} is VALID [2018-11-23 11:54:50,599 INFO L273 TraceCheckUtils]: 13: Hoare triple {256#false} assume !false; {256#false} is VALID [2018-11-23 11:54:50,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:54:50,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:50,601 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:50,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:54:50,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:50,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:50,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:51,047 INFO L256 TraceCheckUtils]: 0: Hoare triple {255#true} call ULTIMATE.init(); {255#true} is VALID [2018-11-23 11:54:51,048 INFO L273 TraceCheckUtils]: 1: Hoare triple {255#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {255#true} is VALID [2018-11-23 11:54:51,048 INFO L273 TraceCheckUtils]: 2: Hoare triple {255#true} assume true; {255#true} is VALID [2018-11-23 11:54:51,048 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {255#true} {255#true} #48#return; {255#true} is VALID [2018-11-23 11:54:51,048 INFO L256 TraceCheckUtils]: 4: Hoare triple {255#true} call #t~ret2 := main(); {255#true} is VALID [2018-11-23 11:54:51,049 INFO L273 TraceCheckUtils]: 5: Hoare triple {255#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {277#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:51,050 INFO L273 TraceCheckUtils]: 6: Hoare triple {277#(<= 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; {258#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:51,054 INFO L273 TraceCheckUtils]: 7: Hoare triple {258#(<= main_~i~0 1)} assume !(~i~0 < 100000); {256#false} is VALID [2018-11-23 11:54:51,055 INFO L273 TraceCheckUtils]: 8: Hoare triple {256#false} havoc ~x~0;~x~0 := 0; {256#false} is VALID [2018-11-23 11:54:51,055 INFO L273 TraceCheckUtils]: 9: Hoare triple {256#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {256#false} is VALID [2018-11-23 11:54:51,055 INFO L256 TraceCheckUtils]: 10: Hoare triple {256#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {256#false} is VALID [2018-11-23 11:54:51,056 INFO L273 TraceCheckUtils]: 11: Hoare triple {256#false} ~cond := #in~cond; {256#false} is VALID [2018-11-23 11:54:51,056 INFO L273 TraceCheckUtils]: 12: Hoare triple {256#false} assume 0 == ~cond; {256#false} is VALID [2018-11-23 11:54:51,056 INFO L273 TraceCheckUtils]: 13: Hoare triple {256#false} assume !false; {256#false} is VALID [2018-11-23 11:54:51,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:54:51,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:51,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 11:54:51,084 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 11:54:51,084 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:51,084 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:54:51,128 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:51,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:54:51,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:54:51,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:54:51,129 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 5 states. [2018-11-23 11:54:51,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:51,277 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-11-23 11:54:51,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:54:51,277 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 11:54:51,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:51,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:54:51,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2018-11-23 11:54:51,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:54:51,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2018-11-23 11:54:51,283 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 33 transitions. [2018-11-23 11:54:51,432 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:54:51,433 INFO L225 Difference]: With dead ends: 31 [2018-11-23 11:54:51,434 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 11:54:51,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 11:54:51,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 11:54:51,450 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:51,451 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-23 11:54:51,451 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 11:54:51,451 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 11:54:51,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:51,454 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2018-11-23 11:54:51,454 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 11:54:51,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:51,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:51,455 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 11:54:51,455 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 11:54:51,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:51,457 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2018-11-23 11:54:51,457 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 11:54:51,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:51,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:51,458 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:51,458 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:51,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:54:51,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-11-23 11:54:51,460 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 14 [2018-11-23 11:54:51,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:51,461 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-23 11:54:51,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:54:51,461 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 11:54:51,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 11:54:51,462 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:51,462 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:51,462 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:51,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:51,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1794669362, now seen corresponding path program 2 times [2018-11-23 11:54:51,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:51,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:51,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:51,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:54:51,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:51,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:51,738 INFO L256 TraceCheckUtils]: 0: Hoare triple {415#true} call ULTIMATE.init(); {415#true} is VALID [2018-11-23 11:54:51,739 INFO L273 TraceCheckUtils]: 1: Hoare triple {415#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {415#true} is VALID [2018-11-23 11:54:51,739 INFO L273 TraceCheckUtils]: 2: Hoare triple {415#true} assume true; {415#true} is VALID [2018-11-23 11:54:51,739 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {415#true} {415#true} #48#return; {415#true} is VALID [2018-11-23 11:54:51,740 INFO L256 TraceCheckUtils]: 4: Hoare triple {415#true} call #t~ret2 := main(); {415#true} is VALID [2018-11-23 11:54:51,746 INFO L273 TraceCheckUtils]: 5: Hoare triple {415#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {417#(= main_~i~0 0)} is VALID [2018-11-23 11:54:51,747 INFO L273 TraceCheckUtils]: 6: Hoare triple {417#(= 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; {418#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:51,748 INFO L273 TraceCheckUtils]: 7: Hoare triple {418#(<= 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; {419#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:51,751 INFO L273 TraceCheckUtils]: 8: Hoare triple {419#(<= main_~i~0 2)} assume !(~i~0 < 100000); {416#false} is VALID [2018-11-23 11:54:51,752 INFO L273 TraceCheckUtils]: 9: Hoare triple {416#false} havoc ~x~0;~x~0 := 0; {416#false} is VALID [2018-11-23 11:54:51,752 INFO L273 TraceCheckUtils]: 10: Hoare triple {416#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {416#false} is VALID [2018-11-23 11:54:51,752 INFO L256 TraceCheckUtils]: 11: Hoare triple {416#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {416#false} is VALID [2018-11-23 11:54:51,753 INFO L273 TraceCheckUtils]: 12: Hoare triple {416#false} ~cond := #in~cond; {416#false} is VALID [2018-11-23 11:54:51,753 INFO L273 TraceCheckUtils]: 13: Hoare triple {416#false} assume 0 == ~cond; {416#false} is VALID [2018-11-23 11:54:51,753 INFO L273 TraceCheckUtils]: 14: Hoare triple {416#false} assume !false; {416#false} is VALID [2018-11-23 11:54:51,754 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:54:51,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:51,754 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:51,764 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:54:51,780 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:54:51,781 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:51,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:51,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:51,938 INFO L256 TraceCheckUtils]: 0: Hoare triple {415#true} call ULTIMATE.init(); {415#true} is VALID [2018-11-23 11:54:51,938 INFO L273 TraceCheckUtils]: 1: Hoare triple {415#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {415#true} is VALID [2018-11-23 11:54:51,939 INFO L273 TraceCheckUtils]: 2: Hoare triple {415#true} assume true; {415#true} is VALID [2018-11-23 11:54:51,939 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {415#true} {415#true} #48#return; {415#true} is VALID [2018-11-23 11:54:51,939 INFO L256 TraceCheckUtils]: 4: Hoare triple {415#true} call #t~ret2 := main(); {415#true} is VALID [2018-11-23 11:54:51,940 INFO L273 TraceCheckUtils]: 5: Hoare triple {415#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {438#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:51,941 INFO L273 TraceCheckUtils]: 6: Hoare triple {438#(<= 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; {418#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:51,942 INFO L273 TraceCheckUtils]: 7: Hoare triple {418#(<= 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; {419#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:51,943 INFO L273 TraceCheckUtils]: 8: Hoare triple {419#(<= main_~i~0 2)} assume !(~i~0 < 100000); {416#false} is VALID [2018-11-23 11:54:51,943 INFO L273 TraceCheckUtils]: 9: Hoare triple {416#false} havoc ~x~0;~x~0 := 0; {416#false} is VALID [2018-11-23 11:54:51,943 INFO L273 TraceCheckUtils]: 10: Hoare triple {416#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {416#false} is VALID [2018-11-23 11:54:51,944 INFO L256 TraceCheckUtils]: 11: Hoare triple {416#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {416#false} is VALID [2018-11-23 11:54:51,944 INFO L273 TraceCheckUtils]: 12: Hoare triple {416#false} ~cond := #in~cond; {416#false} is VALID [2018-11-23 11:54:51,945 INFO L273 TraceCheckUtils]: 13: Hoare triple {416#false} assume 0 == ~cond; {416#false} is VALID [2018-11-23 11:54:51,945 INFO L273 TraceCheckUtils]: 14: Hoare triple {416#false} assume !false; {416#false} is VALID [2018-11-23 11:54:51,946 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:54:51,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:51,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 11:54:51,967 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-23 11:54:51,967 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:51,967 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:54:52,002 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:52,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:54:52,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:54:52,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:54:52,003 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 6 states. [2018-11-23 11:54:52,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:52,214 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-11-23 11:54:52,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:54:52,214 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-23 11:54:52,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:52,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:54:52,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2018-11-23 11:54:52,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:54:52,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2018-11-23 11:54:52,219 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 34 transitions. [2018-11-23 11:54:52,388 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:54:52,390 INFO L225 Difference]: With dead ends: 32 [2018-11-23 11:54:52,390 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 11:54:52,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:54:52,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 11:54:52,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-23 11:54:52,409 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:52,409 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2018-11-23 11:54:52,410 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 11:54:52,410 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 11:54:52,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:52,412 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-11-23 11:54:52,412 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-23 11:54:52,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:52,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:52,413 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 11:54:52,413 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 11:54:52,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:52,415 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-11-23 11:54:52,415 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-23 11:54:52,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:52,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:52,416 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:52,416 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:52,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:54:52,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-23 11:54:52,418 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 15 [2018-11-23 11:54:52,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:52,419 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-23 11:54:52,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:54:52,419 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-23 11:54:52,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:54:52,420 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:52,420 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:52,420 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:52,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:52,421 INFO L82 PathProgramCache]: Analyzing trace with hash 2004063982, now seen corresponding path program 3 times [2018-11-23 11:54:52,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:52,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:52,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:52,422 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:52,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:52,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:52,541 INFO L256 TraceCheckUtils]: 0: Hoare triple {585#true} call ULTIMATE.init(); {585#true} is VALID [2018-11-23 11:54:52,541 INFO L273 TraceCheckUtils]: 1: Hoare triple {585#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {585#true} is VALID [2018-11-23 11:54:52,542 INFO L273 TraceCheckUtils]: 2: Hoare triple {585#true} assume true; {585#true} is VALID [2018-11-23 11:54:52,542 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {585#true} {585#true} #48#return; {585#true} is VALID [2018-11-23 11:54:52,542 INFO L256 TraceCheckUtils]: 4: Hoare triple {585#true} call #t~ret2 := main(); {585#true} is VALID [2018-11-23 11:54:52,543 INFO L273 TraceCheckUtils]: 5: Hoare triple {585#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {587#(= main_~i~0 0)} is VALID [2018-11-23 11:54:52,545 INFO L273 TraceCheckUtils]: 6: Hoare triple {587#(= 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; {588#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:52,546 INFO L273 TraceCheckUtils]: 7: Hoare triple {588#(<= 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; {589#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:52,547 INFO L273 TraceCheckUtils]: 8: Hoare triple {589#(<= 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; {590#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:52,549 INFO L273 TraceCheckUtils]: 9: Hoare triple {590#(<= main_~i~0 3)} assume !(~i~0 < 100000); {586#false} is VALID [2018-11-23 11:54:52,549 INFO L273 TraceCheckUtils]: 10: Hoare triple {586#false} havoc ~x~0;~x~0 := 0; {586#false} is VALID [2018-11-23 11:54:52,549 INFO L273 TraceCheckUtils]: 11: Hoare triple {586#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {586#false} is VALID [2018-11-23 11:54:52,550 INFO L256 TraceCheckUtils]: 12: Hoare triple {586#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {586#false} is VALID [2018-11-23 11:54:52,550 INFO L273 TraceCheckUtils]: 13: Hoare triple {586#false} ~cond := #in~cond; {586#false} is VALID [2018-11-23 11:54:52,551 INFO L273 TraceCheckUtils]: 14: Hoare triple {586#false} assume 0 == ~cond; {586#false} is VALID [2018-11-23 11:54:52,551 INFO L273 TraceCheckUtils]: 15: Hoare triple {586#false} assume !false; {586#false} is VALID [2018-11-23 11:54:52,552 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:54:52,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:52,553 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,562 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:54:52,577 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 11:54:52,577 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:52,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:52,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:52,675 INFO L256 TraceCheckUtils]: 0: Hoare triple {585#true} call ULTIMATE.init(); {585#true} is VALID [2018-11-23 11:54:52,676 INFO L273 TraceCheckUtils]: 1: Hoare triple {585#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {585#true} is VALID [2018-11-23 11:54:52,676 INFO L273 TraceCheckUtils]: 2: Hoare triple {585#true} assume true; {585#true} is VALID [2018-11-23 11:54:52,677 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {585#true} {585#true} #48#return; {585#true} is VALID [2018-11-23 11:54:52,677 INFO L256 TraceCheckUtils]: 4: Hoare triple {585#true} call #t~ret2 := main(); {585#true} is VALID [2018-11-23 11:54:52,683 INFO L273 TraceCheckUtils]: 5: Hoare triple {585#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {609#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:52,684 INFO L273 TraceCheckUtils]: 6: Hoare triple {609#(<= 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; {588#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:52,684 INFO L273 TraceCheckUtils]: 7: Hoare triple {588#(<= 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; {589#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:52,686 INFO L273 TraceCheckUtils]: 8: Hoare triple {589#(<= 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; {590#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:52,686 INFO L273 TraceCheckUtils]: 9: Hoare triple {590#(<= main_~i~0 3)} assume !(~i~0 < 100000); {586#false} is VALID [2018-11-23 11:54:52,687 INFO L273 TraceCheckUtils]: 10: Hoare triple {586#false} havoc ~x~0;~x~0 := 0; {586#false} is VALID [2018-11-23 11:54:52,687 INFO L273 TraceCheckUtils]: 11: Hoare triple {586#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {586#false} is VALID [2018-11-23 11:54:52,688 INFO L256 TraceCheckUtils]: 12: Hoare triple {586#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {586#false} is VALID [2018-11-23 11:54:52,688 INFO L273 TraceCheckUtils]: 13: Hoare triple {586#false} ~cond := #in~cond; {586#false} is VALID [2018-11-23 11:54:52,688 INFO L273 TraceCheckUtils]: 14: Hoare triple {586#false} assume 0 == ~cond; {586#false} is VALID [2018-11-23 11:54:52,689 INFO L273 TraceCheckUtils]: 15: Hoare triple {586#false} assume !false; {586#false} is VALID [2018-11-23 11:54:52,689 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:54:52,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:52,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 11:54:52,709 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-11-23 11:54:52,710 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:52,710 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:54:52,748 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:52,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:54:52,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:54:52,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:54:52,750 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 7 states. [2018-11-23 11:54:52,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:52,896 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-11-23 11:54:52,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:54:52,896 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-11-23 11:54:52,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:52,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:54:52,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2018-11-23 11:54:52,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:54:52,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2018-11-23 11:54:52,901 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 35 transitions. [2018-11-23 11:54:52,955 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:54:52,956 INFO L225 Difference]: With dead ends: 33 [2018-11-23 11:54:52,956 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 11:54:52,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 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:52,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 11:54:52,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-23 11:54:52,977 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:52,977 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-23 11:54:52,978 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 11:54:52,978 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 11:54:52,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:52,979 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-23 11:54:52,979 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-23 11:54:52,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:52,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:52,980 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 11:54:52,980 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 11:54:52,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:52,982 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-23 11:54:52,982 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-23 11:54:52,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:52,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:52,983 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:52,983 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:52,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:54:52,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-11-23 11:54:52,985 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 16 [2018-11-23 11:54:52,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:52,985 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-11-23 11:54:52,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:54:52,986 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-23 11:54:52,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 11:54:52,986 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:52,986 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:52,987 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:52,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:52,987 INFO L82 PathProgramCache]: Analyzing trace with hash -94637390, now seen corresponding path program 4 times [2018-11-23 11:54:52,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:52,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:52,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:52,989 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:52,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:53,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:53,103 INFO L256 TraceCheckUtils]: 0: Hoare triple {765#true} call ULTIMATE.init(); {765#true} is VALID [2018-11-23 11:54:53,104 INFO L273 TraceCheckUtils]: 1: Hoare triple {765#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {765#true} is VALID [2018-11-23 11:54:53,104 INFO L273 TraceCheckUtils]: 2: Hoare triple {765#true} assume true; {765#true} is VALID [2018-11-23 11:54:53,105 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {765#true} {765#true} #48#return; {765#true} is VALID [2018-11-23 11:54:53,105 INFO L256 TraceCheckUtils]: 4: Hoare triple {765#true} call #t~ret2 := main(); {765#true} is VALID [2018-11-23 11:54:53,120 INFO L273 TraceCheckUtils]: 5: Hoare triple {765#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {767#(= main_~i~0 0)} is VALID [2018-11-23 11:54:53,122 INFO L273 TraceCheckUtils]: 6: Hoare triple {767#(= 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; {768#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:53,124 INFO L273 TraceCheckUtils]: 7: Hoare triple {768#(<= 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; {769#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:53,127 INFO L273 TraceCheckUtils]: 8: Hoare triple {769#(<= 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; {770#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:53,127 INFO L273 TraceCheckUtils]: 9: Hoare triple {770#(<= 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; {771#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:53,128 INFO L273 TraceCheckUtils]: 10: Hoare triple {771#(<= main_~i~0 4)} assume !(~i~0 < 100000); {766#false} is VALID [2018-11-23 11:54:53,128 INFO L273 TraceCheckUtils]: 11: Hoare triple {766#false} havoc ~x~0;~x~0 := 0; {766#false} is VALID [2018-11-23 11:54:53,129 INFO L273 TraceCheckUtils]: 12: Hoare triple {766#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {766#false} is VALID [2018-11-23 11:54:53,129 INFO L256 TraceCheckUtils]: 13: Hoare triple {766#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {766#false} is VALID [2018-11-23 11:54:53,129 INFO L273 TraceCheckUtils]: 14: Hoare triple {766#false} ~cond := #in~cond; {766#false} is VALID [2018-11-23 11:54:53,130 INFO L273 TraceCheckUtils]: 15: Hoare triple {766#false} assume 0 == ~cond; {766#false} is VALID [2018-11-23 11:54:53,130 INFO L273 TraceCheckUtils]: 16: Hoare triple {766#false} assume !false; {766#false} is VALID [2018-11-23 11:54:53,132 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:54:53,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:53,132 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,143 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:54:53,164 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:54:53,164 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:53,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:53,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:53,343 INFO L256 TraceCheckUtils]: 0: Hoare triple {765#true} call ULTIMATE.init(); {765#true} is VALID [2018-11-23 11:54:53,343 INFO L273 TraceCheckUtils]: 1: Hoare triple {765#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {765#true} is VALID [2018-11-23 11:54:53,343 INFO L273 TraceCheckUtils]: 2: Hoare triple {765#true} assume true; {765#true} is VALID [2018-11-23 11:54:53,344 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {765#true} {765#true} #48#return; {765#true} is VALID [2018-11-23 11:54:53,344 INFO L256 TraceCheckUtils]: 4: Hoare triple {765#true} call #t~ret2 := main(); {765#true} is VALID [2018-11-23 11:54:53,345 INFO L273 TraceCheckUtils]: 5: Hoare triple {765#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {790#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:53,346 INFO L273 TraceCheckUtils]: 6: Hoare triple {790#(<= 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; {768#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:53,347 INFO L273 TraceCheckUtils]: 7: Hoare triple {768#(<= 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; {769#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:53,347 INFO L273 TraceCheckUtils]: 8: Hoare triple {769#(<= 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; {770#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:53,349 INFO L273 TraceCheckUtils]: 9: Hoare triple {770#(<= 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; {771#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:53,349 INFO L273 TraceCheckUtils]: 10: Hoare triple {771#(<= main_~i~0 4)} assume !(~i~0 < 100000); {766#false} is VALID [2018-11-23 11:54:53,350 INFO L273 TraceCheckUtils]: 11: Hoare triple {766#false} havoc ~x~0;~x~0 := 0; {766#false} is VALID [2018-11-23 11:54:53,350 INFO L273 TraceCheckUtils]: 12: Hoare triple {766#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {766#false} is VALID [2018-11-23 11:54:53,350 INFO L256 TraceCheckUtils]: 13: Hoare triple {766#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {766#false} is VALID [2018-11-23 11:54:53,351 INFO L273 TraceCheckUtils]: 14: Hoare triple {766#false} ~cond := #in~cond; {766#false} is VALID [2018-11-23 11:54:53,351 INFO L273 TraceCheckUtils]: 15: Hoare triple {766#false} assume 0 == ~cond; {766#false} is VALID [2018-11-23 11:54:53,351 INFO L273 TraceCheckUtils]: 16: Hoare triple {766#false} assume !false; {766#false} is VALID [2018-11-23 11:54:53,352 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:54:53,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:53,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 11:54:53,372 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-11-23 11:54:53,372 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:53,372 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:54:53,390 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:53,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:54:53,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:54:53,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:54:53,391 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 8 states. [2018-11-23 11:54:53,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:53,508 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-11-23 11:54:53,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:54:53,509 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-11-23 11:54:53,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:53,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:54:53,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2018-11-23 11:54:53,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:54:53,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2018-11-23 11:54:53,514 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 36 transitions. [2018-11-23 11:54:53,563 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:54:53,565 INFO L225 Difference]: With dead ends: 34 [2018-11-23 11:54:53,565 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 11:54:53,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 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:53,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 11:54:53,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-23 11:54:53,580 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:53,581 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2018-11-23 11:54:53,581 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-23 11:54:53,581 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-23 11:54:53,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:53,584 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2018-11-23 11:54:53,584 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-11-23 11:54:53,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:53,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:53,585 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-23 11:54:53,585 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-23 11:54:53,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:53,587 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2018-11-23 11:54:53,587 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-11-23 11:54:53,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:53,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:53,588 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:53,588 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:53,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:54:53,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-11-23 11:54:53,589 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 17 [2018-11-23 11:54:53,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:53,590 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-23 11:54:53,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:54:53,590 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-11-23 11:54:53,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 11:54:53,591 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:53,591 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:53,591 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:53,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:53,592 INFO L82 PathProgramCache]: Analyzing trace with hash -729870482, now seen corresponding path program 5 times [2018-11-23 11:54:53,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:53,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:53,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:53,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:53,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:53,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:53,812 INFO L256 TraceCheckUtils]: 0: Hoare triple {955#true} call ULTIMATE.init(); {955#true} is VALID [2018-11-23 11:54:53,812 INFO L273 TraceCheckUtils]: 1: Hoare triple {955#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {955#true} is VALID [2018-11-23 11:54:53,813 INFO L273 TraceCheckUtils]: 2: Hoare triple {955#true} assume true; {955#true} is VALID [2018-11-23 11:54:53,813 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {955#true} {955#true} #48#return; {955#true} is VALID [2018-11-23 11:54:53,813 INFO L256 TraceCheckUtils]: 4: Hoare triple {955#true} call #t~ret2 := main(); {955#true} is VALID [2018-11-23 11:54:53,814 INFO L273 TraceCheckUtils]: 5: Hoare triple {955#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {957#(= main_~i~0 0)} is VALID [2018-11-23 11:54:53,814 INFO L273 TraceCheckUtils]: 6: Hoare triple {957#(= 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; {958#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:53,815 INFO L273 TraceCheckUtils]: 7: Hoare triple {958#(<= 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; {959#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:53,816 INFO L273 TraceCheckUtils]: 8: Hoare triple {959#(<= 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; {960#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:53,817 INFO L273 TraceCheckUtils]: 9: Hoare triple {960#(<= 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; {961#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:53,818 INFO L273 TraceCheckUtils]: 10: Hoare triple {961#(<= 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; {962#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:53,819 INFO L273 TraceCheckUtils]: 11: Hoare triple {962#(<= main_~i~0 5)} assume !(~i~0 < 100000); {956#false} is VALID [2018-11-23 11:54:53,820 INFO L273 TraceCheckUtils]: 12: Hoare triple {956#false} havoc ~x~0;~x~0 := 0; {956#false} is VALID [2018-11-23 11:54:53,820 INFO L273 TraceCheckUtils]: 13: Hoare triple {956#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {956#false} is VALID [2018-11-23 11:54:53,820 INFO L256 TraceCheckUtils]: 14: Hoare triple {956#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {956#false} is VALID [2018-11-23 11:54:53,820 INFO L273 TraceCheckUtils]: 15: Hoare triple {956#false} ~cond := #in~cond; {956#false} is VALID [2018-11-23 11:54:53,821 INFO L273 TraceCheckUtils]: 16: Hoare triple {956#false} assume 0 == ~cond; {956#false} is VALID [2018-11-23 11:54:53,821 INFO L273 TraceCheckUtils]: 17: Hoare triple {956#false} assume !false; {956#false} is VALID [2018-11-23 11:54:53,822 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:54:53,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:53,823 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:53,832 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:54:53,892 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-11-23 11:54:53,892 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:53,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:53,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:53,993 INFO L256 TraceCheckUtils]: 0: Hoare triple {955#true} call ULTIMATE.init(); {955#true} is VALID [2018-11-23 11:54:53,994 INFO L273 TraceCheckUtils]: 1: Hoare triple {955#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {955#true} is VALID [2018-11-23 11:54:53,994 INFO L273 TraceCheckUtils]: 2: Hoare triple {955#true} assume true; {955#true} is VALID [2018-11-23 11:54:53,994 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {955#true} {955#true} #48#return; {955#true} is VALID [2018-11-23 11:54:53,995 INFO L256 TraceCheckUtils]: 4: Hoare triple {955#true} call #t~ret2 := main(); {955#true} is VALID [2018-11-23 11:54:53,996 INFO L273 TraceCheckUtils]: 5: Hoare triple {955#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {981#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:53,997 INFO L273 TraceCheckUtils]: 6: Hoare triple {981#(<= 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; {958#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:54,010 INFO L273 TraceCheckUtils]: 7: Hoare triple {958#(<= 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; {959#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:54,017 INFO L273 TraceCheckUtils]: 8: Hoare triple {959#(<= 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; {960#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:54,018 INFO L273 TraceCheckUtils]: 9: Hoare triple {960#(<= 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; {961#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:54,019 INFO L273 TraceCheckUtils]: 10: Hoare triple {961#(<= 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; {962#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:54,019 INFO L273 TraceCheckUtils]: 11: Hoare triple {962#(<= main_~i~0 5)} assume !(~i~0 < 100000); {956#false} is VALID [2018-11-23 11:54:54,020 INFO L273 TraceCheckUtils]: 12: Hoare triple {956#false} havoc ~x~0;~x~0 := 0; {956#false} is VALID [2018-11-23 11:54:54,020 INFO L273 TraceCheckUtils]: 13: Hoare triple {956#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {956#false} is VALID [2018-11-23 11:54:54,020 INFO L256 TraceCheckUtils]: 14: Hoare triple {956#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {956#false} is VALID [2018-11-23 11:54:54,020 INFO L273 TraceCheckUtils]: 15: Hoare triple {956#false} ~cond := #in~cond; {956#false} is VALID [2018-11-23 11:54:54,020 INFO L273 TraceCheckUtils]: 16: Hoare triple {956#false} assume 0 == ~cond; {956#false} is VALID [2018-11-23 11:54:54,021 INFO L273 TraceCheckUtils]: 17: Hoare triple {956#false} assume !false; {956#false} is VALID [2018-11-23 11:54:54,022 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:54:54,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:54,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 11:54:54,041 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-11-23 11:54:54,042 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:54,042 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:54:54,061 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:54,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:54:54,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:54:54,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:54:54,063 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 9 states. [2018-11-23 11:54:54,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:54,181 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-11-23 11:54:54,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:54:54,182 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-11-23 11:54:54,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:54,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:54:54,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2018-11-23 11:54:54,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:54:54,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2018-11-23 11:54:54,187 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 37 transitions. [2018-11-23 11:54:54,293 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:54:54,294 INFO L225 Difference]: With dead ends: 35 [2018-11-23 11:54:54,294 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 11:54:54,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:54:54,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 11:54:54,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-23 11:54:54,311 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:54,311 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-23 11:54:54,311 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 11:54:54,311 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 11:54:54,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:54,313 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-11-23 11:54:54,313 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-23 11:54:54,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:54,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:54,314 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 11:54:54,314 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 11:54:54,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:54,315 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-11-23 11:54:54,316 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-23 11:54:54,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:54,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:54,316 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:54,316 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:54,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:54:54,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-11-23 11:54:54,318 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 18 [2018-11-23 11:54:54,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:54,319 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-23 11:54:54,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:54:54,319 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-23 11:54:54,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 11:54:54,320 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:54,320 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:54,320 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:54,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:54,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1052740146, now seen corresponding path program 6 times [2018-11-23 11:54:54,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:54,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:54,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:54,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:54,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:54,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:54,527 INFO L256 TraceCheckUtils]: 0: Hoare triple {1155#true} call ULTIMATE.init(); {1155#true} is VALID [2018-11-23 11:54:54,528 INFO L273 TraceCheckUtils]: 1: Hoare triple {1155#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1155#true} is VALID [2018-11-23 11:54:54,528 INFO L273 TraceCheckUtils]: 2: Hoare triple {1155#true} assume true; {1155#true} is VALID [2018-11-23 11:54:54,528 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1155#true} {1155#true} #48#return; {1155#true} is VALID [2018-11-23 11:54:54,529 INFO L256 TraceCheckUtils]: 4: Hoare triple {1155#true} call #t~ret2 := main(); {1155#true} is VALID [2018-11-23 11:54:54,530 INFO L273 TraceCheckUtils]: 5: Hoare triple {1155#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1157#(= main_~i~0 0)} is VALID [2018-11-23 11:54:54,531 INFO L273 TraceCheckUtils]: 6: Hoare triple {1157#(= 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; {1158#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:54,532 INFO L273 TraceCheckUtils]: 7: Hoare triple {1158#(<= 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; {1159#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:54,533 INFO L273 TraceCheckUtils]: 8: Hoare triple {1159#(<= 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; {1160#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:54,534 INFO L273 TraceCheckUtils]: 9: Hoare triple {1160#(<= 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; {1161#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:54,535 INFO L273 TraceCheckUtils]: 10: Hoare triple {1161#(<= 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; {1162#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:54,536 INFO L273 TraceCheckUtils]: 11: Hoare triple {1162#(<= 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; {1163#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:54,537 INFO L273 TraceCheckUtils]: 12: Hoare triple {1163#(<= main_~i~0 6)} assume !(~i~0 < 100000); {1156#false} is VALID [2018-11-23 11:54:54,537 INFO L273 TraceCheckUtils]: 13: Hoare triple {1156#false} havoc ~x~0;~x~0 := 0; {1156#false} is VALID [2018-11-23 11:54:54,538 INFO L273 TraceCheckUtils]: 14: Hoare triple {1156#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1156#false} is VALID [2018-11-23 11:54:54,538 INFO L256 TraceCheckUtils]: 15: Hoare triple {1156#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {1156#false} is VALID [2018-11-23 11:54:54,538 INFO L273 TraceCheckUtils]: 16: Hoare triple {1156#false} ~cond := #in~cond; {1156#false} is VALID [2018-11-23 11:54:54,539 INFO L273 TraceCheckUtils]: 17: Hoare triple {1156#false} assume 0 == ~cond; {1156#false} is VALID [2018-11-23 11:54:54,539 INFO L273 TraceCheckUtils]: 18: Hoare triple {1156#false} assume !false; {1156#false} is VALID [2018-11-23 11:54:54,540 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:54:54,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:54,541 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:54,555 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:54:54,582 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-11-23 11:54:54,583 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:54,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:54,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:54,733 INFO L256 TraceCheckUtils]: 0: Hoare triple {1155#true} call ULTIMATE.init(); {1155#true} is VALID [2018-11-23 11:54:54,734 INFO L273 TraceCheckUtils]: 1: Hoare triple {1155#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1155#true} is VALID [2018-11-23 11:54:54,734 INFO L273 TraceCheckUtils]: 2: Hoare triple {1155#true} assume true; {1155#true} is VALID [2018-11-23 11:54:54,734 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1155#true} {1155#true} #48#return; {1155#true} is VALID [2018-11-23 11:54:54,735 INFO L256 TraceCheckUtils]: 4: Hoare triple {1155#true} call #t~ret2 := main(); {1155#true} is VALID [2018-11-23 11:54:54,736 INFO L273 TraceCheckUtils]: 5: Hoare triple {1155#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1182#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:54,736 INFO L273 TraceCheckUtils]: 6: Hoare triple {1182#(<= 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; {1158#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:54,737 INFO L273 TraceCheckUtils]: 7: Hoare triple {1158#(<= 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; {1159#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:54,738 INFO L273 TraceCheckUtils]: 8: Hoare triple {1159#(<= 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; {1160#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:54,739 INFO L273 TraceCheckUtils]: 9: Hoare triple {1160#(<= 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; {1161#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:54,740 INFO L273 TraceCheckUtils]: 10: Hoare triple {1161#(<= 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; {1162#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:54,741 INFO L273 TraceCheckUtils]: 11: Hoare triple {1162#(<= 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; {1163#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:54,742 INFO L273 TraceCheckUtils]: 12: Hoare triple {1163#(<= main_~i~0 6)} assume !(~i~0 < 100000); {1156#false} is VALID [2018-11-23 11:54:54,742 INFO L273 TraceCheckUtils]: 13: Hoare triple {1156#false} havoc ~x~0;~x~0 := 0; {1156#false} is VALID [2018-11-23 11:54:54,743 INFO L273 TraceCheckUtils]: 14: Hoare triple {1156#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1156#false} is VALID [2018-11-23 11:54:54,743 INFO L256 TraceCheckUtils]: 15: Hoare triple {1156#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {1156#false} is VALID [2018-11-23 11:54:54,743 INFO L273 TraceCheckUtils]: 16: Hoare triple {1156#false} ~cond := #in~cond; {1156#false} is VALID [2018-11-23 11:54:54,744 INFO L273 TraceCheckUtils]: 17: Hoare triple {1156#false} assume 0 == ~cond; {1156#false} is VALID [2018-11-23 11:54:54,744 INFO L273 TraceCheckUtils]: 18: Hoare triple {1156#false} assume !false; {1156#false} is VALID [2018-11-23 11:54:54,745 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:54:54,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:54,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 11:54:54,765 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2018-11-23 11:54:54,765 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:54,765 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 11:54:54,783 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:54,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:54:54,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:54:54,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:54:54,785 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 10 states. [2018-11-23 11:54:54,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:54,978 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-11-23 11:54:54,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:54:54,979 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2018-11-23 11:54:54,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:54,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:54:54,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 38 transitions. [2018-11-23 11:54:54,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:54:54,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 38 transitions. [2018-11-23 11:54:54,984 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 38 transitions. [2018-11-23 11:54:55,027 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:54:55,029 INFO L225 Difference]: With dead ends: 36 [2018-11-23 11:54:55,029 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 11:54:55,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:54:55,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 11:54:55,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-23 11:54:55,069 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:55,069 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2018-11-23 11:54:55,069 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 11:54:55,069 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 11:54:55,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:55,072 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-23 11:54:55,072 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-23 11:54:55,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:55,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:55,073 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 11:54:55,073 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 11:54:55,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:55,075 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-23 11:54:55,076 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-23 11:54:55,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:55,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:55,076 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:55,076 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:55,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 11:54:55,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-11-23 11:54:55,078 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 19 [2018-11-23 11:54:55,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:55,078 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-11-23 11:54:55,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:54:55,079 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-23 11:54:55,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 11:54:55,079 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:55,079 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:55,080 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:55,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:55,080 INFO L82 PathProgramCache]: Analyzing trace with hash 479094766, now seen corresponding path program 7 times [2018-11-23 11:54:55,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:55,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:55,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:55,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:55,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:55,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:55,375 INFO L256 TraceCheckUtils]: 0: Hoare triple {1365#true} call ULTIMATE.init(); {1365#true} is VALID [2018-11-23 11:54:55,375 INFO L273 TraceCheckUtils]: 1: Hoare triple {1365#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1365#true} is VALID [2018-11-23 11:54:55,375 INFO L273 TraceCheckUtils]: 2: Hoare triple {1365#true} assume true; {1365#true} is VALID [2018-11-23 11:54:55,376 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1365#true} {1365#true} #48#return; {1365#true} is VALID [2018-11-23 11:54:55,376 INFO L256 TraceCheckUtils]: 4: Hoare triple {1365#true} call #t~ret2 := main(); {1365#true} is VALID [2018-11-23 11:54:55,377 INFO L273 TraceCheckUtils]: 5: Hoare triple {1365#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1367#(= main_~i~0 0)} is VALID [2018-11-23 11:54:55,377 INFO L273 TraceCheckUtils]: 6: Hoare triple {1367#(= 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; {1368#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:55,378 INFO L273 TraceCheckUtils]: 7: Hoare triple {1368#(<= 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; {1369#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:55,379 INFO L273 TraceCheckUtils]: 8: Hoare triple {1369#(<= 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; {1370#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:55,380 INFO L273 TraceCheckUtils]: 9: Hoare triple {1370#(<= 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; {1371#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:55,380 INFO L273 TraceCheckUtils]: 10: Hoare triple {1371#(<= 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; {1372#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:55,381 INFO L273 TraceCheckUtils]: 11: Hoare triple {1372#(<= 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; {1373#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:55,382 INFO L273 TraceCheckUtils]: 12: Hoare triple {1373#(<= 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; {1374#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:55,383 INFO L273 TraceCheckUtils]: 13: Hoare triple {1374#(<= main_~i~0 7)} assume !(~i~0 < 100000); {1366#false} is VALID [2018-11-23 11:54:55,383 INFO L273 TraceCheckUtils]: 14: Hoare triple {1366#false} havoc ~x~0;~x~0 := 0; {1366#false} is VALID [2018-11-23 11:54:55,384 INFO L273 TraceCheckUtils]: 15: Hoare triple {1366#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1366#false} is VALID [2018-11-23 11:54:55,384 INFO L256 TraceCheckUtils]: 16: Hoare triple {1366#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {1366#false} is VALID [2018-11-23 11:54:55,384 INFO L273 TraceCheckUtils]: 17: Hoare triple {1366#false} ~cond := #in~cond; {1366#false} is VALID [2018-11-23 11:54:55,384 INFO L273 TraceCheckUtils]: 18: Hoare triple {1366#false} assume 0 == ~cond; {1366#false} is VALID [2018-11-23 11:54:55,385 INFO L273 TraceCheckUtils]: 19: Hoare triple {1366#false} assume !false; {1366#false} is VALID [2018-11-23 11:54:55,386 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:54:55,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:55,386 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:55,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:54:55,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:55,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:55,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:55,542 INFO L256 TraceCheckUtils]: 0: Hoare triple {1365#true} call ULTIMATE.init(); {1365#true} is VALID [2018-11-23 11:54:55,542 INFO L273 TraceCheckUtils]: 1: Hoare triple {1365#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1365#true} is VALID [2018-11-23 11:54:55,542 INFO L273 TraceCheckUtils]: 2: Hoare triple {1365#true} assume true; {1365#true} is VALID [2018-11-23 11:54:55,543 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1365#true} {1365#true} #48#return; {1365#true} is VALID [2018-11-23 11:54:55,543 INFO L256 TraceCheckUtils]: 4: Hoare triple {1365#true} call #t~ret2 := main(); {1365#true} is VALID [2018-11-23 11:54:55,545 INFO L273 TraceCheckUtils]: 5: Hoare triple {1365#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1393#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:55,546 INFO L273 TraceCheckUtils]: 6: Hoare triple {1393#(<= 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; {1368#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:55,546 INFO L273 TraceCheckUtils]: 7: Hoare triple {1368#(<= 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; {1369#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:55,547 INFO L273 TraceCheckUtils]: 8: Hoare triple {1369#(<= 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; {1370#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:55,549 INFO L273 TraceCheckUtils]: 9: Hoare triple {1370#(<= 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; {1371#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:55,553 INFO L273 TraceCheckUtils]: 10: Hoare triple {1371#(<= 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; {1372#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:55,557 INFO L273 TraceCheckUtils]: 11: Hoare triple {1372#(<= 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; {1373#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:55,559 INFO L273 TraceCheckUtils]: 12: Hoare triple {1373#(<= 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; {1374#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:55,560 INFO L273 TraceCheckUtils]: 13: Hoare triple {1374#(<= main_~i~0 7)} assume !(~i~0 < 100000); {1366#false} is VALID [2018-11-23 11:54:55,560 INFO L273 TraceCheckUtils]: 14: Hoare triple {1366#false} havoc ~x~0;~x~0 := 0; {1366#false} is VALID [2018-11-23 11:54:55,560 INFO L273 TraceCheckUtils]: 15: Hoare triple {1366#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1366#false} is VALID [2018-11-23 11:54:55,560 INFO L256 TraceCheckUtils]: 16: Hoare triple {1366#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {1366#false} is VALID [2018-11-23 11:54:55,561 INFO L273 TraceCheckUtils]: 17: Hoare triple {1366#false} ~cond := #in~cond; {1366#false} is VALID [2018-11-23 11:54:55,561 INFO L273 TraceCheckUtils]: 18: Hoare triple {1366#false} assume 0 == ~cond; {1366#false} is VALID [2018-11-23 11:54:55,561 INFO L273 TraceCheckUtils]: 19: Hoare triple {1366#false} assume !false; {1366#false} is VALID [2018-11-23 11:54:55,562 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:54:55,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:55,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 11:54:55,581 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-11-23 11:54:55,582 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:55,582 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 11:54:55,602 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:55,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 11:54:55,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:54:55,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:54:55,603 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 11 states. [2018-11-23 11:54:55,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:55,794 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-11-23 11:54:55,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:54:55,795 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-11-23 11:54:55,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:55,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:54:55,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 39 transitions. [2018-11-23 11:54:55,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:54:55,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 39 transitions. [2018-11-23 11:54:55,799 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 39 transitions. [2018-11-23 11:54:55,988 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:54:55,989 INFO L225 Difference]: With dead ends: 37 [2018-11-23 11:54:55,989 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 11:54:55,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:54:55,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 11:54:56,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-23 11:54:56,011 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:56,012 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-11-23 11:54:56,012 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 11:54:56,012 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 11:54:56,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:56,013 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-23 11:54:56,014 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-23 11:54:56,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:56,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:56,014 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 11:54:56,015 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 11:54:56,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:56,016 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-23 11:54:56,017 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-23 11:54:56,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:56,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:56,017 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:56,017 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:56,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 11:54:56,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-11-23 11:54:56,019 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 20 [2018-11-23 11:54:56,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:56,019 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-11-23 11:54:56,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 11:54:56,020 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-23 11:54:56,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 11:54:56,021 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:56,022 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:56,022 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:56,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:56,022 INFO L82 PathProgramCache]: Analyzing trace with hash -124042830, now seen corresponding path program 8 times [2018-11-23 11:54:56,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:56,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:56,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:56,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:54:56,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:56,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:56,252 INFO L256 TraceCheckUtils]: 0: Hoare triple {1585#true} call ULTIMATE.init(); {1585#true} is VALID [2018-11-23 11:54:56,252 INFO L273 TraceCheckUtils]: 1: Hoare triple {1585#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1585#true} is VALID [2018-11-23 11:54:56,253 INFO L273 TraceCheckUtils]: 2: Hoare triple {1585#true} assume true; {1585#true} is VALID [2018-11-23 11:54:56,253 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1585#true} {1585#true} #48#return; {1585#true} is VALID [2018-11-23 11:54:56,253 INFO L256 TraceCheckUtils]: 4: Hoare triple {1585#true} call #t~ret2 := main(); {1585#true} is VALID [2018-11-23 11:54:56,254 INFO L273 TraceCheckUtils]: 5: Hoare triple {1585#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1587#(= main_~i~0 0)} is VALID [2018-11-23 11:54:56,255 INFO L273 TraceCheckUtils]: 6: Hoare triple {1587#(= 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; {1588#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:56,256 INFO L273 TraceCheckUtils]: 7: Hoare triple {1588#(<= 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; {1589#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:56,258 INFO L273 TraceCheckUtils]: 8: Hoare triple {1589#(<= 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; {1590#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:56,259 INFO L273 TraceCheckUtils]: 9: Hoare triple {1590#(<= 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; {1591#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:56,260 INFO L273 TraceCheckUtils]: 10: Hoare triple {1591#(<= 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; {1592#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:56,261 INFO L273 TraceCheckUtils]: 11: Hoare triple {1592#(<= 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; {1593#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:56,263 INFO L273 TraceCheckUtils]: 12: Hoare triple {1593#(<= 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; {1594#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:56,264 INFO L273 TraceCheckUtils]: 13: Hoare triple {1594#(<= 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; {1595#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:56,265 INFO L273 TraceCheckUtils]: 14: Hoare triple {1595#(<= main_~i~0 8)} assume !(~i~0 < 100000); {1586#false} is VALID [2018-11-23 11:54:56,265 INFO L273 TraceCheckUtils]: 15: Hoare triple {1586#false} havoc ~x~0;~x~0 := 0; {1586#false} is VALID [2018-11-23 11:54:56,265 INFO L273 TraceCheckUtils]: 16: Hoare triple {1586#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1586#false} is VALID [2018-11-23 11:54:56,266 INFO L256 TraceCheckUtils]: 17: Hoare triple {1586#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {1586#false} is VALID [2018-11-23 11:54:56,266 INFO L273 TraceCheckUtils]: 18: Hoare triple {1586#false} ~cond := #in~cond; {1586#false} is VALID [2018-11-23 11:54:56,266 INFO L273 TraceCheckUtils]: 19: Hoare triple {1586#false} assume 0 == ~cond; {1586#false} is VALID [2018-11-23 11:54:56,267 INFO L273 TraceCheckUtils]: 20: Hoare triple {1586#false} assume !false; {1586#false} is VALID [2018-11-23 11:54:56,268 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:54:56,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:56,269 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:56,280 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:54:56,325 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:54:56,325 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:56,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:56,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:56,846 INFO L256 TraceCheckUtils]: 0: Hoare triple {1585#true} call ULTIMATE.init(); {1585#true} is VALID [2018-11-23 11:54:56,846 INFO L273 TraceCheckUtils]: 1: Hoare triple {1585#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1585#true} is VALID [2018-11-23 11:54:56,847 INFO L273 TraceCheckUtils]: 2: Hoare triple {1585#true} assume true; {1585#true} is VALID [2018-11-23 11:54:56,847 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1585#true} {1585#true} #48#return; {1585#true} is VALID [2018-11-23 11:54:56,847 INFO L256 TraceCheckUtils]: 4: Hoare triple {1585#true} call #t~ret2 := main(); {1585#true} is VALID [2018-11-23 11:54:56,848 INFO L273 TraceCheckUtils]: 5: Hoare triple {1585#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1614#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:56,849 INFO L273 TraceCheckUtils]: 6: Hoare triple {1614#(<= 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; {1588#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:56,849 INFO L273 TraceCheckUtils]: 7: Hoare triple {1588#(<= 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; {1589#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:56,868 INFO L273 TraceCheckUtils]: 8: Hoare triple {1589#(<= 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; {1590#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:56,882 INFO L273 TraceCheckUtils]: 9: Hoare triple {1590#(<= 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; {1591#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:56,898 INFO L273 TraceCheckUtils]: 10: Hoare triple {1591#(<= 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; {1592#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:56,914 INFO L273 TraceCheckUtils]: 11: Hoare triple {1592#(<= 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; {1593#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:56,919 INFO L273 TraceCheckUtils]: 12: Hoare triple {1593#(<= 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; {1594#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:56,920 INFO L273 TraceCheckUtils]: 13: Hoare triple {1594#(<= 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; {1595#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:56,925 INFO L273 TraceCheckUtils]: 14: Hoare triple {1595#(<= main_~i~0 8)} assume !(~i~0 < 100000); {1586#false} is VALID [2018-11-23 11:54:56,925 INFO L273 TraceCheckUtils]: 15: Hoare triple {1586#false} havoc ~x~0;~x~0 := 0; {1586#false} is VALID [2018-11-23 11:54:56,925 INFO L273 TraceCheckUtils]: 16: Hoare triple {1586#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1586#false} is VALID [2018-11-23 11:54:56,926 INFO L256 TraceCheckUtils]: 17: Hoare triple {1586#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {1586#false} is VALID [2018-11-23 11:54:56,926 INFO L273 TraceCheckUtils]: 18: Hoare triple {1586#false} ~cond := #in~cond; {1586#false} is VALID [2018-11-23 11:54:56,926 INFO L273 TraceCheckUtils]: 19: Hoare triple {1586#false} assume 0 == ~cond; {1586#false} is VALID [2018-11-23 11:54:56,926 INFO L273 TraceCheckUtils]: 20: Hoare triple {1586#false} assume !false; {1586#false} is VALID [2018-11-23 11:54:56,927 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:54:56,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:56,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 11:54:56,948 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-11-23 11:54:56,948 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:56,948 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:54:56,971 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:56,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:54:56,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:54:56,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:54:56,972 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 12 states. [2018-11-23 11:54:57,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:57,533 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2018-11-23 11:54:57,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:54:57,533 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-11-23 11:54:57,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:57,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:54:57,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 40 transitions. [2018-11-23 11:54:57,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:54:57,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 40 transitions. [2018-11-23 11:54:57,537 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 40 transitions. [2018-11-23 11:54:57,610 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:57,611 INFO L225 Difference]: With dead ends: 38 [2018-11-23 11:54:57,611 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 11:54:57,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:54:57,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 11:54:57,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-23 11:54:57,633 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:57,634 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2018-11-23 11:54:57,634 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 11:54:57,634 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 11:54:57,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:57,635 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-11-23 11:54:57,636 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-23 11:54:57,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:57,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:57,636 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 11:54:57,636 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 11:54:57,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:57,638 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-11-23 11:54:57,638 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-23 11:54:57,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:57,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:57,638 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:57,638 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:57,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 11:54:57,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-11-23 11:54:57,640 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 21 [2018-11-23 11:54:57,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:57,640 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-11-23 11:54:57,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:54:57,640 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-23 11:54:57,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 11:54:57,641 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:57,641 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:57,641 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:57,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:57,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1641439122, now seen corresponding path program 9 times [2018-11-23 11:54:57,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:57,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:57,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:57,643 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:57,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:57,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:57,829 INFO L256 TraceCheckUtils]: 0: Hoare triple {1815#true} call ULTIMATE.init(); {1815#true} is VALID [2018-11-23 11:54:57,830 INFO L273 TraceCheckUtils]: 1: Hoare triple {1815#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1815#true} is VALID [2018-11-23 11:54:57,830 INFO L273 TraceCheckUtils]: 2: Hoare triple {1815#true} assume true; {1815#true} is VALID [2018-11-23 11:54:57,831 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1815#true} {1815#true} #48#return; {1815#true} is VALID [2018-11-23 11:54:57,831 INFO L256 TraceCheckUtils]: 4: Hoare triple {1815#true} call #t~ret2 := main(); {1815#true} is VALID [2018-11-23 11:54:57,833 INFO L273 TraceCheckUtils]: 5: Hoare triple {1815#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1817#(= main_~i~0 0)} is VALID [2018-11-23 11:54:57,834 INFO L273 TraceCheckUtils]: 6: Hoare triple {1817#(= 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; {1818#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:57,835 INFO L273 TraceCheckUtils]: 7: Hoare triple {1818#(<= 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; {1819#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:57,840 INFO L273 TraceCheckUtils]: 8: Hoare triple {1819#(<= 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; {1820#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:57,841 INFO L273 TraceCheckUtils]: 9: Hoare triple {1820#(<= 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; {1821#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:57,841 INFO L273 TraceCheckUtils]: 10: Hoare triple {1821#(<= 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; {1822#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:57,842 INFO L273 TraceCheckUtils]: 11: Hoare triple {1822#(<= 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; {1823#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:57,843 INFO L273 TraceCheckUtils]: 12: Hoare triple {1823#(<= 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; {1824#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:57,843 INFO L273 TraceCheckUtils]: 13: Hoare triple {1824#(<= 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; {1825#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:57,844 INFO L273 TraceCheckUtils]: 14: Hoare triple {1825#(<= 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; {1826#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:57,845 INFO L273 TraceCheckUtils]: 15: Hoare triple {1826#(<= main_~i~0 9)} assume !(~i~0 < 100000); {1816#false} is VALID [2018-11-23 11:54:57,845 INFO L273 TraceCheckUtils]: 16: Hoare triple {1816#false} havoc ~x~0;~x~0 := 0; {1816#false} is VALID [2018-11-23 11:54:57,845 INFO L273 TraceCheckUtils]: 17: Hoare triple {1816#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1816#false} is VALID [2018-11-23 11:54:57,845 INFO L256 TraceCheckUtils]: 18: Hoare triple {1816#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {1816#false} is VALID [2018-11-23 11:54:57,849 INFO L273 TraceCheckUtils]: 19: Hoare triple {1816#false} ~cond := #in~cond; {1816#false} is VALID [2018-11-23 11:54:57,849 INFO L273 TraceCheckUtils]: 20: Hoare triple {1816#false} assume 0 == ~cond; {1816#false} is VALID [2018-11-23 11:54:57,850 INFO L273 TraceCheckUtils]: 21: Hoare triple {1816#false} assume !false; {1816#false} is VALID [2018-11-23 11:54:57,850 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:54:57,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:57,851 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:57,864 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:54:57,891 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 11:54:57,891 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:57,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:57,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:58,291 INFO L256 TraceCheckUtils]: 0: Hoare triple {1815#true} call ULTIMATE.init(); {1815#true} is VALID [2018-11-23 11:54:58,291 INFO L273 TraceCheckUtils]: 1: Hoare triple {1815#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1815#true} is VALID [2018-11-23 11:54:58,291 INFO L273 TraceCheckUtils]: 2: Hoare triple {1815#true} assume true; {1815#true} is VALID [2018-11-23 11:54:58,291 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1815#true} {1815#true} #48#return; {1815#true} is VALID [2018-11-23 11:54:58,291 INFO L256 TraceCheckUtils]: 4: Hoare triple {1815#true} call #t~ret2 := main(); {1815#true} is VALID [2018-11-23 11:54:58,292 INFO L273 TraceCheckUtils]: 5: Hoare triple {1815#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1845#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:58,293 INFO L273 TraceCheckUtils]: 6: Hoare triple {1845#(<= 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; {1818#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:58,295 INFO L273 TraceCheckUtils]: 7: Hoare triple {1818#(<= 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; {1819#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:58,304 INFO L273 TraceCheckUtils]: 8: Hoare triple {1819#(<= 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; {1820#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:58,317 INFO L273 TraceCheckUtils]: 9: Hoare triple {1820#(<= 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; {1821#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:58,330 INFO L273 TraceCheckUtils]: 10: Hoare triple {1821#(<= 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; {1822#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:58,345 INFO L273 TraceCheckUtils]: 11: Hoare triple {1822#(<= 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; {1823#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:58,354 INFO L273 TraceCheckUtils]: 12: Hoare triple {1823#(<= 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; {1824#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:58,356 INFO L273 TraceCheckUtils]: 13: Hoare triple {1824#(<= 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; {1825#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:58,356 INFO L273 TraceCheckUtils]: 14: Hoare triple {1825#(<= 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; {1826#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:58,358 INFO L273 TraceCheckUtils]: 15: Hoare triple {1826#(<= main_~i~0 9)} assume !(~i~0 < 100000); {1816#false} is VALID [2018-11-23 11:54:58,358 INFO L273 TraceCheckUtils]: 16: Hoare triple {1816#false} havoc ~x~0;~x~0 := 0; {1816#false} is VALID [2018-11-23 11:54:58,358 INFO L273 TraceCheckUtils]: 17: Hoare triple {1816#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1816#false} is VALID [2018-11-23 11:54:58,358 INFO L256 TraceCheckUtils]: 18: Hoare triple {1816#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {1816#false} is VALID [2018-11-23 11:54:58,358 INFO L273 TraceCheckUtils]: 19: Hoare triple {1816#false} ~cond := #in~cond; {1816#false} is VALID [2018-11-23 11:54:58,358 INFO L273 TraceCheckUtils]: 20: Hoare triple {1816#false} assume 0 == ~cond; {1816#false} is VALID [2018-11-23 11:54:58,359 INFO L273 TraceCheckUtils]: 21: Hoare triple {1816#false} assume !false; {1816#false} is VALID [2018-11-23 11:54:58,359 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:54:58,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:58,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-23 11:54:58,388 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2018-11-23 11:54:58,389 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:58,389 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 11:54:58,416 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:58,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 11:54:58,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 11:54:58,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:54:58,418 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 13 states. [2018-11-23 11:54:58,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:58,520 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-11-23 11:54:58,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 11:54:58,521 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2018-11-23 11:54:58,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:58,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:54:58,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 41 transitions. [2018-11-23 11:54:58,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:54:58,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 41 transitions. [2018-11-23 11:54:58,524 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 41 transitions. [2018-11-23 11:54:58,566 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:54:58,568 INFO L225 Difference]: With dead ends: 39 [2018-11-23 11:54:58,568 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 11:54:58,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:54:58,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 11:54:58,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-23 11:54:58,582 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:58,582 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-23 11:54:58,582 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 11:54:58,582 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 11:54:58,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:58,584 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-23 11:54:58,584 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-23 11:54:58,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:58,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:58,584 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 11:54:58,584 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 11:54:58,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:58,585 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-23 11:54:58,585 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-23 11:54:58,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:58,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:58,586 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:58,586 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:58,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:54:58,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-11-23 11:54:58,587 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 22 [2018-11-23 11:54:58,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:58,587 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-11-23 11:54:58,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 11:54:58,587 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-23 11:54:58,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 11:54:58,587 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:58,588 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:58,588 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:58,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:58,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1436083918, now seen corresponding path program 10 times [2018-11-23 11:54:58,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:58,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:58,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:58,589 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:58,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:58,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:58,852 INFO L256 TraceCheckUtils]: 0: Hoare triple {2055#true} call ULTIMATE.init(); {2055#true} is VALID [2018-11-23 11:54:58,852 INFO L273 TraceCheckUtils]: 1: Hoare triple {2055#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2055#true} is VALID [2018-11-23 11:54:58,852 INFO L273 TraceCheckUtils]: 2: Hoare triple {2055#true} assume true; {2055#true} is VALID [2018-11-23 11:54:58,853 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2055#true} {2055#true} #48#return; {2055#true} is VALID [2018-11-23 11:54:58,853 INFO L256 TraceCheckUtils]: 4: Hoare triple {2055#true} call #t~ret2 := main(); {2055#true} is VALID [2018-11-23 11:54:58,855 INFO L273 TraceCheckUtils]: 5: Hoare triple {2055#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2057#(= main_~i~0 0)} is VALID [2018-11-23 11:54:58,856 INFO L273 TraceCheckUtils]: 6: Hoare triple {2057#(= 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; {2058#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:58,856 INFO L273 TraceCheckUtils]: 7: Hoare triple {2058#(<= 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; {2059#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:58,857 INFO L273 TraceCheckUtils]: 8: Hoare triple {2059#(<= 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; {2060#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:58,857 INFO L273 TraceCheckUtils]: 9: Hoare triple {2060#(<= 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; {2061#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:58,858 INFO L273 TraceCheckUtils]: 10: Hoare triple {2061#(<= 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; {2062#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:58,859 INFO L273 TraceCheckUtils]: 11: Hoare triple {2062#(<= 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; {2063#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:58,860 INFO L273 TraceCheckUtils]: 12: Hoare triple {2063#(<= 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; {2064#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:58,861 INFO L273 TraceCheckUtils]: 13: Hoare triple {2064#(<= 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; {2065#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:58,862 INFO L273 TraceCheckUtils]: 14: Hoare triple {2065#(<= 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; {2066#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:58,863 INFO L273 TraceCheckUtils]: 15: Hoare triple {2066#(<= 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; {2067#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:58,864 INFO L273 TraceCheckUtils]: 16: Hoare triple {2067#(<= main_~i~0 10)} assume !(~i~0 < 100000); {2056#false} is VALID [2018-11-23 11:54:58,864 INFO L273 TraceCheckUtils]: 17: Hoare triple {2056#false} havoc ~x~0;~x~0 := 0; {2056#false} is VALID [2018-11-23 11:54:58,865 INFO L273 TraceCheckUtils]: 18: Hoare triple {2056#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2056#false} is VALID [2018-11-23 11:54:58,865 INFO L256 TraceCheckUtils]: 19: Hoare triple {2056#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {2056#false} is VALID [2018-11-23 11:54:58,865 INFO L273 TraceCheckUtils]: 20: Hoare triple {2056#false} ~cond := #in~cond; {2056#false} is VALID [2018-11-23 11:54:58,865 INFO L273 TraceCheckUtils]: 21: Hoare triple {2056#false} assume 0 == ~cond; {2056#false} is VALID [2018-11-23 11:54:58,866 INFO L273 TraceCheckUtils]: 22: Hoare triple {2056#false} assume !false; {2056#false} is VALID [2018-11-23 11:54:58,867 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:54:58,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:58,867 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:54:58,881 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:54:58,899 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:54:58,899 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:58,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:58,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:59,026 INFO L256 TraceCheckUtils]: 0: Hoare triple {2055#true} call ULTIMATE.init(); {2055#true} is VALID [2018-11-23 11:54:59,026 INFO L273 TraceCheckUtils]: 1: Hoare triple {2055#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2055#true} is VALID [2018-11-23 11:54:59,027 INFO L273 TraceCheckUtils]: 2: Hoare triple {2055#true} assume true; {2055#true} is VALID [2018-11-23 11:54:59,027 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2055#true} {2055#true} #48#return; {2055#true} is VALID [2018-11-23 11:54:59,027 INFO L256 TraceCheckUtils]: 4: Hoare triple {2055#true} call #t~ret2 := main(); {2055#true} is VALID [2018-11-23 11:54:59,028 INFO L273 TraceCheckUtils]: 5: Hoare triple {2055#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2086#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:59,029 INFO L273 TraceCheckUtils]: 6: Hoare triple {2086#(<= 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; {2058#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:59,030 INFO L273 TraceCheckUtils]: 7: Hoare triple {2058#(<= 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; {2059#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:59,034 INFO L273 TraceCheckUtils]: 8: Hoare triple {2059#(<= 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; {2060#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:59,036 INFO L273 TraceCheckUtils]: 9: Hoare triple {2060#(<= 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; {2061#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:59,037 INFO L273 TraceCheckUtils]: 10: Hoare triple {2061#(<= 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; {2062#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:59,040 INFO L273 TraceCheckUtils]: 11: Hoare triple {2062#(<= 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; {2063#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:59,041 INFO L273 TraceCheckUtils]: 12: Hoare triple {2063#(<= 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; {2064#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:59,046 INFO L273 TraceCheckUtils]: 13: Hoare triple {2064#(<= 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; {2065#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:59,046 INFO L273 TraceCheckUtils]: 14: Hoare triple {2065#(<= 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; {2066#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:59,047 INFO L273 TraceCheckUtils]: 15: Hoare triple {2066#(<= 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; {2067#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:59,048 INFO L273 TraceCheckUtils]: 16: Hoare triple {2067#(<= main_~i~0 10)} assume !(~i~0 < 100000); {2056#false} is VALID [2018-11-23 11:54:59,048 INFO L273 TraceCheckUtils]: 17: Hoare triple {2056#false} havoc ~x~0;~x~0 := 0; {2056#false} is VALID [2018-11-23 11:54:59,048 INFO L273 TraceCheckUtils]: 18: Hoare triple {2056#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2056#false} is VALID [2018-11-23 11:54:59,048 INFO L256 TraceCheckUtils]: 19: Hoare triple {2056#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {2056#false} is VALID [2018-11-23 11:54:59,048 INFO L273 TraceCheckUtils]: 20: Hoare triple {2056#false} ~cond := #in~cond; {2056#false} is VALID [2018-11-23 11:54:59,049 INFO L273 TraceCheckUtils]: 21: Hoare triple {2056#false} assume 0 == ~cond; {2056#false} is VALID [2018-11-23 11:54:59,049 INFO L273 TraceCheckUtils]: 22: Hoare triple {2056#false} assume !false; {2056#false} is VALID [2018-11-23 11:54:59,050 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:54:59,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:59,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-23 11:54:59,070 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2018-11-23 11:54:59,070 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:59,070 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:54:59,089 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:59,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:54:59,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:54:59,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:54:59,091 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 14 states. [2018-11-23 11:54:59,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:59,332 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-11-23 11:54:59,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 11:54:59,333 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2018-11-23 11:54:59,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:59,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:54:59,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 42 transitions. [2018-11-23 11:54:59,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:54:59,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 42 transitions. [2018-11-23 11:54:59,336 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 42 transitions. [2018-11-23 11:54:59,419 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:59,421 INFO L225 Difference]: With dead ends: 40 [2018-11-23 11:54:59,421 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 11:54:59,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:54:59,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 11:54:59,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-23 11:54:59,450 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:59,450 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2018-11-23 11:54:59,450 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-23 11:54:59,450 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-23 11:54:59,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:59,453 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-11-23 11:54:59,453 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-11-23 11:54:59,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:59,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:59,453 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-23 11:54:59,454 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-23 11:54:59,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:59,455 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-11-23 11:54:59,455 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-11-23 11:54:59,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:59,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:59,455 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:59,455 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:59,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 11:54:59,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-11-23 11:54:59,456 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 23 [2018-11-23 11:54:59,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:59,456 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-11-23 11:54:59,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:54:59,456 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-11-23 11:54:59,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 11:54:59,457 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:59,457 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:59,457 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:59,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:59,458 INFO L82 PathProgramCache]: Analyzing trace with hash 634960110, now seen corresponding path program 11 times [2018-11-23 11:54:59,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:59,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:59,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:59,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:59,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:59,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:59,895 INFO L256 TraceCheckUtils]: 0: Hoare triple {2305#true} call ULTIMATE.init(); {2305#true} is VALID [2018-11-23 11:54:59,896 INFO L273 TraceCheckUtils]: 1: Hoare triple {2305#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2305#true} is VALID [2018-11-23 11:54:59,896 INFO L273 TraceCheckUtils]: 2: Hoare triple {2305#true} assume true; {2305#true} is VALID [2018-11-23 11:54:59,896 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2305#true} {2305#true} #48#return; {2305#true} is VALID [2018-11-23 11:54:59,896 INFO L256 TraceCheckUtils]: 4: Hoare triple {2305#true} call #t~ret2 := main(); {2305#true} is VALID [2018-11-23 11:54:59,897 INFO L273 TraceCheckUtils]: 5: Hoare triple {2305#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2307#(= main_~i~0 0)} is VALID [2018-11-23 11:54:59,898 INFO L273 TraceCheckUtils]: 6: Hoare triple {2307#(= 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; {2308#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:59,899 INFO L273 TraceCheckUtils]: 7: Hoare triple {2308#(<= 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; {2309#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:59,899 INFO L273 TraceCheckUtils]: 8: Hoare triple {2309#(<= 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; {2310#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:59,900 INFO L273 TraceCheckUtils]: 9: Hoare triple {2310#(<= 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; {2311#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:59,900 INFO L273 TraceCheckUtils]: 10: Hoare triple {2311#(<= 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; {2312#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:59,901 INFO L273 TraceCheckUtils]: 11: Hoare triple {2312#(<= 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; {2313#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:59,902 INFO L273 TraceCheckUtils]: 12: Hoare triple {2313#(<= 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; {2314#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:59,903 INFO L273 TraceCheckUtils]: 13: Hoare triple {2314#(<= 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; {2315#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:59,904 INFO L273 TraceCheckUtils]: 14: Hoare triple {2315#(<= 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; {2316#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:59,905 INFO L273 TraceCheckUtils]: 15: Hoare triple {2316#(<= 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; {2317#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:59,906 INFO L273 TraceCheckUtils]: 16: Hoare triple {2317#(<= 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; {2318#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:59,907 INFO L273 TraceCheckUtils]: 17: Hoare triple {2318#(<= main_~i~0 11)} assume !(~i~0 < 100000); {2306#false} is VALID [2018-11-23 11:54:59,907 INFO L273 TraceCheckUtils]: 18: Hoare triple {2306#false} havoc ~x~0;~x~0 := 0; {2306#false} is VALID [2018-11-23 11:54:59,907 INFO L273 TraceCheckUtils]: 19: Hoare triple {2306#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2306#false} is VALID [2018-11-23 11:54:59,907 INFO L256 TraceCheckUtils]: 20: Hoare triple {2306#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {2306#false} is VALID [2018-11-23 11:54:59,908 INFO L273 TraceCheckUtils]: 21: Hoare triple {2306#false} ~cond := #in~cond; {2306#false} is VALID [2018-11-23 11:54:59,908 INFO L273 TraceCheckUtils]: 22: Hoare triple {2306#false} assume 0 == ~cond; {2306#false} is VALID [2018-11-23 11:54:59,908 INFO L273 TraceCheckUtils]: 23: Hoare triple {2306#false} assume !false; {2306#false} is VALID [2018-11-23 11:54:59,909 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:54:59,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:59,909 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:54:59,918 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:54:59,957 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-23 11:54:59,957 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:59,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:59,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:00,282 INFO L256 TraceCheckUtils]: 0: Hoare triple {2305#true} call ULTIMATE.init(); {2305#true} is VALID [2018-11-23 11:55:00,282 INFO L273 TraceCheckUtils]: 1: Hoare triple {2305#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2305#true} is VALID [2018-11-23 11:55:00,282 INFO L273 TraceCheckUtils]: 2: Hoare triple {2305#true} assume true; {2305#true} is VALID [2018-11-23 11:55:00,282 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2305#true} {2305#true} #48#return; {2305#true} is VALID [2018-11-23 11:55:00,282 INFO L256 TraceCheckUtils]: 4: Hoare triple {2305#true} call #t~ret2 := main(); {2305#true} is VALID [2018-11-23 11:55:00,283 INFO L273 TraceCheckUtils]: 5: Hoare triple {2305#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2337#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:00,284 INFO L273 TraceCheckUtils]: 6: Hoare triple {2337#(<= 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; {2308#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:00,284 INFO L273 TraceCheckUtils]: 7: Hoare triple {2308#(<= 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; {2309#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:00,285 INFO L273 TraceCheckUtils]: 8: Hoare triple {2309#(<= 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; {2310#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:00,286 INFO L273 TraceCheckUtils]: 9: Hoare triple {2310#(<= 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; {2311#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:00,287 INFO L273 TraceCheckUtils]: 10: Hoare triple {2311#(<= 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; {2312#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:00,288 INFO L273 TraceCheckUtils]: 11: Hoare triple {2312#(<= 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; {2313#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:00,289 INFO L273 TraceCheckUtils]: 12: Hoare triple {2313#(<= 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; {2314#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:00,290 INFO L273 TraceCheckUtils]: 13: Hoare triple {2314#(<= 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; {2315#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:00,291 INFO L273 TraceCheckUtils]: 14: Hoare triple {2315#(<= 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; {2316#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:00,292 INFO L273 TraceCheckUtils]: 15: Hoare triple {2316#(<= 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; {2317#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:00,293 INFO L273 TraceCheckUtils]: 16: Hoare triple {2317#(<= 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; {2318#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:00,294 INFO L273 TraceCheckUtils]: 17: Hoare triple {2318#(<= main_~i~0 11)} assume !(~i~0 < 100000); {2306#false} is VALID [2018-11-23 11:55:00,294 INFO L273 TraceCheckUtils]: 18: Hoare triple {2306#false} havoc ~x~0;~x~0 := 0; {2306#false} is VALID [2018-11-23 11:55:00,294 INFO L273 TraceCheckUtils]: 19: Hoare triple {2306#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2306#false} is VALID [2018-11-23 11:55:00,295 INFO L256 TraceCheckUtils]: 20: Hoare triple {2306#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {2306#false} is VALID [2018-11-23 11:55:00,295 INFO L273 TraceCheckUtils]: 21: Hoare triple {2306#false} ~cond := #in~cond; {2306#false} is VALID [2018-11-23 11:55:00,295 INFO L273 TraceCheckUtils]: 22: Hoare triple {2306#false} assume 0 == ~cond; {2306#false} is VALID [2018-11-23 11:55:00,295 INFO L273 TraceCheckUtils]: 23: Hoare triple {2306#false} assume !false; {2306#false} is VALID [2018-11-23 11:55:00,296 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:00,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:00,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-23 11:55:00,317 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2018-11-23 11:55:00,318 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:00,318 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 11:55:00,338 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:55:00,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 11:55:00,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 11:55:00,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:55:00,340 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 15 states. [2018-11-23 11:55:00,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:00,595 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-11-23 11:55:00,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 11:55:00,596 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2018-11-23 11:55:00,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:00,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:55:00,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 43 transitions. [2018-11-23 11:55:00,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:55:00,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 43 transitions. [2018-11-23 11:55:00,599 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 43 transitions. [2018-11-23 11:55:00,643 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:55:00,644 INFO L225 Difference]: With dead ends: 41 [2018-11-23 11:55:00,645 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 11:55:00,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:55:00,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 11:55:00,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-23 11:55:00,691 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:00,691 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2018-11-23 11:55:00,691 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-23 11:55:00,691 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-23 11:55:00,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:00,692 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-11-23 11:55:00,692 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-11-23 11:55:00,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:00,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:00,693 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-23 11:55:00,693 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-23 11:55:00,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:00,694 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-11-23 11:55:00,694 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-11-23 11:55:00,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:00,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:00,694 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:00,694 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:00,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:55:00,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-11-23 11:55:00,695 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 24 [2018-11-23 11:55:00,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:00,695 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-11-23 11:55:00,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 11:55:00,695 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-11-23 11:55:00,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 11:55:00,696 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:00,696 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:00,696 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:00,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:00,697 INFO L82 PathProgramCache]: Analyzing trace with hash 412815538, now seen corresponding path program 12 times [2018-11-23 11:55:00,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:00,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:00,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:00,698 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:00,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:00,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:00,916 INFO L256 TraceCheckUtils]: 0: Hoare triple {2565#true} call ULTIMATE.init(); {2565#true} is VALID [2018-11-23 11:55:00,916 INFO L273 TraceCheckUtils]: 1: Hoare triple {2565#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2565#true} is VALID [2018-11-23 11:55:00,917 INFO L273 TraceCheckUtils]: 2: Hoare triple {2565#true} assume true; {2565#true} is VALID [2018-11-23 11:55:00,917 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2565#true} {2565#true} #48#return; {2565#true} is VALID [2018-11-23 11:55:00,917 INFO L256 TraceCheckUtils]: 4: Hoare triple {2565#true} call #t~ret2 := main(); {2565#true} is VALID [2018-11-23 11:55:00,917 INFO L273 TraceCheckUtils]: 5: Hoare triple {2565#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2567#(= main_~i~0 0)} is VALID [2018-11-23 11:55:00,918 INFO L273 TraceCheckUtils]: 6: Hoare triple {2567#(= 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; {2568#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:00,919 INFO L273 TraceCheckUtils]: 7: Hoare triple {2568#(<= 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; {2569#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:00,919 INFO L273 TraceCheckUtils]: 8: Hoare triple {2569#(<= 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; {2570#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:00,920 INFO L273 TraceCheckUtils]: 9: Hoare triple {2570#(<= 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; {2571#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:00,920 INFO L273 TraceCheckUtils]: 10: Hoare triple {2571#(<= 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; {2572#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:00,921 INFO L273 TraceCheckUtils]: 11: Hoare triple {2572#(<= 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; {2573#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:00,922 INFO L273 TraceCheckUtils]: 12: Hoare triple {2573#(<= 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; {2574#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:00,923 INFO L273 TraceCheckUtils]: 13: Hoare triple {2574#(<= 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; {2575#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:00,924 INFO L273 TraceCheckUtils]: 14: Hoare triple {2575#(<= 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; {2576#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:00,925 INFO L273 TraceCheckUtils]: 15: Hoare triple {2576#(<= 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; {2577#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:00,926 INFO L273 TraceCheckUtils]: 16: Hoare triple {2577#(<= 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; {2578#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:00,928 INFO L273 TraceCheckUtils]: 17: Hoare triple {2578#(<= 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; {2579#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:00,928 INFO L273 TraceCheckUtils]: 18: Hoare triple {2579#(<= main_~i~0 12)} assume !(~i~0 < 100000); {2566#false} is VALID [2018-11-23 11:55:00,929 INFO L273 TraceCheckUtils]: 19: Hoare triple {2566#false} havoc ~x~0;~x~0 := 0; {2566#false} is VALID [2018-11-23 11:55:00,929 INFO L273 TraceCheckUtils]: 20: Hoare triple {2566#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2566#false} is VALID [2018-11-23 11:55:00,929 INFO L256 TraceCheckUtils]: 21: Hoare triple {2566#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {2566#false} is VALID [2018-11-23 11:55:00,930 INFO L273 TraceCheckUtils]: 22: Hoare triple {2566#false} ~cond := #in~cond; {2566#false} is VALID [2018-11-23 11:55:00,930 INFO L273 TraceCheckUtils]: 23: Hoare triple {2566#false} assume 0 == ~cond; {2566#false} is VALID [2018-11-23 11:55:00,930 INFO L273 TraceCheckUtils]: 24: Hoare triple {2566#false} assume !false; {2566#false} is VALID [2018-11-23 11:55:00,932 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:00,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:00,932 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:00,943 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:55:01,003 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 11:55:01,003 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:01,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:01,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:01,114 INFO L256 TraceCheckUtils]: 0: Hoare triple {2565#true} call ULTIMATE.init(); {2565#true} is VALID [2018-11-23 11:55:01,115 INFO L273 TraceCheckUtils]: 1: Hoare triple {2565#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2565#true} is VALID [2018-11-23 11:55:01,115 INFO L273 TraceCheckUtils]: 2: Hoare triple {2565#true} assume true; {2565#true} is VALID [2018-11-23 11:55:01,115 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2565#true} {2565#true} #48#return; {2565#true} is VALID [2018-11-23 11:55:01,116 INFO L256 TraceCheckUtils]: 4: Hoare triple {2565#true} call #t~ret2 := main(); {2565#true} is VALID [2018-11-23 11:55:01,116 INFO L273 TraceCheckUtils]: 5: Hoare triple {2565#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2598#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:01,117 INFO L273 TraceCheckUtils]: 6: Hoare triple {2598#(<= 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; {2568#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:01,117 INFO L273 TraceCheckUtils]: 7: Hoare triple {2568#(<= 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; {2569#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:01,118 INFO L273 TraceCheckUtils]: 8: Hoare triple {2569#(<= 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; {2570#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:01,119 INFO L273 TraceCheckUtils]: 9: Hoare triple {2570#(<= 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; {2571#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:01,119 INFO L273 TraceCheckUtils]: 10: Hoare triple {2571#(<= 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; {2572#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:01,120 INFO L273 TraceCheckUtils]: 11: Hoare triple {2572#(<= 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; {2573#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:01,121 INFO L273 TraceCheckUtils]: 12: Hoare triple {2573#(<= 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; {2574#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:01,122 INFO L273 TraceCheckUtils]: 13: Hoare triple {2574#(<= 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; {2575#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:01,123 INFO L273 TraceCheckUtils]: 14: Hoare triple {2575#(<= 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; {2576#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:01,124 INFO L273 TraceCheckUtils]: 15: Hoare triple {2576#(<= 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; {2577#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:01,125 INFO L273 TraceCheckUtils]: 16: Hoare triple {2577#(<= 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; {2578#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:01,126 INFO L273 TraceCheckUtils]: 17: Hoare triple {2578#(<= 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; {2579#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:01,127 INFO L273 TraceCheckUtils]: 18: Hoare triple {2579#(<= main_~i~0 12)} assume !(~i~0 < 100000); {2566#false} is VALID [2018-11-23 11:55:01,127 INFO L273 TraceCheckUtils]: 19: Hoare triple {2566#false} havoc ~x~0;~x~0 := 0; {2566#false} is VALID [2018-11-23 11:55:01,127 INFO L273 TraceCheckUtils]: 20: Hoare triple {2566#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2566#false} is VALID [2018-11-23 11:55:01,128 INFO L256 TraceCheckUtils]: 21: Hoare triple {2566#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {2566#false} is VALID [2018-11-23 11:55:01,128 INFO L273 TraceCheckUtils]: 22: Hoare triple {2566#false} ~cond := #in~cond; {2566#false} is VALID [2018-11-23 11:55:01,128 INFO L273 TraceCheckUtils]: 23: Hoare triple {2566#false} assume 0 == ~cond; {2566#false} is VALID [2018-11-23 11:55:01,128 INFO L273 TraceCheckUtils]: 24: Hoare triple {2566#false} assume !false; {2566#false} is VALID [2018-11-23 11:55:01,129 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:01,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:01,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-11-23 11:55:01,150 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2018-11-23 11:55:01,150 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:01,150 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 11:55:01,172 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:01,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 11:55:01,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 11:55:01,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:55:01,174 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 16 states. [2018-11-23 11:55:01,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:01,397 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-11-23 11:55:01,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 11:55:01,398 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2018-11-23 11:55:01,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:01,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:55:01,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 44 transitions. [2018-11-23 11:55:01,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:55:01,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 44 transitions. [2018-11-23 11:55:01,400 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 44 transitions. [2018-11-23 11:55:01,440 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:55:01,441 INFO L225 Difference]: With dead ends: 42 [2018-11-23 11:55:01,441 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 11:55:01,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:55:01,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 11:55:01,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-23 11:55:01,482 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:01,482 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2018-11-23 11:55:01,483 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-23 11:55:01,483 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-23 11:55:01,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:01,485 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-11-23 11:55:01,485 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-11-23 11:55:01,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:01,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:01,485 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-23 11:55:01,485 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-23 11:55:01,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:01,486 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-11-23 11:55:01,486 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-11-23 11:55:01,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:01,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:01,487 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:01,487 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:01,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 11:55:01,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-11-23 11:55:01,488 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 25 [2018-11-23 11:55:01,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:01,488 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-11-23 11:55:01,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 11:55:01,489 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-11-23 11:55:01,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 11:55:01,489 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:01,489 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:01,490 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:01,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:01,490 INFO L82 PathProgramCache]: Analyzing trace with hash 2116268398, now seen corresponding path program 13 times [2018-11-23 11:55:01,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:01,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:01,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:01,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:01,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:01,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:01,731 INFO L256 TraceCheckUtils]: 0: Hoare triple {2835#true} call ULTIMATE.init(); {2835#true} is VALID [2018-11-23 11:55:01,732 INFO L273 TraceCheckUtils]: 1: Hoare triple {2835#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2835#true} is VALID [2018-11-23 11:55:01,732 INFO L273 TraceCheckUtils]: 2: Hoare triple {2835#true} assume true; {2835#true} is VALID [2018-11-23 11:55:01,732 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2835#true} {2835#true} #48#return; {2835#true} is VALID [2018-11-23 11:55:01,732 INFO L256 TraceCheckUtils]: 4: Hoare triple {2835#true} call #t~ret2 := main(); {2835#true} is VALID [2018-11-23 11:55:01,733 INFO L273 TraceCheckUtils]: 5: Hoare triple {2835#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2837#(= main_~i~0 0)} is VALID [2018-11-23 11:55:01,734 INFO L273 TraceCheckUtils]: 6: Hoare triple {2837#(= 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; {2838#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:01,735 INFO L273 TraceCheckUtils]: 7: Hoare triple {2838#(<= 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; {2839#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:01,736 INFO L273 TraceCheckUtils]: 8: Hoare triple {2839#(<= 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; {2840#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:01,737 INFO L273 TraceCheckUtils]: 9: Hoare triple {2840#(<= 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; {2841#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:01,738 INFO L273 TraceCheckUtils]: 10: Hoare triple {2841#(<= 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; {2842#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:01,739 INFO L273 TraceCheckUtils]: 11: Hoare triple {2842#(<= 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; {2843#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:01,740 INFO L273 TraceCheckUtils]: 12: Hoare triple {2843#(<= 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; {2844#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:01,741 INFO L273 TraceCheckUtils]: 13: Hoare triple {2844#(<= 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; {2845#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:01,742 INFO L273 TraceCheckUtils]: 14: Hoare triple {2845#(<= 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; {2846#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:01,743 INFO L273 TraceCheckUtils]: 15: Hoare triple {2846#(<= 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; {2847#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:01,744 INFO L273 TraceCheckUtils]: 16: Hoare triple {2847#(<= 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; {2848#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:01,745 INFO L273 TraceCheckUtils]: 17: Hoare triple {2848#(<= 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; {2849#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:01,760 INFO L273 TraceCheckUtils]: 18: Hoare triple {2849#(<= 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; {2850#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:01,761 INFO L273 TraceCheckUtils]: 19: Hoare triple {2850#(<= main_~i~0 13)} assume !(~i~0 < 100000); {2836#false} is VALID [2018-11-23 11:55:01,761 INFO L273 TraceCheckUtils]: 20: Hoare triple {2836#false} havoc ~x~0;~x~0 := 0; {2836#false} is VALID [2018-11-23 11:55:01,761 INFO L273 TraceCheckUtils]: 21: Hoare triple {2836#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2836#false} is VALID [2018-11-23 11:55:01,761 INFO L256 TraceCheckUtils]: 22: Hoare triple {2836#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {2836#false} is VALID [2018-11-23 11:55:01,762 INFO L273 TraceCheckUtils]: 23: Hoare triple {2836#false} ~cond := #in~cond; {2836#false} is VALID [2018-11-23 11:55:01,762 INFO L273 TraceCheckUtils]: 24: Hoare triple {2836#false} assume 0 == ~cond; {2836#false} is VALID [2018-11-23 11:55:01,762 INFO L273 TraceCheckUtils]: 25: Hoare triple {2836#false} assume !false; {2836#false} is VALID [2018-11-23 11:55:01,763 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:01,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:01,763 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:01,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:01,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:01,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:01,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:02,034 INFO L256 TraceCheckUtils]: 0: Hoare triple {2835#true} call ULTIMATE.init(); {2835#true} is VALID [2018-11-23 11:55:02,034 INFO L273 TraceCheckUtils]: 1: Hoare triple {2835#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2835#true} is VALID [2018-11-23 11:55:02,034 INFO L273 TraceCheckUtils]: 2: Hoare triple {2835#true} assume true; {2835#true} is VALID [2018-11-23 11:55:02,034 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2835#true} {2835#true} #48#return; {2835#true} is VALID [2018-11-23 11:55:02,034 INFO L256 TraceCheckUtils]: 4: Hoare triple {2835#true} call #t~ret2 := main(); {2835#true} is VALID [2018-11-23 11:55:02,035 INFO L273 TraceCheckUtils]: 5: Hoare triple {2835#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2869#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:02,036 INFO L273 TraceCheckUtils]: 6: Hoare triple {2869#(<= 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; {2838#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:02,036 INFO L273 TraceCheckUtils]: 7: Hoare triple {2838#(<= 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; {2839#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:02,037 INFO L273 TraceCheckUtils]: 8: Hoare triple {2839#(<= 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; {2840#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:02,038 INFO L273 TraceCheckUtils]: 9: Hoare triple {2840#(<= 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; {2841#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:02,039 INFO L273 TraceCheckUtils]: 10: Hoare triple {2841#(<= 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; {2842#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:02,040 INFO L273 TraceCheckUtils]: 11: Hoare triple {2842#(<= 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; {2843#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:02,041 INFO L273 TraceCheckUtils]: 12: Hoare triple {2843#(<= 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; {2844#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:02,042 INFO L273 TraceCheckUtils]: 13: Hoare triple {2844#(<= 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; {2845#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:02,043 INFO L273 TraceCheckUtils]: 14: Hoare triple {2845#(<= 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; {2846#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:02,044 INFO L273 TraceCheckUtils]: 15: Hoare triple {2846#(<= 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; {2847#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:02,049 INFO L273 TraceCheckUtils]: 16: Hoare triple {2847#(<= 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; {2848#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:02,050 INFO L273 TraceCheckUtils]: 17: Hoare triple {2848#(<= 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; {2849#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:02,050 INFO L273 TraceCheckUtils]: 18: Hoare triple {2849#(<= 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; {2850#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:02,051 INFO L273 TraceCheckUtils]: 19: Hoare triple {2850#(<= main_~i~0 13)} assume !(~i~0 < 100000); {2836#false} is VALID [2018-11-23 11:55:02,051 INFO L273 TraceCheckUtils]: 20: Hoare triple {2836#false} havoc ~x~0;~x~0 := 0; {2836#false} is VALID [2018-11-23 11:55:02,051 INFO L273 TraceCheckUtils]: 21: Hoare triple {2836#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2836#false} is VALID [2018-11-23 11:55:02,051 INFO L256 TraceCheckUtils]: 22: Hoare triple {2836#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {2836#false} is VALID [2018-11-23 11:55:02,051 INFO L273 TraceCheckUtils]: 23: Hoare triple {2836#false} ~cond := #in~cond; {2836#false} is VALID [2018-11-23 11:55:02,051 INFO L273 TraceCheckUtils]: 24: Hoare triple {2836#false} assume 0 == ~cond; {2836#false} is VALID [2018-11-23 11:55:02,052 INFO L273 TraceCheckUtils]: 25: Hoare triple {2836#false} assume !false; {2836#false} is VALID [2018-11-23 11:55:02,052 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:02,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:02,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 11:55:02,073 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2018-11-23 11:55:02,074 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:02,074 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 11:55:02,095 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:02,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 11:55:02,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 11:55:02,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:55:02,096 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 17 states. [2018-11-23 11:55:02,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:02,269 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2018-11-23 11:55:02,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 11:55:02,270 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2018-11-23 11:55:02,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:02,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:55:02,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 45 transitions. [2018-11-23 11:55:02,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:55:02,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 45 transitions. [2018-11-23 11:55:02,273 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 45 transitions. [2018-11-23 11:55:02,341 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:02,341 INFO L225 Difference]: With dead ends: 43 [2018-11-23 11:55:02,341 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 11:55:02,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:55:02,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 11:55:02,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-23 11:55:02,426 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:02,426 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2018-11-23 11:55:02,426 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-23 11:55:02,426 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-23 11:55:02,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:02,427 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2018-11-23 11:55:02,427 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-11-23 11:55:02,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:02,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:02,428 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-23 11:55:02,428 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-23 11:55:02,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:02,429 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2018-11-23 11:55:02,429 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-11-23 11:55:02,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:02,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:02,430 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:02,430 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:02,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 11:55:02,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-11-23 11:55:02,431 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 26 [2018-11-23 11:55:02,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:02,431 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2018-11-23 11:55:02,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 11:55:02,432 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-11-23 11:55:02,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 11:55:02,432 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:02,432 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:02,432 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:02,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:02,433 INFO L82 PathProgramCache]: Analyzing trace with hash -911267790, now seen corresponding path program 14 times [2018-11-23 11:55:02,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:02,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:02,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:02,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:02,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:02,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:02,702 INFO L256 TraceCheckUtils]: 0: Hoare triple {3115#true} call ULTIMATE.init(); {3115#true} is VALID [2018-11-23 11:55:02,703 INFO L273 TraceCheckUtils]: 1: Hoare triple {3115#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3115#true} is VALID [2018-11-23 11:55:02,703 INFO L273 TraceCheckUtils]: 2: Hoare triple {3115#true} assume true; {3115#true} is VALID [2018-11-23 11:55:02,703 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3115#true} {3115#true} #48#return; {3115#true} is VALID [2018-11-23 11:55:02,704 INFO L256 TraceCheckUtils]: 4: Hoare triple {3115#true} call #t~ret2 := main(); {3115#true} is VALID [2018-11-23 11:55:02,704 INFO L273 TraceCheckUtils]: 5: Hoare triple {3115#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3117#(= main_~i~0 0)} is VALID [2018-11-23 11:55:02,705 INFO L273 TraceCheckUtils]: 6: Hoare triple {3117#(= 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; {3118#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:02,706 INFO L273 TraceCheckUtils]: 7: Hoare triple {3118#(<= 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; {3119#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:02,707 INFO L273 TraceCheckUtils]: 8: Hoare triple {3119#(<= 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; {3120#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:02,707 INFO L273 TraceCheckUtils]: 9: Hoare triple {3120#(<= 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; {3121#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:02,708 INFO L273 TraceCheckUtils]: 10: Hoare triple {3121#(<= 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; {3122#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:02,709 INFO L273 TraceCheckUtils]: 11: Hoare triple {3122#(<= 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; {3123#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:02,710 INFO L273 TraceCheckUtils]: 12: Hoare triple {3123#(<= 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; {3124#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:02,711 INFO L273 TraceCheckUtils]: 13: Hoare triple {3124#(<= 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; {3125#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:02,711 INFO L273 TraceCheckUtils]: 14: Hoare triple {3125#(<= 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; {3126#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:02,712 INFO L273 TraceCheckUtils]: 15: Hoare triple {3126#(<= 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; {3127#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:02,713 INFO L273 TraceCheckUtils]: 16: Hoare triple {3127#(<= 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; {3128#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:02,714 INFO L273 TraceCheckUtils]: 17: Hoare triple {3128#(<= 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; {3129#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:02,716 INFO L273 TraceCheckUtils]: 18: Hoare triple {3129#(<= 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; {3130#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:02,717 INFO L273 TraceCheckUtils]: 19: Hoare triple {3130#(<= 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; {3131#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:02,717 INFO L273 TraceCheckUtils]: 20: Hoare triple {3131#(<= main_~i~0 14)} assume !(~i~0 < 100000); {3116#false} is VALID [2018-11-23 11:55:02,718 INFO L273 TraceCheckUtils]: 21: Hoare triple {3116#false} havoc ~x~0;~x~0 := 0; {3116#false} is VALID [2018-11-23 11:55:02,718 INFO L273 TraceCheckUtils]: 22: Hoare triple {3116#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3116#false} is VALID [2018-11-23 11:55:02,718 INFO L256 TraceCheckUtils]: 23: Hoare triple {3116#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {3116#false} is VALID [2018-11-23 11:55:02,719 INFO L273 TraceCheckUtils]: 24: Hoare triple {3116#false} ~cond := #in~cond; {3116#false} is VALID [2018-11-23 11:55:02,719 INFO L273 TraceCheckUtils]: 25: Hoare triple {3116#false} assume 0 == ~cond; {3116#false} is VALID [2018-11-23 11:55:02,719 INFO L273 TraceCheckUtils]: 26: Hoare triple {3116#false} assume !false; {3116#false} is VALID [2018-11-23 11:55:02,720 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:02,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:02,720 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:02,730 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:55:02,765 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:55:02,765 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:02,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:02,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:02,963 INFO L256 TraceCheckUtils]: 0: Hoare triple {3115#true} call ULTIMATE.init(); {3115#true} is VALID [2018-11-23 11:55:02,963 INFO L273 TraceCheckUtils]: 1: Hoare triple {3115#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3115#true} is VALID [2018-11-23 11:55:02,963 INFO L273 TraceCheckUtils]: 2: Hoare triple {3115#true} assume true; {3115#true} is VALID [2018-11-23 11:55:02,964 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3115#true} {3115#true} #48#return; {3115#true} is VALID [2018-11-23 11:55:02,964 INFO L256 TraceCheckUtils]: 4: Hoare triple {3115#true} call #t~ret2 := main(); {3115#true} is VALID [2018-11-23 11:55:02,965 INFO L273 TraceCheckUtils]: 5: Hoare triple {3115#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3150#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:02,966 INFO L273 TraceCheckUtils]: 6: Hoare triple {3150#(<= 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; {3118#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:02,966 INFO L273 TraceCheckUtils]: 7: Hoare triple {3118#(<= 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; {3119#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:02,967 INFO L273 TraceCheckUtils]: 8: Hoare triple {3119#(<= 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; {3120#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:02,968 INFO L273 TraceCheckUtils]: 9: Hoare triple {3120#(<= 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; {3121#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:02,969 INFO L273 TraceCheckUtils]: 10: Hoare triple {3121#(<= 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; {3122#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:02,970 INFO L273 TraceCheckUtils]: 11: Hoare triple {3122#(<= 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; {3123#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:02,971 INFO L273 TraceCheckUtils]: 12: Hoare triple {3123#(<= 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; {3124#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:02,972 INFO L273 TraceCheckUtils]: 13: Hoare triple {3124#(<= 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; {3125#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:02,973 INFO L273 TraceCheckUtils]: 14: Hoare triple {3125#(<= 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; {3126#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:02,976 INFO L273 TraceCheckUtils]: 15: Hoare triple {3126#(<= 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; {3127#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:02,977 INFO L273 TraceCheckUtils]: 16: Hoare triple {3127#(<= 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; {3128#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:02,978 INFO L273 TraceCheckUtils]: 17: Hoare triple {3128#(<= 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; {3129#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:02,978 INFO L273 TraceCheckUtils]: 18: Hoare triple {3129#(<= 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; {3130#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:02,979 INFO L273 TraceCheckUtils]: 19: Hoare triple {3130#(<= 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; {3131#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:02,980 INFO L273 TraceCheckUtils]: 20: Hoare triple {3131#(<= main_~i~0 14)} assume !(~i~0 < 100000); {3116#false} is VALID [2018-11-23 11:55:02,980 INFO L273 TraceCheckUtils]: 21: Hoare triple {3116#false} havoc ~x~0;~x~0 := 0; {3116#false} is VALID [2018-11-23 11:55:02,980 INFO L273 TraceCheckUtils]: 22: Hoare triple {3116#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3116#false} is VALID [2018-11-23 11:55:02,980 INFO L256 TraceCheckUtils]: 23: Hoare triple {3116#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {3116#false} is VALID [2018-11-23 11:55:02,980 INFO L273 TraceCheckUtils]: 24: Hoare triple {3116#false} ~cond := #in~cond; {3116#false} is VALID [2018-11-23 11:55:02,980 INFO L273 TraceCheckUtils]: 25: Hoare triple {3116#false} assume 0 == ~cond; {3116#false} is VALID [2018-11-23 11:55:02,981 INFO L273 TraceCheckUtils]: 26: Hoare triple {3116#false} assume !false; {3116#false} is VALID [2018-11-23 11:55:02,982 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:03,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:03,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 11:55:03,003 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 27 [2018-11-23 11:55:03,003 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:03,003 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 11:55:03,089 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:03,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 11:55:03,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 11:55:03,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:55:03,090 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 18 states. [2018-11-23 11:55:03,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:03,361 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-11-23 11:55:03,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 11:55:03,362 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 27 [2018-11-23 11:55:03,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:03,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:55:03,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 46 transitions. [2018-11-23 11:55:03,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:55:03,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 46 transitions. [2018-11-23 11:55:03,365 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 46 transitions. [2018-11-23 11:55:03,411 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:55:03,412 INFO L225 Difference]: With dead ends: 44 [2018-11-23 11:55:03,412 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 11:55:03,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:55:03,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 11:55:03,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-23 11:55:03,441 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:03,441 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2018-11-23 11:55:03,441 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-23 11:55:03,441 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-23 11:55:03,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:03,442 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-11-23 11:55:03,442 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-11-23 11:55:03,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:03,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:03,443 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-23 11:55:03,443 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-23 11:55:03,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:03,444 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-11-23 11:55:03,444 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-11-23 11:55:03,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:03,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:03,445 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:03,445 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:03,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 11:55:03,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-11-23 11:55:03,447 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 27 [2018-11-23 11:55:03,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:03,447 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-11-23 11:55:03,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 11:55:03,447 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-11-23 11:55:03,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 11:55:03,448 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:03,448 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:03,448 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:03,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:03,448 INFO L82 PathProgramCache]: Analyzing trace with hash -275609106, now seen corresponding path program 15 times [2018-11-23 11:55:03,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:03,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:03,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:03,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:03,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:03,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:04,671 INFO L256 TraceCheckUtils]: 0: Hoare triple {3405#true} call ULTIMATE.init(); {3405#true} is VALID [2018-11-23 11:55:04,671 INFO L273 TraceCheckUtils]: 1: Hoare triple {3405#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3405#true} is VALID [2018-11-23 11:55:04,671 INFO L273 TraceCheckUtils]: 2: Hoare triple {3405#true} assume true; {3405#true} is VALID [2018-11-23 11:55:04,672 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3405#true} {3405#true} #48#return; {3405#true} is VALID [2018-11-23 11:55:04,672 INFO L256 TraceCheckUtils]: 4: Hoare triple {3405#true} call #t~ret2 := main(); {3405#true} is VALID [2018-11-23 11:55:04,673 INFO L273 TraceCheckUtils]: 5: Hoare triple {3405#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3407#(= main_~i~0 0)} is VALID [2018-11-23 11:55:04,674 INFO L273 TraceCheckUtils]: 6: Hoare triple {3407#(= 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; {3408#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:04,675 INFO L273 TraceCheckUtils]: 7: Hoare triple {3408#(<= 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; {3409#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:04,675 INFO L273 TraceCheckUtils]: 8: Hoare triple {3409#(<= 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; {3410#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:04,676 INFO L273 TraceCheckUtils]: 9: Hoare triple {3410#(<= 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; {3411#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:04,677 INFO L273 TraceCheckUtils]: 10: Hoare triple {3411#(<= 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; {3412#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:04,678 INFO L273 TraceCheckUtils]: 11: Hoare triple {3412#(<= 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; {3413#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:04,679 INFO L273 TraceCheckUtils]: 12: Hoare triple {3413#(<= 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; {3414#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:04,680 INFO L273 TraceCheckUtils]: 13: Hoare triple {3414#(<= 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; {3415#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:04,682 INFO L273 TraceCheckUtils]: 14: Hoare triple {3415#(<= 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; {3416#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:04,683 INFO L273 TraceCheckUtils]: 15: Hoare triple {3416#(<= 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; {3417#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:04,684 INFO L273 TraceCheckUtils]: 16: Hoare triple {3417#(<= 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; {3418#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:04,685 INFO L273 TraceCheckUtils]: 17: Hoare triple {3418#(<= 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; {3419#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:04,686 INFO L273 TraceCheckUtils]: 18: Hoare triple {3419#(<= 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; {3420#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:04,687 INFO L273 TraceCheckUtils]: 19: Hoare triple {3420#(<= 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; {3421#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:04,688 INFO L273 TraceCheckUtils]: 20: Hoare triple {3421#(<= 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; {3422#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:04,689 INFO L273 TraceCheckUtils]: 21: Hoare triple {3422#(<= main_~i~0 15)} assume !(~i~0 < 100000); {3406#false} is VALID [2018-11-23 11:55:04,689 INFO L273 TraceCheckUtils]: 22: Hoare triple {3406#false} havoc ~x~0;~x~0 := 0; {3406#false} is VALID [2018-11-23 11:55:04,690 INFO L273 TraceCheckUtils]: 23: Hoare triple {3406#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3406#false} is VALID [2018-11-23 11:55:04,690 INFO L256 TraceCheckUtils]: 24: Hoare triple {3406#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {3406#false} is VALID [2018-11-23 11:55:04,690 INFO L273 TraceCheckUtils]: 25: Hoare triple {3406#false} ~cond := #in~cond; {3406#false} is VALID [2018-11-23 11:55:04,690 INFO L273 TraceCheckUtils]: 26: Hoare triple {3406#false} assume 0 == ~cond; {3406#false} is VALID [2018-11-23 11:55:04,691 INFO L273 TraceCheckUtils]: 27: Hoare triple {3406#false} assume !false; {3406#false} is VALID [2018-11-23 11:55:04,693 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:04,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:04,693 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:04,701 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:55:04,835 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 11:55:04,835 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:04,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:04,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:05,035 INFO L256 TraceCheckUtils]: 0: Hoare triple {3405#true} call ULTIMATE.init(); {3405#true} is VALID [2018-11-23 11:55:05,036 INFO L273 TraceCheckUtils]: 1: Hoare triple {3405#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3405#true} is VALID [2018-11-23 11:55:05,036 INFO L273 TraceCheckUtils]: 2: Hoare triple {3405#true} assume true; {3405#true} is VALID [2018-11-23 11:55:05,036 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3405#true} {3405#true} #48#return; {3405#true} is VALID [2018-11-23 11:55:05,036 INFO L256 TraceCheckUtils]: 4: Hoare triple {3405#true} call #t~ret2 := main(); {3405#true} is VALID [2018-11-23 11:55:05,037 INFO L273 TraceCheckUtils]: 5: Hoare triple {3405#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3441#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:05,038 INFO L273 TraceCheckUtils]: 6: Hoare triple {3441#(<= 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; {3408#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:05,039 INFO L273 TraceCheckUtils]: 7: Hoare triple {3408#(<= 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; {3409#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:05,039 INFO L273 TraceCheckUtils]: 8: Hoare triple {3409#(<= 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; {3410#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:05,040 INFO L273 TraceCheckUtils]: 9: Hoare triple {3410#(<= 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; {3411#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:05,040 INFO L273 TraceCheckUtils]: 10: Hoare triple {3411#(<= 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; {3412#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:05,041 INFO L273 TraceCheckUtils]: 11: Hoare triple {3412#(<= 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; {3413#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:05,042 INFO L273 TraceCheckUtils]: 12: Hoare triple {3413#(<= 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; {3414#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:05,043 INFO L273 TraceCheckUtils]: 13: Hoare triple {3414#(<= 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; {3415#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:05,044 INFO L273 TraceCheckUtils]: 14: Hoare triple {3415#(<= 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; {3416#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:05,045 INFO L273 TraceCheckUtils]: 15: Hoare triple {3416#(<= 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; {3417#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:05,046 INFO L273 TraceCheckUtils]: 16: Hoare triple {3417#(<= 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; {3418#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:05,047 INFO L273 TraceCheckUtils]: 17: Hoare triple {3418#(<= 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; {3419#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:05,048 INFO L273 TraceCheckUtils]: 18: Hoare triple {3419#(<= 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; {3420#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:05,049 INFO L273 TraceCheckUtils]: 19: Hoare triple {3420#(<= 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; {3421#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:05,050 INFO L273 TraceCheckUtils]: 20: Hoare triple {3421#(<= 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; {3422#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:05,050 INFO L273 TraceCheckUtils]: 21: Hoare triple {3422#(<= main_~i~0 15)} assume !(~i~0 < 100000); {3406#false} is VALID [2018-11-23 11:55:05,051 INFO L273 TraceCheckUtils]: 22: Hoare triple {3406#false} havoc ~x~0;~x~0 := 0; {3406#false} is VALID [2018-11-23 11:55:05,051 INFO L273 TraceCheckUtils]: 23: Hoare triple {3406#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3406#false} is VALID [2018-11-23 11:55:05,051 INFO L256 TraceCheckUtils]: 24: Hoare triple {3406#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {3406#false} is VALID [2018-11-23 11:55:05,051 INFO L273 TraceCheckUtils]: 25: Hoare triple {3406#false} ~cond := #in~cond; {3406#false} is VALID [2018-11-23 11:55:05,051 INFO L273 TraceCheckUtils]: 26: Hoare triple {3406#false} assume 0 == ~cond; {3406#false} is VALID [2018-11-23 11:55:05,052 INFO L273 TraceCheckUtils]: 27: Hoare triple {3406#false} assume !false; {3406#false} is VALID [2018-11-23 11:55:05,053 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:05,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:05,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-23 11:55:05,073 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 28 [2018-11-23 11:55:05,073 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:05,073 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 11:55:05,123 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:05,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 11:55:05,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 11:55:05,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 11:55:05,124 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 19 states. [2018-11-23 11:55:05,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:05,600 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-11-23 11:55:05,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 11:55:05,600 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 28 [2018-11-23 11:55:05,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:05,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:55:05,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 47 transitions. [2018-11-23 11:55:05,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:55:05,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 47 transitions. [2018-11-23 11:55:05,603 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 47 transitions. [2018-11-23 11:55:05,641 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:05,642 INFO L225 Difference]: With dead ends: 45 [2018-11-23 11:55:05,642 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 11:55:05,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 11:55:05,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 11:55:05,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-23 11:55:05,675 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:05,675 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 34 states. [2018-11-23 11:55:05,675 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-23 11:55:05,675 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-23 11:55:05,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:05,676 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-11-23 11:55:05,676 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-11-23 11:55:05,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:05,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:05,676 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-23 11:55:05,676 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-23 11:55:05,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:05,677 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-11-23 11:55:05,677 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-11-23 11:55:05,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:05,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:05,678 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:05,678 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:05,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 11:55:05,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-11-23 11:55:05,679 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 28 [2018-11-23 11:55:05,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:05,679 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-11-23 11:55:05,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 11:55:05,679 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-11-23 11:55:05,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 11:55:05,679 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:05,679 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:05,680 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:05,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:05,680 INFO L82 PathProgramCache]: Analyzing trace with hash -2045026382, now seen corresponding path program 16 times [2018-11-23 11:55:05,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:05,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:05,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:05,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:05,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:05,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:05,960 INFO L256 TraceCheckUtils]: 0: Hoare triple {3705#true} call ULTIMATE.init(); {3705#true} is VALID [2018-11-23 11:55:05,961 INFO L273 TraceCheckUtils]: 1: Hoare triple {3705#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3705#true} is VALID [2018-11-23 11:55:05,961 INFO L273 TraceCheckUtils]: 2: Hoare triple {3705#true} assume true; {3705#true} is VALID [2018-11-23 11:55:05,961 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3705#true} {3705#true} #48#return; {3705#true} is VALID [2018-11-23 11:55:05,961 INFO L256 TraceCheckUtils]: 4: Hoare triple {3705#true} call #t~ret2 := main(); {3705#true} is VALID [2018-11-23 11:55:05,981 INFO L273 TraceCheckUtils]: 5: Hoare triple {3705#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3707#(= main_~i~0 0)} is VALID [2018-11-23 11:55:05,986 INFO L273 TraceCheckUtils]: 6: Hoare triple {3707#(= 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; {3708#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:05,987 INFO L273 TraceCheckUtils]: 7: Hoare triple {3708#(<= 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; {3709#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:05,988 INFO L273 TraceCheckUtils]: 8: Hoare triple {3709#(<= 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; {3710#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:05,988 INFO L273 TraceCheckUtils]: 9: Hoare triple {3710#(<= 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; {3711#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:05,989 INFO L273 TraceCheckUtils]: 10: Hoare triple {3711#(<= 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; {3712#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:05,989 INFO L273 TraceCheckUtils]: 11: Hoare triple {3712#(<= 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; {3713#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:05,990 INFO L273 TraceCheckUtils]: 12: Hoare triple {3713#(<= 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; {3714#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:05,991 INFO L273 TraceCheckUtils]: 13: Hoare triple {3714#(<= 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; {3715#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:05,992 INFO L273 TraceCheckUtils]: 14: Hoare triple {3715#(<= 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; {3716#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:05,993 INFO L273 TraceCheckUtils]: 15: Hoare triple {3716#(<= 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; {3717#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:05,994 INFO L273 TraceCheckUtils]: 16: Hoare triple {3717#(<= 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; {3718#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:05,995 INFO L273 TraceCheckUtils]: 17: Hoare triple {3718#(<= 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; {3719#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:05,996 INFO L273 TraceCheckUtils]: 18: Hoare triple {3719#(<= 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; {3720#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:05,997 INFO L273 TraceCheckUtils]: 19: Hoare triple {3720#(<= 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; {3721#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:05,998 INFO L273 TraceCheckUtils]: 20: Hoare triple {3721#(<= 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; {3722#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:05,999 INFO L273 TraceCheckUtils]: 21: Hoare triple {3722#(<= 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; {3723#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:05,999 INFO L273 TraceCheckUtils]: 22: Hoare triple {3723#(<= main_~i~0 16)} assume !(~i~0 < 100000); {3706#false} is VALID [2018-11-23 11:55:05,999 INFO L273 TraceCheckUtils]: 23: Hoare triple {3706#false} havoc ~x~0;~x~0 := 0; {3706#false} is VALID [2018-11-23 11:55:06,000 INFO L273 TraceCheckUtils]: 24: Hoare triple {3706#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3706#false} is VALID [2018-11-23 11:55:06,000 INFO L256 TraceCheckUtils]: 25: Hoare triple {3706#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {3706#false} is VALID [2018-11-23 11:55:06,000 INFO L273 TraceCheckUtils]: 26: Hoare triple {3706#false} ~cond := #in~cond; {3706#false} is VALID [2018-11-23 11:55:06,000 INFO L273 TraceCheckUtils]: 27: Hoare triple {3706#false} assume 0 == ~cond; {3706#false} is VALID [2018-11-23 11:55:06,001 INFO L273 TraceCheckUtils]: 28: Hoare triple {3706#false} assume !false; {3706#false} is VALID [2018-11-23 11:55:06,002 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:06,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:06,002 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:06,011 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:55:06,028 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:55:06,028 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:06,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:06,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:06,204 INFO L256 TraceCheckUtils]: 0: Hoare triple {3705#true} call ULTIMATE.init(); {3705#true} is VALID [2018-11-23 11:55:06,205 INFO L273 TraceCheckUtils]: 1: Hoare triple {3705#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3705#true} is VALID [2018-11-23 11:55:06,205 INFO L273 TraceCheckUtils]: 2: Hoare triple {3705#true} assume true; {3705#true} is VALID [2018-11-23 11:55:06,205 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3705#true} {3705#true} #48#return; {3705#true} is VALID [2018-11-23 11:55:06,205 INFO L256 TraceCheckUtils]: 4: Hoare triple {3705#true} call #t~ret2 := main(); {3705#true} is VALID [2018-11-23 11:55:06,206 INFO L273 TraceCheckUtils]: 5: Hoare triple {3705#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3742#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:06,206 INFO L273 TraceCheckUtils]: 6: Hoare triple {3742#(<= 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; {3708#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:06,207 INFO L273 TraceCheckUtils]: 7: Hoare triple {3708#(<= 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; {3709#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:06,207 INFO L273 TraceCheckUtils]: 8: Hoare triple {3709#(<= 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; {3710#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:06,208 INFO L273 TraceCheckUtils]: 9: Hoare triple {3710#(<= 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; {3711#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:06,209 INFO L273 TraceCheckUtils]: 10: Hoare triple {3711#(<= 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; {3712#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:06,209 INFO L273 TraceCheckUtils]: 11: Hoare triple {3712#(<= 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; {3713#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:06,210 INFO L273 TraceCheckUtils]: 12: Hoare triple {3713#(<= 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; {3714#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:06,211 INFO L273 TraceCheckUtils]: 13: Hoare triple {3714#(<= 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; {3715#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:06,212 INFO L273 TraceCheckUtils]: 14: Hoare triple {3715#(<= 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; {3716#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:06,213 INFO L273 TraceCheckUtils]: 15: Hoare triple {3716#(<= 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; {3717#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:06,214 INFO L273 TraceCheckUtils]: 16: Hoare triple {3717#(<= 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; {3718#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:06,215 INFO L273 TraceCheckUtils]: 17: Hoare triple {3718#(<= 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; {3719#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:06,216 INFO L273 TraceCheckUtils]: 18: Hoare triple {3719#(<= 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; {3720#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:06,217 INFO L273 TraceCheckUtils]: 19: Hoare triple {3720#(<= 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; {3721#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:06,218 INFO L273 TraceCheckUtils]: 20: Hoare triple {3721#(<= 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; {3722#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:06,219 INFO L273 TraceCheckUtils]: 21: Hoare triple {3722#(<= 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; {3723#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:06,220 INFO L273 TraceCheckUtils]: 22: Hoare triple {3723#(<= main_~i~0 16)} assume !(~i~0 < 100000); {3706#false} is VALID [2018-11-23 11:55:06,220 INFO L273 TraceCheckUtils]: 23: Hoare triple {3706#false} havoc ~x~0;~x~0 := 0; {3706#false} is VALID [2018-11-23 11:55:06,220 INFO L273 TraceCheckUtils]: 24: Hoare triple {3706#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3706#false} is VALID [2018-11-23 11:55:06,220 INFO L256 TraceCheckUtils]: 25: Hoare triple {3706#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {3706#false} is VALID [2018-11-23 11:55:06,221 INFO L273 TraceCheckUtils]: 26: Hoare triple {3706#false} ~cond := #in~cond; {3706#false} is VALID [2018-11-23 11:55:06,221 INFO L273 TraceCheckUtils]: 27: Hoare triple {3706#false} assume 0 == ~cond; {3706#false} is VALID [2018-11-23 11:55:06,221 INFO L273 TraceCheckUtils]: 28: Hoare triple {3706#false} assume !false; {3706#false} is VALID [2018-11-23 11:55:06,222 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:06,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:06,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-23 11:55:06,242 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 29 [2018-11-23 11:55:06,242 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:06,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 11:55:06,264 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,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 11:55:06,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 11:55:06,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:55:06,265 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 20 states. [2018-11-23 11:55:06,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:06,465 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2018-11-23 11:55:06,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 11:55:06,466 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 29 [2018-11-23 11:55:06,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:06,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:55:06,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 48 transitions. [2018-11-23 11:55:06,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:55:06,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 48 transitions. [2018-11-23 11:55:06,469 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 48 transitions. [2018-11-23 11:55:06,868 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:55:06,869 INFO L225 Difference]: With dead ends: 46 [2018-11-23 11:55:06,869 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 11:55:06,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:55:06,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 11:55:06,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-23 11:55:06,889 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:06,890 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2018-11-23 11:55:06,890 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-23 11:55:06,890 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-23 11:55:06,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:06,891 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2018-11-23 11:55:06,891 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-11-23 11:55:06,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:06,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:06,892 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-23 11:55:06,892 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-23 11:55:06,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:06,892 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2018-11-23 11:55:06,893 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-11-23 11:55:06,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:06,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:06,893 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:06,893 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:06,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 11:55:06,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-11-23 11:55:06,894 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 29 [2018-11-23 11:55:06,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:06,894 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-11-23 11:55:06,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 11:55:06,894 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-11-23 11:55:06,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 11:55:06,895 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:06,895 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:06,895 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:06,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:06,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1062387090, now seen corresponding path program 17 times [2018-11-23 11:55:06,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:06,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:06,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:06,897 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:06,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:06,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:07,301 INFO L256 TraceCheckUtils]: 0: Hoare triple {4015#true} call ULTIMATE.init(); {4015#true} is VALID [2018-11-23 11:55:07,301 INFO L273 TraceCheckUtils]: 1: Hoare triple {4015#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4015#true} is VALID [2018-11-23 11:55:07,301 INFO L273 TraceCheckUtils]: 2: Hoare triple {4015#true} assume true; {4015#true} is VALID [2018-11-23 11:55:07,301 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4015#true} {4015#true} #48#return; {4015#true} is VALID [2018-11-23 11:55:07,302 INFO L256 TraceCheckUtils]: 4: Hoare triple {4015#true} call #t~ret2 := main(); {4015#true} is VALID [2018-11-23 11:55:07,303 INFO L273 TraceCheckUtils]: 5: Hoare triple {4015#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4017#(= main_~i~0 0)} is VALID [2018-11-23 11:55:07,303 INFO L273 TraceCheckUtils]: 6: Hoare triple {4017#(= 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; {4018#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:07,305 INFO L273 TraceCheckUtils]: 7: Hoare triple {4018#(<= 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; {4019#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:07,306 INFO L273 TraceCheckUtils]: 8: Hoare triple {4019#(<= 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; {4020#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:07,307 INFO L273 TraceCheckUtils]: 9: Hoare triple {4020#(<= 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; {4021#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:07,308 INFO L273 TraceCheckUtils]: 10: Hoare triple {4021#(<= 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; {4022#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:07,309 INFO L273 TraceCheckUtils]: 11: Hoare triple {4022#(<= 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; {4023#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:07,310 INFO L273 TraceCheckUtils]: 12: Hoare triple {4023#(<= 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; {4024#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:07,311 INFO L273 TraceCheckUtils]: 13: Hoare triple {4024#(<= 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; {4025#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:07,313 INFO L273 TraceCheckUtils]: 14: Hoare triple {4025#(<= 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; {4026#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:07,314 INFO L273 TraceCheckUtils]: 15: Hoare triple {4026#(<= 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; {4027#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:07,315 INFO L273 TraceCheckUtils]: 16: Hoare triple {4027#(<= 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; {4028#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:07,317 INFO L273 TraceCheckUtils]: 17: Hoare triple {4028#(<= 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; {4029#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:07,319 INFO L273 TraceCheckUtils]: 18: Hoare triple {4029#(<= 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; {4030#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:07,319 INFO L273 TraceCheckUtils]: 19: Hoare triple {4030#(<= 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; {4031#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:07,321 INFO L273 TraceCheckUtils]: 20: Hoare triple {4031#(<= 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; {4032#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:07,321 INFO L273 TraceCheckUtils]: 21: Hoare triple {4032#(<= 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; {4033#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:07,322 INFO L273 TraceCheckUtils]: 22: Hoare triple {4033#(<= 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; {4034#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:07,322 INFO L273 TraceCheckUtils]: 23: Hoare triple {4034#(<= main_~i~0 17)} assume !(~i~0 < 100000); {4016#false} is VALID [2018-11-23 11:55:07,322 INFO L273 TraceCheckUtils]: 24: Hoare triple {4016#false} havoc ~x~0;~x~0 := 0; {4016#false} is VALID [2018-11-23 11:55:07,322 INFO L273 TraceCheckUtils]: 25: Hoare triple {4016#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4016#false} is VALID [2018-11-23 11:55:07,323 INFO L256 TraceCheckUtils]: 26: Hoare triple {4016#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {4016#false} is VALID [2018-11-23 11:55:07,323 INFO L273 TraceCheckUtils]: 27: Hoare triple {4016#false} ~cond := #in~cond; {4016#false} is VALID [2018-11-23 11:55:07,323 INFO L273 TraceCheckUtils]: 28: Hoare triple {4016#false} assume 0 == ~cond; {4016#false} is VALID [2018-11-23 11:55:07,323 INFO L273 TraceCheckUtils]: 29: Hoare triple {4016#false} assume !false; {4016#false} is VALID [2018-11-23 11:55:07,324 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:07,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:07,324 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:07,335 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:55:07,421 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-11-23 11:55:07,421 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:07,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:07,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:07,722 INFO L256 TraceCheckUtils]: 0: Hoare triple {4015#true} call ULTIMATE.init(); {4015#true} is VALID [2018-11-23 11:55:07,722 INFO L273 TraceCheckUtils]: 1: Hoare triple {4015#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4015#true} is VALID [2018-11-23 11:55:07,723 INFO L273 TraceCheckUtils]: 2: Hoare triple {4015#true} assume true; {4015#true} is VALID [2018-11-23 11:55:07,723 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4015#true} {4015#true} #48#return; {4015#true} is VALID [2018-11-23 11:55:07,723 INFO L256 TraceCheckUtils]: 4: Hoare triple {4015#true} call #t~ret2 := main(); {4015#true} is VALID [2018-11-23 11:55:07,724 INFO L273 TraceCheckUtils]: 5: Hoare triple {4015#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4053#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:07,724 INFO L273 TraceCheckUtils]: 6: Hoare triple {4053#(<= 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; {4018#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:07,725 INFO L273 TraceCheckUtils]: 7: Hoare triple {4018#(<= 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; {4019#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:07,726 INFO L273 TraceCheckUtils]: 8: Hoare triple {4019#(<= 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; {4020#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:07,727 INFO L273 TraceCheckUtils]: 9: Hoare triple {4020#(<= 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; {4021#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:07,728 INFO L273 TraceCheckUtils]: 10: Hoare triple {4021#(<= 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; {4022#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:07,728 INFO L273 TraceCheckUtils]: 11: Hoare triple {4022#(<= 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; {4023#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:07,729 INFO L273 TraceCheckUtils]: 12: Hoare triple {4023#(<= 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; {4024#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:07,730 INFO L273 TraceCheckUtils]: 13: Hoare triple {4024#(<= 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; {4025#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:07,731 INFO L273 TraceCheckUtils]: 14: Hoare triple {4025#(<= 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; {4026#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:07,732 INFO L273 TraceCheckUtils]: 15: Hoare triple {4026#(<= 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; {4027#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:07,733 INFO L273 TraceCheckUtils]: 16: Hoare triple {4027#(<= 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; {4028#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:07,734 INFO L273 TraceCheckUtils]: 17: Hoare triple {4028#(<= 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; {4029#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:07,735 INFO L273 TraceCheckUtils]: 18: Hoare triple {4029#(<= 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; {4030#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:07,736 INFO L273 TraceCheckUtils]: 19: Hoare triple {4030#(<= 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; {4031#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:07,737 INFO L273 TraceCheckUtils]: 20: Hoare triple {4031#(<= 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; {4032#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:07,738 INFO L273 TraceCheckUtils]: 21: Hoare triple {4032#(<= 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; {4033#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:07,739 INFO L273 TraceCheckUtils]: 22: Hoare triple {4033#(<= 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; {4034#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:07,740 INFO L273 TraceCheckUtils]: 23: Hoare triple {4034#(<= main_~i~0 17)} assume !(~i~0 < 100000); {4016#false} is VALID [2018-11-23 11:55:07,740 INFO L273 TraceCheckUtils]: 24: Hoare triple {4016#false} havoc ~x~0;~x~0 := 0; {4016#false} is VALID [2018-11-23 11:55:07,740 INFO L273 TraceCheckUtils]: 25: Hoare triple {4016#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4016#false} is VALID [2018-11-23 11:55:07,740 INFO L256 TraceCheckUtils]: 26: Hoare triple {4016#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {4016#false} is VALID [2018-11-23 11:55:07,740 INFO L273 TraceCheckUtils]: 27: Hoare triple {4016#false} ~cond := #in~cond; {4016#false} is VALID [2018-11-23 11:55:07,741 INFO L273 TraceCheckUtils]: 28: Hoare triple {4016#false} assume 0 == ~cond; {4016#false} is VALID [2018-11-23 11:55:07,741 INFO L273 TraceCheckUtils]: 29: Hoare triple {4016#false} assume !false; {4016#false} is VALID [2018-11-23 11:55:07,742 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:07,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:07,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-23 11:55:07,763 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 30 [2018-11-23 11:55:07,763 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:07,764 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 11:55:07,788 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,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 11:55:07,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 11:55:07,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 11:55:07,790 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 21 states. [2018-11-23 11:55:07,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:07,904 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2018-11-23 11:55:07,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 11:55:07,905 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 30 [2018-11-23 11:55:07,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:07,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:55:07,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 49 transitions. [2018-11-23 11:55:07,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:55:07,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 49 transitions. [2018-11-23 11:55:07,908 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 49 transitions. [2018-11-23 11:55:08,419 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:08,420 INFO L225 Difference]: With dead ends: 47 [2018-11-23 11:55:08,420 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 11:55:08,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 11:55:08,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 11:55:08,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-23 11:55:08,450 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:08,450 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 36 states. [2018-11-23 11:55:08,450 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2018-11-23 11:55:08,450 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2018-11-23 11:55:08,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:08,452 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2018-11-23 11:55:08,452 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-11-23 11:55:08,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:08,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:08,453 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2018-11-23 11:55:08,453 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2018-11-23 11:55:08,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:08,453 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2018-11-23 11:55:08,454 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-11-23 11:55:08,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:08,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:08,454 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:08,454 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:08,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 11:55:08,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-11-23 11:55:08,455 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 30 [2018-11-23 11:55:08,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:08,455 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-11-23 11:55:08,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 11:55:08,455 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-11-23 11:55:08,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 11:55:08,456 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:08,456 INFO L402 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:08,456 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:08,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:08,456 INFO L82 PathProgramCache]: Analyzing trace with hash -665340110, now seen corresponding path program 18 times [2018-11-23 11:55:08,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:08,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:08,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:08,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:08,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:08,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:08,779 INFO L256 TraceCheckUtils]: 0: Hoare triple {4335#true} call ULTIMATE.init(); {4335#true} is VALID [2018-11-23 11:55:08,779 INFO L273 TraceCheckUtils]: 1: Hoare triple {4335#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4335#true} is VALID [2018-11-23 11:55:08,780 INFO L273 TraceCheckUtils]: 2: Hoare triple {4335#true} assume true; {4335#true} is VALID [2018-11-23 11:55:08,780 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4335#true} {4335#true} #48#return; {4335#true} is VALID [2018-11-23 11:55:08,780 INFO L256 TraceCheckUtils]: 4: Hoare triple {4335#true} call #t~ret2 := main(); {4335#true} is VALID [2018-11-23 11:55:08,797 INFO L273 TraceCheckUtils]: 5: Hoare triple {4335#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4337#(= main_~i~0 0)} is VALID [2018-11-23 11:55:08,812 INFO L273 TraceCheckUtils]: 6: Hoare triple {4337#(= 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; {4338#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:08,826 INFO L273 TraceCheckUtils]: 7: Hoare triple {4338#(<= 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; {4339#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:08,843 INFO L273 TraceCheckUtils]: 8: Hoare triple {4339#(<= 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; {4340#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:08,858 INFO L273 TraceCheckUtils]: 9: Hoare triple {4340#(<= 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; {4341#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:08,873 INFO L273 TraceCheckUtils]: 10: Hoare triple {4341#(<= 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; {4342#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:08,888 INFO L273 TraceCheckUtils]: 11: Hoare triple {4342#(<= 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; {4343#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:08,890 INFO L273 TraceCheckUtils]: 12: Hoare triple {4343#(<= 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; {4344#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:08,892 INFO L273 TraceCheckUtils]: 13: Hoare triple {4344#(<= 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; {4345#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:08,892 INFO L273 TraceCheckUtils]: 14: Hoare triple {4345#(<= 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; {4346#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:08,894 INFO L273 TraceCheckUtils]: 15: Hoare triple {4346#(<= 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; {4347#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:08,894 INFO L273 TraceCheckUtils]: 16: Hoare triple {4347#(<= 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; {4348#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:08,895 INFO L273 TraceCheckUtils]: 17: Hoare triple {4348#(<= 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; {4349#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:08,896 INFO L273 TraceCheckUtils]: 18: Hoare triple {4349#(<= 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; {4350#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:08,897 INFO L273 TraceCheckUtils]: 19: Hoare triple {4350#(<= 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; {4351#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:08,898 INFO L273 TraceCheckUtils]: 20: Hoare triple {4351#(<= 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; {4352#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:08,899 INFO L273 TraceCheckUtils]: 21: Hoare triple {4352#(<= 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; {4353#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:08,899 INFO L273 TraceCheckUtils]: 22: Hoare triple {4353#(<= 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; {4354#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:08,900 INFO L273 TraceCheckUtils]: 23: Hoare triple {4354#(<= 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; {4355#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:08,901 INFO L273 TraceCheckUtils]: 24: Hoare triple {4355#(<= main_~i~0 18)} assume !(~i~0 < 100000); {4336#false} is VALID [2018-11-23 11:55:08,901 INFO L273 TraceCheckUtils]: 25: Hoare triple {4336#false} havoc ~x~0;~x~0 := 0; {4336#false} is VALID [2018-11-23 11:55:08,901 INFO L273 TraceCheckUtils]: 26: Hoare triple {4336#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4336#false} is VALID [2018-11-23 11:55:08,902 INFO L256 TraceCheckUtils]: 27: Hoare triple {4336#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {4336#false} is VALID [2018-11-23 11:55:08,902 INFO L273 TraceCheckUtils]: 28: Hoare triple {4336#false} ~cond := #in~cond; {4336#false} is VALID [2018-11-23 11:55:08,902 INFO L273 TraceCheckUtils]: 29: Hoare triple {4336#false} assume 0 == ~cond; {4336#false} is VALID [2018-11-23 11:55:08,902 INFO L273 TraceCheckUtils]: 30: Hoare triple {4336#false} assume !false; {4336#false} is VALID [2018-11-23 11:55:08,903 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:08,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:08,904 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:08,913 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:55:09,062 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-11-23 11:55:09,063 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:09,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:09,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:09,386 INFO L256 TraceCheckUtils]: 0: Hoare triple {4335#true} call ULTIMATE.init(); {4335#true} is VALID [2018-11-23 11:55:09,386 INFO L273 TraceCheckUtils]: 1: Hoare triple {4335#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4335#true} is VALID [2018-11-23 11:55:09,386 INFO L273 TraceCheckUtils]: 2: Hoare triple {4335#true} assume true; {4335#true} is VALID [2018-11-23 11:55:09,386 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4335#true} {4335#true} #48#return; {4335#true} is VALID [2018-11-23 11:55:09,386 INFO L256 TraceCheckUtils]: 4: Hoare triple {4335#true} call #t~ret2 := main(); {4335#true} is VALID [2018-11-23 11:55:09,387 INFO L273 TraceCheckUtils]: 5: Hoare triple {4335#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4374#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:09,387 INFO L273 TraceCheckUtils]: 6: Hoare triple {4374#(<= 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; {4338#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:09,388 INFO L273 TraceCheckUtils]: 7: Hoare triple {4338#(<= 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; {4339#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:09,389 INFO L273 TraceCheckUtils]: 8: Hoare triple {4339#(<= 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; {4340#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:09,389 INFO L273 TraceCheckUtils]: 9: Hoare triple {4340#(<= 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; {4341#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:09,390 INFO L273 TraceCheckUtils]: 10: Hoare triple {4341#(<= 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; {4342#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:09,391 INFO L273 TraceCheckUtils]: 11: Hoare triple {4342#(<= 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; {4343#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:09,391 INFO L273 TraceCheckUtils]: 12: Hoare triple {4343#(<= 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; {4344#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:09,392 INFO L273 TraceCheckUtils]: 13: Hoare triple {4344#(<= 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; {4345#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:09,393 INFO L273 TraceCheckUtils]: 14: Hoare triple {4345#(<= 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; {4346#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:09,394 INFO L273 TraceCheckUtils]: 15: Hoare triple {4346#(<= 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; {4347#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:09,395 INFO L273 TraceCheckUtils]: 16: Hoare triple {4347#(<= 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; {4348#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:09,396 INFO L273 TraceCheckUtils]: 17: Hoare triple {4348#(<= 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; {4349#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:09,397 INFO L273 TraceCheckUtils]: 18: Hoare triple {4349#(<= 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; {4350#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:09,398 INFO L273 TraceCheckUtils]: 19: Hoare triple {4350#(<= 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; {4351#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:09,399 INFO L273 TraceCheckUtils]: 20: Hoare triple {4351#(<= 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; {4352#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:09,399 INFO L273 TraceCheckUtils]: 21: Hoare triple {4352#(<= 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; {4353#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:09,400 INFO L273 TraceCheckUtils]: 22: Hoare triple {4353#(<= 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; {4354#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:09,401 INFO L273 TraceCheckUtils]: 23: Hoare triple {4354#(<= 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; {4355#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:09,402 INFO L273 TraceCheckUtils]: 24: Hoare triple {4355#(<= main_~i~0 18)} assume !(~i~0 < 100000); {4336#false} is VALID [2018-11-23 11:55:09,402 INFO L273 TraceCheckUtils]: 25: Hoare triple {4336#false} havoc ~x~0;~x~0 := 0; {4336#false} is VALID [2018-11-23 11:55:09,402 INFO L273 TraceCheckUtils]: 26: Hoare triple {4336#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4336#false} is VALID [2018-11-23 11:55:09,403 INFO L256 TraceCheckUtils]: 27: Hoare triple {4336#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {4336#false} is VALID [2018-11-23 11:55:09,403 INFO L273 TraceCheckUtils]: 28: Hoare triple {4336#false} ~cond := #in~cond; {4336#false} is VALID [2018-11-23 11:55:09,403 INFO L273 TraceCheckUtils]: 29: Hoare triple {4336#false} assume 0 == ~cond; {4336#false} is VALID [2018-11-23 11:55:09,403 INFO L273 TraceCheckUtils]: 30: Hoare triple {4336#false} assume !false; {4336#false} is VALID [2018-11-23 11:55:09,405 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:09,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:09,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-11-23 11:55:09,427 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 31 [2018-11-23 11:55:09,427 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:09,427 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 11:55:09,453 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:09,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 11:55:09,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 11:55:09,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 11:55:09,454 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 22 states. [2018-11-23 11:55:09,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:09,622 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-11-23 11:55:09,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 11:55:09,623 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 31 [2018-11-23 11:55:09,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:09,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:55:09,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 50 transitions. [2018-11-23 11:55:09,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:55:09,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 50 transitions. [2018-11-23 11:55:09,626 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 50 transitions. [2018-11-23 11:55:10,009 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:55:10,011 INFO L225 Difference]: With dead ends: 48 [2018-11-23 11:55:10,011 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 11:55:10,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 11:55:10,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 11:55:10,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-23 11:55:10,029 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:10,029 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2018-11-23 11:55:10,030 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-23 11:55:10,030 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-23 11:55:10,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:10,031 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-11-23 11:55:10,031 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-11-23 11:55:10,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:10,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:10,031 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-23 11:55:10,032 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-23 11:55:10,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:10,033 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-11-23 11:55:10,033 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-11-23 11:55:10,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:10,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:10,033 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:10,033 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:10,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 11:55:10,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-11-23 11:55:10,034 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 31 [2018-11-23 11:55:10,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:10,035 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-11-23 11:55:10,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 11:55:10,035 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-11-23 11:55:10,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 11:55:10,035 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:10,036 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:10,036 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:10,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:10,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1241785618, now seen corresponding path program 19 times [2018-11-23 11:55:10,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:10,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:10,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:10,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:10,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:10,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:11,001 INFO L256 TraceCheckUtils]: 0: Hoare triple {4665#true} call ULTIMATE.init(); {4665#true} is VALID [2018-11-23 11:55:11,001 INFO L273 TraceCheckUtils]: 1: Hoare triple {4665#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4665#true} is VALID [2018-11-23 11:55:11,002 INFO L273 TraceCheckUtils]: 2: Hoare triple {4665#true} assume true; {4665#true} is VALID [2018-11-23 11:55:11,002 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4665#true} {4665#true} #48#return; {4665#true} is VALID [2018-11-23 11:55:11,002 INFO L256 TraceCheckUtils]: 4: Hoare triple {4665#true} call #t~ret2 := main(); {4665#true} is VALID [2018-11-23 11:55:11,003 INFO L273 TraceCheckUtils]: 5: Hoare triple {4665#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4667#(= main_~i~0 0)} is VALID [2018-11-23 11:55:11,003 INFO L273 TraceCheckUtils]: 6: Hoare triple {4667#(= 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; {4668#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:11,004 INFO L273 TraceCheckUtils]: 7: Hoare triple {4668#(<= 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; {4669#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:11,005 INFO L273 TraceCheckUtils]: 8: Hoare triple {4669#(<= 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; {4670#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:11,006 INFO L273 TraceCheckUtils]: 9: Hoare triple {4670#(<= 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; {4671#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:11,007 INFO L273 TraceCheckUtils]: 10: Hoare triple {4671#(<= 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; {4672#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:11,008 INFO L273 TraceCheckUtils]: 11: Hoare triple {4672#(<= 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; {4673#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:11,009 INFO L273 TraceCheckUtils]: 12: Hoare triple {4673#(<= 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; {4674#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:11,010 INFO L273 TraceCheckUtils]: 13: Hoare triple {4674#(<= 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; {4675#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:11,011 INFO L273 TraceCheckUtils]: 14: Hoare triple {4675#(<= 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; {4676#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:11,011 INFO L273 TraceCheckUtils]: 15: Hoare triple {4676#(<= 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; {4677#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:11,012 INFO L273 TraceCheckUtils]: 16: Hoare triple {4677#(<= 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; {4678#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:11,013 INFO L273 TraceCheckUtils]: 17: Hoare triple {4678#(<= 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; {4679#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:11,014 INFO L273 TraceCheckUtils]: 18: Hoare triple {4679#(<= 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; {4680#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:11,015 INFO L273 TraceCheckUtils]: 19: Hoare triple {4680#(<= 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; {4681#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:11,016 INFO L273 TraceCheckUtils]: 20: Hoare triple {4681#(<= 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; {4682#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:11,017 INFO L273 TraceCheckUtils]: 21: Hoare triple {4682#(<= 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; {4683#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:11,018 INFO L273 TraceCheckUtils]: 22: Hoare triple {4683#(<= 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; {4684#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:11,018 INFO L273 TraceCheckUtils]: 23: Hoare triple {4684#(<= 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; {4685#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:11,019 INFO L273 TraceCheckUtils]: 24: Hoare triple {4685#(<= 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; {4686#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:11,020 INFO L273 TraceCheckUtils]: 25: Hoare triple {4686#(<= main_~i~0 19)} assume !(~i~0 < 100000); {4666#false} is VALID [2018-11-23 11:55:11,020 INFO L273 TraceCheckUtils]: 26: Hoare triple {4666#false} havoc ~x~0;~x~0 := 0; {4666#false} is VALID [2018-11-23 11:55:11,020 INFO L273 TraceCheckUtils]: 27: Hoare triple {4666#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4666#false} is VALID [2018-11-23 11:55:11,021 INFO L256 TraceCheckUtils]: 28: Hoare triple {4666#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {4666#false} is VALID [2018-11-23 11:55:11,021 INFO L273 TraceCheckUtils]: 29: Hoare triple {4666#false} ~cond := #in~cond; {4666#false} is VALID [2018-11-23 11:55:11,021 INFO L273 TraceCheckUtils]: 30: Hoare triple {4666#false} assume 0 == ~cond; {4666#false} is VALID [2018-11-23 11:55:11,021 INFO L273 TraceCheckUtils]: 31: Hoare triple {4666#false} assume !false; {4666#false} is VALID [2018-11-23 11:55:11,023 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:11,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:11,023 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:11,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:11,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:11,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:11,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:11,245 INFO L256 TraceCheckUtils]: 0: Hoare triple {4665#true} call ULTIMATE.init(); {4665#true} is VALID [2018-11-23 11:55:11,245 INFO L273 TraceCheckUtils]: 1: Hoare triple {4665#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4665#true} is VALID [2018-11-23 11:55:11,246 INFO L273 TraceCheckUtils]: 2: Hoare triple {4665#true} assume true; {4665#true} is VALID [2018-11-23 11:55:11,246 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4665#true} {4665#true} #48#return; {4665#true} is VALID [2018-11-23 11:55:11,246 INFO L256 TraceCheckUtils]: 4: Hoare triple {4665#true} call #t~ret2 := main(); {4665#true} is VALID [2018-11-23 11:55:11,246 INFO L273 TraceCheckUtils]: 5: Hoare triple {4665#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4705#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:11,247 INFO L273 TraceCheckUtils]: 6: Hoare triple {4705#(<= 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; {4668#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:11,248 INFO L273 TraceCheckUtils]: 7: Hoare triple {4668#(<= 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; {4669#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:11,249 INFO L273 TraceCheckUtils]: 8: Hoare triple {4669#(<= 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; {4670#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:11,250 INFO L273 TraceCheckUtils]: 9: Hoare triple {4670#(<= 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; {4671#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:11,251 INFO L273 TraceCheckUtils]: 10: Hoare triple {4671#(<= 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; {4672#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:11,252 INFO L273 TraceCheckUtils]: 11: Hoare triple {4672#(<= 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; {4673#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:11,253 INFO L273 TraceCheckUtils]: 12: Hoare triple {4673#(<= 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; {4674#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:11,254 INFO L273 TraceCheckUtils]: 13: Hoare triple {4674#(<= 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; {4675#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:11,255 INFO L273 TraceCheckUtils]: 14: Hoare triple {4675#(<= 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; {4676#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:11,256 INFO L273 TraceCheckUtils]: 15: Hoare triple {4676#(<= 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; {4677#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:11,257 INFO L273 TraceCheckUtils]: 16: Hoare triple {4677#(<= 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; {4678#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:11,258 INFO L273 TraceCheckUtils]: 17: Hoare triple {4678#(<= 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; {4679#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:11,258 INFO L273 TraceCheckUtils]: 18: Hoare triple {4679#(<= 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; {4680#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:11,259 INFO L273 TraceCheckUtils]: 19: Hoare triple {4680#(<= 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; {4681#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:11,260 INFO L273 TraceCheckUtils]: 20: Hoare triple {4681#(<= 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; {4682#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:11,261 INFO L273 TraceCheckUtils]: 21: Hoare triple {4682#(<= 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; {4683#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:11,262 INFO L273 TraceCheckUtils]: 22: Hoare triple {4683#(<= 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; {4684#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:11,263 INFO L273 TraceCheckUtils]: 23: Hoare triple {4684#(<= 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; {4685#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:11,264 INFO L273 TraceCheckUtils]: 24: Hoare triple {4685#(<= 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; {4686#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:11,265 INFO L273 TraceCheckUtils]: 25: Hoare triple {4686#(<= main_~i~0 19)} assume !(~i~0 < 100000); {4666#false} is VALID [2018-11-23 11:55:11,265 INFO L273 TraceCheckUtils]: 26: Hoare triple {4666#false} havoc ~x~0;~x~0 := 0; {4666#false} is VALID [2018-11-23 11:55:11,265 INFO L273 TraceCheckUtils]: 27: Hoare triple {4666#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4666#false} is VALID [2018-11-23 11:55:11,265 INFO L256 TraceCheckUtils]: 28: Hoare triple {4666#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {4666#false} is VALID [2018-11-23 11:55:11,265 INFO L273 TraceCheckUtils]: 29: Hoare triple {4666#false} ~cond := #in~cond; {4666#false} is VALID [2018-11-23 11:55:11,266 INFO L273 TraceCheckUtils]: 30: Hoare triple {4666#false} assume 0 == ~cond; {4666#false} is VALID [2018-11-23 11:55:11,266 INFO L273 TraceCheckUtils]: 31: Hoare triple {4666#false} assume !false; {4666#false} is VALID [2018-11-23 11:55:11,267 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:11,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:11,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-23 11:55:11,287 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 32 [2018-11-23 11:55:11,287 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:11,287 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 11:55:11,312 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:11,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 11:55:11,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 11:55:11,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 11:55:11,313 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 23 states. [2018-11-23 11:55:11,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:11,764 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2018-11-23 11:55:11,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 11:55:11,765 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 32 [2018-11-23 11:55:11,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:11,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:55:11,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 51 transitions. [2018-11-23 11:55:11,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:55:11,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 51 transitions. [2018-11-23 11:55:11,767 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 51 transitions. [2018-11-23 11:55:12,200 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:12,201 INFO L225 Difference]: With dead ends: 49 [2018-11-23 11:55:12,201 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 11:55:12,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 11:55:12,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 11:55:12,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-23 11:55:12,222 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:12,222 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 38 states. [2018-11-23 11:55:12,222 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-23 11:55:12,222 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-23 11:55:12,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:12,223 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2018-11-23 11:55:12,223 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-11-23 11:55:12,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:12,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:12,224 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-23 11:55:12,224 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-23 11:55:12,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:12,225 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2018-11-23 11:55:12,225 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-11-23 11:55:12,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:12,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:12,226 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:12,226 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:12,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 11:55:12,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-11-23 11:55:12,227 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 32 [2018-11-23 11:55:12,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:12,227 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-11-23 11:55:12,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 11:55:12,227 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-11-23 11:55:12,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 11:55:12,228 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:12,228 INFO L402 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:12,228 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:12,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:12,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1931727182, now seen corresponding path program 20 times [2018-11-23 11:55:12,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:12,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:12,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:12,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:12,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:12,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:13,613 INFO L256 TraceCheckUtils]: 0: Hoare triple {5005#true} call ULTIMATE.init(); {5005#true} is VALID [2018-11-23 11:55:13,613 INFO L273 TraceCheckUtils]: 1: Hoare triple {5005#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5005#true} is VALID [2018-11-23 11:55:13,614 INFO L273 TraceCheckUtils]: 2: Hoare triple {5005#true} assume true; {5005#true} is VALID [2018-11-23 11:55:13,614 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5005#true} {5005#true} #48#return; {5005#true} is VALID [2018-11-23 11:55:13,614 INFO L256 TraceCheckUtils]: 4: Hoare triple {5005#true} call #t~ret2 := main(); {5005#true} is VALID [2018-11-23 11:55:13,615 INFO L273 TraceCheckUtils]: 5: Hoare triple {5005#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5007#(= main_~i~0 0)} is VALID [2018-11-23 11:55:13,616 INFO L273 TraceCheckUtils]: 6: Hoare triple {5007#(= 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; {5008#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:13,617 INFO L273 TraceCheckUtils]: 7: Hoare triple {5008#(<= 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; {5009#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:13,618 INFO L273 TraceCheckUtils]: 8: Hoare triple {5009#(<= 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; {5010#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:13,619 INFO L273 TraceCheckUtils]: 9: Hoare triple {5010#(<= 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; {5011#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:13,619 INFO L273 TraceCheckUtils]: 10: Hoare triple {5011#(<= 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; {5012#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:13,620 INFO L273 TraceCheckUtils]: 11: Hoare triple {5012#(<= 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; {5013#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:13,622 INFO L273 TraceCheckUtils]: 12: Hoare triple {5013#(<= 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; {5014#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:13,623 INFO L273 TraceCheckUtils]: 13: Hoare triple {5014#(<= 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; {5015#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:13,624 INFO L273 TraceCheckUtils]: 14: Hoare triple {5015#(<= 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; {5016#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:13,625 INFO L273 TraceCheckUtils]: 15: Hoare triple {5016#(<= 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; {5017#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:13,626 INFO L273 TraceCheckUtils]: 16: Hoare triple {5017#(<= 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; {5018#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:13,627 INFO L273 TraceCheckUtils]: 17: Hoare triple {5018#(<= 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; {5019#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:13,628 INFO L273 TraceCheckUtils]: 18: Hoare triple {5019#(<= 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; {5020#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:13,629 INFO L273 TraceCheckUtils]: 19: Hoare triple {5020#(<= 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; {5021#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:13,630 INFO L273 TraceCheckUtils]: 20: Hoare triple {5021#(<= 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; {5022#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:13,631 INFO L273 TraceCheckUtils]: 21: Hoare triple {5022#(<= 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; {5023#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:13,633 INFO L273 TraceCheckUtils]: 22: Hoare triple {5023#(<= 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; {5024#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:13,634 INFO L273 TraceCheckUtils]: 23: Hoare triple {5024#(<= 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; {5025#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:13,635 INFO L273 TraceCheckUtils]: 24: Hoare triple {5025#(<= 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; {5026#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:13,636 INFO L273 TraceCheckUtils]: 25: Hoare triple {5026#(<= 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; {5027#(<= main_~i~0 20)} is VALID [2018-11-23 11:55:13,637 INFO L273 TraceCheckUtils]: 26: Hoare triple {5027#(<= main_~i~0 20)} assume !(~i~0 < 100000); {5006#false} is VALID [2018-11-23 11:55:13,637 INFO L273 TraceCheckUtils]: 27: Hoare triple {5006#false} havoc ~x~0;~x~0 := 0; {5006#false} is VALID [2018-11-23 11:55:13,637 INFO L273 TraceCheckUtils]: 28: Hoare triple {5006#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5006#false} is VALID [2018-11-23 11:55:13,637 INFO L256 TraceCheckUtils]: 29: Hoare triple {5006#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {5006#false} is VALID [2018-11-23 11:55:13,638 INFO L273 TraceCheckUtils]: 30: Hoare triple {5006#false} ~cond := #in~cond; {5006#false} is VALID [2018-11-23 11:55:13,638 INFO L273 TraceCheckUtils]: 31: Hoare triple {5006#false} assume 0 == ~cond; {5006#false} is VALID [2018-11-23 11:55:13,638 INFO L273 TraceCheckUtils]: 32: Hoare triple {5006#false} assume !false; {5006#false} is VALID [2018-11-23 11:55:13,640 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:13,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:13,641 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:13,649 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:55:13,672 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:55:13,672 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:13,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:13,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:13,829 INFO L256 TraceCheckUtils]: 0: Hoare triple {5005#true} call ULTIMATE.init(); {5005#true} is VALID [2018-11-23 11:55:13,830 INFO L273 TraceCheckUtils]: 1: Hoare triple {5005#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5005#true} is VALID [2018-11-23 11:55:13,830 INFO L273 TraceCheckUtils]: 2: Hoare triple {5005#true} assume true; {5005#true} is VALID [2018-11-23 11:55:13,830 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5005#true} {5005#true} #48#return; {5005#true} is VALID [2018-11-23 11:55:13,830 INFO L256 TraceCheckUtils]: 4: Hoare triple {5005#true} call #t~ret2 := main(); {5005#true} is VALID [2018-11-23 11:55:13,831 INFO L273 TraceCheckUtils]: 5: Hoare triple {5005#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5046#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:13,832 INFO L273 TraceCheckUtils]: 6: Hoare triple {5046#(<= 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; {5008#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:13,833 INFO L273 TraceCheckUtils]: 7: Hoare triple {5008#(<= 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; {5009#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:13,833 INFO L273 TraceCheckUtils]: 8: Hoare triple {5009#(<= 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; {5010#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:13,834 INFO L273 TraceCheckUtils]: 9: Hoare triple {5010#(<= 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; {5011#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:13,835 INFO L273 TraceCheckUtils]: 10: Hoare triple {5011#(<= 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; {5012#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:13,836 INFO L273 TraceCheckUtils]: 11: Hoare triple {5012#(<= 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; {5013#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:13,837 INFO L273 TraceCheckUtils]: 12: Hoare triple {5013#(<= 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; {5014#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:13,838 INFO L273 TraceCheckUtils]: 13: Hoare triple {5014#(<= 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; {5015#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:13,839 INFO L273 TraceCheckUtils]: 14: Hoare triple {5015#(<= 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; {5016#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:13,840 INFO L273 TraceCheckUtils]: 15: Hoare triple {5016#(<= 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; {5017#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:13,841 INFO L273 TraceCheckUtils]: 16: Hoare triple {5017#(<= 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; {5018#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:13,842 INFO L273 TraceCheckUtils]: 17: Hoare triple {5018#(<= 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; {5019#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:13,843 INFO L273 TraceCheckUtils]: 18: Hoare triple {5019#(<= 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; {5020#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:13,844 INFO L273 TraceCheckUtils]: 19: Hoare triple {5020#(<= 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; {5021#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:13,845 INFO L273 TraceCheckUtils]: 20: Hoare triple {5021#(<= 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; {5022#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:13,846 INFO L273 TraceCheckUtils]: 21: Hoare triple {5022#(<= 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; {5023#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:13,847 INFO L273 TraceCheckUtils]: 22: Hoare triple {5023#(<= 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; {5024#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:13,848 INFO L273 TraceCheckUtils]: 23: Hoare triple {5024#(<= 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; {5025#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:13,849 INFO L273 TraceCheckUtils]: 24: Hoare triple {5025#(<= 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; {5026#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:13,850 INFO L273 TraceCheckUtils]: 25: Hoare triple {5026#(<= 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; {5027#(<= main_~i~0 20)} is VALID [2018-11-23 11:55:13,851 INFO L273 TraceCheckUtils]: 26: Hoare triple {5027#(<= main_~i~0 20)} assume !(~i~0 < 100000); {5006#false} is VALID [2018-11-23 11:55:13,851 INFO L273 TraceCheckUtils]: 27: Hoare triple {5006#false} havoc ~x~0;~x~0 := 0; {5006#false} is VALID [2018-11-23 11:55:13,851 INFO L273 TraceCheckUtils]: 28: Hoare triple {5006#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5006#false} is VALID [2018-11-23 11:55:13,852 INFO L256 TraceCheckUtils]: 29: Hoare triple {5006#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {5006#false} is VALID [2018-11-23 11:55:13,852 INFO L273 TraceCheckUtils]: 30: Hoare triple {5006#false} ~cond := #in~cond; {5006#false} is VALID [2018-11-23 11:55:13,852 INFO L273 TraceCheckUtils]: 31: Hoare triple {5006#false} assume 0 == ~cond; {5006#false} is VALID [2018-11-23 11:55:13,852 INFO L273 TraceCheckUtils]: 32: Hoare triple {5006#false} assume !false; {5006#false} is VALID [2018-11-23 11:55:13,855 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:13,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:13,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-23 11:55:13,874 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 33 [2018-11-23 11:55:13,875 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:13,875 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 11:55:13,903 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:13,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 11:55:13,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 11:55:13,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 11:55:13,904 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 24 states. [2018-11-23 11:55:14,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:14,058 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2018-11-23 11:55:14,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 11:55:14,058 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 33 [2018-11-23 11:55:14,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:14,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:55:14,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 52 transitions. [2018-11-23 11:55:14,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:55:14,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 52 transitions. [2018-11-23 11:55:14,062 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 52 transitions. [2018-11-23 11:55:14,125 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:55:14,126 INFO L225 Difference]: With dead ends: 50 [2018-11-23 11:55:14,126 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 11:55:14,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 11:55:14,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 11:55:14,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-23 11:55:14,151 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:14,152 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 39 states. [2018-11-23 11:55:14,152 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2018-11-23 11:55:14,152 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2018-11-23 11:55:14,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:14,153 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-11-23 11:55:14,153 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-11-23 11:55:14,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:14,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:14,154 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2018-11-23 11:55:14,154 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2018-11-23 11:55:14,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:14,155 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-11-23 11:55:14,156 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-11-23 11:55:14,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:14,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:14,156 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:14,156 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:14,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 11:55:14,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-11-23 11:55:14,158 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 33 [2018-11-23 11:55:14,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:14,158 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-11-23 11:55:14,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 11:55:14,158 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-11-23 11:55:14,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 11:55:14,159 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:14,159 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:14,159 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:14,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:14,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1845079186, now seen corresponding path program 21 times [2018-11-23 11:55:14,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:14,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:14,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:14,161 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:14,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:14,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:15,039 INFO L256 TraceCheckUtils]: 0: Hoare triple {5355#true} call ULTIMATE.init(); {5355#true} is VALID [2018-11-23 11:55:15,039 INFO L273 TraceCheckUtils]: 1: Hoare triple {5355#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5355#true} is VALID [2018-11-23 11:55:15,039 INFO L273 TraceCheckUtils]: 2: Hoare triple {5355#true} assume true; {5355#true} is VALID [2018-11-23 11:55:15,040 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5355#true} {5355#true} #48#return; {5355#true} is VALID [2018-11-23 11:55:15,040 INFO L256 TraceCheckUtils]: 4: Hoare triple {5355#true} call #t~ret2 := main(); {5355#true} is VALID [2018-11-23 11:55:15,041 INFO L273 TraceCheckUtils]: 5: Hoare triple {5355#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5357#(= main_~i~0 0)} is VALID [2018-11-23 11:55:15,042 INFO L273 TraceCheckUtils]: 6: Hoare triple {5357#(= 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; {5358#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:15,043 INFO L273 TraceCheckUtils]: 7: Hoare triple {5358#(<= 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; {5359#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:15,044 INFO L273 TraceCheckUtils]: 8: Hoare triple {5359#(<= 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; {5360#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:15,045 INFO L273 TraceCheckUtils]: 9: Hoare triple {5360#(<= 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; {5361#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:15,046 INFO L273 TraceCheckUtils]: 10: Hoare triple {5361#(<= 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; {5362#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:15,047 INFO L273 TraceCheckUtils]: 11: Hoare triple {5362#(<= 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; {5363#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:15,048 INFO L273 TraceCheckUtils]: 12: Hoare triple {5363#(<= 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; {5364#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:15,049 INFO L273 TraceCheckUtils]: 13: Hoare triple {5364#(<= 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; {5365#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:15,051 INFO L273 TraceCheckUtils]: 14: Hoare triple {5365#(<= 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; {5366#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:15,052 INFO L273 TraceCheckUtils]: 15: Hoare triple {5366#(<= 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; {5367#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:15,053 INFO L273 TraceCheckUtils]: 16: Hoare triple {5367#(<= 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; {5368#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:15,054 INFO L273 TraceCheckUtils]: 17: Hoare triple {5368#(<= 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; {5369#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:15,055 INFO L273 TraceCheckUtils]: 18: Hoare triple {5369#(<= 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; {5370#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:15,056 INFO L273 TraceCheckUtils]: 19: Hoare triple {5370#(<= 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; {5371#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:15,057 INFO L273 TraceCheckUtils]: 20: Hoare triple {5371#(<= 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; {5372#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:15,058 INFO L273 TraceCheckUtils]: 21: Hoare triple {5372#(<= 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; {5373#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:15,059 INFO L273 TraceCheckUtils]: 22: Hoare triple {5373#(<= 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; {5374#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:15,060 INFO L273 TraceCheckUtils]: 23: Hoare triple {5374#(<= 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; {5375#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:15,061 INFO L273 TraceCheckUtils]: 24: Hoare triple {5375#(<= 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; {5376#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:15,062 INFO L273 TraceCheckUtils]: 25: Hoare triple {5376#(<= 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; {5377#(<= main_~i~0 20)} is VALID [2018-11-23 11:55:15,063 INFO L273 TraceCheckUtils]: 26: Hoare triple {5377#(<= 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; {5378#(<= main_~i~0 21)} is VALID [2018-11-23 11:55:15,064 INFO L273 TraceCheckUtils]: 27: Hoare triple {5378#(<= main_~i~0 21)} assume !(~i~0 < 100000); {5356#false} is VALID [2018-11-23 11:55:15,065 INFO L273 TraceCheckUtils]: 28: Hoare triple {5356#false} havoc ~x~0;~x~0 := 0; {5356#false} is VALID [2018-11-23 11:55:15,065 INFO L273 TraceCheckUtils]: 29: Hoare triple {5356#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5356#false} is VALID [2018-11-23 11:55:15,065 INFO L256 TraceCheckUtils]: 30: Hoare triple {5356#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {5356#false} is VALID [2018-11-23 11:55:15,065 INFO L273 TraceCheckUtils]: 31: Hoare triple {5356#false} ~cond := #in~cond; {5356#false} is VALID [2018-11-23 11:55:15,066 INFO L273 TraceCheckUtils]: 32: Hoare triple {5356#false} assume 0 == ~cond; {5356#false} is VALID [2018-11-23 11:55:15,066 INFO L273 TraceCheckUtils]: 33: Hoare triple {5356#false} assume !false; {5356#false} is VALID [2018-11-23 11:55:15,068 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:15,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:15,068 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:15,097 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:55:15,529 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-23 11:55:15,529 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:15,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:15,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:15,669 INFO L256 TraceCheckUtils]: 0: Hoare triple {5355#true} call ULTIMATE.init(); {5355#true} is VALID [2018-11-23 11:55:15,670 INFO L273 TraceCheckUtils]: 1: Hoare triple {5355#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5355#true} is VALID [2018-11-23 11:55:15,670 INFO L273 TraceCheckUtils]: 2: Hoare triple {5355#true} assume true; {5355#true} is VALID [2018-11-23 11:55:15,670 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5355#true} {5355#true} #48#return; {5355#true} is VALID [2018-11-23 11:55:15,671 INFO L256 TraceCheckUtils]: 4: Hoare triple {5355#true} call #t~ret2 := main(); {5355#true} is VALID [2018-11-23 11:55:15,671 INFO L273 TraceCheckUtils]: 5: Hoare triple {5355#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5397#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:15,672 INFO L273 TraceCheckUtils]: 6: Hoare triple {5397#(<= 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; {5358#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:15,673 INFO L273 TraceCheckUtils]: 7: Hoare triple {5358#(<= 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; {5359#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:15,673 INFO L273 TraceCheckUtils]: 8: Hoare triple {5359#(<= 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; {5360#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:15,674 INFO L273 TraceCheckUtils]: 9: Hoare triple {5360#(<= 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; {5361#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:15,674 INFO L273 TraceCheckUtils]: 10: Hoare triple {5361#(<= 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; {5362#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:15,675 INFO L273 TraceCheckUtils]: 11: Hoare triple {5362#(<= 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; {5363#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:15,676 INFO L273 TraceCheckUtils]: 12: Hoare triple {5363#(<= 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; {5364#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:15,677 INFO L273 TraceCheckUtils]: 13: Hoare triple {5364#(<= 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; {5365#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:15,678 INFO L273 TraceCheckUtils]: 14: Hoare triple {5365#(<= 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; {5366#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:15,679 INFO L273 TraceCheckUtils]: 15: Hoare triple {5366#(<= 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; {5367#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:15,680 INFO L273 TraceCheckUtils]: 16: Hoare triple {5367#(<= 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; {5368#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:15,681 INFO L273 TraceCheckUtils]: 17: Hoare triple {5368#(<= 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; {5369#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:15,682 INFO L273 TraceCheckUtils]: 18: Hoare triple {5369#(<= 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; {5370#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:15,683 INFO L273 TraceCheckUtils]: 19: Hoare triple {5370#(<= 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; {5371#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:15,684 INFO L273 TraceCheckUtils]: 20: Hoare triple {5371#(<= 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; {5372#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:15,685 INFO L273 TraceCheckUtils]: 21: Hoare triple {5372#(<= 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; {5373#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:15,686 INFO L273 TraceCheckUtils]: 22: Hoare triple {5373#(<= 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; {5374#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:15,686 INFO L273 TraceCheckUtils]: 23: Hoare triple {5374#(<= 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; {5375#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:15,687 INFO L273 TraceCheckUtils]: 24: Hoare triple {5375#(<= 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; {5376#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:15,688 INFO L273 TraceCheckUtils]: 25: Hoare triple {5376#(<= 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; {5377#(<= main_~i~0 20)} is VALID [2018-11-23 11:55:15,689 INFO L273 TraceCheckUtils]: 26: Hoare triple {5377#(<= 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; {5378#(<= main_~i~0 21)} is VALID [2018-11-23 11:55:15,690 INFO L273 TraceCheckUtils]: 27: Hoare triple {5378#(<= main_~i~0 21)} assume !(~i~0 < 100000); {5356#false} is VALID [2018-11-23 11:55:15,690 INFO L273 TraceCheckUtils]: 28: Hoare triple {5356#false} havoc ~x~0;~x~0 := 0; {5356#false} is VALID [2018-11-23 11:55:15,690 INFO L273 TraceCheckUtils]: 29: Hoare triple {5356#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5356#false} is VALID [2018-11-23 11:55:15,691 INFO L256 TraceCheckUtils]: 30: Hoare triple {5356#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {5356#false} is VALID [2018-11-23 11:55:15,691 INFO L273 TraceCheckUtils]: 31: Hoare triple {5356#false} ~cond := #in~cond; {5356#false} is VALID [2018-11-23 11:55:15,691 INFO L273 TraceCheckUtils]: 32: Hoare triple {5356#false} assume 0 == ~cond; {5356#false} is VALID [2018-11-23 11:55:15,691 INFO L273 TraceCheckUtils]: 33: Hoare triple {5356#false} assume !false; {5356#false} is VALID [2018-11-23 11:55:15,693 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:15,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:15,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-11-23 11:55:15,715 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 34 [2018-11-23 11:55:15,715 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:15,715 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 11:55:15,742 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:15,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 11:55:15,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 11:55:15,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 11:55:15,743 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 25 states. [2018-11-23 11:55:15,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:15,870 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2018-11-23 11:55:15,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 11:55:15,870 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 34 [2018-11-23 11:55:15,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:15,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 11:55:15,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 53 transitions. [2018-11-23 11:55:15,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 11:55:15,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 53 transitions. [2018-11-23 11:55:15,873 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 53 transitions. [2018-11-23 11:55:15,917 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:15,918 INFO L225 Difference]: With dead ends: 51 [2018-11-23 11:55:15,918 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 11:55:15,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 11:55:15,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 11:55:15,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-23 11:55:15,960 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:15,960 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2018-11-23 11:55:15,960 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-23 11:55:15,960 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-23 11:55:15,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:15,961 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-11-23 11:55:15,961 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-23 11:55:15,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:15,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:15,962 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-23 11:55:15,962 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-23 11:55:15,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:15,963 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-11-23 11:55:15,963 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-23 11:55:15,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:15,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:15,963 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:15,963 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:15,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 11:55:15,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-11-23 11:55:15,964 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 34 [2018-11-23 11:55:15,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:15,964 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-11-23 11:55:15,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 11:55:15,964 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-23 11:55:15,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 11:55:15,965 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:15,965 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:15,965 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:15,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:15,965 INFO L82 PathProgramCache]: Analyzing trace with hash 841008690, now seen corresponding path program 22 times [2018-11-23 11:55:15,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:15,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:15,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:15,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:15,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:15,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:16,336 INFO L256 TraceCheckUtils]: 0: Hoare triple {5715#true} call ULTIMATE.init(); {5715#true} is VALID [2018-11-23 11:55:16,336 INFO L273 TraceCheckUtils]: 1: Hoare triple {5715#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5715#true} is VALID [2018-11-23 11:55:16,337 INFO L273 TraceCheckUtils]: 2: Hoare triple {5715#true} assume true; {5715#true} is VALID [2018-11-23 11:55:16,337 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5715#true} {5715#true} #48#return; {5715#true} is VALID [2018-11-23 11:55:16,337 INFO L256 TraceCheckUtils]: 4: Hoare triple {5715#true} call #t~ret2 := main(); {5715#true} is VALID [2018-11-23 11:55:16,338 INFO L273 TraceCheckUtils]: 5: Hoare triple {5715#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5717#(= main_~i~0 0)} is VALID [2018-11-23 11:55:16,339 INFO L273 TraceCheckUtils]: 6: Hoare triple {5717#(= 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; {5718#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:16,340 INFO L273 TraceCheckUtils]: 7: Hoare triple {5718#(<= 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; {5719#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:16,341 INFO L273 TraceCheckUtils]: 8: Hoare triple {5719#(<= 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; {5720#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:16,342 INFO L273 TraceCheckUtils]: 9: Hoare triple {5720#(<= 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; {5721#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:16,343 INFO L273 TraceCheckUtils]: 10: Hoare triple {5721#(<= 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; {5722#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:16,343 INFO L273 TraceCheckUtils]: 11: Hoare triple {5722#(<= 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; {5723#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:16,344 INFO L273 TraceCheckUtils]: 12: Hoare triple {5723#(<= 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; {5724#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:16,345 INFO L273 TraceCheckUtils]: 13: Hoare triple {5724#(<= 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; {5725#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:16,346 INFO L273 TraceCheckUtils]: 14: Hoare triple {5725#(<= 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; {5726#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:16,347 INFO L273 TraceCheckUtils]: 15: Hoare triple {5726#(<= 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; {5727#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:16,348 INFO L273 TraceCheckUtils]: 16: Hoare triple {5727#(<= 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; {5728#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:16,349 INFO L273 TraceCheckUtils]: 17: Hoare triple {5728#(<= 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; {5729#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:16,350 INFO L273 TraceCheckUtils]: 18: Hoare triple {5729#(<= 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; {5730#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:16,351 INFO L273 TraceCheckUtils]: 19: Hoare triple {5730#(<= 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; {5731#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:16,352 INFO L273 TraceCheckUtils]: 20: Hoare triple {5731#(<= 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; {5732#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:16,353 INFO L273 TraceCheckUtils]: 21: Hoare triple {5732#(<= 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; {5733#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:16,354 INFO L273 TraceCheckUtils]: 22: Hoare triple {5733#(<= 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; {5734#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:16,355 INFO L273 TraceCheckUtils]: 23: Hoare triple {5734#(<= 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; {5735#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:16,356 INFO L273 TraceCheckUtils]: 24: Hoare triple {5735#(<= 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; {5736#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:16,357 INFO L273 TraceCheckUtils]: 25: Hoare triple {5736#(<= 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; {5737#(<= main_~i~0 20)} is VALID [2018-11-23 11:55:16,358 INFO L273 TraceCheckUtils]: 26: Hoare triple {5737#(<= 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; {5738#(<= main_~i~0 21)} is VALID [2018-11-23 11:55:16,359 INFO L273 TraceCheckUtils]: 27: Hoare triple {5738#(<= 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; {5739#(<= main_~i~0 22)} is VALID [2018-11-23 11:55:16,360 INFO L273 TraceCheckUtils]: 28: Hoare triple {5739#(<= main_~i~0 22)} assume !(~i~0 < 100000); {5716#false} is VALID [2018-11-23 11:55:16,360 INFO L273 TraceCheckUtils]: 29: Hoare triple {5716#false} havoc ~x~0;~x~0 := 0; {5716#false} is VALID [2018-11-23 11:55:16,360 INFO L273 TraceCheckUtils]: 30: Hoare triple {5716#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5716#false} is VALID [2018-11-23 11:55:16,361 INFO L256 TraceCheckUtils]: 31: Hoare triple {5716#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {5716#false} is VALID [2018-11-23 11:55:16,361 INFO L273 TraceCheckUtils]: 32: Hoare triple {5716#false} ~cond := #in~cond; {5716#false} is VALID [2018-11-23 11:55:16,361 INFO L273 TraceCheckUtils]: 33: Hoare triple {5716#false} assume 0 == ~cond; {5716#false} is VALID [2018-11-23 11:55:16,361 INFO L273 TraceCheckUtils]: 34: Hoare triple {5716#false} assume !false; {5716#false} is VALID [2018-11-23 11:55:16,363 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:16,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:16,363 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:16,372 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:55:16,396 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:55:16,397 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:16,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:16,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:16,594 INFO L256 TraceCheckUtils]: 0: Hoare triple {5715#true} call ULTIMATE.init(); {5715#true} is VALID [2018-11-23 11:55:16,595 INFO L273 TraceCheckUtils]: 1: Hoare triple {5715#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5715#true} is VALID [2018-11-23 11:55:16,595 INFO L273 TraceCheckUtils]: 2: Hoare triple {5715#true} assume true; {5715#true} is VALID [2018-11-23 11:55:16,595 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5715#true} {5715#true} #48#return; {5715#true} is VALID [2018-11-23 11:55:16,595 INFO L256 TraceCheckUtils]: 4: Hoare triple {5715#true} call #t~ret2 := main(); {5715#true} is VALID [2018-11-23 11:55:16,596 INFO L273 TraceCheckUtils]: 5: Hoare triple {5715#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5758#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:16,597 INFO L273 TraceCheckUtils]: 6: Hoare triple {5758#(<= 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; {5718#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:16,597 INFO L273 TraceCheckUtils]: 7: Hoare triple {5718#(<= 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; {5719#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:16,598 INFO L273 TraceCheckUtils]: 8: Hoare triple {5719#(<= 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; {5720#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:16,598 INFO L273 TraceCheckUtils]: 9: Hoare triple {5720#(<= 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; {5721#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:16,599 INFO L273 TraceCheckUtils]: 10: Hoare triple {5721#(<= 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; {5722#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:16,600 INFO L273 TraceCheckUtils]: 11: Hoare triple {5722#(<= 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; {5723#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:16,601 INFO L273 TraceCheckUtils]: 12: Hoare triple {5723#(<= 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; {5724#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:16,602 INFO L273 TraceCheckUtils]: 13: Hoare triple {5724#(<= 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; {5725#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:16,603 INFO L273 TraceCheckUtils]: 14: Hoare triple {5725#(<= 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; {5726#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:16,604 INFO L273 TraceCheckUtils]: 15: Hoare triple {5726#(<= 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; {5727#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:16,605 INFO L273 TraceCheckUtils]: 16: Hoare triple {5727#(<= 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; {5728#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:16,605 INFO L273 TraceCheckUtils]: 17: Hoare triple {5728#(<= 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; {5729#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:16,606 INFO L273 TraceCheckUtils]: 18: Hoare triple {5729#(<= 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; {5730#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:16,607 INFO L273 TraceCheckUtils]: 19: Hoare triple {5730#(<= 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; {5731#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:16,608 INFO L273 TraceCheckUtils]: 20: Hoare triple {5731#(<= 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; {5732#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:16,609 INFO L273 TraceCheckUtils]: 21: Hoare triple {5732#(<= 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; {5733#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:16,610 INFO L273 TraceCheckUtils]: 22: Hoare triple {5733#(<= 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; {5734#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:16,611 INFO L273 TraceCheckUtils]: 23: Hoare triple {5734#(<= 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; {5735#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:16,612 INFO L273 TraceCheckUtils]: 24: Hoare triple {5735#(<= 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; {5736#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:16,613 INFO L273 TraceCheckUtils]: 25: Hoare triple {5736#(<= 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; {5737#(<= main_~i~0 20)} is VALID [2018-11-23 11:55:16,614 INFO L273 TraceCheckUtils]: 26: Hoare triple {5737#(<= 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; {5738#(<= main_~i~0 21)} is VALID [2018-11-23 11:55:16,615 INFO L273 TraceCheckUtils]: 27: Hoare triple {5738#(<= 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; {5739#(<= main_~i~0 22)} is VALID [2018-11-23 11:55:16,616 INFO L273 TraceCheckUtils]: 28: Hoare triple {5739#(<= main_~i~0 22)} assume !(~i~0 < 100000); {5716#false} is VALID [2018-11-23 11:55:16,616 INFO L273 TraceCheckUtils]: 29: Hoare triple {5716#false} havoc ~x~0;~x~0 := 0; {5716#false} is VALID [2018-11-23 11:55:16,616 INFO L273 TraceCheckUtils]: 30: Hoare triple {5716#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5716#false} is VALID [2018-11-23 11:55:16,616 INFO L256 TraceCheckUtils]: 31: Hoare triple {5716#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {5716#false} is VALID [2018-11-23 11:55:16,617 INFO L273 TraceCheckUtils]: 32: Hoare triple {5716#false} ~cond := #in~cond; {5716#false} is VALID [2018-11-23 11:55:16,617 INFO L273 TraceCheckUtils]: 33: Hoare triple {5716#false} assume 0 == ~cond; {5716#false} is VALID [2018-11-23 11:55:16,617 INFO L273 TraceCheckUtils]: 34: Hoare triple {5716#false} assume !false; {5716#false} is VALID [2018-11-23 11:55:16,619 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:16,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:16,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-11-23 11:55:16,639 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 35 [2018-11-23 11:55:16,639 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:16,639 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 11:55:16,668 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:16,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 11:55:16,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 11:55:16,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 11:55:16,669 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 26 states. [2018-11-23 11:55:16,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:16,891 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2018-11-23 11:55:16,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 11:55:16,892 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 35 [2018-11-23 11:55:16,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:16,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 11:55:16,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 54 transitions. [2018-11-23 11:55:16,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 11:55:16,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 54 transitions. [2018-11-23 11:55:16,895 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 54 transitions. [2018-11-23 11:55:17,423 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:55:17,424 INFO L225 Difference]: With dead ends: 52 [2018-11-23 11:55:17,424 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 11:55:17,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 11:55:17,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 11:55:17,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-23 11:55:17,489 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:17,489 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 41 states. [2018-11-23 11:55:17,489 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2018-11-23 11:55:17,489 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2018-11-23 11:55:17,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:17,490 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-11-23 11:55:17,490 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-11-23 11:55:17,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:17,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:17,491 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2018-11-23 11:55:17,491 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2018-11-23 11:55:17,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:17,492 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-11-23 11:55:17,492 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-11-23 11:55:17,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:17,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:17,493 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:17,493 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:17,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 11:55:17,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-11-23 11:55:17,494 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 35 [2018-11-23 11:55:17,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:17,494 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-11-23 11:55:17,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 11:55:17,494 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-11-23 11:55:17,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 11:55:17,495 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:17,495 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:17,495 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:17,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:17,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1789613074, now seen corresponding path program 23 times [2018-11-23 11:55:17,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:17,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:17,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:17,496 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:17,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:17,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:17,913 INFO L256 TraceCheckUtils]: 0: Hoare triple {6085#true} call ULTIMATE.init(); {6085#true} is VALID [2018-11-23 11:55:17,914 INFO L273 TraceCheckUtils]: 1: Hoare triple {6085#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6085#true} is VALID [2018-11-23 11:55:17,914 INFO L273 TraceCheckUtils]: 2: Hoare triple {6085#true} assume true; {6085#true} is VALID [2018-11-23 11:55:17,914 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6085#true} {6085#true} #48#return; {6085#true} is VALID [2018-11-23 11:55:17,914 INFO L256 TraceCheckUtils]: 4: Hoare triple {6085#true} call #t~ret2 := main(); {6085#true} is VALID [2018-11-23 11:55:17,914 INFO L273 TraceCheckUtils]: 5: Hoare triple {6085#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6087#(= main_~i~0 0)} is VALID [2018-11-23 11:55:17,915 INFO L273 TraceCheckUtils]: 6: Hoare triple {6087#(= 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; {6088#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:17,916 INFO L273 TraceCheckUtils]: 7: Hoare triple {6088#(<= 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; {6089#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:17,917 INFO L273 TraceCheckUtils]: 8: Hoare triple {6089#(<= 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; {6090#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:17,918 INFO L273 TraceCheckUtils]: 9: Hoare triple {6090#(<= 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; {6091#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:17,919 INFO L273 TraceCheckUtils]: 10: Hoare triple {6091#(<= 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; {6092#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:17,920 INFO L273 TraceCheckUtils]: 11: Hoare triple {6092#(<= 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; {6093#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:17,921 INFO L273 TraceCheckUtils]: 12: Hoare triple {6093#(<= 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; {6094#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:17,922 INFO L273 TraceCheckUtils]: 13: Hoare triple {6094#(<= 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; {6095#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:17,923 INFO L273 TraceCheckUtils]: 14: Hoare triple {6095#(<= 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; {6096#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:17,924 INFO L273 TraceCheckUtils]: 15: Hoare triple {6096#(<= 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; {6097#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:17,925 INFO L273 TraceCheckUtils]: 16: Hoare triple {6097#(<= 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; {6098#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:17,926 INFO L273 TraceCheckUtils]: 17: Hoare triple {6098#(<= 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; {6099#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:17,927 INFO L273 TraceCheckUtils]: 18: Hoare triple {6099#(<= 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; {6100#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:17,928 INFO L273 TraceCheckUtils]: 19: Hoare triple {6100#(<= 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; {6101#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:17,928 INFO L273 TraceCheckUtils]: 20: Hoare triple {6101#(<= 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; {6102#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:17,929 INFO L273 TraceCheckUtils]: 21: Hoare triple {6102#(<= 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; {6103#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:17,930 INFO L273 TraceCheckUtils]: 22: Hoare triple {6103#(<= 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; {6104#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:17,931 INFO L273 TraceCheckUtils]: 23: Hoare triple {6104#(<= 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; {6105#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:17,932 INFO L273 TraceCheckUtils]: 24: Hoare triple {6105#(<= 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; {6106#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:17,933 INFO L273 TraceCheckUtils]: 25: Hoare triple {6106#(<= 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; {6107#(<= main_~i~0 20)} is VALID [2018-11-23 11:55:17,934 INFO L273 TraceCheckUtils]: 26: Hoare triple {6107#(<= 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; {6108#(<= main_~i~0 21)} is VALID [2018-11-23 11:55:17,935 INFO L273 TraceCheckUtils]: 27: Hoare triple {6108#(<= 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; {6109#(<= main_~i~0 22)} is VALID [2018-11-23 11:55:17,936 INFO L273 TraceCheckUtils]: 28: Hoare triple {6109#(<= 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; {6110#(<= main_~i~0 23)} is VALID [2018-11-23 11:55:17,937 INFO L273 TraceCheckUtils]: 29: Hoare triple {6110#(<= main_~i~0 23)} assume !(~i~0 < 100000); {6086#false} is VALID [2018-11-23 11:55:17,937 INFO L273 TraceCheckUtils]: 30: Hoare triple {6086#false} havoc ~x~0;~x~0 := 0; {6086#false} is VALID [2018-11-23 11:55:17,937 INFO L273 TraceCheckUtils]: 31: Hoare triple {6086#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6086#false} is VALID [2018-11-23 11:55:17,937 INFO L256 TraceCheckUtils]: 32: Hoare triple {6086#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {6086#false} is VALID [2018-11-23 11:55:17,938 INFO L273 TraceCheckUtils]: 33: Hoare triple {6086#false} ~cond := #in~cond; {6086#false} is VALID [2018-11-23 11:55:17,938 INFO L273 TraceCheckUtils]: 34: Hoare triple {6086#false} assume 0 == ~cond; {6086#false} is VALID [2018-11-23 11:55:17,938 INFO L273 TraceCheckUtils]: 35: Hoare triple {6086#false} assume !false; {6086#false} is VALID [2018-11-23 11:55:17,940 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:17,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:17,940 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:17,950 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:55:18,157 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-11-23 11:55:18,157 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:18,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:18,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:18,374 INFO L256 TraceCheckUtils]: 0: Hoare triple {6085#true} call ULTIMATE.init(); {6085#true} is VALID [2018-11-23 11:55:18,375 INFO L273 TraceCheckUtils]: 1: Hoare triple {6085#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6085#true} is VALID [2018-11-23 11:55:18,375 INFO L273 TraceCheckUtils]: 2: Hoare triple {6085#true} assume true; {6085#true} is VALID [2018-11-23 11:55:18,375 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6085#true} {6085#true} #48#return; {6085#true} is VALID [2018-11-23 11:55:18,375 INFO L256 TraceCheckUtils]: 4: Hoare triple {6085#true} call #t~ret2 := main(); {6085#true} is VALID [2018-11-23 11:55:18,376 INFO L273 TraceCheckUtils]: 5: Hoare triple {6085#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6129#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:18,377 INFO L273 TraceCheckUtils]: 6: Hoare triple {6129#(<= 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; {6088#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:18,378 INFO L273 TraceCheckUtils]: 7: Hoare triple {6088#(<= 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; {6089#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:18,379 INFO L273 TraceCheckUtils]: 8: Hoare triple {6089#(<= 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; {6090#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:18,380 INFO L273 TraceCheckUtils]: 9: Hoare triple {6090#(<= 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; {6091#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:18,381 INFO L273 TraceCheckUtils]: 10: Hoare triple {6091#(<= 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; {6092#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:18,382 INFO L273 TraceCheckUtils]: 11: Hoare triple {6092#(<= 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; {6093#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:18,383 INFO L273 TraceCheckUtils]: 12: Hoare triple {6093#(<= 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; {6094#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:18,384 INFO L273 TraceCheckUtils]: 13: Hoare triple {6094#(<= 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; {6095#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:18,385 INFO L273 TraceCheckUtils]: 14: Hoare triple {6095#(<= 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; {6096#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:18,386 INFO L273 TraceCheckUtils]: 15: Hoare triple {6096#(<= 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; {6097#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:18,387 INFO L273 TraceCheckUtils]: 16: Hoare triple {6097#(<= 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; {6098#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:18,388 INFO L273 TraceCheckUtils]: 17: Hoare triple {6098#(<= 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; {6099#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:18,389 INFO L273 TraceCheckUtils]: 18: Hoare triple {6099#(<= 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; {6100#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:18,390 INFO L273 TraceCheckUtils]: 19: Hoare triple {6100#(<= 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; {6101#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:18,391 INFO L273 TraceCheckUtils]: 20: Hoare triple {6101#(<= 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; {6102#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:18,392 INFO L273 TraceCheckUtils]: 21: Hoare triple {6102#(<= 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; {6103#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:18,393 INFO L273 TraceCheckUtils]: 22: Hoare triple {6103#(<= 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; {6104#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:18,393 INFO L273 TraceCheckUtils]: 23: Hoare triple {6104#(<= 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; {6105#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:18,394 INFO L273 TraceCheckUtils]: 24: Hoare triple {6105#(<= 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; {6106#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:18,395 INFO L273 TraceCheckUtils]: 25: Hoare triple {6106#(<= 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; {6107#(<= main_~i~0 20)} is VALID [2018-11-23 11:55:18,396 INFO L273 TraceCheckUtils]: 26: Hoare triple {6107#(<= 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; {6108#(<= main_~i~0 21)} is VALID [2018-11-23 11:55:18,397 INFO L273 TraceCheckUtils]: 27: Hoare triple {6108#(<= 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; {6109#(<= main_~i~0 22)} is VALID [2018-11-23 11:55:18,398 INFO L273 TraceCheckUtils]: 28: Hoare triple {6109#(<= 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; {6110#(<= main_~i~0 23)} is VALID [2018-11-23 11:55:18,399 INFO L273 TraceCheckUtils]: 29: Hoare triple {6110#(<= main_~i~0 23)} assume !(~i~0 < 100000); {6086#false} is VALID [2018-11-23 11:55:18,399 INFO L273 TraceCheckUtils]: 30: Hoare triple {6086#false} havoc ~x~0;~x~0 := 0; {6086#false} is VALID [2018-11-23 11:55:18,399 INFO L273 TraceCheckUtils]: 31: Hoare triple {6086#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6086#false} is VALID [2018-11-23 11:55:18,400 INFO L256 TraceCheckUtils]: 32: Hoare triple {6086#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {6086#false} is VALID [2018-11-23 11:55:18,400 INFO L273 TraceCheckUtils]: 33: Hoare triple {6086#false} ~cond := #in~cond; {6086#false} is VALID [2018-11-23 11:55:18,400 INFO L273 TraceCheckUtils]: 34: Hoare triple {6086#false} assume 0 == ~cond; {6086#false} is VALID [2018-11-23 11:55:18,400 INFO L273 TraceCheckUtils]: 35: Hoare triple {6086#false} assume !false; {6086#false} is VALID [2018-11-23 11:55:18,402 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:18,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:18,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2018-11-23 11:55:18,422 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 36 [2018-11-23 11:55:18,422 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:18,422 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-23 11:55:18,455 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:18,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-23 11:55:18,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-23 11:55:18,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-23 11:55:18,456 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 27 states. [2018-11-23 11:55:18,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:18,811 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2018-11-23 11:55:18,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 11:55:18,811 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 36 [2018-11-23 11:55:18,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:18,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 11:55:18,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 55 transitions. [2018-11-23 11:55:18,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 11:55:18,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 55 transitions. [2018-11-23 11:55:18,813 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 55 transitions. [2018-11-23 11:55:18,855 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:18,856 INFO L225 Difference]: With dead ends: 53 [2018-11-23 11:55:18,856 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 11:55:18,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-23 11:55:18,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 11:55:18,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-23 11:55:18,930 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:18,930 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 42 states. [2018-11-23 11:55:18,930 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-23 11:55:18,930 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-23 11:55:18,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:18,931 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2018-11-23 11:55:18,931 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-11-23 11:55:18,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:18,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:18,932 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-23 11:55:18,932 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-23 11:55:18,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:18,932 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2018-11-23 11:55:18,933 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-11-23 11:55:18,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:18,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:18,933 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:18,933 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:18,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 11:55:18,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-11-23 11:55:18,934 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 36 [2018-11-23 11:55:18,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:18,935 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-11-23 11:55:18,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-23 11:55:18,935 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-11-23 11:55:18,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 11:55:18,935 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:18,935 INFO L402 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:18,935 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:18,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:18,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1734509134, now seen corresponding path program 24 times [2018-11-23 11:55:18,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:18,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:18,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:18,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:18,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:18,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:19,779 INFO L256 TraceCheckUtils]: 0: Hoare triple {6465#true} call ULTIMATE.init(); {6465#true} is VALID [2018-11-23 11:55:19,779 INFO L273 TraceCheckUtils]: 1: Hoare triple {6465#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6465#true} is VALID [2018-11-23 11:55:19,779 INFO L273 TraceCheckUtils]: 2: Hoare triple {6465#true} assume true; {6465#true} is VALID [2018-11-23 11:55:19,780 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6465#true} {6465#true} #48#return; {6465#true} is VALID [2018-11-23 11:55:19,780 INFO L256 TraceCheckUtils]: 4: Hoare triple {6465#true} call #t~ret2 := main(); {6465#true} is VALID [2018-11-23 11:55:19,780 INFO L273 TraceCheckUtils]: 5: Hoare triple {6465#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6467#(= main_~i~0 0)} is VALID [2018-11-23 11:55:19,781 INFO L273 TraceCheckUtils]: 6: Hoare triple {6467#(= 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; {6468#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:19,782 INFO L273 TraceCheckUtils]: 7: Hoare triple {6468#(<= 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; {6469#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:19,782 INFO L273 TraceCheckUtils]: 8: Hoare triple {6469#(<= 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; {6470#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:19,783 INFO L273 TraceCheckUtils]: 9: Hoare triple {6470#(<= 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; {6471#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:19,784 INFO L273 TraceCheckUtils]: 10: Hoare triple {6471#(<= 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; {6472#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:19,785 INFO L273 TraceCheckUtils]: 11: Hoare triple {6472#(<= 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; {6473#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:19,786 INFO L273 TraceCheckUtils]: 12: Hoare triple {6473#(<= 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; {6474#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:19,787 INFO L273 TraceCheckUtils]: 13: Hoare triple {6474#(<= 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; {6475#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:19,788 INFO L273 TraceCheckUtils]: 14: Hoare triple {6475#(<= 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; {6476#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:19,789 INFO L273 TraceCheckUtils]: 15: Hoare triple {6476#(<= 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; {6477#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:19,789 INFO L273 TraceCheckUtils]: 16: Hoare triple {6477#(<= 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; {6478#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:19,790 INFO L273 TraceCheckUtils]: 17: Hoare triple {6478#(<= 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; {6479#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:19,791 INFO L273 TraceCheckUtils]: 18: Hoare triple {6479#(<= 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; {6480#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:19,792 INFO L273 TraceCheckUtils]: 19: Hoare triple {6480#(<= 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; {6481#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:19,793 INFO L273 TraceCheckUtils]: 20: Hoare triple {6481#(<= 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; {6482#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:19,794 INFO L273 TraceCheckUtils]: 21: Hoare triple {6482#(<= 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; {6483#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:19,795 INFO L273 TraceCheckUtils]: 22: Hoare triple {6483#(<= 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; {6484#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:19,796 INFO L273 TraceCheckUtils]: 23: Hoare triple {6484#(<= 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; {6485#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:19,797 INFO L273 TraceCheckUtils]: 24: Hoare triple {6485#(<= 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; {6486#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:19,798 INFO L273 TraceCheckUtils]: 25: Hoare triple {6486#(<= 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; {6487#(<= main_~i~0 20)} is VALID [2018-11-23 11:55:19,799 INFO L273 TraceCheckUtils]: 26: Hoare triple {6487#(<= 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; {6488#(<= main_~i~0 21)} is VALID [2018-11-23 11:55:19,800 INFO L273 TraceCheckUtils]: 27: Hoare triple {6488#(<= 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; {6489#(<= main_~i~0 22)} is VALID [2018-11-23 11:55:19,801 INFO L273 TraceCheckUtils]: 28: Hoare triple {6489#(<= 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; {6490#(<= main_~i~0 23)} is VALID [2018-11-23 11:55:19,802 INFO L273 TraceCheckUtils]: 29: Hoare triple {6490#(<= 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; {6491#(<= main_~i~0 24)} is VALID [2018-11-23 11:55:19,802 INFO L273 TraceCheckUtils]: 30: Hoare triple {6491#(<= main_~i~0 24)} assume !(~i~0 < 100000); {6466#false} is VALID [2018-11-23 11:55:19,803 INFO L273 TraceCheckUtils]: 31: Hoare triple {6466#false} havoc ~x~0;~x~0 := 0; {6466#false} is VALID [2018-11-23 11:55:19,803 INFO L273 TraceCheckUtils]: 32: Hoare triple {6466#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6466#false} is VALID [2018-11-23 11:55:19,803 INFO L256 TraceCheckUtils]: 33: Hoare triple {6466#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {6466#false} is VALID [2018-11-23 11:55:19,803 INFO L273 TraceCheckUtils]: 34: Hoare triple {6466#false} ~cond := #in~cond; {6466#false} is VALID [2018-11-23 11:55:19,804 INFO L273 TraceCheckUtils]: 35: Hoare triple {6466#false} assume 0 == ~cond; {6466#false} is VALID [2018-11-23 11:55:19,804 INFO L273 TraceCheckUtils]: 36: Hoare triple {6466#false} assume !false; {6466#false} is VALID [2018-11-23 11:55:19,806 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:19,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:19,806 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:55:19,816 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:55:21,229 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-23 11:55:21,230 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:21,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:21,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:21,417 INFO L256 TraceCheckUtils]: 0: Hoare triple {6465#true} call ULTIMATE.init(); {6465#true} is VALID [2018-11-23 11:55:21,418 INFO L273 TraceCheckUtils]: 1: Hoare triple {6465#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6465#true} is VALID [2018-11-23 11:55:21,418 INFO L273 TraceCheckUtils]: 2: Hoare triple {6465#true} assume true; {6465#true} is VALID [2018-11-23 11:55:21,418 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6465#true} {6465#true} #48#return; {6465#true} is VALID [2018-11-23 11:55:21,418 INFO L256 TraceCheckUtils]: 4: Hoare triple {6465#true} call #t~ret2 := main(); {6465#true} is VALID [2018-11-23 11:55:21,419 INFO L273 TraceCheckUtils]: 5: Hoare triple {6465#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6510#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:21,419 INFO L273 TraceCheckUtils]: 6: Hoare triple {6510#(<= 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; {6468#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:21,420 INFO L273 TraceCheckUtils]: 7: Hoare triple {6468#(<= 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; {6469#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:21,420 INFO L273 TraceCheckUtils]: 8: Hoare triple {6469#(<= 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; {6470#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:21,421 INFO L273 TraceCheckUtils]: 9: Hoare triple {6470#(<= 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; {6471#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:21,421 INFO L273 TraceCheckUtils]: 10: Hoare triple {6471#(<= 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; {6472#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:21,422 INFO L273 TraceCheckUtils]: 11: Hoare triple {6472#(<= 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; {6473#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:21,423 INFO L273 TraceCheckUtils]: 12: Hoare triple {6473#(<= 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; {6474#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:21,423 INFO L273 TraceCheckUtils]: 13: Hoare triple {6474#(<= 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; {6475#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:21,424 INFO L273 TraceCheckUtils]: 14: Hoare triple {6475#(<= 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; {6476#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:21,425 INFO L273 TraceCheckUtils]: 15: Hoare triple {6476#(<= 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; {6477#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:21,426 INFO L273 TraceCheckUtils]: 16: Hoare triple {6477#(<= 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; {6478#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:21,427 INFO L273 TraceCheckUtils]: 17: Hoare triple {6478#(<= 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; {6479#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:21,427 INFO L273 TraceCheckUtils]: 18: Hoare triple {6479#(<= 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; {6480#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:21,428 INFO L273 TraceCheckUtils]: 19: Hoare triple {6480#(<= 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; {6481#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:21,429 INFO L273 TraceCheckUtils]: 20: Hoare triple {6481#(<= 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; {6482#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:21,430 INFO L273 TraceCheckUtils]: 21: Hoare triple {6482#(<= 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; {6483#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:21,431 INFO L273 TraceCheckUtils]: 22: Hoare triple {6483#(<= 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; {6484#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:21,432 INFO L273 TraceCheckUtils]: 23: Hoare triple {6484#(<= 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; {6485#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:21,433 INFO L273 TraceCheckUtils]: 24: Hoare triple {6485#(<= 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; {6486#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:21,434 INFO L273 TraceCheckUtils]: 25: Hoare triple {6486#(<= 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; {6487#(<= main_~i~0 20)} is VALID [2018-11-23 11:55:21,435 INFO L273 TraceCheckUtils]: 26: Hoare triple {6487#(<= 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; {6488#(<= main_~i~0 21)} is VALID [2018-11-23 11:55:21,436 INFO L273 TraceCheckUtils]: 27: Hoare triple {6488#(<= 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; {6489#(<= main_~i~0 22)} is VALID [2018-11-23 11:55:21,437 INFO L273 TraceCheckUtils]: 28: Hoare triple {6489#(<= 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; {6490#(<= main_~i~0 23)} is VALID [2018-11-23 11:55:21,437 INFO L273 TraceCheckUtils]: 29: Hoare triple {6490#(<= 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; {6491#(<= main_~i~0 24)} is VALID [2018-11-23 11:55:21,438 INFO L273 TraceCheckUtils]: 30: Hoare triple {6491#(<= main_~i~0 24)} assume !(~i~0 < 100000); {6466#false} is VALID [2018-11-23 11:55:21,438 INFO L273 TraceCheckUtils]: 31: Hoare triple {6466#false} havoc ~x~0;~x~0 := 0; {6466#false} is VALID [2018-11-23 11:55:21,439 INFO L273 TraceCheckUtils]: 32: Hoare triple {6466#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6466#false} is VALID [2018-11-23 11:55:21,439 INFO L256 TraceCheckUtils]: 33: Hoare triple {6466#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {6466#false} is VALID [2018-11-23 11:55:21,439 INFO L273 TraceCheckUtils]: 34: Hoare triple {6466#false} ~cond := #in~cond; {6466#false} is VALID [2018-11-23 11:55:21,439 INFO L273 TraceCheckUtils]: 35: Hoare triple {6466#false} assume 0 == ~cond; {6466#false} is VALID [2018-11-23 11:55:21,439 INFO L273 TraceCheckUtils]: 36: Hoare triple {6466#false} assume !false; {6466#false} is VALID [2018-11-23 11:55:21,441 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:21,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:21,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2018-11-23 11:55:21,463 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 37 [2018-11-23 11:55:21,463 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:21,463 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-23 11:55:21,496 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:21,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-23 11:55:21,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 11:55:21,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-23 11:55:21,498 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 28 states. [2018-11-23 11:55:21,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:21,893 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2018-11-23 11:55:21,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 11:55:21,894 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 37 [2018-11-23 11:55:21,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:21,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:55:21,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 56 transitions. [2018-11-23 11:55:21,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:55:21,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 56 transitions. [2018-11-23 11:55:21,896 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 56 transitions. [2018-11-23 11:55:21,937 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:55:21,938 INFO L225 Difference]: With dead ends: 54 [2018-11-23 11:55:21,938 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 11:55:21,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-23 11:55:21,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 11:55:21,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-23 11:55:21,960 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:21,961 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 43 states. [2018-11-23 11:55:21,961 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2018-11-23 11:55:21,961 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2018-11-23 11:55:21,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:21,962 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-11-23 11:55:21,962 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-11-23 11:55:21,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:21,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:21,962 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2018-11-23 11:55:21,963 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2018-11-23 11:55:21,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:21,963 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-11-23 11:55:21,963 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-11-23 11:55:21,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:21,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:21,964 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:21,964 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:21,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 11:55:21,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-11-23 11:55:21,965 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 37 [2018-11-23 11:55:21,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:21,965 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-11-23 11:55:21,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-23 11:55:21,965 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-11-23 11:55:21,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 11:55:21,965 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:21,965 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:21,966 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:21,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:21,966 INFO L82 PathProgramCache]: Analyzing trace with hash -26286994, now seen corresponding path program 25 times [2018-11-23 11:55:21,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:21,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:21,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:21,967 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:21,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:21,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:22,889 INFO L256 TraceCheckUtils]: 0: Hoare triple {6855#true} call ULTIMATE.init(); {6855#true} is VALID [2018-11-23 11:55:22,889 INFO L273 TraceCheckUtils]: 1: Hoare triple {6855#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6855#true} is VALID [2018-11-23 11:55:22,889 INFO L273 TraceCheckUtils]: 2: Hoare triple {6855#true} assume true; {6855#true} is VALID [2018-11-23 11:55:22,890 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6855#true} {6855#true} #48#return; {6855#true} is VALID [2018-11-23 11:55:22,890 INFO L256 TraceCheckUtils]: 4: Hoare triple {6855#true} call #t~ret2 := main(); {6855#true} is VALID [2018-11-23 11:55:22,892 INFO L273 TraceCheckUtils]: 5: Hoare triple {6855#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6857#(= main_~i~0 0)} is VALID [2018-11-23 11:55:22,893 INFO L273 TraceCheckUtils]: 6: Hoare triple {6857#(= 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; {6858#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:22,895 INFO L273 TraceCheckUtils]: 7: Hoare triple {6858#(<= 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; {6859#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:22,895 INFO L273 TraceCheckUtils]: 8: Hoare triple {6859#(<= 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; {6860#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:22,897 INFO L273 TraceCheckUtils]: 9: Hoare triple {6860#(<= 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; {6861#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:22,899 INFO L273 TraceCheckUtils]: 10: Hoare triple {6861#(<= 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; {6862#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:22,900 INFO L273 TraceCheckUtils]: 11: Hoare triple {6862#(<= 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; {6863#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:22,902 INFO L273 TraceCheckUtils]: 12: Hoare triple {6863#(<= 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; {6864#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:22,902 INFO L273 TraceCheckUtils]: 13: Hoare triple {6864#(<= 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; {6865#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:22,904 INFO L273 TraceCheckUtils]: 14: Hoare triple {6865#(<= 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; {6866#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:22,905 INFO L273 TraceCheckUtils]: 15: Hoare triple {6866#(<= 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; {6867#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:22,906 INFO L273 TraceCheckUtils]: 16: Hoare triple {6867#(<= 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; {6868#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:22,908 INFO L273 TraceCheckUtils]: 17: Hoare triple {6868#(<= 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; {6869#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:22,909 INFO L273 TraceCheckUtils]: 18: Hoare triple {6869#(<= 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; {6870#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:22,911 INFO L273 TraceCheckUtils]: 19: Hoare triple {6870#(<= 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; {6871#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:22,911 INFO L273 TraceCheckUtils]: 20: Hoare triple {6871#(<= 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; {6872#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:22,913 INFO L273 TraceCheckUtils]: 21: Hoare triple {6872#(<= 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; {6873#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:22,913 INFO L273 TraceCheckUtils]: 22: Hoare triple {6873#(<= 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; {6874#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:22,915 INFO L273 TraceCheckUtils]: 23: Hoare triple {6874#(<= 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; {6875#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:22,916 INFO L273 TraceCheckUtils]: 24: Hoare triple {6875#(<= 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; {6876#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:22,917 INFO L273 TraceCheckUtils]: 25: Hoare triple {6876#(<= 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; {6877#(<= main_~i~0 20)} is VALID [2018-11-23 11:55:22,918 INFO L273 TraceCheckUtils]: 26: Hoare triple {6877#(<= 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; {6878#(<= main_~i~0 21)} is VALID [2018-11-23 11:55:22,919 INFO L273 TraceCheckUtils]: 27: Hoare triple {6878#(<= 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; {6879#(<= main_~i~0 22)} is VALID [2018-11-23 11:55:22,920 INFO L273 TraceCheckUtils]: 28: Hoare triple {6879#(<= 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; {6880#(<= main_~i~0 23)} is VALID [2018-11-23 11:55:22,921 INFO L273 TraceCheckUtils]: 29: Hoare triple {6880#(<= 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; {6881#(<= main_~i~0 24)} is VALID [2018-11-23 11:55:22,922 INFO L273 TraceCheckUtils]: 30: Hoare triple {6881#(<= 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; {6882#(<= main_~i~0 25)} is VALID [2018-11-23 11:55:22,923 INFO L273 TraceCheckUtils]: 31: Hoare triple {6882#(<= main_~i~0 25)} assume !(~i~0 < 100000); {6856#false} is VALID [2018-11-23 11:55:22,923 INFO L273 TraceCheckUtils]: 32: Hoare triple {6856#false} havoc ~x~0;~x~0 := 0; {6856#false} is VALID [2018-11-23 11:55:22,923 INFO L273 TraceCheckUtils]: 33: Hoare triple {6856#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6856#false} is VALID [2018-11-23 11:55:22,923 INFO L256 TraceCheckUtils]: 34: Hoare triple {6856#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {6856#false} is VALID [2018-11-23 11:55:22,924 INFO L273 TraceCheckUtils]: 35: Hoare triple {6856#false} ~cond := #in~cond; {6856#false} is VALID [2018-11-23 11:55:22,924 INFO L273 TraceCheckUtils]: 36: Hoare triple {6856#false} assume 0 == ~cond; {6856#false} is VALID [2018-11-23 11:55:22,924 INFO L273 TraceCheckUtils]: 37: Hoare triple {6856#false} assume !false; {6856#false} is VALID [2018-11-23 11:55:22,925 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:22,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:22,926 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:55:22,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:22,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:22,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:22,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:23,154 INFO L256 TraceCheckUtils]: 0: Hoare triple {6855#true} call ULTIMATE.init(); {6855#true} is VALID [2018-11-23 11:55:23,155 INFO L273 TraceCheckUtils]: 1: Hoare triple {6855#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6855#true} is VALID [2018-11-23 11:55:23,155 INFO L273 TraceCheckUtils]: 2: Hoare triple {6855#true} assume true; {6855#true} is VALID [2018-11-23 11:55:23,155 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6855#true} {6855#true} #48#return; {6855#true} is VALID [2018-11-23 11:55:23,156 INFO L256 TraceCheckUtils]: 4: Hoare triple {6855#true} call #t~ret2 := main(); {6855#true} is VALID [2018-11-23 11:55:23,156 INFO L273 TraceCheckUtils]: 5: Hoare triple {6855#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6901#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:23,157 INFO L273 TraceCheckUtils]: 6: Hoare triple {6901#(<= 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; {6858#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:23,158 INFO L273 TraceCheckUtils]: 7: Hoare triple {6858#(<= 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; {6859#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:23,158 INFO L273 TraceCheckUtils]: 8: Hoare triple {6859#(<= 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; {6860#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:23,159 INFO L273 TraceCheckUtils]: 9: Hoare triple {6860#(<= 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; {6861#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:23,160 INFO L273 TraceCheckUtils]: 10: Hoare triple {6861#(<= 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; {6862#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:23,161 INFO L273 TraceCheckUtils]: 11: Hoare triple {6862#(<= 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; {6863#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:23,161 INFO L273 TraceCheckUtils]: 12: Hoare triple {6863#(<= 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; {6864#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:23,162 INFO L273 TraceCheckUtils]: 13: Hoare triple {6864#(<= 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; {6865#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:23,163 INFO L273 TraceCheckUtils]: 14: Hoare triple {6865#(<= 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; {6866#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:23,164 INFO L273 TraceCheckUtils]: 15: Hoare triple {6866#(<= 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; {6867#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:23,165 INFO L273 TraceCheckUtils]: 16: Hoare triple {6867#(<= 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; {6868#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:23,166 INFO L273 TraceCheckUtils]: 17: Hoare triple {6868#(<= 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; {6869#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:23,167 INFO L273 TraceCheckUtils]: 18: Hoare triple {6869#(<= 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; {6870#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:23,168 INFO L273 TraceCheckUtils]: 19: Hoare triple {6870#(<= 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; {6871#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:23,169 INFO L273 TraceCheckUtils]: 20: Hoare triple {6871#(<= 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; {6872#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:23,170 INFO L273 TraceCheckUtils]: 21: Hoare triple {6872#(<= 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; {6873#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:23,170 INFO L273 TraceCheckUtils]: 22: Hoare triple {6873#(<= 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; {6874#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:23,171 INFO L273 TraceCheckUtils]: 23: Hoare triple {6874#(<= 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; {6875#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:23,172 INFO L273 TraceCheckUtils]: 24: Hoare triple {6875#(<= 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; {6876#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:23,173 INFO L273 TraceCheckUtils]: 25: Hoare triple {6876#(<= 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; {6877#(<= main_~i~0 20)} is VALID [2018-11-23 11:55:23,174 INFO L273 TraceCheckUtils]: 26: Hoare triple {6877#(<= 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; {6878#(<= main_~i~0 21)} is VALID [2018-11-23 11:55:23,175 INFO L273 TraceCheckUtils]: 27: Hoare triple {6878#(<= 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; {6879#(<= main_~i~0 22)} is VALID [2018-11-23 11:55:23,176 INFO L273 TraceCheckUtils]: 28: Hoare triple {6879#(<= 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; {6880#(<= main_~i~0 23)} is VALID [2018-11-23 11:55:23,177 INFO L273 TraceCheckUtils]: 29: Hoare triple {6880#(<= 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; {6881#(<= main_~i~0 24)} is VALID [2018-11-23 11:55:23,178 INFO L273 TraceCheckUtils]: 30: Hoare triple {6881#(<= 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; {6882#(<= main_~i~0 25)} is VALID [2018-11-23 11:55:23,178 INFO L273 TraceCheckUtils]: 31: Hoare triple {6882#(<= main_~i~0 25)} assume !(~i~0 < 100000); {6856#false} is VALID [2018-11-23 11:55:23,179 INFO L273 TraceCheckUtils]: 32: Hoare triple {6856#false} havoc ~x~0;~x~0 := 0; {6856#false} is VALID [2018-11-23 11:55:23,179 INFO L273 TraceCheckUtils]: 33: Hoare triple {6856#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6856#false} is VALID [2018-11-23 11:55:23,179 INFO L256 TraceCheckUtils]: 34: Hoare triple {6856#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {6856#false} is VALID [2018-11-23 11:55:23,179 INFO L273 TraceCheckUtils]: 35: Hoare triple {6856#false} ~cond := #in~cond; {6856#false} is VALID [2018-11-23 11:55:23,179 INFO L273 TraceCheckUtils]: 36: Hoare triple {6856#false} assume 0 == ~cond; {6856#false} is VALID [2018-11-23 11:55:23,180 INFO L273 TraceCheckUtils]: 37: Hoare triple {6856#false} assume !false; {6856#false} is VALID [2018-11-23 11:55:23,182 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:23,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:23,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-11-23 11:55:23,201 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 38 [2018-11-23 11:55:23,201 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:23,201 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-23 11:55:23,230 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:23,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 11:55:23,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 11:55:23,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 11:55:23,231 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 29 states. [2018-11-23 11:55:23,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:23,960 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2018-11-23 11:55:23,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 11:55:23,960 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 38 [2018-11-23 11:55:23,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:23,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 11:55:23,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 57 transitions. [2018-11-23 11:55:23,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 11:55:23,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 57 transitions. [2018-11-23 11:55:23,962 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 57 transitions. [2018-11-23 11:55:24,007 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:24,008 INFO L225 Difference]: With dead ends: 55 [2018-11-23 11:55:24,008 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 11:55:24,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 11:55:24,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 11:55:24,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-23 11:55:24,033 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:24,033 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2018-11-23 11:55:24,034 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-23 11:55:24,034 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-23 11:55:24,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:24,035 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2018-11-23 11:55:24,035 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-11-23 11:55:24,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:24,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:24,036 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-23 11:55:24,036 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-23 11:55:24,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:24,037 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2018-11-23 11:55:24,037 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-11-23 11:55:24,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:24,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:24,037 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:24,038 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:24,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 11:55:24,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2018-11-23 11:55:24,038 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 38 [2018-11-23 11:55:24,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:24,039 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2018-11-23 11:55:24,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 11:55:24,039 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-11-23 11:55:24,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 11:55:24,039 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:24,040 INFO L402 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:24,040 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:24,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:24,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1388991794, now seen corresponding path program 26 times [2018-11-23 11:55:24,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:24,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:24,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:24,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:24,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:24,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:25,147 INFO L256 TraceCheckUtils]: 0: Hoare triple {7255#true} call ULTIMATE.init(); {7255#true} is VALID [2018-11-23 11:55:25,147 INFO L273 TraceCheckUtils]: 1: Hoare triple {7255#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7255#true} is VALID [2018-11-23 11:55:25,147 INFO L273 TraceCheckUtils]: 2: Hoare triple {7255#true} assume true; {7255#true} is VALID [2018-11-23 11:55:25,148 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7255#true} {7255#true} #48#return; {7255#true} is VALID [2018-11-23 11:55:25,148 INFO L256 TraceCheckUtils]: 4: Hoare triple {7255#true} call #t~ret2 := main(); {7255#true} is VALID [2018-11-23 11:55:25,148 INFO L273 TraceCheckUtils]: 5: Hoare triple {7255#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7257#(= main_~i~0 0)} is VALID [2018-11-23 11:55:25,149 INFO L273 TraceCheckUtils]: 6: Hoare triple {7257#(= 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; {7258#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:25,150 INFO L273 TraceCheckUtils]: 7: Hoare triple {7258#(<= 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; {7259#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:25,151 INFO L273 TraceCheckUtils]: 8: Hoare triple {7259#(<= 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; {7260#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:25,152 INFO L273 TraceCheckUtils]: 9: Hoare triple {7260#(<= 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; {7261#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:25,153 INFO L273 TraceCheckUtils]: 10: Hoare triple {7261#(<= 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; {7262#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:25,154 INFO L273 TraceCheckUtils]: 11: Hoare triple {7262#(<= 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; {7263#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:25,155 INFO L273 TraceCheckUtils]: 12: Hoare triple {7263#(<= 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; {7264#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:25,156 INFO L273 TraceCheckUtils]: 13: Hoare triple {7264#(<= 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; {7265#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:25,157 INFO L273 TraceCheckUtils]: 14: Hoare triple {7265#(<= 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; {7266#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:25,158 INFO L273 TraceCheckUtils]: 15: Hoare triple {7266#(<= 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; {7267#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:25,177 INFO L273 TraceCheckUtils]: 16: Hoare triple {7267#(<= 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; {7268#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:25,178 INFO L273 TraceCheckUtils]: 17: Hoare triple {7268#(<= 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; {7269#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:25,179 INFO L273 TraceCheckUtils]: 18: Hoare triple {7269#(<= 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; {7270#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:25,179 INFO L273 TraceCheckUtils]: 19: Hoare triple {7270#(<= 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; {7271#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:25,180 INFO L273 TraceCheckUtils]: 20: Hoare triple {7271#(<= 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; {7272#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:25,180 INFO L273 TraceCheckUtils]: 21: Hoare triple {7272#(<= 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; {7273#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:25,181 INFO L273 TraceCheckUtils]: 22: Hoare triple {7273#(<= 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; {7274#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:25,182 INFO L273 TraceCheckUtils]: 23: Hoare triple {7274#(<= 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; {7275#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:25,183 INFO L273 TraceCheckUtils]: 24: Hoare triple {7275#(<= 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; {7276#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:25,184 INFO L273 TraceCheckUtils]: 25: Hoare triple {7276#(<= 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; {7277#(<= main_~i~0 20)} is VALID [2018-11-23 11:55:25,185 INFO L273 TraceCheckUtils]: 26: Hoare triple {7277#(<= 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; {7278#(<= main_~i~0 21)} is VALID [2018-11-23 11:55:25,186 INFO L273 TraceCheckUtils]: 27: Hoare triple {7278#(<= 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; {7279#(<= main_~i~0 22)} is VALID [2018-11-23 11:55:25,187 INFO L273 TraceCheckUtils]: 28: Hoare triple {7279#(<= 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; {7280#(<= main_~i~0 23)} is VALID [2018-11-23 11:55:25,188 INFO L273 TraceCheckUtils]: 29: Hoare triple {7280#(<= 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; {7281#(<= main_~i~0 24)} is VALID [2018-11-23 11:55:25,189 INFO L273 TraceCheckUtils]: 30: Hoare triple {7281#(<= 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; {7282#(<= main_~i~0 25)} is VALID [2018-11-23 11:55:25,190 INFO L273 TraceCheckUtils]: 31: Hoare triple {7282#(<= 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; {7283#(<= main_~i~0 26)} is VALID [2018-11-23 11:55:25,190 INFO L273 TraceCheckUtils]: 32: Hoare triple {7283#(<= main_~i~0 26)} assume !(~i~0 < 100000); {7256#false} is VALID [2018-11-23 11:55:25,191 INFO L273 TraceCheckUtils]: 33: Hoare triple {7256#false} havoc ~x~0;~x~0 := 0; {7256#false} is VALID [2018-11-23 11:55:25,191 INFO L273 TraceCheckUtils]: 34: Hoare triple {7256#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {7256#false} is VALID [2018-11-23 11:55:25,191 INFO L256 TraceCheckUtils]: 35: Hoare triple {7256#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {7256#false} is VALID [2018-11-23 11:55:25,191 INFO L273 TraceCheckUtils]: 36: Hoare triple {7256#false} ~cond := #in~cond; {7256#false} is VALID [2018-11-23 11:55:25,191 INFO L273 TraceCheckUtils]: 37: Hoare triple {7256#false} assume 0 == ~cond; {7256#false} is VALID [2018-11-23 11:55:25,192 INFO L273 TraceCheckUtils]: 38: Hoare triple {7256#false} assume !false; {7256#false} is VALID [2018-11-23 11:55:25,194 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:25,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:25,194 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:55:25,202 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:55:25,228 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:55:25,228 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:25,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:25,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:25,383 INFO L256 TraceCheckUtils]: 0: Hoare triple {7255#true} call ULTIMATE.init(); {7255#true} is VALID [2018-11-23 11:55:25,383 INFO L273 TraceCheckUtils]: 1: Hoare triple {7255#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7255#true} is VALID [2018-11-23 11:55:25,383 INFO L273 TraceCheckUtils]: 2: Hoare triple {7255#true} assume true; {7255#true} is VALID [2018-11-23 11:55:25,384 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7255#true} {7255#true} #48#return; {7255#true} is VALID [2018-11-23 11:55:25,384 INFO L256 TraceCheckUtils]: 4: Hoare triple {7255#true} call #t~ret2 := main(); {7255#true} is VALID [2018-11-23 11:55:25,385 INFO L273 TraceCheckUtils]: 5: Hoare triple {7255#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7302#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:25,385 INFO L273 TraceCheckUtils]: 6: Hoare triple {7302#(<= 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; {7258#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:25,386 INFO L273 TraceCheckUtils]: 7: Hoare triple {7258#(<= 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; {7259#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:25,387 INFO L273 TraceCheckUtils]: 8: Hoare triple {7259#(<= 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; {7260#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:25,387 INFO L273 TraceCheckUtils]: 9: Hoare triple {7260#(<= 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; {7261#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:25,388 INFO L273 TraceCheckUtils]: 10: Hoare triple {7261#(<= 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; {7262#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:25,389 INFO L273 TraceCheckUtils]: 11: Hoare triple {7262#(<= 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; {7263#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:25,390 INFO L273 TraceCheckUtils]: 12: Hoare triple {7263#(<= 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; {7264#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:25,391 INFO L273 TraceCheckUtils]: 13: Hoare triple {7264#(<= 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; {7265#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:25,392 INFO L273 TraceCheckUtils]: 14: Hoare triple {7265#(<= 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; {7266#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:25,393 INFO L273 TraceCheckUtils]: 15: Hoare triple {7266#(<= 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; {7267#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:25,394 INFO L273 TraceCheckUtils]: 16: Hoare triple {7267#(<= 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; {7268#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:25,395 INFO L273 TraceCheckUtils]: 17: Hoare triple {7268#(<= 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; {7269#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:25,396 INFO L273 TraceCheckUtils]: 18: Hoare triple {7269#(<= 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; {7270#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:25,397 INFO L273 TraceCheckUtils]: 19: Hoare triple {7270#(<= 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; {7271#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:25,397 INFO L273 TraceCheckUtils]: 20: Hoare triple {7271#(<= 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; {7272#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:25,398 INFO L273 TraceCheckUtils]: 21: Hoare triple {7272#(<= 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; {7273#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:25,399 INFO L273 TraceCheckUtils]: 22: Hoare triple {7273#(<= 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; {7274#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:25,400 INFO L273 TraceCheckUtils]: 23: Hoare triple {7274#(<= 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; {7275#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:25,401 INFO L273 TraceCheckUtils]: 24: Hoare triple {7275#(<= 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; {7276#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:25,402 INFO L273 TraceCheckUtils]: 25: Hoare triple {7276#(<= 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; {7277#(<= main_~i~0 20)} is VALID [2018-11-23 11:55:25,403 INFO L273 TraceCheckUtils]: 26: Hoare triple {7277#(<= 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; {7278#(<= main_~i~0 21)} is VALID [2018-11-23 11:55:25,404 INFO L273 TraceCheckUtils]: 27: Hoare triple {7278#(<= 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; {7279#(<= main_~i~0 22)} is VALID [2018-11-23 11:55:25,405 INFO L273 TraceCheckUtils]: 28: Hoare triple {7279#(<= 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; {7280#(<= main_~i~0 23)} is VALID [2018-11-23 11:55:25,406 INFO L273 TraceCheckUtils]: 29: Hoare triple {7280#(<= 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; {7281#(<= main_~i~0 24)} is VALID [2018-11-23 11:55:25,407 INFO L273 TraceCheckUtils]: 30: Hoare triple {7281#(<= 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; {7282#(<= main_~i~0 25)} is VALID [2018-11-23 11:55:25,408 INFO L273 TraceCheckUtils]: 31: Hoare triple {7282#(<= 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; {7283#(<= main_~i~0 26)} is VALID [2018-11-23 11:55:25,408 INFO L273 TraceCheckUtils]: 32: Hoare triple {7283#(<= main_~i~0 26)} assume !(~i~0 < 100000); {7256#false} is VALID [2018-11-23 11:55:25,409 INFO L273 TraceCheckUtils]: 33: Hoare triple {7256#false} havoc ~x~0;~x~0 := 0; {7256#false} is VALID [2018-11-23 11:55:25,409 INFO L273 TraceCheckUtils]: 34: Hoare triple {7256#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {7256#false} is VALID [2018-11-23 11:55:25,409 INFO L256 TraceCheckUtils]: 35: Hoare triple {7256#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {7256#false} is VALID [2018-11-23 11:55:25,409 INFO L273 TraceCheckUtils]: 36: Hoare triple {7256#false} ~cond := #in~cond; {7256#false} is VALID [2018-11-23 11:55:25,410 INFO L273 TraceCheckUtils]: 37: Hoare triple {7256#false} assume 0 == ~cond; {7256#false} is VALID [2018-11-23 11:55:25,410 INFO L273 TraceCheckUtils]: 38: Hoare triple {7256#false} assume !false; {7256#false} is VALID [2018-11-23 11:55:25,412 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:25,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:25,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2018-11-23 11:55:25,431 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 39 [2018-11-23 11:55:25,431 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:25,431 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 11:55:25,460 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:55:25,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 11:55:25,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 11:55:25,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 11:55:25,462 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 30 states. [2018-11-23 11:55:25,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:25,914 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2018-11-23 11:55:25,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 11:55:25,914 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 39 [2018-11-23 11:55:25,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:25,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:55:25,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 58 transitions. [2018-11-23 11:55:25,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:55:25,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 58 transitions. [2018-11-23 11:55:25,917 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 58 transitions. [2018-11-23 11:55:26,064 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:26,065 INFO L225 Difference]: With dead ends: 56 [2018-11-23 11:55:26,065 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 11:55:26,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 11:55:26,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 11:55:26,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-23 11:55:26,092 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:26,092 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 45 states. [2018-11-23 11:55:26,092 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2018-11-23 11:55:26,092 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2018-11-23 11:55:26,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:26,093 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-11-23 11:55:26,094 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-11-23 11:55:26,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:26,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:26,094 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2018-11-23 11:55:26,094 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2018-11-23 11:55:26,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:26,095 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-11-23 11:55:26,095 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-11-23 11:55:26,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:26,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:26,096 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:26,096 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:26,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 11:55:26,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-11-23 11:55:26,097 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 39 [2018-11-23 11:55:26,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:26,098 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-11-23 11:55:26,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 11:55:26,098 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-11-23 11:55:26,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 11:55:26,098 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:26,098 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:26,099 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:26,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:26,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1982006034, now seen corresponding path program 27 times [2018-11-23 11:55:26,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:26,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:26,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:26,100 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:26,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:26,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:26,592 INFO L256 TraceCheckUtils]: 0: Hoare triple {7665#true} call ULTIMATE.init(); {7665#true} is VALID [2018-11-23 11:55:26,592 INFO L273 TraceCheckUtils]: 1: Hoare triple {7665#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7665#true} is VALID [2018-11-23 11:55:26,592 INFO L273 TraceCheckUtils]: 2: Hoare triple {7665#true} assume true; {7665#true} is VALID [2018-11-23 11:55:26,592 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7665#true} {7665#true} #48#return; {7665#true} is VALID [2018-11-23 11:55:26,593 INFO L256 TraceCheckUtils]: 4: Hoare triple {7665#true} call #t~ret2 := main(); {7665#true} is VALID [2018-11-23 11:55:26,593 INFO L273 TraceCheckUtils]: 5: Hoare triple {7665#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7667#(= main_~i~0 0)} is VALID [2018-11-23 11:55:26,594 INFO L273 TraceCheckUtils]: 6: Hoare triple {7667#(= 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; {7668#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:26,595 INFO L273 TraceCheckUtils]: 7: Hoare triple {7668#(<= 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; {7669#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:26,596 INFO L273 TraceCheckUtils]: 8: Hoare triple {7669#(<= 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; {7670#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:26,597 INFO L273 TraceCheckUtils]: 9: Hoare triple {7670#(<= 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; {7671#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:26,598 INFO L273 TraceCheckUtils]: 10: Hoare triple {7671#(<= 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; {7672#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:26,599 INFO L273 TraceCheckUtils]: 11: Hoare triple {7672#(<= 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; {7673#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:26,600 INFO L273 TraceCheckUtils]: 12: Hoare triple {7673#(<= 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; {7674#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:26,601 INFO L273 TraceCheckUtils]: 13: Hoare triple {7674#(<= 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; {7675#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:26,602 INFO L273 TraceCheckUtils]: 14: Hoare triple {7675#(<= 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; {7676#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:26,603 INFO L273 TraceCheckUtils]: 15: Hoare triple {7676#(<= 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; {7677#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:26,604 INFO L273 TraceCheckUtils]: 16: Hoare triple {7677#(<= 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; {7678#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:26,605 INFO L273 TraceCheckUtils]: 17: Hoare triple {7678#(<= 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; {7679#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:26,606 INFO L273 TraceCheckUtils]: 18: Hoare triple {7679#(<= 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; {7680#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:26,607 INFO L273 TraceCheckUtils]: 19: Hoare triple {7680#(<= 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; {7681#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:26,608 INFO L273 TraceCheckUtils]: 20: Hoare triple {7681#(<= 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; {7682#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:26,608 INFO L273 TraceCheckUtils]: 21: Hoare triple {7682#(<= 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; {7683#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:26,609 INFO L273 TraceCheckUtils]: 22: Hoare triple {7683#(<= 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; {7684#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:26,610 INFO L273 TraceCheckUtils]: 23: Hoare triple {7684#(<= 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; {7685#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:26,611 INFO L273 TraceCheckUtils]: 24: Hoare triple {7685#(<= 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; {7686#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:26,612 INFO L273 TraceCheckUtils]: 25: Hoare triple {7686#(<= 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; {7687#(<= main_~i~0 20)} is VALID [2018-11-23 11:55:26,613 INFO L273 TraceCheckUtils]: 26: Hoare triple {7687#(<= 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; {7688#(<= main_~i~0 21)} is VALID [2018-11-23 11:55:26,614 INFO L273 TraceCheckUtils]: 27: Hoare triple {7688#(<= 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; {7689#(<= main_~i~0 22)} is VALID [2018-11-23 11:55:26,615 INFO L273 TraceCheckUtils]: 28: Hoare triple {7689#(<= 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; {7690#(<= main_~i~0 23)} is VALID [2018-11-23 11:55:26,616 INFO L273 TraceCheckUtils]: 29: Hoare triple {7690#(<= 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; {7691#(<= main_~i~0 24)} is VALID [2018-11-23 11:55:26,617 INFO L273 TraceCheckUtils]: 30: Hoare triple {7691#(<= 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; {7692#(<= main_~i~0 25)} is VALID [2018-11-23 11:55:26,618 INFO L273 TraceCheckUtils]: 31: Hoare triple {7692#(<= 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; {7693#(<= main_~i~0 26)} is VALID [2018-11-23 11:55:26,619 INFO L273 TraceCheckUtils]: 32: Hoare triple {7693#(<= 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; {7694#(<= main_~i~0 27)} is VALID [2018-11-23 11:55:26,619 INFO L273 TraceCheckUtils]: 33: Hoare triple {7694#(<= main_~i~0 27)} assume !(~i~0 < 100000); {7666#false} is VALID [2018-11-23 11:55:26,620 INFO L273 TraceCheckUtils]: 34: Hoare triple {7666#false} havoc ~x~0;~x~0 := 0; {7666#false} is VALID [2018-11-23 11:55:26,620 INFO L273 TraceCheckUtils]: 35: Hoare triple {7666#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {7666#false} is VALID [2018-11-23 11:55:26,620 INFO L256 TraceCheckUtils]: 36: Hoare triple {7666#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {7666#false} is VALID [2018-11-23 11:55:26,620 INFO L273 TraceCheckUtils]: 37: Hoare triple {7666#false} ~cond := #in~cond; {7666#false} is VALID [2018-11-23 11:55:26,620 INFO L273 TraceCheckUtils]: 38: Hoare triple {7666#false} assume 0 == ~cond; {7666#false} is VALID [2018-11-23 11:55:26,621 INFO L273 TraceCheckUtils]: 39: Hoare triple {7666#false} assume !false; {7666#false} is VALID [2018-11-23 11:55:26,623 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:26,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:26,623 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:55:26,636 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:55:29,834 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-11-23 11:55:29,834 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:29,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:29,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:30,037 INFO L256 TraceCheckUtils]: 0: Hoare triple {7665#true} call ULTIMATE.init(); {7665#true} is VALID [2018-11-23 11:55:30,037 INFO L273 TraceCheckUtils]: 1: Hoare triple {7665#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7665#true} is VALID [2018-11-23 11:55:30,037 INFO L273 TraceCheckUtils]: 2: Hoare triple {7665#true} assume true; {7665#true} is VALID [2018-11-23 11:55:30,038 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7665#true} {7665#true} #48#return; {7665#true} is VALID [2018-11-23 11:55:30,038 INFO L256 TraceCheckUtils]: 4: Hoare triple {7665#true} call #t~ret2 := main(); {7665#true} is VALID [2018-11-23 11:55:30,038 INFO L273 TraceCheckUtils]: 5: Hoare triple {7665#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7713#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:30,039 INFO L273 TraceCheckUtils]: 6: Hoare triple {7713#(<= 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; {7668#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:30,039 INFO L273 TraceCheckUtils]: 7: Hoare triple {7668#(<= 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; {7669#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:30,040 INFO L273 TraceCheckUtils]: 8: Hoare triple {7669#(<= 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; {7670#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:30,041 INFO L273 TraceCheckUtils]: 9: Hoare triple {7670#(<= 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; {7671#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:30,041 INFO L273 TraceCheckUtils]: 10: Hoare triple {7671#(<= 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; {7672#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:30,042 INFO L273 TraceCheckUtils]: 11: Hoare triple {7672#(<= 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; {7673#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:30,043 INFO L273 TraceCheckUtils]: 12: Hoare triple {7673#(<= 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; {7674#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:30,044 INFO L273 TraceCheckUtils]: 13: Hoare triple {7674#(<= 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; {7675#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:30,045 INFO L273 TraceCheckUtils]: 14: Hoare triple {7675#(<= 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; {7676#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:30,046 INFO L273 TraceCheckUtils]: 15: Hoare triple {7676#(<= 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; {7677#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:30,047 INFO L273 TraceCheckUtils]: 16: Hoare triple {7677#(<= 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; {7678#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:30,048 INFO L273 TraceCheckUtils]: 17: Hoare triple {7678#(<= 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; {7679#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:30,049 INFO L273 TraceCheckUtils]: 18: Hoare triple {7679#(<= 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; {7680#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:30,050 INFO L273 TraceCheckUtils]: 19: Hoare triple {7680#(<= 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; {7681#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:30,051 INFO L273 TraceCheckUtils]: 20: Hoare triple {7681#(<= 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; {7682#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:30,052 INFO L273 TraceCheckUtils]: 21: Hoare triple {7682#(<= 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; {7683#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:30,053 INFO L273 TraceCheckUtils]: 22: Hoare triple {7683#(<= 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; {7684#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:30,054 INFO L273 TraceCheckUtils]: 23: Hoare triple {7684#(<= 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; {7685#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:30,054 INFO L273 TraceCheckUtils]: 24: Hoare triple {7685#(<= 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; {7686#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:30,055 INFO L273 TraceCheckUtils]: 25: Hoare triple {7686#(<= 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; {7687#(<= main_~i~0 20)} is VALID [2018-11-23 11:55:30,056 INFO L273 TraceCheckUtils]: 26: Hoare triple {7687#(<= 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; {7688#(<= main_~i~0 21)} is VALID [2018-11-23 11:55:30,057 INFO L273 TraceCheckUtils]: 27: Hoare triple {7688#(<= 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; {7689#(<= main_~i~0 22)} is VALID [2018-11-23 11:55:30,058 INFO L273 TraceCheckUtils]: 28: Hoare triple {7689#(<= 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; {7690#(<= main_~i~0 23)} is VALID [2018-11-23 11:55:30,059 INFO L273 TraceCheckUtils]: 29: Hoare triple {7690#(<= 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; {7691#(<= main_~i~0 24)} is VALID [2018-11-23 11:55:30,060 INFO L273 TraceCheckUtils]: 30: Hoare triple {7691#(<= 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; {7692#(<= main_~i~0 25)} is VALID [2018-11-23 11:55:30,061 INFO L273 TraceCheckUtils]: 31: Hoare triple {7692#(<= 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; {7693#(<= main_~i~0 26)} is VALID [2018-11-23 11:55:30,062 INFO L273 TraceCheckUtils]: 32: Hoare triple {7693#(<= 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; {7694#(<= main_~i~0 27)} is VALID [2018-11-23 11:55:30,063 INFO L273 TraceCheckUtils]: 33: Hoare triple {7694#(<= main_~i~0 27)} assume !(~i~0 < 100000); {7666#false} is VALID [2018-11-23 11:55:30,063 INFO L273 TraceCheckUtils]: 34: Hoare triple {7666#false} havoc ~x~0;~x~0 := 0; {7666#false} is VALID [2018-11-23 11:55:30,063 INFO L273 TraceCheckUtils]: 35: Hoare triple {7666#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {7666#false} is VALID [2018-11-23 11:55:30,063 INFO L256 TraceCheckUtils]: 36: Hoare triple {7666#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {7666#false} is VALID [2018-11-23 11:55:30,063 INFO L273 TraceCheckUtils]: 37: Hoare triple {7666#false} ~cond := #in~cond; {7666#false} is VALID [2018-11-23 11:55:30,064 INFO L273 TraceCheckUtils]: 38: Hoare triple {7666#false} assume 0 == ~cond; {7666#false} is VALID [2018-11-23 11:55:30,064 INFO L273 TraceCheckUtils]: 39: Hoare triple {7666#false} assume !false; {7666#false} is VALID [2018-11-23 11:55:30,066 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:30,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:30,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2018-11-23 11:55:30,087 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 40 [2018-11-23 11:55:30,088 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:30,088 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-23 11:55:30,119 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:55:30,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-23 11:55:30,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 11:55:30,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-23 11:55:30,120 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 31 states. [2018-11-23 11:55:30,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:30,388 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-11-23 11:55:30,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 11:55:30,388 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 40 [2018-11-23 11:55:30,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:30,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 11:55:30,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 59 transitions. [2018-11-23 11:55:30,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 11:55:30,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 59 transitions. [2018-11-23 11:55:30,391 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 59 transitions. [2018-11-23 11:55:30,443 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:30,444 INFO L225 Difference]: With dead ends: 57 [2018-11-23 11:55:30,444 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 11:55:30,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-23 11:55:30,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 11:55:30,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-23 11:55:30,471 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:30,471 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 46 states. [2018-11-23 11:55:30,471 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-23 11:55:30,471 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-23 11:55:30,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:30,472 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2018-11-23 11:55:30,472 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-11-23 11:55:30,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:30,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:30,472 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-23 11:55:30,472 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-23 11:55:30,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:30,473 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2018-11-23 11:55:30,473 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-11-23 11:55:30,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:30,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:30,473 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:30,473 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:30,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 11:55:30,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-11-23 11:55:30,474 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 40 [2018-11-23 11:55:30,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:30,475 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-11-23 11:55:30,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-23 11:55:30,475 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-11-23 11:55:30,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 11:55:30,475 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:30,475 INFO L402 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:30,476 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:30,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:30,476 INFO L82 PathProgramCache]: Analyzing trace with hash 891243698, now seen corresponding path program 28 times [2018-11-23 11:55:30,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:30,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:30,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:30,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:30,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:30,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:30,969 INFO L256 TraceCheckUtils]: 0: Hoare triple {8085#true} call ULTIMATE.init(); {8085#true} is VALID [2018-11-23 11:55:30,970 INFO L273 TraceCheckUtils]: 1: Hoare triple {8085#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8085#true} is VALID [2018-11-23 11:55:30,970 INFO L273 TraceCheckUtils]: 2: Hoare triple {8085#true} assume true; {8085#true} is VALID [2018-11-23 11:55:30,970 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8085#true} {8085#true} #48#return; {8085#true} is VALID [2018-11-23 11:55:30,970 INFO L256 TraceCheckUtils]: 4: Hoare triple {8085#true} call #t~ret2 := main(); {8085#true} is VALID [2018-11-23 11:55:30,971 INFO L273 TraceCheckUtils]: 5: Hoare triple {8085#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8087#(= main_~i~0 0)} is VALID [2018-11-23 11:55:30,972 INFO L273 TraceCheckUtils]: 6: Hoare triple {8087#(= 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; {8088#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:30,972 INFO L273 TraceCheckUtils]: 7: Hoare triple {8088#(<= 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; {8089#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:30,973 INFO L273 TraceCheckUtils]: 8: Hoare triple {8089#(<= 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; {8090#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:30,973 INFO L273 TraceCheckUtils]: 9: Hoare triple {8090#(<= 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; {8091#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:30,974 INFO L273 TraceCheckUtils]: 10: Hoare triple {8091#(<= 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; {8092#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:30,974 INFO L273 TraceCheckUtils]: 11: Hoare triple {8092#(<= 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; {8093#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:30,975 INFO L273 TraceCheckUtils]: 12: Hoare triple {8093#(<= 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; {8094#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:30,976 INFO L273 TraceCheckUtils]: 13: Hoare triple {8094#(<= 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; {8095#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:30,977 INFO L273 TraceCheckUtils]: 14: Hoare triple {8095#(<= 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; {8096#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:30,978 INFO L273 TraceCheckUtils]: 15: Hoare triple {8096#(<= 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; {8097#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:30,979 INFO L273 TraceCheckUtils]: 16: Hoare triple {8097#(<= 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; {8098#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:30,980 INFO L273 TraceCheckUtils]: 17: Hoare triple {8098#(<= 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; {8099#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:30,981 INFO L273 TraceCheckUtils]: 18: Hoare triple {8099#(<= 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; {8100#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:30,982 INFO L273 TraceCheckUtils]: 19: Hoare triple {8100#(<= 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; {8101#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:30,983 INFO L273 TraceCheckUtils]: 20: Hoare triple {8101#(<= 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; {8102#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:30,984 INFO L273 TraceCheckUtils]: 21: Hoare triple {8102#(<= 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; {8103#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:30,985 INFO L273 TraceCheckUtils]: 22: Hoare triple {8103#(<= 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; {8104#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:30,986 INFO L273 TraceCheckUtils]: 23: Hoare triple {8104#(<= 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; {8105#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:30,987 INFO L273 TraceCheckUtils]: 24: Hoare triple {8105#(<= 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; {8106#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:30,988 INFO L273 TraceCheckUtils]: 25: Hoare triple {8106#(<= 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; {8107#(<= main_~i~0 20)} is VALID [2018-11-23 11:55:30,988 INFO L273 TraceCheckUtils]: 26: Hoare triple {8107#(<= 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; {8108#(<= main_~i~0 21)} is VALID [2018-11-23 11:55:30,989 INFO L273 TraceCheckUtils]: 27: Hoare triple {8108#(<= 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; {8109#(<= main_~i~0 22)} is VALID [2018-11-23 11:55:30,990 INFO L273 TraceCheckUtils]: 28: Hoare triple {8109#(<= 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; {8110#(<= main_~i~0 23)} is VALID [2018-11-23 11:55:30,991 INFO L273 TraceCheckUtils]: 29: Hoare triple {8110#(<= 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; {8111#(<= main_~i~0 24)} is VALID [2018-11-23 11:55:30,992 INFO L273 TraceCheckUtils]: 30: Hoare triple {8111#(<= 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; {8112#(<= main_~i~0 25)} is VALID [2018-11-23 11:55:30,993 INFO L273 TraceCheckUtils]: 31: Hoare triple {8112#(<= 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; {8113#(<= main_~i~0 26)} is VALID [2018-11-23 11:55:30,994 INFO L273 TraceCheckUtils]: 32: Hoare triple {8113#(<= 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; {8114#(<= main_~i~0 27)} is VALID [2018-11-23 11:55:30,995 INFO L273 TraceCheckUtils]: 33: Hoare triple {8114#(<= 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; {8115#(<= main_~i~0 28)} is VALID [2018-11-23 11:55:30,996 INFO L273 TraceCheckUtils]: 34: Hoare triple {8115#(<= main_~i~0 28)} assume !(~i~0 < 100000); {8086#false} is VALID [2018-11-23 11:55:30,996 INFO L273 TraceCheckUtils]: 35: Hoare triple {8086#false} havoc ~x~0;~x~0 := 0; {8086#false} is VALID [2018-11-23 11:55:30,996 INFO L273 TraceCheckUtils]: 36: Hoare triple {8086#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {8086#false} is VALID [2018-11-23 11:55:30,996 INFO L256 TraceCheckUtils]: 37: Hoare triple {8086#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {8086#false} is VALID [2018-11-23 11:55:30,997 INFO L273 TraceCheckUtils]: 38: Hoare triple {8086#false} ~cond := #in~cond; {8086#false} is VALID [2018-11-23 11:55:30,997 INFO L273 TraceCheckUtils]: 39: Hoare triple {8086#false} assume 0 == ~cond; {8086#false} is VALID [2018-11-23 11:55:30,997 INFO L273 TraceCheckUtils]: 40: Hoare triple {8086#false} assume !false; {8086#false} is VALID [2018-11-23 11:55:31,000 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:31,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:31,000 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:55:31,008 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:55:31,035 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:55:31,035 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:31,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:31,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:31,253 INFO L256 TraceCheckUtils]: 0: Hoare triple {8085#true} call ULTIMATE.init(); {8085#true} is VALID [2018-11-23 11:55:31,254 INFO L273 TraceCheckUtils]: 1: Hoare triple {8085#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8085#true} is VALID [2018-11-23 11:55:31,254 INFO L273 TraceCheckUtils]: 2: Hoare triple {8085#true} assume true; {8085#true} is VALID [2018-11-23 11:55:31,254 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8085#true} {8085#true} #48#return; {8085#true} is VALID [2018-11-23 11:55:31,254 INFO L256 TraceCheckUtils]: 4: Hoare triple {8085#true} call #t~ret2 := main(); {8085#true} is VALID [2018-11-23 11:55:31,255 INFO L273 TraceCheckUtils]: 5: Hoare triple {8085#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8134#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:31,256 INFO L273 TraceCheckUtils]: 6: Hoare triple {8134#(<= 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; {8088#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:31,257 INFO L273 TraceCheckUtils]: 7: Hoare triple {8088#(<= 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; {8089#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:31,257 INFO L273 TraceCheckUtils]: 8: Hoare triple {8089#(<= 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; {8090#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:31,258 INFO L273 TraceCheckUtils]: 9: Hoare triple {8090#(<= 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; {8091#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:31,259 INFO L273 TraceCheckUtils]: 10: Hoare triple {8091#(<= 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; {8092#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:31,260 INFO L273 TraceCheckUtils]: 11: Hoare triple {8092#(<= 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; {8093#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:31,261 INFO L273 TraceCheckUtils]: 12: Hoare triple {8093#(<= 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; {8094#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:31,261 INFO L273 TraceCheckUtils]: 13: Hoare triple {8094#(<= 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; {8095#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:31,262 INFO L273 TraceCheckUtils]: 14: Hoare triple {8095#(<= 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; {8096#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:31,263 INFO L273 TraceCheckUtils]: 15: Hoare triple {8096#(<= 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; {8097#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:31,264 INFO L273 TraceCheckUtils]: 16: Hoare triple {8097#(<= 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; {8098#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:31,265 INFO L273 TraceCheckUtils]: 17: Hoare triple {8098#(<= 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; {8099#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:31,266 INFO L273 TraceCheckUtils]: 18: Hoare triple {8099#(<= 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; {8100#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:31,267 INFO L273 TraceCheckUtils]: 19: Hoare triple {8100#(<= 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; {8101#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:31,268 INFO L273 TraceCheckUtils]: 20: Hoare triple {8101#(<= 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; {8102#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:31,269 INFO L273 TraceCheckUtils]: 21: Hoare triple {8102#(<= 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; {8103#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:31,270 INFO L273 TraceCheckUtils]: 22: Hoare triple {8103#(<= 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; {8104#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:31,271 INFO L273 TraceCheckUtils]: 23: Hoare triple {8104#(<= 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; {8105#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:31,272 INFO L273 TraceCheckUtils]: 24: Hoare triple {8105#(<= 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; {8106#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:31,273 INFO L273 TraceCheckUtils]: 25: Hoare triple {8106#(<= 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; {8107#(<= main_~i~0 20)} is VALID [2018-11-23 11:55:31,274 INFO L273 TraceCheckUtils]: 26: Hoare triple {8107#(<= 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; {8108#(<= main_~i~0 21)} is VALID [2018-11-23 11:55:31,275 INFO L273 TraceCheckUtils]: 27: Hoare triple {8108#(<= 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; {8109#(<= main_~i~0 22)} is VALID [2018-11-23 11:55:31,275 INFO L273 TraceCheckUtils]: 28: Hoare triple {8109#(<= 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; {8110#(<= main_~i~0 23)} is VALID [2018-11-23 11:55:31,276 INFO L273 TraceCheckUtils]: 29: Hoare triple {8110#(<= 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; {8111#(<= main_~i~0 24)} is VALID [2018-11-23 11:55:31,277 INFO L273 TraceCheckUtils]: 30: Hoare triple {8111#(<= 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; {8112#(<= main_~i~0 25)} is VALID [2018-11-23 11:55:31,278 INFO L273 TraceCheckUtils]: 31: Hoare triple {8112#(<= 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; {8113#(<= main_~i~0 26)} is VALID [2018-11-23 11:55:31,279 INFO L273 TraceCheckUtils]: 32: Hoare triple {8113#(<= 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; {8114#(<= main_~i~0 27)} is VALID [2018-11-23 11:55:31,280 INFO L273 TraceCheckUtils]: 33: Hoare triple {8114#(<= 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; {8115#(<= main_~i~0 28)} is VALID [2018-11-23 11:55:31,281 INFO L273 TraceCheckUtils]: 34: Hoare triple {8115#(<= main_~i~0 28)} assume !(~i~0 < 100000); {8086#false} is VALID [2018-11-23 11:55:31,281 INFO L273 TraceCheckUtils]: 35: Hoare triple {8086#false} havoc ~x~0;~x~0 := 0; {8086#false} is VALID [2018-11-23 11:55:31,281 INFO L273 TraceCheckUtils]: 36: Hoare triple {8086#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {8086#false} is VALID [2018-11-23 11:55:31,281 INFO L256 TraceCheckUtils]: 37: Hoare triple {8086#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {8086#false} is VALID [2018-11-23 11:55:31,282 INFO L273 TraceCheckUtils]: 38: Hoare triple {8086#false} ~cond := #in~cond; {8086#false} is VALID [2018-11-23 11:55:31,282 INFO L273 TraceCheckUtils]: 39: Hoare triple {8086#false} assume 0 == ~cond; {8086#false} is VALID [2018-11-23 11:55:31,282 INFO L273 TraceCheckUtils]: 40: Hoare triple {8086#false} assume !false; {8086#false} is VALID [2018-11-23 11:55:31,284 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:31,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:31,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2018-11-23 11:55:31,304 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 41 [2018-11-23 11:55:31,304 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:31,304 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-23 11:55:31,336 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:55:31,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-23 11:55:31,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-23 11:55:31,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-23 11:55:31,338 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 32 states. [2018-11-23 11:55:31,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:31,831 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2018-11-23 11:55:31,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-23 11:55:31,832 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 41 [2018-11-23 11:55:31,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:31,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 11:55:31,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 60 transitions. [2018-11-23 11:55:31,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 11:55:31,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 60 transitions. [2018-11-23 11:55:31,835 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 60 transitions. [2018-11-23 11:55:31,879 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:31,880 INFO L225 Difference]: With dead ends: 58 [2018-11-23 11:55:31,880 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 11:55:31,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 41 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:55:31,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 11:55:32,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-11-23 11:55:32,038 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:32,038 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 47 states. [2018-11-23 11:55:32,038 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2018-11-23 11:55:32,038 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2018-11-23 11:55:32,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:32,039 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2018-11-23 11:55:32,039 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-11-23 11:55:32,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:32,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:32,040 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2018-11-23 11:55:32,040 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2018-11-23 11:55:32,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:32,040 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2018-11-23 11:55:32,040 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-11-23 11:55:32,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:32,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:32,041 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:32,041 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:32,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 11:55:32,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-11-23 11:55:32,042 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 41 [2018-11-23 11:55:32,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:32,042 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-11-23 11:55:32,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-23 11:55:32,042 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-11-23 11:55:32,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 11:55:32,042 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:32,042 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:32,043 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:32,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:32,043 INFO L82 PathProgramCache]: Analyzing trace with hash -232327826, now seen corresponding path program 29 times [2018-11-23 11:55:32,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:32,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:32,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:32,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:32,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:32,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:32,615 INFO L256 TraceCheckUtils]: 0: Hoare triple {8515#true} call ULTIMATE.init(); {8515#true} is VALID [2018-11-23 11:55:32,616 INFO L273 TraceCheckUtils]: 1: Hoare triple {8515#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8515#true} is VALID [2018-11-23 11:55:32,616 INFO L273 TraceCheckUtils]: 2: Hoare triple {8515#true} assume true; {8515#true} is VALID [2018-11-23 11:55:32,616 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8515#true} {8515#true} #48#return; {8515#true} is VALID [2018-11-23 11:55:32,616 INFO L256 TraceCheckUtils]: 4: Hoare triple {8515#true} call #t~ret2 := main(); {8515#true} is VALID [2018-11-23 11:55:32,617 INFO L273 TraceCheckUtils]: 5: Hoare triple {8515#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8517#(= main_~i~0 0)} is VALID [2018-11-23 11:55:32,617 INFO L273 TraceCheckUtils]: 6: Hoare triple {8517#(= 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; {8518#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:32,618 INFO L273 TraceCheckUtils]: 7: Hoare triple {8518#(<= 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; {8519#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:32,619 INFO L273 TraceCheckUtils]: 8: Hoare triple {8519#(<= 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; {8520#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:32,619 INFO L273 TraceCheckUtils]: 9: Hoare triple {8520#(<= 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; {8521#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:32,620 INFO L273 TraceCheckUtils]: 10: Hoare triple {8521#(<= 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; {8522#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:32,621 INFO L273 TraceCheckUtils]: 11: Hoare triple {8522#(<= 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; {8523#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:32,622 INFO L273 TraceCheckUtils]: 12: Hoare triple {8523#(<= 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; {8524#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:32,623 INFO L273 TraceCheckUtils]: 13: Hoare triple {8524#(<= 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; {8525#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:32,624 INFO L273 TraceCheckUtils]: 14: Hoare triple {8525#(<= 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; {8526#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:32,625 INFO L273 TraceCheckUtils]: 15: Hoare triple {8526#(<= 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; {8527#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:32,626 INFO L273 TraceCheckUtils]: 16: Hoare triple {8527#(<= 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; {8528#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:32,627 INFO L273 TraceCheckUtils]: 17: Hoare triple {8528#(<= 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; {8529#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:32,628 INFO L273 TraceCheckUtils]: 18: Hoare triple {8529#(<= 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; {8530#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:32,629 INFO L273 TraceCheckUtils]: 19: Hoare triple {8530#(<= 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; {8531#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:32,630 INFO L273 TraceCheckUtils]: 20: Hoare triple {8531#(<= 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; {8532#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:32,631 INFO L273 TraceCheckUtils]: 21: Hoare triple {8532#(<= 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; {8533#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:32,632 INFO L273 TraceCheckUtils]: 22: Hoare triple {8533#(<= 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; {8534#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:32,633 INFO L273 TraceCheckUtils]: 23: Hoare triple {8534#(<= 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; {8535#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:32,634 INFO L273 TraceCheckUtils]: 24: Hoare triple {8535#(<= 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; {8536#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:32,635 INFO L273 TraceCheckUtils]: 25: Hoare triple {8536#(<= 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; {8537#(<= main_~i~0 20)} is VALID [2018-11-23 11:55:32,636 INFO L273 TraceCheckUtils]: 26: Hoare triple {8537#(<= 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; {8538#(<= main_~i~0 21)} is VALID [2018-11-23 11:55:32,637 INFO L273 TraceCheckUtils]: 27: Hoare triple {8538#(<= 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; {8539#(<= main_~i~0 22)} is VALID [2018-11-23 11:55:32,639 INFO L273 TraceCheckUtils]: 28: Hoare triple {8539#(<= 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; {8540#(<= main_~i~0 23)} is VALID [2018-11-23 11:55:32,640 INFO L273 TraceCheckUtils]: 29: Hoare triple {8540#(<= 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; {8541#(<= main_~i~0 24)} is VALID [2018-11-23 11:55:32,641 INFO L273 TraceCheckUtils]: 30: Hoare triple {8541#(<= 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; {8542#(<= main_~i~0 25)} is VALID [2018-11-23 11:55:32,642 INFO L273 TraceCheckUtils]: 31: Hoare triple {8542#(<= 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; {8543#(<= main_~i~0 26)} is VALID [2018-11-23 11:55:32,643 INFO L273 TraceCheckUtils]: 32: Hoare triple {8543#(<= 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; {8544#(<= main_~i~0 27)} is VALID [2018-11-23 11:55:32,644 INFO L273 TraceCheckUtils]: 33: Hoare triple {8544#(<= 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; {8545#(<= main_~i~0 28)} is VALID [2018-11-23 11:55:32,645 INFO L273 TraceCheckUtils]: 34: Hoare triple {8545#(<= 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; {8546#(<= main_~i~0 29)} is VALID [2018-11-23 11:55:32,646 INFO L273 TraceCheckUtils]: 35: Hoare triple {8546#(<= main_~i~0 29)} assume !(~i~0 < 100000); {8516#false} is VALID [2018-11-23 11:55:32,646 INFO L273 TraceCheckUtils]: 36: Hoare triple {8516#false} havoc ~x~0;~x~0 := 0; {8516#false} is VALID [2018-11-23 11:55:32,646 INFO L273 TraceCheckUtils]: 37: Hoare triple {8516#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {8516#false} is VALID [2018-11-23 11:55:32,647 INFO L256 TraceCheckUtils]: 38: Hoare triple {8516#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {8516#false} is VALID [2018-11-23 11:55:32,647 INFO L273 TraceCheckUtils]: 39: Hoare triple {8516#false} ~cond := #in~cond; {8516#false} is VALID [2018-11-23 11:55:32,647 INFO L273 TraceCheckUtils]: 40: Hoare triple {8516#false} assume 0 == ~cond; {8516#false} is VALID [2018-11-23 11:55:32,647 INFO L273 TraceCheckUtils]: 41: Hoare triple {8516#false} assume !false; {8516#false} is VALID [2018-11-23 11:55:32,650 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:32,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:32,651 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:55:32,660 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:55:33,043 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2018-11-23 11:55:33,043 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:33,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:33,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:33,404 INFO L256 TraceCheckUtils]: 0: Hoare triple {8515#true} call ULTIMATE.init(); {8515#true} is VALID [2018-11-23 11:55:33,405 INFO L273 TraceCheckUtils]: 1: Hoare triple {8515#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8515#true} is VALID [2018-11-23 11:55:33,405 INFO L273 TraceCheckUtils]: 2: Hoare triple {8515#true} assume true; {8515#true} is VALID [2018-11-23 11:55:33,405 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8515#true} {8515#true} #48#return; {8515#true} is VALID [2018-11-23 11:55:33,406 INFO L256 TraceCheckUtils]: 4: Hoare triple {8515#true} call #t~ret2 := main(); {8515#true} is VALID [2018-11-23 11:55:33,406 INFO L273 TraceCheckUtils]: 5: Hoare triple {8515#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8565#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:33,407 INFO L273 TraceCheckUtils]: 6: Hoare triple {8565#(<= 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; {8518#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:33,408 INFO L273 TraceCheckUtils]: 7: Hoare triple {8518#(<= 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; {8519#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:33,409 INFO L273 TraceCheckUtils]: 8: Hoare triple {8519#(<= 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; {8520#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:33,409 INFO L273 TraceCheckUtils]: 9: Hoare triple {8520#(<= 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; {8521#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:33,410 INFO L273 TraceCheckUtils]: 10: Hoare triple {8521#(<= 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; {8522#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:33,411 INFO L273 TraceCheckUtils]: 11: Hoare triple {8522#(<= 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; {8523#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:33,412 INFO L273 TraceCheckUtils]: 12: Hoare triple {8523#(<= 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; {8524#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:33,413 INFO L273 TraceCheckUtils]: 13: Hoare triple {8524#(<= 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; {8525#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:33,414 INFO L273 TraceCheckUtils]: 14: Hoare triple {8525#(<= 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; {8526#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:33,428 INFO L273 TraceCheckUtils]: 15: Hoare triple {8526#(<= 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; {8527#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:33,429 INFO L273 TraceCheckUtils]: 16: Hoare triple {8527#(<= 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; {8528#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:33,430 INFO L273 TraceCheckUtils]: 17: Hoare triple {8528#(<= 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; {8529#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:33,431 INFO L273 TraceCheckUtils]: 18: Hoare triple {8529#(<= 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; {8530#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:33,431 INFO L273 TraceCheckUtils]: 19: Hoare triple {8530#(<= 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; {8531#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:33,432 INFO L273 TraceCheckUtils]: 20: Hoare triple {8531#(<= 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; {8532#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:33,433 INFO L273 TraceCheckUtils]: 21: Hoare triple {8532#(<= 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; {8533#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:33,434 INFO L273 TraceCheckUtils]: 22: Hoare triple {8533#(<= 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; {8534#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:33,435 INFO L273 TraceCheckUtils]: 23: Hoare triple {8534#(<= 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; {8535#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:33,436 INFO L273 TraceCheckUtils]: 24: Hoare triple {8535#(<= 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; {8536#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:33,437 INFO L273 TraceCheckUtils]: 25: Hoare triple {8536#(<= 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; {8537#(<= main_~i~0 20)} is VALID [2018-11-23 11:55:33,438 INFO L273 TraceCheckUtils]: 26: Hoare triple {8537#(<= 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; {8538#(<= main_~i~0 21)} is VALID [2018-11-23 11:55:33,439 INFO L273 TraceCheckUtils]: 27: Hoare triple {8538#(<= 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; {8539#(<= main_~i~0 22)} is VALID [2018-11-23 11:55:33,440 INFO L273 TraceCheckUtils]: 28: Hoare triple {8539#(<= 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; {8540#(<= main_~i~0 23)} is VALID [2018-11-23 11:55:33,441 INFO L273 TraceCheckUtils]: 29: Hoare triple {8540#(<= 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; {8541#(<= main_~i~0 24)} is VALID [2018-11-23 11:55:33,442 INFO L273 TraceCheckUtils]: 30: Hoare triple {8541#(<= 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; {8542#(<= main_~i~0 25)} is VALID [2018-11-23 11:55:33,443 INFO L273 TraceCheckUtils]: 31: Hoare triple {8542#(<= 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; {8543#(<= main_~i~0 26)} is VALID [2018-11-23 11:55:33,445 INFO L273 TraceCheckUtils]: 32: Hoare triple {8543#(<= 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; {8544#(<= main_~i~0 27)} is VALID [2018-11-23 11:55:33,446 INFO L273 TraceCheckUtils]: 33: Hoare triple {8544#(<= 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; {8545#(<= main_~i~0 28)} is VALID [2018-11-23 11:55:33,447 INFO L273 TraceCheckUtils]: 34: Hoare triple {8545#(<= 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; {8546#(<= main_~i~0 29)} is VALID [2018-11-23 11:55:33,447 INFO L273 TraceCheckUtils]: 35: Hoare triple {8546#(<= main_~i~0 29)} assume !(~i~0 < 100000); {8516#false} is VALID [2018-11-23 11:55:33,448 INFO L273 TraceCheckUtils]: 36: Hoare triple {8516#false} havoc ~x~0;~x~0 := 0; {8516#false} is VALID [2018-11-23 11:55:33,448 INFO L273 TraceCheckUtils]: 37: Hoare triple {8516#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {8516#false} is VALID [2018-11-23 11:55:33,448 INFO L256 TraceCheckUtils]: 38: Hoare triple {8516#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {8516#false} is VALID [2018-11-23 11:55:33,449 INFO L273 TraceCheckUtils]: 39: Hoare triple {8516#false} ~cond := #in~cond; {8516#false} is VALID [2018-11-23 11:55:33,449 INFO L273 TraceCheckUtils]: 40: Hoare triple {8516#false} assume 0 == ~cond; {8516#false} is VALID [2018-11-23 11:55:33,449 INFO L273 TraceCheckUtils]: 41: Hoare triple {8516#false} assume !false; {8516#false} is VALID [2018-11-23 11:55:33,453 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:33,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:33,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2018-11-23 11:55:33,474 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 42 [2018-11-23 11:55:33,474 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:33,475 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2018-11-23 11:55:33,512 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:55:33,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-23 11:55:33,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-23 11:55:33,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 11:55:33,514 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 33 states. [2018-11-23 11:55:34,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:34,213 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2018-11-23 11:55:34,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-23 11:55:34,213 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 42 [2018-11-23 11:55:34,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:34,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 11:55:34,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 61 transitions. [2018-11-23 11:55:34,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 11:55:34,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 61 transitions. [2018-11-23 11:55:34,216 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 61 transitions. [2018-11-23 11:55:34,262 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:34,263 INFO L225 Difference]: With dead ends: 59 [2018-11-23 11:55:34,264 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 11:55:34,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 11:55:34,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 11:55:34,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-23 11:55:34,298 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:34,298 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 48 states. [2018-11-23 11:55:34,298 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2018-11-23 11:55:34,298 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2018-11-23 11:55:34,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:34,299 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2018-11-23 11:55:34,300 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-11-23 11:55:34,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:34,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:34,300 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2018-11-23 11:55:34,300 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2018-11-23 11:55:34,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:34,301 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2018-11-23 11:55:34,301 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-11-23 11:55:34,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:34,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:34,301 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:34,302 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:34,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 11:55:34,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-11-23 11:55:34,302 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 42 [2018-11-23 11:55:34,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:34,303 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-11-23 11:55:34,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-23 11:55:34,303 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-11-23 11:55:34,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 11:55:34,303 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:34,303 INFO L402 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:34,303 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:34,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:34,304 INFO L82 PathProgramCache]: Analyzing trace with hash -703306702, now seen corresponding path program 30 times [2018-11-23 11:55:34,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:34,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:34,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:34,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:34,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:34,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:35,068 INFO L256 TraceCheckUtils]: 0: Hoare triple {8955#true} call ULTIMATE.init(); {8955#true} is VALID [2018-11-23 11:55:35,069 INFO L273 TraceCheckUtils]: 1: Hoare triple {8955#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8955#true} is VALID [2018-11-23 11:55:35,069 INFO L273 TraceCheckUtils]: 2: Hoare triple {8955#true} assume true; {8955#true} is VALID [2018-11-23 11:55:35,069 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8955#true} {8955#true} #48#return; {8955#true} is VALID [2018-11-23 11:55:35,069 INFO L256 TraceCheckUtils]: 4: Hoare triple {8955#true} call #t~ret2 := main(); {8955#true} is VALID [2018-11-23 11:55:35,070 INFO L273 TraceCheckUtils]: 5: Hoare triple {8955#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8957#(= main_~i~0 0)} is VALID [2018-11-23 11:55:35,071 INFO L273 TraceCheckUtils]: 6: Hoare triple {8957#(= 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; {8958#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:35,072 INFO L273 TraceCheckUtils]: 7: Hoare triple {8958#(<= 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; {8959#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:35,073 INFO L273 TraceCheckUtils]: 8: Hoare triple {8959#(<= 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; {8960#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:35,074 INFO L273 TraceCheckUtils]: 9: Hoare triple {8960#(<= 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; {8961#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:35,074 INFO L273 TraceCheckUtils]: 10: Hoare triple {8961#(<= 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; {8962#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:35,075 INFO L273 TraceCheckUtils]: 11: Hoare triple {8962#(<= 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; {8963#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:35,076 INFO L273 TraceCheckUtils]: 12: Hoare triple {8963#(<= 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; {8964#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:35,077 INFO L273 TraceCheckUtils]: 13: Hoare triple {8964#(<= 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; {8965#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:35,078 INFO L273 TraceCheckUtils]: 14: Hoare triple {8965#(<= 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; {8966#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:35,079 INFO L273 TraceCheckUtils]: 15: Hoare triple {8966#(<= 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; {8967#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:35,080 INFO L273 TraceCheckUtils]: 16: Hoare triple {8967#(<= 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; {8968#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:35,081 INFO L273 TraceCheckUtils]: 17: Hoare triple {8968#(<= 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; {8969#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:35,082 INFO L273 TraceCheckUtils]: 18: Hoare triple {8969#(<= 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; {8970#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:35,083 INFO L273 TraceCheckUtils]: 19: Hoare triple {8970#(<= 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; {8971#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:35,084 INFO L273 TraceCheckUtils]: 20: Hoare triple {8971#(<= 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; {8972#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:35,085 INFO L273 TraceCheckUtils]: 21: Hoare triple {8972#(<= 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; {8973#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:35,086 INFO L273 TraceCheckUtils]: 22: Hoare triple {8973#(<= 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; {8974#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:35,087 INFO L273 TraceCheckUtils]: 23: Hoare triple {8974#(<= 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; {8975#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:35,088 INFO L273 TraceCheckUtils]: 24: Hoare triple {8975#(<= 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; {8976#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:35,088 INFO L273 TraceCheckUtils]: 25: Hoare triple {8976#(<= 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; {8977#(<= main_~i~0 20)} is VALID [2018-11-23 11:55:35,089 INFO L273 TraceCheckUtils]: 26: Hoare triple {8977#(<= 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; {8978#(<= main_~i~0 21)} is VALID [2018-11-23 11:55:35,090 INFO L273 TraceCheckUtils]: 27: Hoare triple {8978#(<= 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; {8979#(<= main_~i~0 22)} is VALID [2018-11-23 11:55:35,091 INFO L273 TraceCheckUtils]: 28: Hoare triple {8979#(<= 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; {8980#(<= main_~i~0 23)} is VALID [2018-11-23 11:55:35,092 INFO L273 TraceCheckUtils]: 29: Hoare triple {8980#(<= 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; {8981#(<= main_~i~0 24)} is VALID [2018-11-23 11:55:35,093 INFO L273 TraceCheckUtils]: 30: Hoare triple {8981#(<= 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; {8982#(<= main_~i~0 25)} is VALID [2018-11-23 11:55:35,094 INFO L273 TraceCheckUtils]: 31: Hoare triple {8982#(<= 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; {8983#(<= main_~i~0 26)} is VALID [2018-11-23 11:55:35,095 INFO L273 TraceCheckUtils]: 32: Hoare triple {8983#(<= 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; {8984#(<= main_~i~0 27)} is VALID [2018-11-23 11:55:35,096 INFO L273 TraceCheckUtils]: 33: Hoare triple {8984#(<= 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; {8985#(<= main_~i~0 28)} is VALID [2018-11-23 11:55:35,097 INFO L273 TraceCheckUtils]: 34: Hoare triple {8985#(<= 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; {8986#(<= main_~i~0 29)} is VALID [2018-11-23 11:55:35,098 INFO L273 TraceCheckUtils]: 35: Hoare triple {8986#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8987#(<= main_~i~0 30)} is VALID [2018-11-23 11:55:35,099 INFO L273 TraceCheckUtils]: 36: Hoare triple {8987#(<= main_~i~0 30)} assume !(~i~0 < 100000); {8956#false} is VALID [2018-11-23 11:55:35,099 INFO L273 TraceCheckUtils]: 37: Hoare triple {8956#false} havoc ~x~0;~x~0 := 0; {8956#false} is VALID [2018-11-23 11:55:35,099 INFO L273 TraceCheckUtils]: 38: Hoare triple {8956#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {8956#false} is VALID [2018-11-23 11:55:35,099 INFO L256 TraceCheckUtils]: 39: Hoare triple {8956#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {8956#false} is VALID [2018-11-23 11:55:35,099 INFO L273 TraceCheckUtils]: 40: Hoare triple {8956#false} ~cond := #in~cond; {8956#false} is VALID [2018-11-23 11:55:35,100 INFO L273 TraceCheckUtils]: 41: Hoare triple {8956#false} assume 0 == ~cond; {8956#false} is VALID [2018-11-23 11:55:35,100 INFO L273 TraceCheckUtils]: 42: Hoare triple {8956#false} assume !false; {8956#false} is VALID [2018-11-23 11:55:35,102 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:35,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:35,102 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:35,111 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:55:37,930 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2018-11-23 11:55:37,930 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:37,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:37,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:38,391 INFO L256 TraceCheckUtils]: 0: Hoare triple {8955#true} call ULTIMATE.init(); {8955#true} is VALID [2018-11-23 11:55:38,391 INFO L273 TraceCheckUtils]: 1: Hoare triple {8955#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8955#true} is VALID [2018-11-23 11:55:38,391 INFO L273 TraceCheckUtils]: 2: Hoare triple {8955#true} assume true; {8955#true} is VALID [2018-11-23 11:55:38,391 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8955#true} {8955#true} #48#return; {8955#true} is VALID [2018-11-23 11:55:38,391 INFO L256 TraceCheckUtils]: 4: Hoare triple {8955#true} call #t~ret2 := main(); {8955#true} is VALID [2018-11-23 11:55:38,392 INFO L273 TraceCheckUtils]: 5: Hoare triple {8955#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {9006#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:38,393 INFO L273 TraceCheckUtils]: 6: Hoare triple {9006#(<= 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; {8958#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:38,393 INFO L273 TraceCheckUtils]: 7: Hoare triple {8958#(<= 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; {8959#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:38,395 INFO L273 TraceCheckUtils]: 8: Hoare triple {8959#(<= 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; {8960#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:38,396 INFO L273 TraceCheckUtils]: 9: Hoare triple {8960#(<= 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; {8961#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:38,397 INFO L273 TraceCheckUtils]: 10: Hoare triple {8961#(<= 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; {8962#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:38,398 INFO L273 TraceCheckUtils]: 11: Hoare triple {8962#(<= 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; {8963#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:38,398 INFO L273 TraceCheckUtils]: 12: Hoare triple {8963#(<= 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; {8964#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:38,399 INFO L273 TraceCheckUtils]: 13: Hoare triple {8964#(<= 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; {8965#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:38,400 INFO L273 TraceCheckUtils]: 14: Hoare triple {8965#(<= 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; {8966#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:38,401 INFO L273 TraceCheckUtils]: 15: Hoare triple {8966#(<= 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; {8967#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:38,402 INFO L273 TraceCheckUtils]: 16: Hoare triple {8967#(<= 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; {8968#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:38,403 INFO L273 TraceCheckUtils]: 17: Hoare triple {8968#(<= 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; {8969#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:38,404 INFO L273 TraceCheckUtils]: 18: Hoare triple {8969#(<= 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; {8970#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:38,405 INFO L273 TraceCheckUtils]: 19: Hoare triple {8970#(<= 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; {8971#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:38,406 INFO L273 TraceCheckUtils]: 20: Hoare triple {8971#(<= 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; {8972#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:38,407 INFO L273 TraceCheckUtils]: 21: Hoare triple {8972#(<= 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; {8973#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:38,408 INFO L273 TraceCheckUtils]: 22: Hoare triple {8973#(<= 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; {8974#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:38,409 INFO L273 TraceCheckUtils]: 23: Hoare triple {8974#(<= 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; {8975#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:38,410 INFO L273 TraceCheckUtils]: 24: Hoare triple {8975#(<= 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; {8976#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:38,411 INFO L273 TraceCheckUtils]: 25: Hoare triple {8976#(<= 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; {8977#(<= main_~i~0 20)} is VALID [2018-11-23 11:55:38,412 INFO L273 TraceCheckUtils]: 26: Hoare triple {8977#(<= 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; {8978#(<= main_~i~0 21)} is VALID [2018-11-23 11:55:38,413 INFO L273 TraceCheckUtils]: 27: Hoare triple {8978#(<= 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; {8979#(<= main_~i~0 22)} is VALID [2018-11-23 11:55:38,414 INFO L273 TraceCheckUtils]: 28: Hoare triple {8979#(<= 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; {8980#(<= main_~i~0 23)} is VALID [2018-11-23 11:55:38,415 INFO L273 TraceCheckUtils]: 29: Hoare triple {8980#(<= 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; {8981#(<= main_~i~0 24)} is VALID [2018-11-23 11:55:38,415 INFO L273 TraceCheckUtils]: 30: Hoare triple {8981#(<= 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; {8982#(<= main_~i~0 25)} is VALID [2018-11-23 11:55:38,416 INFO L273 TraceCheckUtils]: 31: Hoare triple {8982#(<= 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; {8983#(<= main_~i~0 26)} is VALID [2018-11-23 11:55:38,417 INFO L273 TraceCheckUtils]: 32: Hoare triple {8983#(<= 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; {8984#(<= main_~i~0 27)} is VALID [2018-11-23 11:55:38,418 INFO L273 TraceCheckUtils]: 33: Hoare triple {8984#(<= 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; {8985#(<= main_~i~0 28)} is VALID [2018-11-23 11:55:38,419 INFO L273 TraceCheckUtils]: 34: Hoare triple {8985#(<= 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; {8986#(<= main_~i~0 29)} is VALID [2018-11-23 11:55:38,420 INFO L273 TraceCheckUtils]: 35: Hoare triple {8986#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8987#(<= main_~i~0 30)} is VALID [2018-11-23 11:55:38,421 INFO L273 TraceCheckUtils]: 36: Hoare triple {8987#(<= main_~i~0 30)} assume !(~i~0 < 100000); {8956#false} is VALID [2018-11-23 11:55:38,421 INFO L273 TraceCheckUtils]: 37: Hoare triple {8956#false} havoc ~x~0;~x~0 := 0; {8956#false} is VALID [2018-11-23 11:55:38,421 INFO L273 TraceCheckUtils]: 38: Hoare triple {8956#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {8956#false} is VALID [2018-11-23 11:55:38,422 INFO L256 TraceCheckUtils]: 39: Hoare triple {8956#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {8956#false} is VALID [2018-11-23 11:55:38,422 INFO L273 TraceCheckUtils]: 40: Hoare triple {8956#false} ~cond := #in~cond; {8956#false} is VALID [2018-11-23 11:55:38,422 INFO L273 TraceCheckUtils]: 41: Hoare triple {8956#false} assume 0 == ~cond; {8956#false} is VALID [2018-11-23 11:55:38,422 INFO L273 TraceCheckUtils]: 42: Hoare triple {8956#false} assume !false; {8956#false} is VALID [2018-11-23 11:55:38,425 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:38,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:38,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2018-11-23 11:55:38,446 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 43 [2018-11-23 11:55:38,446 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:38,446 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-23 11:55:38,480 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:38,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-23 11:55:38,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-23 11:55:38,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 11:55:38,482 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 34 states. [2018-11-23 11:55:39,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:39,141 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-11-23 11:55:39,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-23 11:55:39,141 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 43 [2018-11-23 11:55:39,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:39,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 11:55:39,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 62 transitions. [2018-11-23 11:55:39,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 11:55:39,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 62 transitions. [2018-11-23 11:55:39,145 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 62 transitions. [2018-11-23 11:55:39,191 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:39,192 INFO L225 Difference]: With dead ends: 60 [2018-11-23 11:55:39,192 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 11:55:39,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 11:55:39,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 11:55:39,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-11-23 11:55:39,218 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:39,218 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 49 states. [2018-11-23 11:55:39,219 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2018-11-23 11:55:39,219 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2018-11-23 11:55:39,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:39,220 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-11-23 11:55:39,220 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-11-23 11:55:39,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:39,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:39,221 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2018-11-23 11:55:39,221 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2018-11-23 11:55:39,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:39,222 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-11-23 11:55:39,222 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-11-23 11:55:39,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:39,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:39,223 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:39,223 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:39,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 11:55:39,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-11-23 11:55:39,224 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 43 [2018-11-23 11:55:39,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:39,224 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-11-23 11:55:39,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-23 11:55:39,224 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-11-23 11:55:39,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 11:55:39,225 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:39,225 INFO L402 BasicCegarLoop]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:39,225 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:39,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:39,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1876217326, now seen corresponding path program 31 times [2018-11-23 11:55:39,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:39,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:39,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:39,227 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:39,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:39,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:39,905 INFO L256 TraceCheckUtils]: 0: Hoare triple {9405#true} call ULTIMATE.init(); {9405#true} is VALID [2018-11-23 11:55:39,905 INFO L273 TraceCheckUtils]: 1: Hoare triple {9405#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9405#true} is VALID [2018-11-23 11:55:39,906 INFO L273 TraceCheckUtils]: 2: Hoare triple {9405#true} assume true; {9405#true} is VALID [2018-11-23 11:55:39,906 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9405#true} {9405#true} #48#return; {9405#true} is VALID [2018-11-23 11:55:39,906 INFO L256 TraceCheckUtils]: 4: Hoare triple {9405#true} call #t~ret2 := main(); {9405#true} is VALID [2018-11-23 11:55:39,907 INFO L273 TraceCheckUtils]: 5: Hoare triple {9405#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {9407#(= main_~i~0 0)} is VALID [2018-11-23 11:55:39,908 INFO L273 TraceCheckUtils]: 6: Hoare triple {9407#(= 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; {9408#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:39,908 INFO L273 TraceCheckUtils]: 7: Hoare triple {9408#(<= 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; {9409#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:39,909 INFO L273 TraceCheckUtils]: 8: Hoare triple {9409#(<= 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; {9410#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:39,910 INFO L273 TraceCheckUtils]: 9: Hoare triple {9410#(<= 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; {9411#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:39,911 INFO L273 TraceCheckUtils]: 10: Hoare triple {9411#(<= 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; {9412#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:39,912 INFO L273 TraceCheckUtils]: 11: Hoare triple {9412#(<= 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; {9413#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:39,913 INFO L273 TraceCheckUtils]: 12: Hoare triple {9413#(<= 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; {9414#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:39,914 INFO L273 TraceCheckUtils]: 13: Hoare triple {9414#(<= 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; {9415#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:39,915 INFO L273 TraceCheckUtils]: 14: Hoare triple {9415#(<= 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; {9416#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:39,916 INFO L273 TraceCheckUtils]: 15: Hoare triple {9416#(<= 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; {9417#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:39,917 INFO L273 TraceCheckUtils]: 16: Hoare triple {9417#(<= 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; {9418#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:39,918 INFO L273 TraceCheckUtils]: 17: Hoare triple {9418#(<= 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; {9419#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:39,919 INFO L273 TraceCheckUtils]: 18: Hoare triple {9419#(<= 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; {9420#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:39,920 INFO L273 TraceCheckUtils]: 19: Hoare triple {9420#(<= 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; {9421#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:39,921 INFO L273 TraceCheckUtils]: 20: Hoare triple {9421#(<= 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; {9422#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:39,922 INFO L273 TraceCheckUtils]: 21: Hoare triple {9422#(<= 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; {9423#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:39,923 INFO L273 TraceCheckUtils]: 22: Hoare triple {9423#(<= 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; {9424#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:39,923 INFO L273 TraceCheckUtils]: 23: Hoare triple {9424#(<= 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; {9425#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:39,924 INFO L273 TraceCheckUtils]: 24: Hoare triple {9425#(<= 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; {9426#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:39,925 INFO L273 TraceCheckUtils]: 25: Hoare triple {9426#(<= 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; {9427#(<= main_~i~0 20)} is VALID [2018-11-23 11:55:39,926 INFO L273 TraceCheckUtils]: 26: Hoare triple {9427#(<= 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; {9428#(<= main_~i~0 21)} is VALID [2018-11-23 11:55:39,927 INFO L273 TraceCheckUtils]: 27: Hoare triple {9428#(<= 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; {9429#(<= main_~i~0 22)} is VALID [2018-11-23 11:55:39,928 INFO L273 TraceCheckUtils]: 28: Hoare triple {9429#(<= 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; {9430#(<= main_~i~0 23)} is VALID [2018-11-23 11:55:39,929 INFO L273 TraceCheckUtils]: 29: Hoare triple {9430#(<= 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; {9431#(<= main_~i~0 24)} is VALID [2018-11-23 11:55:39,930 INFO L273 TraceCheckUtils]: 30: Hoare triple {9431#(<= 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; {9432#(<= main_~i~0 25)} is VALID [2018-11-23 11:55:39,931 INFO L273 TraceCheckUtils]: 31: Hoare triple {9432#(<= 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; {9433#(<= main_~i~0 26)} is VALID [2018-11-23 11:55:39,932 INFO L273 TraceCheckUtils]: 32: Hoare triple {9433#(<= 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; {9434#(<= main_~i~0 27)} is VALID [2018-11-23 11:55:39,933 INFO L273 TraceCheckUtils]: 33: Hoare triple {9434#(<= 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; {9435#(<= main_~i~0 28)} is VALID [2018-11-23 11:55:39,934 INFO L273 TraceCheckUtils]: 34: Hoare triple {9435#(<= 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; {9436#(<= main_~i~0 29)} is VALID [2018-11-23 11:55:39,935 INFO L273 TraceCheckUtils]: 35: Hoare triple {9436#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9437#(<= main_~i~0 30)} is VALID [2018-11-23 11:55:39,936 INFO L273 TraceCheckUtils]: 36: Hoare triple {9437#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9438#(<= main_~i~0 31)} is VALID [2018-11-23 11:55:39,936 INFO L273 TraceCheckUtils]: 37: Hoare triple {9438#(<= main_~i~0 31)} assume !(~i~0 < 100000); {9406#false} is VALID [2018-11-23 11:55:39,937 INFO L273 TraceCheckUtils]: 38: Hoare triple {9406#false} havoc ~x~0;~x~0 := 0; {9406#false} is VALID [2018-11-23 11:55:39,937 INFO L273 TraceCheckUtils]: 39: Hoare triple {9406#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {9406#false} is VALID [2018-11-23 11:55:39,937 INFO L256 TraceCheckUtils]: 40: Hoare triple {9406#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {9406#false} is VALID [2018-11-23 11:55:39,937 INFO L273 TraceCheckUtils]: 41: Hoare triple {9406#false} ~cond := #in~cond; {9406#false} is VALID [2018-11-23 11:55:39,937 INFO L273 TraceCheckUtils]: 42: Hoare triple {9406#false} assume 0 == ~cond; {9406#false} is VALID [2018-11-23 11:55:39,938 INFO L273 TraceCheckUtils]: 43: Hoare triple {9406#false} assume !false; {9406#false} is VALID [2018-11-23 11:55:39,940 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:39,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:39,940 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:39,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:39,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:39,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:39,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:40,176 INFO L256 TraceCheckUtils]: 0: Hoare triple {9405#true} call ULTIMATE.init(); {9405#true} is VALID [2018-11-23 11:55:40,177 INFO L273 TraceCheckUtils]: 1: Hoare triple {9405#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9405#true} is VALID [2018-11-23 11:55:40,177 INFO L273 TraceCheckUtils]: 2: Hoare triple {9405#true} assume true; {9405#true} is VALID [2018-11-23 11:55:40,177 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9405#true} {9405#true} #48#return; {9405#true} is VALID [2018-11-23 11:55:40,177 INFO L256 TraceCheckUtils]: 4: Hoare triple {9405#true} call #t~ret2 := main(); {9405#true} is VALID [2018-11-23 11:55:40,178 INFO L273 TraceCheckUtils]: 5: Hoare triple {9405#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {9457#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:40,179 INFO L273 TraceCheckUtils]: 6: Hoare triple {9457#(<= 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; {9408#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:40,180 INFO L273 TraceCheckUtils]: 7: Hoare triple {9408#(<= 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; {9409#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:40,180 INFO L273 TraceCheckUtils]: 8: Hoare triple {9409#(<= 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; {9410#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:40,181 INFO L273 TraceCheckUtils]: 9: Hoare triple {9410#(<= 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; {9411#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:40,181 INFO L273 TraceCheckUtils]: 10: Hoare triple {9411#(<= 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; {9412#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:40,182 INFO L273 TraceCheckUtils]: 11: Hoare triple {9412#(<= 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; {9413#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:40,183 INFO L273 TraceCheckUtils]: 12: Hoare triple {9413#(<= 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; {9414#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:40,184 INFO L273 TraceCheckUtils]: 13: Hoare triple {9414#(<= 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; {9415#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:40,185 INFO L273 TraceCheckUtils]: 14: Hoare triple {9415#(<= 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; {9416#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:40,186 INFO L273 TraceCheckUtils]: 15: Hoare triple {9416#(<= 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; {9417#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:40,187 INFO L273 TraceCheckUtils]: 16: Hoare triple {9417#(<= 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; {9418#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:40,188 INFO L273 TraceCheckUtils]: 17: Hoare triple {9418#(<= 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; {9419#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:40,189 INFO L273 TraceCheckUtils]: 18: Hoare triple {9419#(<= 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; {9420#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:40,189 INFO L273 TraceCheckUtils]: 19: Hoare triple {9420#(<= 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; {9421#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:40,190 INFO L273 TraceCheckUtils]: 20: Hoare triple {9421#(<= 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; {9422#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:40,191 INFO L273 TraceCheckUtils]: 21: Hoare triple {9422#(<= 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; {9423#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:40,192 INFO L273 TraceCheckUtils]: 22: Hoare triple {9423#(<= 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; {9424#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:40,193 INFO L273 TraceCheckUtils]: 23: Hoare triple {9424#(<= 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; {9425#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:40,194 INFO L273 TraceCheckUtils]: 24: Hoare triple {9425#(<= 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; {9426#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:40,195 INFO L273 TraceCheckUtils]: 25: Hoare triple {9426#(<= 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; {9427#(<= main_~i~0 20)} is VALID [2018-11-23 11:55:40,196 INFO L273 TraceCheckUtils]: 26: Hoare triple {9427#(<= 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; {9428#(<= main_~i~0 21)} is VALID [2018-11-23 11:55:40,197 INFO L273 TraceCheckUtils]: 27: Hoare triple {9428#(<= 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; {9429#(<= main_~i~0 22)} is VALID [2018-11-23 11:55:40,198 INFO L273 TraceCheckUtils]: 28: Hoare triple {9429#(<= 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; {9430#(<= main_~i~0 23)} is VALID [2018-11-23 11:55:40,199 INFO L273 TraceCheckUtils]: 29: Hoare triple {9430#(<= 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; {9431#(<= main_~i~0 24)} is VALID [2018-11-23 11:55:40,200 INFO L273 TraceCheckUtils]: 30: Hoare triple {9431#(<= 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; {9432#(<= main_~i~0 25)} is VALID [2018-11-23 11:55:40,201 INFO L273 TraceCheckUtils]: 31: Hoare triple {9432#(<= 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; {9433#(<= main_~i~0 26)} is VALID [2018-11-23 11:55:40,202 INFO L273 TraceCheckUtils]: 32: Hoare triple {9433#(<= 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; {9434#(<= main_~i~0 27)} is VALID [2018-11-23 11:55:40,203 INFO L273 TraceCheckUtils]: 33: Hoare triple {9434#(<= 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; {9435#(<= main_~i~0 28)} is VALID [2018-11-23 11:55:40,204 INFO L273 TraceCheckUtils]: 34: Hoare triple {9435#(<= 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; {9436#(<= main_~i~0 29)} is VALID [2018-11-23 11:55:40,204 INFO L273 TraceCheckUtils]: 35: Hoare triple {9436#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9437#(<= main_~i~0 30)} is VALID [2018-11-23 11:55:40,205 INFO L273 TraceCheckUtils]: 36: Hoare triple {9437#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9438#(<= main_~i~0 31)} is VALID [2018-11-23 11:55:40,206 INFO L273 TraceCheckUtils]: 37: Hoare triple {9438#(<= main_~i~0 31)} assume !(~i~0 < 100000); {9406#false} is VALID [2018-11-23 11:55:40,206 INFO L273 TraceCheckUtils]: 38: Hoare triple {9406#false} havoc ~x~0;~x~0 := 0; {9406#false} is VALID [2018-11-23 11:55:40,207 INFO L273 TraceCheckUtils]: 39: Hoare triple {9406#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {9406#false} is VALID [2018-11-23 11:55:40,207 INFO L256 TraceCheckUtils]: 40: Hoare triple {9406#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {9406#false} is VALID [2018-11-23 11:55:40,207 INFO L273 TraceCheckUtils]: 41: Hoare triple {9406#false} ~cond := #in~cond; {9406#false} is VALID [2018-11-23 11:55:40,207 INFO L273 TraceCheckUtils]: 42: Hoare triple {9406#false} assume 0 == ~cond; {9406#false} is VALID [2018-11-23 11:55:40,207 INFO L273 TraceCheckUtils]: 43: Hoare triple {9406#false} assume !false; {9406#false} is VALID [2018-11-23 11:55:40,210 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:40,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:40,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2018-11-23 11:55:40,228 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 44 [2018-11-23 11:55:40,229 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:40,229 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2018-11-23 11:55:40,262 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:55:40,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-23 11:55:40,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-23 11:55:40,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 11:55:40,264 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 35 states. [2018-11-23 11:55:40,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:40,735 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-11-23 11:55:40,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 11:55:40,735 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 44 [2018-11-23 11:55:40,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:40,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 11:55:40,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 63 transitions. [2018-11-23 11:55:40,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 11:55:40,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 63 transitions. [2018-11-23 11:55:40,739 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 63 transitions. [2018-11-23 11:55:40,786 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:40,787 INFO L225 Difference]: With dead ends: 61 [2018-11-23 11:55:40,788 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 11:55:40,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 11:55:40,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 11:55:40,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-11-23 11:55:40,813 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:40,813 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 50 states. [2018-11-23 11:55:40,813 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2018-11-23 11:55:40,813 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2018-11-23 11:55:40,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:40,814 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2018-11-23 11:55:40,814 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2018-11-23 11:55:40,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:40,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:40,815 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2018-11-23 11:55:40,815 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2018-11-23 11:55:40,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:40,816 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2018-11-23 11:55:40,816 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2018-11-23 11:55:40,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:40,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:40,817 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:40,817 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:40,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 11:55:40,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2018-11-23 11:55:40,818 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 44 [2018-11-23 11:55:40,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:40,818 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2018-11-23 11:55:40,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-23 11:55:40,818 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2018-11-23 11:55:40,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 11:55:40,819 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:40,819 INFO L402 BasicCegarLoop]: trace histogram [32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:40,819 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:40,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:40,819 INFO L82 PathProgramCache]: Analyzing trace with hash 237083570, now seen corresponding path program 32 times [2018-11-23 11:55:40,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:40,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:40,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:40,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:40,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:40,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:42,011 INFO L256 TraceCheckUtils]: 0: Hoare triple {9865#true} call ULTIMATE.init(); {9865#true} is VALID [2018-11-23 11:55:42,012 INFO L273 TraceCheckUtils]: 1: Hoare triple {9865#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9865#true} is VALID [2018-11-23 11:55:42,012 INFO L273 TraceCheckUtils]: 2: Hoare triple {9865#true} assume true; {9865#true} is VALID [2018-11-23 11:55:42,012 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9865#true} {9865#true} #48#return; {9865#true} is VALID [2018-11-23 11:55:42,012 INFO L256 TraceCheckUtils]: 4: Hoare triple {9865#true} call #t~ret2 := main(); {9865#true} is VALID [2018-11-23 11:55:42,013 INFO L273 TraceCheckUtils]: 5: Hoare triple {9865#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {9867#(= main_~i~0 0)} is VALID [2018-11-23 11:55:42,014 INFO L273 TraceCheckUtils]: 6: Hoare triple {9867#(= 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; {9868#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:42,015 INFO L273 TraceCheckUtils]: 7: Hoare triple {9868#(<= 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; {9869#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:42,015 INFO L273 TraceCheckUtils]: 8: Hoare triple {9869#(<= 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; {9870#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:42,016 INFO L273 TraceCheckUtils]: 9: Hoare triple {9870#(<= 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; {9871#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:42,016 INFO L273 TraceCheckUtils]: 10: Hoare triple {9871#(<= 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; {9872#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:42,017 INFO L273 TraceCheckUtils]: 11: Hoare triple {9872#(<= 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; {9873#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:42,018 INFO L273 TraceCheckUtils]: 12: Hoare triple {9873#(<= 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; {9874#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:42,018 INFO L273 TraceCheckUtils]: 13: Hoare triple {9874#(<= 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; {9875#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:42,019 INFO L273 TraceCheckUtils]: 14: Hoare triple {9875#(<= 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; {9876#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:42,020 INFO L273 TraceCheckUtils]: 15: Hoare triple {9876#(<= 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; {9877#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:42,021 INFO L273 TraceCheckUtils]: 16: Hoare triple {9877#(<= 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; {9878#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:42,022 INFO L273 TraceCheckUtils]: 17: Hoare triple {9878#(<= 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; {9879#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:42,023 INFO L273 TraceCheckUtils]: 18: Hoare triple {9879#(<= 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; {9880#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:42,024 INFO L273 TraceCheckUtils]: 19: Hoare triple {9880#(<= 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; {9881#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:42,025 INFO L273 TraceCheckUtils]: 20: Hoare triple {9881#(<= 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; {9882#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:42,026 INFO L273 TraceCheckUtils]: 21: Hoare triple {9882#(<= 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; {9883#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:42,027 INFO L273 TraceCheckUtils]: 22: Hoare triple {9883#(<= 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; {9884#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:42,028 INFO L273 TraceCheckUtils]: 23: Hoare triple {9884#(<= 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; {9885#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:42,029 INFO L273 TraceCheckUtils]: 24: Hoare triple {9885#(<= 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; {9886#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:42,030 INFO L273 TraceCheckUtils]: 25: Hoare triple {9886#(<= 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; {9887#(<= main_~i~0 20)} is VALID [2018-11-23 11:55:42,031 INFO L273 TraceCheckUtils]: 26: Hoare triple {9887#(<= 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; {9888#(<= main_~i~0 21)} is VALID [2018-11-23 11:55:42,032 INFO L273 TraceCheckUtils]: 27: Hoare triple {9888#(<= 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; {9889#(<= main_~i~0 22)} is VALID [2018-11-23 11:55:42,033 INFO L273 TraceCheckUtils]: 28: Hoare triple {9889#(<= 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; {9890#(<= main_~i~0 23)} is VALID [2018-11-23 11:55:42,033 INFO L273 TraceCheckUtils]: 29: Hoare triple {9890#(<= 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; {9891#(<= main_~i~0 24)} is VALID [2018-11-23 11:55:42,034 INFO L273 TraceCheckUtils]: 30: Hoare triple {9891#(<= 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; {9892#(<= main_~i~0 25)} is VALID [2018-11-23 11:55:42,035 INFO L273 TraceCheckUtils]: 31: Hoare triple {9892#(<= 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; {9893#(<= main_~i~0 26)} is VALID [2018-11-23 11:55:42,036 INFO L273 TraceCheckUtils]: 32: Hoare triple {9893#(<= 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; {9894#(<= main_~i~0 27)} is VALID [2018-11-23 11:55:42,037 INFO L273 TraceCheckUtils]: 33: Hoare triple {9894#(<= 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; {9895#(<= main_~i~0 28)} is VALID [2018-11-23 11:55:42,038 INFO L273 TraceCheckUtils]: 34: Hoare triple {9895#(<= 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; {9896#(<= main_~i~0 29)} is VALID [2018-11-23 11:55:42,039 INFO L273 TraceCheckUtils]: 35: Hoare triple {9896#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9897#(<= main_~i~0 30)} is VALID [2018-11-23 11:55:42,040 INFO L273 TraceCheckUtils]: 36: Hoare triple {9897#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9898#(<= main_~i~0 31)} is VALID [2018-11-23 11:55:42,041 INFO L273 TraceCheckUtils]: 37: Hoare triple {9898#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9899#(<= main_~i~0 32)} is VALID [2018-11-23 11:55:42,042 INFO L273 TraceCheckUtils]: 38: Hoare triple {9899#(<= main_~i~0 32)} assume !(~i~0 < 100000); {9866#false} is VALID [2018-11-23 11:55:42,042 INFO L273 TraceCheckUtils]: 39: Hoare triple {9866#false} havoc ~x~0;~x~0 := 0; {9866#false} is VALID [2018-11-23 11:55:42,042 INFO L273 TraceCheckUtils]: 40: Hoare triple {9866#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {9866#false} is VALID [2018-11-23 11:55:42,042 INFO L256 TraceCheckUtils]: 41: Hoare triple {9866#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {9866#false} is VALID [2018-11-23 11:55:42,043 INFO L273 TraceCheckUtils]: 42: Hoare triple {9866#false} ~cond := #in~cond; {9866#false} is VALID [2018-11-23 11:55:42,043 INFO L273 TraceCheckUtils]: 43: Hoare triple {9866#false} assume 0 == ~cond; {9866#false} is VALID [2018-11-23 11:55:42,043 INFO L273 TraceCheckUtils]: 44: Hoare triple {9866#false} assume !false; {9866#false} is VALID [2018-11-23 11:55:42,046 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:42,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:42,046 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:42,054 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:55:42,080 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:55:42,080 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:42,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:42,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:42,283 INFO L256 TraceCheckUtils]: 0: Hoare triple {9865#true} call ULTIMATE.init(); {9865#true} is VALID [2018-11-23 11:55:42,283 INFO L273 TraceCheckUtils]: 1: Hoare triple {9865#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9865#true} is VALID [2018-11-23 11:55:42,284 INFO L273 TraceCheckUtils]: 2: Hoare triple {9865#true} assume true; {9865#true} is VALID [2018-11-23 11:55:42,284 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9865#true} {9865#true} #48#return; {9865#true} is VALID [2018-11-23 11:55:42,284 INFO L256 TraceCheckUtils]: 4: Hoare triple {9865#true} call #t~ret2 := main(); {9865#true} is VALID [2018-11-23 11:55:42,284 INFO L273 TraceCheckUtils]: 5: Hoare triple {9865#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {9918#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:42,285 INFO L273 TraceCheckUtils]: 6: Hoare triple {9918#(<= 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; {9868#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:42,285 INFO L273 TraceCheckUtils]: 7: Hoare triple {9868#(<= 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; {9869#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:42,286 INFO L273 TraceCheckUtils]: 8: Hoare triple {9869#(<= 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; {9870#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:42,287 INFO L273 TraceCheckUtils]: 9: Hoare triple {9870#(<= 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; {9871#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:42,287 INFO L273 TraceCheckUtils]: 10: Hoare triple {9871#(<= 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; {9872#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:42,288 INFO L273 TraceCheckUtils]: 11: Hoare triple {9872#(<= 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; {9873#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:42,289 INFO L273 TraceCheckUtils]: 12: Hoare triple {9873#(<= 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; {9874#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:42,290 INFO L273 TraceCheckUtils]: 13: Hoare triple {9874#(<= 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; {9875#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:42,291 INFO L273 TraceCheckUtils]: 14: Hoare triple {9875#(<= 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; {9876#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:42,292 INFO L273 TraceCheckUtils]: 15: Hoare triple {9876#(<= 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; {9877#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:42,293 INFO L273 TraceCheckUtils]: 16: Hoare triple {9877#(<= 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; {9878#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:42,294 INFO L273 TraceCheckUtils]: 17: Hoare triple {9878#(<= 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; {9879#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:42,295 INFO L273 TraceCheckUtils]: 18: Hoare triple {9879#(<= 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; {9880#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:42,296 INFO L273 TraceCheckUtils]: 19: Hoare triple {9880#(<= 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; {9881#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:42,297 INFO L273 TraceCheckUtils]: 20: Hoare triple {9881#(<= 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; {9882#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:42,298 INFO L273 TraceCheckUtils]: 21: Hoare triple {9882#(<= 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; {9883#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:42,299 INFO L273 TraceCheckUtils]: 22: Hoare triple {9883#(<= 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; {9884#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:42,300 INFO L273 TraceCheckUtils]: 23: Hoare triple {9884#(<= 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; {9885#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:42,300 INFO L273 TraceCheckUtils]: 24: Hoare triple {9885#(<= 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; {9886#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:42,301 INFO L273 TraceCheckUtils]: 25: Hoare triple {9886#(<= 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; {9887#(<= main_~i~0 20)} is VALID [2018-11-23 11:55:42,302 INFO L273 TraceCheckUtils]: 26: Hoare triple {9887#(<= 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; {9888#(<= main_~i~0 21)} is VALID [2018-11-23 11:55:42,303 INFO L273 TraceCheckUtils]: 27: Hoare triple {9888#(<= 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; {9889#(<= main_~i~0 22)} is VALID [2018-11-23 11:55:42,304 INFO L273 TraceCheckUtils]: 28: Hoare triple {9889#(<= 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; {9890#(<= main_~i~0 23)} is VALID [2018-11-23 11:55:42,305 INFO L273 TraceCheckUtils]: 29: Hoare triple {9890#(<= 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; {9891#(<= main_~i~0 24)} is VALID [2018-11-23 11:55:42,306 INFO L273 TraceCheckUtils]: 30: Hoare triple {9891#(<= 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; {9892#(<= main_~i~0 25)} is VALID [2018-11-23 11:55:42,307 INFO L273 TraceCheckUtils]: 31: Hoare triple {9892#(<= 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; {9893#(<= main_~i~0 26)} is VALID [2018-11-23 11:55:42,308 INFO L273 TraceCheckUtils]: 32: Hoare triple {9893#(<= 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; {9894#(<= main_~i~0 27)} is VALID [2018-11-23 11:55:42,309 INFO L273 TraceCheckUtils]: 33: Hoare triple {9894#(<= 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; {9895#(<= main_~i~0 28)} is VALID [2018-11-23 11:55:42,310 INFO L273 TraceCheckUtils]: 34: Hoare triple {9895#(<= 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; {9896#(<= main_~i~0 29)} is VALID [2018-11-23 11:55:42,311 INFO L273 TraceCheckUtils]: 35: Hoare triple {9896#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9897#(<= main_~i~0 30)} is VALID [2018-11-23 11:55:42,312 INFO L273 TraceCheckUtils]: 36: Hoare triple {9897#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9898#(<= main_~i~0 31)} is VALID [2018-11-23 11:55:42,313 INFO L273 TraceCheckUtils]: 37: Hoare triple {9898#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9899#(<= main_~i~0 32)} is VALID [2018-11-23 11:55:42,313 INFO L273 TraceCheckUtils]: 38: Hoare triple {9899#(<= main_~i~0 32)} assume !(~i~0 < 100000); {9866#false} is VALID [2018-11-23 11:55:42,314 INFO L273 TraceCheckUtils]: 39: Hoare triple {9866#false} havoc ~x~0;~x~0 := 0; {9866#false} is VALID [2018-11-23 11:55:42,314 INFO L273 TraceCheckUtils]: 40: Hoare triple {9866#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {9866#false} is VALID [2018-11-23 11:55:42,314 INFO L256 TraceCheckUtils]: 41: Hoare triple {9866#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {9866#false} is VALID [2018-11-23 11:55:42,314 INFO L273 TraceCheckUtils]: 42: Hoare triple {9866#false} ~cond := #in~cond; {9866#false} is VALID [2018-11-23 11:55:42,314 INFO L273 TraceCheckUtils]: 43: Hoare triple {9866#false} assume 0 == ~cond; {9866#false} is VALID [2018-11-23 11:55:42,315 INFO L273 TraceCheckUtils]: 44: Hoare triple {9866#false} assume !false; {9866#false} is VALID [2018-11-23 11:55:42,317 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:42,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:42,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2018-11-23 11:55:42,337 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 45 [2018-11-23 11:55:42,338 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:42,338 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2018-11-23 11:55:42,372 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:42,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-23 11:55:42,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-23 11:55:42,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 11:55:42,374 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 36 states. [2018-11-23 11:55:42,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:42,858 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-11-23 11:55:42,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-23 11:55:42,858 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 45 [2018-11-23 11:55:42,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:42,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 11:55:42,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 64 transitions. [2018-11-23 11:55:42,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 11:55:42,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 64 transitions. [2018-11-23 11:55:42,861 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 64 transitions. [2018-11-23 11:55:42,957 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:42,958 INFO L225 Difference]: With dead ends: 62 [2018-11-23 11:55:42,958 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 11:55:42,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 11:55:42,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 11:55:42,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-11-23 11:55:42,986 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:42,986 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 51 states. [2018-11-23 11:55:42,986 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 51 states. [2018-11-23 11:55:42,986 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 51 states. [2018-11-23 11:55:42,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:42,987 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2018-11-23 11:55:42,987 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-11-23 11:55:42,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:42,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:42,987 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 51 states. [2018-11-23 11:55:42,987 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 51 states. [2018-11-23 11:55:42,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:42,988 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2018-11-23 11:55:42,988 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-11-23 11:55:42,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:42,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:42,988 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:42,989 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:42,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 11:55:42,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-11-23 11:55:42,989 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 45 [2018-11-23 11:55:42,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:42,989 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-11-23 11:55:42,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-23 11:55:42,990 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-11-23 11:55:42,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 11:55:42,990 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:42,990 INFO L402 BasicCegarLoop]: trace histogram [33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:42,990 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:42,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:42,991 INFO L82 PathProgramCache]: Analyzing trace with hash 963544686, now seen corresponding path program 33 times [2018-11-23 11:55:42,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:42,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:42,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:42,991 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:42,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:43,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:43,946 INFO L256 TraceCheckUtils]: 0: Hoare triple {10335#true} call ULTIMATE.init(); {10335#true} is VALID [2018-11-23 11:55:43,946 INFO L273 TraceCheckUtils]: 1: Hoare triple {10335#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10335#true} is VALID [2018-11-23 11:55:43,946 INFO L273 TraceCheckUtils]: 2: Hoare triple {10335#true} assume true; {10335#true} is VALID [2018-11-23 11:55:43,946 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10335#true} {10335#true} #48#return; {10335#true} is VALID [2018-11-23 11:55:43,947 INFO L256 TraceCheckUtils]: 4: Hoare triple {10335#true} call #t~ret2 := main(); {10335#true} is VALID [2018-11-23 11:55:43,947 INFO L273 TraceCheckUtils]: 5: Hoare triple {10335#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {10337#(= main_~i~0 0)} is VALID [2018-11-23 11:55:43,947 INFO L273 TraceCheckUtils]: 6: Hoare triple {10337#(= 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; {10338#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:43,948 INFO L273 TraceCheckUtils]: 7: Hoare triple {10338#(<= 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; {10339#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:43,949 INFO L273 TraceCheckUtils]: 8: Hoare triple {10339#(<= 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; {10340#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:43,950 INFO L273 TraceCheckUtils]: 9: Hoare triple {10340#(<= 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; {10341#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:43,951 INFO L273 TraceCheckUtils]: 10: Hoare triple {10341#(<= 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; {10342#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:43,952 INFO L273 TraceCheckUtils]: 11: Hoare triple {10342#(<= 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; {10343#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:43,953 INFO L273 TraceCheckUtils]: 12: Hoare triple {10343#(<= 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; {10344#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:43,954 INFO L273 TraceCheckUtils]: 13: Hoare triple {10344#(<= 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; {10345#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:43,955 INFO L273 TraceCheckUtils]: 14: Hoare triple {10345#(<= 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; {10346#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:43,956 INFO L273 TraceCheckUtils]: 15: Hoare triple {10346#(<= 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; {10347#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:43,957 INFO L273 TraceCheckUtils]: 16: Hoare triple {10347#(<= 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; {10348#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:43,958 INFO L273 TraceCheckUtils]: 17: Hoare triple {10348#(<= 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; {10349#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:43,959 INFO L273 TraceCheckUtils]: 18: Hoare triple {10349#(<= 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; {10350#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:43,960 INFO L273 TraceCheckUtils]: 19: Hoare triple {10350#(<= 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; {10351#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:43,961 INFO L273 TraceCheckUtils]: 20: Hoare triple {10351#(<= 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; {10352#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:43,961 INFO L273 TraceCheckUtils]: 21: Hoare triple {10352#(<= 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; {10353#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:43,962 INFO L273 TraceCheckUtils]: 22: Hoare triple {10353#(<= 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; {10354#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:43,963 INFO L273 TraceCheckUtils]: 23: Hoare triple {10354#(<= 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; {10355#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:43,964 INFO L273 TraceCheckUtils]: 24: Hoare triple {10355#(<= 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; {10356#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:43,965 INFO L273 TraceCheckUtils]: 25: Hoare triple {10356#(<= 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; {10357#(<= main_~i~0 20)} is VALID [2018-11-23 11:55:43,966 INFO L273 TraceCheckUtils]: 26: Hoare triple {10357#(<= 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; {10358#(<= main_~i~0 21)} is VALID [2018-11-23 11:55:43,967 INFO L273 TraceCheckUtils]: 27: Hoare triple {10358#(<= 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; {10359#(<= main_~i~0 22)} is VALID [2018-11-23 11:55:43,968 INFO L273 TraceCheckUtils]: 28: Hoare triple {10359#(<= 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; {10360#(<= main_~i~0 23)} is VALID [2018-11-23 11:55:43,969 INFO L273 TraceCheckUtils]: 29: Hoare triple {10360#(<= 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; {10361#(<= main_~i~0 24)} is VALID [2018-11-23 11:55:43,970 INFO L273 TraceCheckUtils]: 30: Hoare triple {10361#(<= 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; {10362#(<= main_~i~0 25)} is VALID [2018-11-23 11:55:43,971 INFO L273 TraceCheckUtils]: 31: Hoare triple {10362#(<= 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; {10363#(<= main_~i~0 26)} is VALID [2018-11-23 11:55:43,972 INFO L273 TraceCheckUtils]: 32: Hoare triple {10363#(<= 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; {10364#(<= main_~i~0 27)} is VALID [2018-11-23 11:55:43,973 INFO L273 TraceCheckUtils]: 33: Hoare triple {10364#(<= 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; {10365#(<= main_~i~0 28)} is VALID [2018-11-23 11:55:43,974 INFO L273 TraceCheckUtils]: 34: Hoare triple {10365#(<= 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; {10366#(<= main_~i~0 29)} is VALID [2018-11-23 11:55:43,975 INFO L273 TraceCheckUtils]: 35: Hoare triple {10366#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10367#(<= main_~i~0 30)} is VALID [2018-11-23 11:55:43,984 INFO L273 TraceCheckUtils]: 36: Hoare triple {10367#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10368#(<= main_~i~0 31)} is VALID [2018-11-23 11:55:43,985 INFO L273 TraceCheckUtils]: 37: Hoare triple {10368#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10369#(<= main_~i~0 32)} is VALID [2018-11-23 11:55:43,985 INFO L273 TraceCheckUtils]: 38: Hoare triple {10369#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10370#(<= main_~i~0 33)} is VALID [2018-11-23 11:55:43,986 INFO L273 TraceCheckUtils]: 39: Hoare triple {10370#(<= main_~i~0 33)} assume !(~i~0 < 100000); {10336#false} is VALID [2018-11-23 11:55:43,986 INFO L273 TraceCheckUtils]: 40: Hoare triple {10336#false} havoc ~x~0;~x~0 := 0; {10336#false} is VALID [2018-11-23 11:55:43,986 INFO L273 TraceCheckUtils]: 41: Hoare triple {10336#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {10336#false} is VALID [2018-11-23 11:55:43,986 INFO L256 TraceCheckUtils]: 42: Hoare triple {10336#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {10336#false} is VALID [2018-11-23 11:55:43,986 INFO L273 TraceCheckUtils]: 43: Hoare triple {10336#false} ~cond := #in~cond; {10336#false} is VALID [2018-11-23 11:55:43,986 INFO L273 TraceCheckUtils]: 44: Hoare triple {10336#false} assume 0 == ~cond; {10336#false} is VALID [2018-11-23 11:55:43,987 INFO L273 TraceCheckUtils]: 45: Hoare triple {10336#false} assume !false; {10336#false} is VALID [2018-11-23 11:55:43,988 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:43,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:43,989 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:43,998 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:55:59,330 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-11-23 11:55:59,331 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:59,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:59,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:59,538 INFO L256 TraceCheckUtils]: 0: Hoare triple {10335#true} call ULTIMATE.init(); {10335#true} is VALID [2018-11-23 11:55:59,538 INFO L273 TraceCheckUtils]: 1: Hoare triple {10335#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10335#true} is VALID [2018-11-23 11:55:59,538 INFO L273 TraceCheckUtils]: 2: Hoare triple {10335#true} assume true; {10335#true} is VALID [2018-11-23 11:55:59,539 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10335#true} {10335#true} #48#return; {10335#true} is VALID [2018-11-23 11:55:59,539 INFO L256 TraceCheckUtils]: 4: Hoare triple {10335#true} call #t~ret2 := main(); {10335#true} is VALID [2018-11-23 11:55:59,540 INFO L273 TraceCheckUtils]: 5: Hoare triple {10335#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {10389#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:59,540 INFO L273 TraceCheckUtils]: 6: Hoare triple {10389#(<= 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; {10338#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:59,541 INFO L273 TraceCheckUtils]: 7: Hoare triple {10338#(<= 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; {10339#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:59,541 INFO L273 TraceCheckUtils]: 8: Hoare triple {10339#(<= 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; {10340#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:59,542 INFO L273 TraceCheckUtils]: 9: Hoare triple {10340#(<= 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; {10341#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:59,543 INFO L273 TraceCheckUtils]: 10: Hoare triple {10341#(<= 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; {10342#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:59,544 INFO L273 TraceCheckUtils]: 11: Hoare triple {10342#(<= 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; {10343#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:59,545 INFO L273 TraceCheckUtils]: 12: Hoare triple {10343#(<= 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; {10344#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:59,546 INFO L273 TraceCheckUtils]: 13: Hoare triple {10344#(<= 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; {10345#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:59,547 INFO L273 TraceCheckUtils]: 14: Hoare triple {10345#(<= 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; {10346#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:59,548 INFO L273 TraceCheckUtils]: 15: Hoare triple {10346#(<= 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; {10347#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:59,549 INFO L273 TraceCheckUtils]: 16: Hoare triple {10347#(<= 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; {10348#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:59,550 INFO L273 TraceCheckUtils]: 17: Hoare triple {10348#(<= 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; {10349#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:59,551 INFO L273 TraceCheckUtils]: 18: Hoare triple {10349#(<= 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; {10350#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:59,552 INFO L273 TraceCheckUtils]: 19: Hoare triple {10350#(<= 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; {10351#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:59,552 INFO L273 TraceCheckUtils]: 20: Hoare triple {10351#(<= 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; {10352#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:59,553 INFO L273 TraceCheckUtils]: 21: Hoare triple {10352#(<= 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; {10353#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:59,554 INFO L273 TraceCheckUtils]: 22: Hoare triple {10353#(<= 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; {10354#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:59,555 INFO L273 TraceCheckUtils]: 23: Hoare triple {10354#(<= 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; {10355#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:59,556 INFO L273 TraceCheckUtils]: 24: Hoare triple {10355#(<= 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; {10356#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:59,557 INFO L273 TraceCheckUtils]: 25: Hoare triple {10356#(<= 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; {10357#(<= main_~i~0 20)} is VALID [2018-11-23 11:55:59,558 INFO L273 TraceCheckUtils]: 26: Hoare triple {10357#(<= 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; {10358#(<= main_~i~0 21)} is VALID [2018-11-23 11:55:59,559 INFO L273 TraceCheckUtils]: 27: Hoare triple {10358#(<= 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; {10359#(<= main_~i~0 22)} is VALID [2018-11-23 11:55:59,560 INFO L273 TraceCheckUtils]: 28: Hoare triple {10359#(<= 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; {10360#(<= main_~i~0 23)} is VALID [2018-11-23 11:55:59,561 INFO L273 TraceCheckUtils]: 29: Hoare triple {10360#(<= 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; {10361#(<= main_~i~0 24)} is VALID [2018-11-23 11:55:59,562 INFO L273 TraceCheckUtils]: 30: Hoare triple {10361#(<= 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; {10362#(<= main_~i~0 25)} is VALID [2018-11-23 11:55:59,563 INFO L273 TraceCheckUtils]: 31: Hoare triple {10362#(<= 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; {10363#(<= main_~i~0 26)} is VALID [2018-11-23 11:55:59,564 INFO L273 TraceCheckUtils]: 32: Hoare triple {10363#(<= 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; {10364#(<= main_~i~0 27)} is VALID [2018-11-23 11:55:59,565 INFO L273 TraceCheckUtils]: 33: Hoare triple {10364#(<= 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; {10365#(<= main_~i~0 28)} is VALID [2018-11-23 11:55:59,565 INFO L273 TraceCheckUtils]: 34: Hoare triple {10365#(<= 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; {10366#(<= main_~i~0 29)} is VALID [2018-11-23 11:55:59,566 INFO L273 TraceCheckUtils]: 35: Hoare triple {10366#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10367#(<= main_~i~0 30)} is VALID [2018-11-23 11:55:59,567 INFO L273 TraceCheckUtils]: 36: Hoare triple {10367#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10368#(<= main_~i~0 31)} is VALID [2018-11-23 11:55:59,568 INFO L273 TraceCheckUtils]: 37: Hoare triple {10368#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10369#(<= main_~i~0 32)} is VALID [2018-11-23 11:55:59,569 INFO L273 TraceCheckUtils]: 38: Hoare triple {10369#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10370#(<= main_~i~0 33)} is VALID [2018-11-23 11:55:59,570 INFO L273 TraceCheckUtils]: 39: Hoare triple {10370#(<= main_~i~0 33)} assume !(~i~0 < 100000); {10336#false} is VALID [2018-11-23 11:55:59,570 INFO L273 TraceCheckUtils]: 40: Hoare triple {10336#false} havoc ~x~0;~x~0 := 0; {10336#false} is VALID [2018-11-23 11:55:59,570 INFO L273 TraceCheckUtils]: 41: Hoare triple {10336#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {10336#false} is VALID [2018-11-23 11:55:59,571 INFO L256 TraceCheckUtils]: 42: Hoare triple {10336#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {10336#false} is VALID [2018-11-23 11:55:59,571 INFO L273 TraceCheckUtils]: 43: Hoare triple {10336#false} ~cond := #in~cond; {10336#false} is VALID [2018-11-23 11:55:59,571 INFO L273 TraceCheckUtils]: 44: Hoare triple {10336#false} assume 0 == ~cond; {10336#false} is VALID [2018-11-23 11:55:59,571 INFO L273 TraceCheckUtils]: 45: Hoare triple {10336#false} assume !false; {10336#false} is VALID [2018-11-23 11:55:59,574 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:59,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:59,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2018-11-23 11:55:59,600 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 46 [2018-11-23 11:55:59,600 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:59,600 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states. [2018-11-23 11:55:59,635 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:55:59,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-23 11:55:59,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-23 11:55:59,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 11:55:59,637 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 37 states. [2018-11-23 11:55:59,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:59,838 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-11-23 11:55:59,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-23 11:55:59,839 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 46 [2018-11-23 11:55:59,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:59,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 11:55:59,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 65 transitions. [2018-11-23 11:55:59,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 11:55:59,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 65 transitions. [2018-11-23 11:55:59,841 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 65 transitions. [2018-11-23 11:55:59,889 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:59,890 INFO L225 Difference]: With dead ends: 63 [2018-11-23 11:55:59,891 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 11:55:59,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 11:55:59,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 11:55:59,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-11-23 11:55:59,926 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:59,926 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 52 states. [2018-11-23 11:55:59,926 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2018-11-23 11:55:59,926 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2018-11-23 11:55:59,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:59,927 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2018-11-23 11:55:59,927 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2018-11-23 11:55:59,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:59,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:59,928 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2018-11-23 11:55:59,928 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2018-11-23 11:55:59,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:59,928 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2018-11-23 11:55:59,928 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2018-11-23 11:55:59,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:59,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:59,929 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:59,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:59,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 11:55:59,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2018-11-23 11:55:59,930 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 46 [2018-11-23 11:55:59,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:59,930 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2018-11-23 11:55:59,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-23 11:55:59,930 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2018-11-23 11:55:59,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 11:55:59,931 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:59,931 INFO L402 BasicCegarLoop]: trace histogram [34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:59,931 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:59,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:59,932 INFO L82 PathProgramCache]: Analyzing trace with hash 2009002802, now seen corresponding path program 34 times [2018-11-23 11:55:59,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:59,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:59,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:59,933 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:59,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:59,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:00,645 INFO L256 TraceCheckUtils]: 0: Hoare triple {10815#true} call ULTIMATE.init(); {10815#true} is VALID [2018-11-23 11:56:00,645 INFO L273 TraceCheckUtils]: 1: Hoare triple {10815#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10815#true} is VALID [2018-11-23 11:56:00,645 INFO L273 TraceCheckUtils]: 2: Hoare triple {10815#true} assume true; {10815#true} is VALID [2018-11-23 11:56:00,646 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10815#true} {10815#true} #48#return; {10815#true} is VALID [2018-11-23 11:56:00,646 INFO L256 TraceCheckUtils]: 4: Hoare triple {10815#true} call #t~ret2 := main(); {10815#true} is VALID [2018-11-23 11:56:00,646 INFO L273 TraceCheckUtils]: 5: Hoare triple {10815#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {10817#(= main_~i~0 0)} is VALID [2018-11-23 11:56:00,647 INFO L273 TraceCheckUtils]: 6: Hoare triple {10817#(= 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; {10818#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:00,648 INFO L273 TraceCheckUtils]: 7: Hoare triple {10818#(<= 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; {10819#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:00,649 INFO L273 TraceCheckUtils]: 8: Hoare triple {10819#(<= 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; {10820#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:00,650 INFO L273 TraceCheckUtils]: 9: Hoare triple {10820#(<= 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; {10821#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:00,651 INFO L273 TraceCheckUtils]: 10: Hoare triple {10821#(<= 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; {10822#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:00,652 INFO L273 TraceCheckUtils]: 11: Hoare triple {10822#(<= 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; {10823#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:00,653 INFO L273 TraceCheckUtils]: 12: Hoare triple {10823#(<= 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; {10824#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:00,654 INFO L273 TraceCheckUtils]: 13: Hoare triple {10824#(<= 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; {10825#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:00,655 INFO L273 TraceCheckUtils]: 14: Hoare triple {10825#(<= 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; {10826#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:00,656 INFO L273 TraceCheckUtils]: 15: Hoare triple {10826#(<= 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; {10827#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:00,657 INFO L273 TraceCheckUtils]: 16: Hoare triple {10827#(<= 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; {10828#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:00,658 INFO L273 TraceCheckUtils]: 17: Hoare triple {10828#(<= 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; {10829#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:00,659 INFO L273 TraceCheckUtils]: 18: Hoare triple {10829#(<= 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; {10830#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:00,660 INFO L273 TraceCheckUtils]: 19: Hoare triple {10830#(<= 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; {10831#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:00,661 INFO L273 TraceCheckUtils]: 20: Hoare triple {10831#(<= 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; {10832#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:00,661 INFO L273 TraceCheckUtils]: 21: Hoare triple {10832#(<= 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; {10833#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:00,662 INFO L273 TraceCheckUtils]: 22: Hoare triple {10833#(<= 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; {10834#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:00,663 INFO L273 TraceCheckUtils]: 23: Hoare triple {10834#(<= 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; {10835#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:00,664 INFO L273 TraceCheckUtils]: 24: Hoare triple {10835#(<= 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; {10836#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:00,665 INFO L273 TraceCheckUtils]: 25: Hoare triple {10836#(<= 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; {10837#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:00,666 INFO L273 TraceCheckUtils]: 26: Hoare triple {10837#(<= 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; {10838#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:00,667 INFO L273 TraceCheckUtils]: 27: Hoare triple {10838#(<= 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; {10839#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:00,668 INFO L273 TraceCheckUtils]: 28: Hoare triple {10839#(<= 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; {10840#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:00,669 INFO L273 TraceCheckUtils]: 29: Hoare triple {10840#(<= 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; {10841#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:00,670 INFO L273 TraceCheckUtils]: 30: Hoare triple {10841#(<= 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; {10842#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:00,671 INFO L273 TraceCheckUtils]: 31: Hoare triple {10842#(<= 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; {10843#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:00,672 INFO L273 TraceCheckUtils]: 32: Hoare triple {10843#(<= 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; {10844#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:00,673 INFO L273 TraceCheckUtils]: 33: Hoare triple {10844#(<= 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; {10845#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:00,674 INFO L273 TraceCheckUtils]: 34: Hoare triple {10845#(<= 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; {10846#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:00,675 INFO L273 TraceCheckUtils]: 35: Hoare triple {10846#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10847#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:00,675 INFO L273 TraceCheckUtils]: 36: Hoare triple {10847#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10848#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:00,676 INFO L273 TraceCheckUtils]: 37: Hoare triple {10848#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10849#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:00,677 INFO L273 TraceCheckUtils]: 38: Hoare triple {10849#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10850#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:00,678 INFO L273 TraceCheckUtils]: 39: Hoare triple {10850#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10851#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:00,679 INFO L273 TraceCheckUtils]: 40: Hoare triple {10851#(<= main_~i~0 34)} assume !(~i~0 < 100000); {10816#false} is VALID [2018-11-23 11:56:00,679 INFO L273 TraceCheckUtils]: 41: Hoare triple {10816#false} havoc ~x~0;~x~0 := 0; {10816#false} is VALID [2018-11-23 11:56:00,679 INFO L273 TraceCheckUtils]: 42: Hoare triple {10816#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {10816#false} is VALID [2018-11-23 11:56:00,680 INFO L256 TraceCheckUtils]: 43: Hoare triple {10816#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {10816#false} is VALID [2018-11-23 11:56:00,680 INFO L273 TraceCheckUtils]: 44: Hoare triple {10816#false} ~cond := #in~cond; {10816#false} is VALID [2018-11-23 11:56:00,680 INFO L273 TraceCheckUtils]: 45: Hoare triple {10816#false} assume 0 == ~cond; {10816#false} is VALID [2018-11-23 11:56:00,680 INFO L273 TraceCheckUtils]: 46: Hoare triple {10816#false} assume !false; {10816#false} is VALID [2018-11-23 11:56:00,683 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:56:00,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:56:00,683 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:56:00,692 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:56:00,727 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:56:00,728 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:56:00,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:00,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:56:00,943 INFO L256 TraceCheckUtils]: 0: Hoare triple {10815#true} call ULTIMATE.init(); {10815#true} is VALID [2018-11-23 11:56:00,944 INFO L273 TraceCheckUtils]: 1: Hoare triple {10815#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10815#true} is VALID [2018-11-23 11:56:00,944 INFO L273 TraceCheckUtils]: 2: Hoare triple {10815#true} assume true; {10815#true} is VALID [2018-11-23 11:56:00,944 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10815#true} {10815#true} #48#return; {10815#true} is VALID [2018-11-23 11:56:00,944 INFO L256 TraceCheckUtils]: 4: Hoare triple {10815#true} call #t~ret2 := main(); {10815#true} is VALID [2018-11-23 11:56:00,945 INFO L273 TraceCheckUtils]: 5: Hoare triple {10815#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {10870#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:00,946 INFO L273 TraceCheckUtils]: 6: Hoare triple {10870#(<= 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; {10818#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:00,947 INFO L273 TraceCheckUtils]: 7: Hoare triple {10818#(<= 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; {10819#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:00,948 INFO L273 TraceCheckUtils]: 8: Hoare triple {10819#(<= 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; {10820#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:00,949 INFO L273 TraceCheckUtils]: 9: Hoare triple {10820#(<= 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; {10821#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:00,950 INFO L273 TraceCheckUtils]: 10: Hoare triple {10821#(<= 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; {10822#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:00,951 INFO L273 TraceCheckUtils]: 11: Hoare triple {10822#(<= 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; {10823#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:00,952 INFO L273 TraceCheckUtils]: 12: Hoare triple {10823#(<= 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; {10824#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:00,953 INFO L273 TraceCheckUtils]: 13: Hoare triple {10824#(<= 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; {10825#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:00,954 INFO L273 TraceCheckUtils]: 14: Hoare triple {10825#(<= 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; {10826#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:00,955 INFO L273 TraceCheckUtils]: 15: Hoare triple {10826#(<= 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; {10827#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:00,956 INFO L273 TraceCheckUtils]: 16: Hoare triple {10827#(<= 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; {10828#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:00,957 INFO L273 TraceCheckUtils]: 17: Hoare triple {10828#(<= 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; {10829#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:00,958 INFO L273 TraceCheckUtils]: 18: Hoare triple {10829#(<= 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; {10830#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:00,958 INFO L273 TraceCheckUtils]: 19: Hoare triple {10830#(<= 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; {10831#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:00,959 INFO L273 TraceCheckUtils]: 20: Hoare triple {10831#(<= 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; {10832#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:00,960 INFO L273 TraceCheckUtils]: 21: Hoare triple {10832#(<= 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; {10833#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:00,961 INFO L273 TraceCheckUtils]: 22: Hoare triple {10833#(<= 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; {10834#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:00,962 INFO L273 TraceCheckUtils]: 23: Hoare triple {10834#(<= 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; {10835#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:00,963 INFO L273 TraceCheckUtils]: 24: Hoare triple {10835#(<= 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; {10836#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:00,964 INFO L273 TraceCheckUtils]: 25: Hoare triple {10836#(<= 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; {10837#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:00,965 INFO L273 TraceCheckUtils]: 26: Hoare triple {10837#(<= 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; {10838#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:00,966 INFO L273 TraceCheckUtils]: 27: Hoare triple {10838#(<= 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; {10839#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:00,967 INFO L273 TraceCheckUtils]: 28: Hoare triple {10839#(<= 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; {10840#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:00,968 INFO L273 TraceCheckUtils]: 29: Hoare triple {10840#(<= 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; {10841#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:00,969 INFO L273 TraceCheckUtils]: 30: Hoare triple {10841#(<= 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; {10842#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:00,970 INFO L273 TraceCheckUtils]: 31: Hoare triple {10842#(<= 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; {10843#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:00,971 INFO L273 TraceCheckUtils]: 32: Hoare triple {10843#(<= 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; {10844#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:00,971 INFO L273 TraceCheckUtils]: 33: Hoare triple {10844#(<= 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; {10845#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:00,972 INFO L273 TraceCheckUtils]: 34: Hoare triple {10845#(<= 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; {10846#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:00,973 INFO L273 TraceCheckUtils]: 35: Hoare triple {10846#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10847#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:00,974 INFO L273 TraceCheckUtils]: 36: Hoare triple {10847#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10848#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:00,975 INFO L273 TraceCheckUtils]: 37: Hoare triple {10848#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10849#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:00,976 INFO L273 TraceCheckUtils]: 38: Hoare triple {10849#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10850#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:00,977 INFO L273 TraceCheckUtils]: 39: Hoare triple {10850#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10851#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:00,978 INFO L273 TraceCheckUtils]: 40: Hoare triple {10851#(<= main_~i~0 34)} assume !(~i~0 < 100000); {10816#false} is VALID [2018-11-23 11:56:00,978 INFO L273 TraceCheckUtils]: 41: Hoare triple {10816#false} havoc ~x~0;~x~0 := 0; {10816#false} is VALID [2018-11-23 11:56:00,978 INFO L273 TraceCheckUtils]: 42: Hoare triple {10816#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {10816#false} is VALID [2018-11-23 11:56:00,978 INFO L256 TraceCheckUtils]: 43: Hoare triple {10816#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {10816#false} is VALID [2018-11-23 11:56:00,979 INFO L273 TraceCheckUtils]: 44: Hoare triple {10816#false} ~cond := #in~cond; {10816#false} is VALID [2018-11-23 11:56:00,979 INFO L273 TraceCheckUtils]: 45: Hoare triple {10816#false} assume 0 == ~cond; {10816#false} is VALID [2018-11-23 11:56:00,979 INFO L273 TraceCheckUtils]: 46: Hoare triple {10816#false} assume !false; {10816#false} is VALID [2018-11-23 11:56:00,982 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:56:01,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:56:01,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2018-11-23 11:56:01,003 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 47 [2018-11-23 11:56:01,003 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:56:01,003 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2018-11-23 11:56:01,039 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:01,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-23 11:56:01,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-23 11:56:01,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 11:56:01,040 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 38 states. [2018-11-23 11:56:01,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:01,526 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2018-11-23 11:56:01,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-23 11:56:01,526 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 47 [2018-11-23 11:56:01,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:56:01,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 11:56:01,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 66 transitions. [2018-11-23 11:56:01,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 11:56:01,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 66 transitions. [2018-11-23 11:56:01,529 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 66 transitions. [2018-11-23 11:56:01,678 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:56:01,679 INFO L225 Difference]: With dead ends: 64 [2018-11-23 11:56:01,680 INFO L226 Difference]: Without dead ends: 53 [2018-11-23 11:56:01,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 11:56:01,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-23 11:56:01,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-11-23 11:56:01,707 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:56:01,707 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 53 states. [2018-11-23 11:56:01,707 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2018-11-23 11:56:01,707 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2018-11-23 11:56:01,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:01,708 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2018-11-23 11:56:01,708 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-11-23 11:56:01,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:01,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:01,709 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2018-11-23 11:56:01,709 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2018-11-23 11:56:01,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:01,710 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2018-11-23 11:56:01,710 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-11-23 11:56:01,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:01,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:01,710 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:56:01,710 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:56:01,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 11:56:01,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-11-23 11:56:01,712 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 47 [2018-11-23 11:56:01,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:56:01,712 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-11-23 11:56:01,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-23 11:56:01,712 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-11-23 11:56:01,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 11:56:01,713 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:56:01,713 INFO L402 BasicCegarLoop]: trace histogram [35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:56:01,713 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:56:01,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:56:01,713 INFO L82 PathProgramCache]: Analyzing trace with hash 58466030, now seen corresponding path program 35 times [2018-11-23 11:56:01,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:56:01,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:56:01,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:01,714 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:56:01,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:01,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:02,438 INFO L256 TraceCheckUtils]: 0: Hoare triple {11305#true} call ULTIMATE.init(); {11305#true} is VALID [2018-11-23 11:56:02,438 INFO L273 TraceCheckUtils]: 1: Hoare triple {11305#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11305#true} is VALID [2018-11-23 11:56:02,439 INFO L273 TraceCheckUtils]: 2: Hoare triple {11305#true} assume true; {11305#true} is VALID [2018-11-23 11:56:02,439 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11305#true} {11305#true} #48#return; {11305#true} is VALID [2018-11-23 11:56:02,439 INFO L256 TraceCheckUtils]: 4: Hoare triple {11305#true} call #t~ret2 := main(); {11305#true} is VALID [2018-11-23 11:56:02,440 INFO L273 TraceCheckUtils]: 5: Hoare triple {11305#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {11307#(= main_~i~0 0)} is VALID [2018-11-23 11:56:02,441 INFO L273 TraceCheckUtils]: 6: Hoare triple {11307#(= 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; {11308#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:02,441 INFO L273 TraceCheckUtils]: 7: Hoare triple {11308#(<= 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; {11309#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:02,442 INFO L273 TraceCheckUtils]: 8: Hoare triple {11309#(<= 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; {11310#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:02,442 INFO L273 TraceCheckUtils]: 9: Hoare triple {11310#(<= 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; {11311#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:02,443 INFO L273 TraceCheckUtils]: 10: Hoare triple {11311#(<= 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; {11312#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:02,444 INFO L273 TraceCheckUtils]: 11: Hoare triple {11312#(<= 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; {11313#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:02,444 INFO L273 TraceCheckUtils]: 12: Hoare triple {11313#(<= 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; {11314#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:02,445 INFO L273 TraceCheckUtils]: 13: Hoare triple {11314#(<= 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; {11315#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:02,446 INFO L273 TraceCheckUtils]: 14: Hoare triple {11315#(<= 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; {11316#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:02,447 INFO L273 TraceCheckUtils]: 15: Hoare triple {11316#(<= 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; {11317#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:02,448 INFO L273 TraceCheckUtils]: 16: Hoare triple {11317#(<= 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; {11318#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:02,449 INFO L273 TraceCheckUtils]: 17: Hoare triple {11318#(<= 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; {11319#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:02,450 INFO L273 TraceCheckUtils]: 18: Hoare triple {11319#(<= 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; {11320#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:02,451 INFO L273 TraceCheckUtils]: 19: Hoare triple {11320#(<= 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; {11321#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:02,452 INFO L273 TraceCheckUtils]: 20: Hoare triple {11321#(<= 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; {11322#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:02,453 INFO L273 TraceCheckUtils]: 21: Hoare triple {11322#(<= 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; {11323#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:02,454 INFO L273 TraceCheckUtils]: 22: Hoare triple {11323#(<= 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; {11324#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:02,455 INFO L273 TraceCheckUtils]: 23: Hoare triple {11324#(<= 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; {11325#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:02,455 INFO L273 TraceCheckUtils]: 24: Hoare triple {11325#(<= 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; {11326#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:02,456 INFO L273 TraceCheckUtils]: 25: Hoare triple {11326#(<= 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; {11327#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:02,457 INFO L273 TraceCheckUtils]: 26: Hoare triple {11327#(<= 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; {11328#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:02,458 INFO L273 TraceCheckUtils]: 27: Hoare triple {11328#(<= 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; {11329#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:02,459 INFO L273 TraceCheckUtils]: 28: Hoare triple {11329#(<= 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; {11330#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:02,460 INFO L273 TraceCheckUtils]: 29: Hoare triple {11330#(<= 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; {11331#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:02,461 INFO L273 TraceCheckUtils]: 30: Hoare triple {11331#(<= 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; {11332#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:02,462 INFO L273 TraceCheckUtils]: 31: Hoare triple {11332#(<= 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; {11333#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:02,463 INFO L273 TraceCheckUtils]: 32: Hoare triple {11333#(<= 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; {11334#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:02,464 INFO L273 TraceCheckUtils]: 33: Hoare triple {11334#(<= 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; {11335#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:02,465 INFO L273 TraceCheckUtils]: 34: Hoare triple {11335#(<= 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; {11336#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:02,466 INFO L273 TraceCheckUtils]: 35: Hoare triple {11336#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11337#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:02,467 INFO L273 TraceCheckUtils]: 36: Hoare triple {11337#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11338#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:02,468 INFO L273 TraceCheckUtils]: 37: Hoare triple {11338#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11339#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:02,469 INFO L273 TraceCheckUtils]: 38: Hoare triple {11339#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11340#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:02,469 INFO L273 TraceCheckUtils]: 39: Hoare triple {11340#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11341#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:02,470 INFO L273 TraceCheckUtils]: 40: Hoare triple {11341#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11342#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:02,471 INFO L273 TraceCheckUtils]: 41: Hoare triple {11342#(<= main_~i~0 35)} assume !(~i~0 < 100000); {11306#false} is VALID [2018-11-23 11:56:02,471 INFO L273 TraceCheckUtils]: 42: Hoare triple {11306#false} havoc ~x~0;~x~0 := 0; {11306#false} is VALID [2018-11-23 11:56:02,472 INFO L273 TraceCheckUtils]: 43: Hoare triple {11306#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {11306#false} is VALID [2018-11-23 11:56:02,472 INFO L256 TraceCheckUtils]: 44: Hoare triple {11306#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {11306#false} is VALID [2018-11-23 11:56:02,472 INFO L273 TraceCheckUtils]: 45: Hoare triple {11306#false} ~cond := #in~cond; {11306#false} is VALID [2018-11-23 11:56:02,472 INFO L273 TraceCheckUtils]: 46: Hoare triple {11306#false} assume 0 == ~cond; {11306#false} is VALID [2018-11-23 11:56:02,472 INFO L273 TraceCheckUtils]: 47: Hoare triple {11306#false} assume !false; {11306#false} is VALID [2018-11-23 11:56:02,475 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:56:02,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:56:02,476 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:56:02,484 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:56:03,117 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2018-11-23 11:56:03,117 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:56:03,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:03,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:56:03,365 INFO L256 TraceCheckUtils]: 0: Hoare triple {11305#true} call ULTIMATE.init(); {11305#true} is VALID [2018-11-23 11:56:03,365 INFO L273 TraceCheckUtils]: 1: Hoare triple {11305#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11305#true} is VALID [2018-11-23 11:56:03,366 INFO L273 TraceCheckUtils]: 2: Hoare triple {11305#true} assume true; {11305#true} is VALID [2018-11-23 11:56:03,366 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11305#true} {11305#true} #48#return; {11305#true} is VALID [2018-11-23 11:56:03,366 INFO L256 TraceCheckUtils]: 4: Hoare triple {11305#true} call #t~ret2 := main(); {11305#true} is VALID [2018-11-23 11:56:03,367 INFO L273 TraceCheckUtils]: 5: Hoare triple {11305#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {11361#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:03,368 INFO L273 TraceCheckUtils]: 6: Hoare triple {11361#(<= 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; {11308#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:03,369 INFO L273 TraceCheckUtils]: 7: Hoare triple {11308#(<= 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; {11309#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:03,369 INFO L273 TraceCheckUtils]: 8: Hoare triple {11309#(<= 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; {11310#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:03,370 INFO L273 TraceCheckUtils]: 9: Hoare triple {11310#(<= 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; {11311#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:03,370 INFO L273 TraceCheckUtils]: 10: Hoare triple {11311#(<= 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; {11312#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:03,371 INFO L273 TraceCheckUtils]: 11: Hoare triple {11312#(<= 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; {11313#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:03,372 INFO L273 TraceCheckUtils]: 12: Hoare triple {11313#(<= 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; {11314#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:03,372 INFO L273 TraceCheckUtils]: 13: Hoare triple {11314#(<= 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; {11315#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:03,373 INFO L273 TraceCheckUtils]: 14: Hoare triple {11315#(<= 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; {11316#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:03,374 INFO L273 TraceCheckUtils]: 15: Hoare triple {11316#(<= 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; {11317#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:03,375 INFO L273 TraceCheckUtils]: 16: Hoare triple {11317#(<= 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; {11318#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:03,376 INFO L273 TraceCheckUtils]: 17: Hoare triple {11318#(<= 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; {11319#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:03,377 INFO L273 TraceCheckUtils]: 18: Hoare triple {11319#(<= 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; {11320#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:03,378 INFO L273 TraceCheckUtils]: 19: Hoare triple {11320#(<= 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; {11321#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:03,379 INFO L273 TraceCheckUtils]: 20: Hoare triple {11321#(<= 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; {11322#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:03,380 INFO L273 TraceCheckUtils]: 21: Hoare triple {11322#(<= 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; {11323#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:03,381 INFO L273 TraceCheckUtils]: 22: Hoare triple {11323#(<= 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; {11324#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:03,382 INFO L273 TraceCheckUtils]: 23: Hoare triple {11324#(<= 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; {11325#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:03,383 INFO L273 TraceCheckUtils]: 24: Hoare triple {11325#(<= 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; {11326#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:03,384 INFO L273 TraceCheckUtils]: 25: Hoare triple {11326#(<= 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; {11327#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:03,385 INFO L273 TraceCheckUtils]: 26: Hoare triple {11327#(<= 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; {11328#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:03,385 INFO L273 TraceCheckUtils]: 27: Hoare triple {11328#(<= 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; {11329#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:03,386 INFO L273 TraceCheckUtils]: 28: Hoare triple {11329#(<= 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; {11330#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:03,387 INFO L273 TraceCheckUtils]: 29: Hoare triple {11330#(<= 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; {11331#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:03,388 INFO L273 TraceCheckUtils]: 30: Hoare triple {11331#(<= 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; {11332#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:03,389 INFO L273 TraceCheckUtils]: 31: Hoare triple {11332#(<= 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; {11333#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:03,390 INFO L273 TraceCheckUtils]: 32: Hoare triple {11333#(<= 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; {11334#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:03,391 INFO L273 TraceCheckUtils]: 33: Hoare triple {11334#(<= 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; {11335#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:03,392 INFO L273 TraceCheckUtils]: 34: Hoare triple {11335#(<= 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; {11336#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:03,393 INFO L273 TraceCheckUtils]: 35: Hoare triple {11336#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11337#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:03,394 INFO L273 TraceCheckUtils]: 36: Hoare triple {11337#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11338#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:03,395 INFO L273 TraceCheckUtils]: 37: Hoare triple {11338#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11339#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:03,396 INFO L273 TraceCheckUtils]: 38: Hoare triple {11339#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11340#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:03,397 INFO L273 TraceCheckUtils]: 39: Hoare triple {11340#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11341#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:03,398 INFO L273 TraceCheckUtils]: 40: Hoare triple {11341#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11342#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:03,398 INFO L273 TraceCheckUtils]: 41: Hoare triple {11342#(<= main_~i~0 35)} assume !(~i~0 < 100000); {11306#false} is VALID [2018-11-23 11:56:03,399 INFO L273 TraceCheckUtils]: 42: Hoare triple {11306#false} havoc ~x~0;~x~0 := 0; {11306#false} is VALID [2018-11-23 11:56:03,399 INFO L273 TraceCheckUtils]: 43: Hoare triple {11306#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {11306#false} is VALID [2018-11-23 11:56:03,399 INFO L256 TraceCheckUtils]: 44: Hoare triple {11306#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {11306#false} is VALID [2018-11-23 11:56:03,399 INFO L273 TraceCheckUtils]: 45: Hoare triple {11306#false} ~cond := #in~cond; {11306#false} is VALID [2018-11-23 11:56:03,399 INFO L273 TraceCheckUtils]: 46: Hoare triple {11306#false} assume 0 == ~cond; {11306#false} is VALID [2018-11-23 11:56:03,400 INFO L273 TraceCheckUtils]: 47: Hoare triple {11306#false} assume !false; {11306#false} is VALID [2018-11-23 11:56:03,402 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:56:03,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:56:03,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2018-11-23 11:56:03,424 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 48 [2018-11-23 11:56:03,424 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:56:03,424 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states. [2018-11-23 11:56:03,462 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:56:03,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-23 11:56:03,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-23 11:56:03,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 11:56:03,464 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 39 states. [2018-11-23 11:56:03,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:03,894 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2018-11-23 11:56:03,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-23 11:56:03,894 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 48 [2018-11-23 11:56:03,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:56:03,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 11:56:03,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 67 transitions. [2018-11-23 11:56:03,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 11:56:03,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 67 transitions. [2018-11-23 11:56:03,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 67 transitions. [2018-11-23 11:56:03,964 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:03,965 INFO L225 Difference]: With dead ends: 65 [2018-11-23 11:56:03,965 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 11:56:03,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 11:56:03,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 11:56:03,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-11-23 11:56:03,996 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:56:03,996 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 54 states. [2018-11-23 11:56:03,996 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2018-11-23 11:56:03,996 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2018-11-23 11:56:03,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:03,997 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2018-11-23 11:56:03,997 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-11-23 11:56:03,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:03,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:03,998 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2018-11-23 11:56:03,998 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2018-11-23 11:56:03,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:03,999 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2018-11-23 11:56:03,999 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-11-23 11:56:03,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:03,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:03,999 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:56:04,000 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:56:04,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 11:56:04,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2018-11-23 11:56:04,001 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 48 [2018-11-23 11:56:04,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:56:04,001 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2018-11-23 11:56:04,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-23 11:56:04,001 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-11-23 11:56:04,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 11:56:04,002 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:56:04,002 INFO L402 BasicCegarLoop]: trace histogram [36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:56:04,002 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:56:04,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:56:04,003 INFO L82 PathProgramCache]: Analyzing trace with hash -278631758, now seen corresponding path program 36 times [2018-11-23 11:56:04,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:56:04,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:56:04,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:04,004 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:56:04,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:04,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:04,950 INFO L256 TraceCheckUtils]: 0: Hoare triple {11805#true} call ULTIMATE.init(); {11805#true} is VALID [2018-11-23 11:56:04,950 INFO L273 TraceCheckUtils]: 1: Hoare triple {11805#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11805#true} is VALID [2018-11-23 11:56:04,950 INFO L273 TraceCheckUtils]: 2: Hoare triple {11805#true} assume true; {11805#true} is VALID [2018-11-23 11:56:04,951 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11805#true} {11805#true} #48#return; {11805#true} is VALID [2018-11-23 11:56:04,951 INFO L256 TraceCheckUtils]: 4: Hoare triple {11805#true} call #t~ret2 := main(); {11805#true} is VALID [2018-11-23 11:56:04,951 INFO L273 TraceCheckUtils]: 5: Hoare triple {11805#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {11807#(= main_~i~0 0)} is VALID [2018-11-23 11:56:04,953 INFO L273 TraceCheckUtils]: 6: Hoare triple {11807#(= 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; {11808#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:04,954 INFO L273 TraceCheckUtils]: 7: Hoare triple {11808#(<= 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; {11809#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:04,954 INFO L273 TraceCheckUtils]: 8: Hoare triple {11809#(<= 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; {11810#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:04,955 INFO L273 TraceCheckUtils]: 9: Hoare triple {11810#(<= 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; {11811#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:04,956 INFO L273 TraceCheckUtils]: 10: Hoare triple {11811#(<= 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; {11812#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:04,956 INFO L273 TraceCheckUtils]: 11: Hoare triple {11812#(<= 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; {11813#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:04,957 INFO L273 TraceCheckUtils]: 12: Hoare triple {11813#(<= 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; {11814#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:04,958 INFO L273 TraceCheckUtils]: 13: Hoare triple {11814#(<= 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; {11815#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:04,959 INFO L273 TraceCheckUtils]: 14: Hoare triple {11815#(<= 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; {11816#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:04,960 INFO L273 TraceCheckUtils]: 15: Hoare triple {11816#(<= 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; {11817#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:04,961 INFO L273 TraceCheckUtils]: 16: Hoare triple {11817#(<= 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; {11818#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:04,962 INFO L273 TraceCheckUtils]: 17: Hoare triple {11818#(<= 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; {11819#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:04,963 INFO L273 TraceCheckUtils]: 18: Hoare triple {11819#(<= 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; {11820#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:04,964 INFO L273 TraceCheckUtils]: 19: Hoare triple {11820#(<= 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; {11821#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:04,965 INFO L273 TraceCheckUtils]: 20: Hoare triple {11821#(<= 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; {11822#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:04,966 INFO L273 TraceCheckUtils]: 21: Hoare triple {11822#(<= 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; {11823#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:04,967 INFO L273 TraceCheckUtils]: 22: Hoare triple {11823#(<= 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; {11824#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:04,968 INFO L273 TraceCheckUtils]: 23: Hoare triple {11824#(<= 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; {11825#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:04,969 INFO L273 TraceCheckUtils]: 24: Hoare triple {11825#(<= 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; {11826#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:04,970 INFO L273 TraceCheckUtils]: 25: Hoare triple {11826#(<= 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; {11827#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:04,971 INFO L273 TraceCheckUtils]: 26: Hoare triple {11827#(<= 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; {11828#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:04,972 INFO L273 TraceCheckUtils]: 27: Hoare triple {11828#(<= 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; {11829#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:04,973 INFO L273 TraceCheckUtils]: 28: Hoare triple {11829#(<= 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; {11830#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:04,974 INFO L273 TraceCheckUtils]: 29: Hoare triple {11830#(<= 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; {11831#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:04,975 INFO L273 TraceCheckUtils]: 30: Hoare triple {11831#(<= 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; {11832#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:04,977 INFO L273 TraceCheckUtils]: 31: Hoare triple {11832#(<= 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; {11833#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:04,978 INFO L273 TraceCheckUtils]: 32: Hoare triple {11833#(<= 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; {11834#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:04,979 INFO L273 TraceCheckUtils]: 33: Hoare triple {11834#(<= 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; {11835#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:04,980 INFO L273 TraceCheckUtils]: 34: Hoare triple {11835#(<= 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; {11836#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:04,981 INFO L273 TraceCheckUtils]: 35: Hoare triple {11836#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11837#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:04,982 INFO L273 TraceCheckUtils]: 36: Hoare triple {11837#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11838#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:04,983 INFO L273 TraceCheckUtils]: 37: Hoare triple {11838#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11839#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:04,984 INFO L273 TraceCheckUtils]: 38: Hoare triple {11839#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11840#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:04,985 INFO L273 TraceCheckUtils]: 39: Hoare triple {11840#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11841#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:04,986 INFO L273 TraceCheckUtils]: 40: Hoare triple {11841#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11842#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:04,987 INFO L273 TraceCheckUtils]: 41: Hoare triple {11842#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11843#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:04,987 INFO L273 TraceCheckUtils]: 42: Hoare triple {11843#(<= main_~i~0 36)} assume !(~i~0 < 100000); {11806#false} is VALID [2018-11-23 11:56:04,988 INFO L273 TraceCheckUtils]: 43: Hoare triple {11806#false} havoc ~x~0;~x~0 := 0; {11806#false} is VALID [2018-11-23 11:56:04,988 INFO L273 TraceCheckUtils]: 44: Hoare triple {11806#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {11806#false} is VALID [2018-11-23 11:56:04,988 INFO L256 TraceCheckUtils]: 45: Hoare triple {11806#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {11806#false} is VALID [2018-11-23 11:56:04,988 INFO L273 TraceCheckUtils]: 46: Hoare triple {11806#false} ~cond := #in~cond; {11806#false} is VALID [2018-11-23 11:56:04,989 INFO L273 TraceCheckUtils]: 47: Hoare triple {11806#false} assume 0 == ~cond; {11806#false} is VALID [2018-11-23 11:56:04,989 INFO L273 TraceCheckUtils]: 48: Hoare triple {11806#false} assume !false; {11806#false} is VALID [2018-11-23 11:56:04,993 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:56:04,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:56:04,993 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:56:05,002 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:56:33,478 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-11-23 11:56:33,478 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:56:33,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:33,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:56:34,430 INFO L256 TraceCheckUtils]: 0: Hoare triple {11805#true} call ULTIMATE.init(); {11805#true} is VALID [2018-11-23 11:56:34,430 INFO L273 TraceCheckUtils]: 1: Hoare triple {11805#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11805#true} is VALID [2018-11-23 11:56:34,430 INFO L273 TraceCheckUtils]: 2: Hoare triple {11805#true} assume true; {11805#true} is VALID [2018-11-23 11:56:34,431 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11805#true} {11805#true} #48#return; {11805#true} is VALID [2018-11-23 11:56:34,431 INFO L256 TraceCheckUtils]: 4: Hoare triple {11805#true} call #t~ret2 := main(); {11805#true} is VALID [2018-11-23 11:56:34,431 INFO L273 TraceCheckUtils]: 5: Hoare triple {11805#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {11862#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:34,433 INFO L273 TraceCheckUtils]: 6: Hoare triple {11862#(<= 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; {11808#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:34,433 INFO L273 TraceCheckUtils]: 7: Hoare triple {11808#(<= 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; {11809#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:34,435 INFO L273 TraceCheckUtils]: 8: Hoare triple {11809#(<= 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; {11810#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:34,435 INFO L273 TraceCheckUtils]: 9: Hoare triple {11810#(<= 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; {11811#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:34,437 INFO L273 TraceCheckUtils]: 10: Hoare triple {11811#(<= 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; {11812#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:34,438 INFO L273 TraceCheckUtils]: 11: Hoare triple {11812#(<= 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; {11813#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:34,439 INFO L273 TraceCheckUtils]: 12: Hoare triple {11813#(<= 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; {11814#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:34,440 INFO L273 TraceCheckUtils]: 13: Hoare triple {11814#(<= 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; {11815#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:34,442 INFO L273 TraceCheckUtils]: 14: Hoare triple {11815#(<= 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; {11816#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:34,443 INFO L273 TraceCheckUtils]: 15: Hoare triple {11816#(<= 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; {11817#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:34,444 INFO L273 TraceCheckUtils]: 16: Hoare triple {11817#(<= 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; {11818#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:34,446 INFO L273 TraceCheckUtils]: 17: Hoare triple {11818#(<= 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; {11819#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:34,448 INFO L273 TraceCheckUtils]: 18: Hoare triple {11819#(<= 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; {11820#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:34,449 INFO L273 TraceCheckUtils]: 19: Hoare triple {11820#(<= 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; {11821#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:34,450 INFO L273 TraceCheckUtils]: 20: Hoare triple {11821#(<= 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; {11822#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:34,450 INFO L273 TraceCheckUtils]: 21: Hoare triple {11822#(<= 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; {11823#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:34,451 INFO L273 TraceCheckUtils]: 22: Hoare triple {11823#(<= 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; {11824#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:34,452 INFO L273 TraceCheckUtils]: 23: Hoare triple {11824#(<= 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; {11825#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:34,457 INFO L273 TraceCheckUtils]: 24: Hoare triple {11825#(<= 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; {11826#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:34,483 INFO L273 TraceCheckUtils]: 25: Hoare triple {11826#(<= 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; {11827#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:34,483 INFO L273 TraceCheckUtils]: 26: Hoare triple {11827#(<= 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; {11828#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:34,487 INFO L273 TraceCheckUtils]: 27: Hoare triple {11828#(<= 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; {11829#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:34,487 INFO L273 TraceCheckUtils]: 28: Hoare triple {11829#(<= 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; {11830#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:34,489 INFO L273 TraceCheckUtils]: 29: Hoare triple {11830#(<= 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; {11831#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:34,489 INFO L273 TraceCheckUtils]: 30: Hoare triple {11831#(<= 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; {11832#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:34,491 INFO L273 TraceCheckUtils]: 31: Hoare triple {11832#(<= 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; {11833#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:34,492 INFO L273 TraceCheckUtils]: 32: Hoare triple {11833#(<= 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; {11834#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:34,493 INFO L273 TraceCheckUtils]: 33: Hoare triple {11834#(<= 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; {11835#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:34,494 INFO L273 TraceCheckUtils]: 34: Hoare triple {11835#(<= 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; {11836#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:34,495 INFO L273 TraceCheckUtils]: 35: Hoare triple {11836#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11837#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:34,496 INFO L273 TraceCheckUtils]: 36: Hoare triple {11837#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11838#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:34,497 INFO L273 TraceCheckUtils]: 37: Hoare triple {11838#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11839#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:34,498 INFO L273 TraceCheckUtils]: 38: Hoare triple {11839#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11840#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:34,499 INFO L273 TraceCheckUtils]: 39: Hoare triple {11840#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11841#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:34,500 INFO L273 TraceCheckUtils]: 40: Hoare triple {11841#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11842#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:34,501 INFO L273 TraceCheckUtils]: 41: Hoare triple {11842#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11843#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:34,503 INFO L273 TraceCheckUtils]: 42: Hoare triple {11843#(<= main_~i~0 36)} assume !(~i~0 < 100000); {11806#false} is VALID [2018-11-23 11:56:34,503 INFO L273 TraceCheckUtils]: 43: Hoare triple {11806#false} havoc ~x~0;~x~0 := 0; {11806#false} is VALID [2018-11-23 11:56:34,503 INFO L273 TraceCheckUtils]: 44: Hoare triple {11806#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {11806#false} is VALID [2018-11-23 11:56:34,503 INFO L256 TraceCheckUtils]: 45: Hoare triple {11806#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {11806#false} is VALID [2018-11-23 11:56:34,504 INFO L273 TraceCheckUtils]: 46: Hoare triple {11806#false} ~cond := #in~cond; {11806#false} is VALID [2018-11-23 11:56:34,504 INFO L273 TraceCheckUtils]: 47: Hoare triple {11806#false} assume 0 == ~cond; {11806#false} is VALID [2018-11-23 11:56:34,504 INFO L273 TraceCheckUtils]: 48: Hoare triple {11806#false} assume !false; {11806#false} is VALID [2018-11-23 11:56:34,507 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:56:34,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:56:34,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2018-11-23 11:56:34,532 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 49 [2018-11-23 11:56:34,533 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:56:34,533 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states. [2018-11-23 11:56:34,577 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:34,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-23 11:56:34,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-23 11:56:34,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 11:56:34,578 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 40 states. [2018-11-23 11:56:34,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:34,843 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2018-11-23 11:56:34,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-23 11:56:34,843 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 49 [2018-11-23 11:56:34,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:56:34,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 11:56:34,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 68 transitions. [2018-11-23 11:56:34,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 11:56:34,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 68 transitions. [2018-11-23 11:56:34,846 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 68 transitions. [2018-11-23 11:56:34,908 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:56:34,909 INFO L225 Difference]: With dead ends: 66 [2018-11-23 11:56:34,910 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 11:56:34,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 11:56:34,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 11:56:34,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-11-23 11:56:34,943 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:56:34,943 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 55 states. [2018-11-23 11:56:34,943 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2018-11-23 11:56:34,944 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2018-11-23 11:56:34,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:34,945 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2018-11-23 11:56:34,945 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-11-23 11:56:34,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:34,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:34,946 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2018-11-23 11:56:34,946 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2018-11-23 11:56:34,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:34,947 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2018-11-23 11:56:34,947 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-11-23 11:56:34,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:34,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:34,947 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:56:34,947 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:56:34,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 11:56:34,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-11-23 11:56:34,948 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 49 [2018-11-23 11:56:34,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:56:34,949 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-11-23 11:56:34,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-23 11:56:34,949 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-11-23 11:56:34,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 11:56:34,949 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:56:34,950 INFO L402 BasicCegarLoop]: trace histogram [37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:56:34,950 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:56:34,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:56:34,950 INFO L82 PathProgramCache]: Analyzing trace with hash -2138728594, now seen corresponding path program 37 times [2018-11-23 11:56:34,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:56:34,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:56:34,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:34,951 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:56:34,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:34,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:35,891 INFO L256 TraceCheckUtils]: 0: Hoare triple {12315#true} call ULTIMATE.init(); {12315#true} is VALID [2018-11-23 11:56:35,892 INFO L273 TraceCheckUtils]: 1: Hoare triple {12315#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12315#true} is VALID [2018-11-23 11:56:35,892 INFO L273 TraceCheckUtils]: 2: Hoare triple {12315#true} assume true; {12315#true} is VALID [2018-11-23 11:56:35,892 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12315#true} {12315#true} #48#return; {12315#true} is VALID [2018-11-23 11:56:35,893 INFO L256 TraceCheckUtils]: 4: Hoare triple {12315#true} call #t~ret2 := main(); {12315#true} is VALID [2018-11-23 11:56:35,893 INFO L273 TraceCheckUtils]: 5: Hoare triple {12315#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {12317#(= main_~i~0 0)} is VALID [2018-11-23 11:56:35,894 INFO L273 TraceCheckUtils]: 6: Hoare triple {12317#(= 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; {12318#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:35,894 INFO L273 TraceCheckUtils]: 7: Hoare triple {12318#(<= 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; {12319#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:35,895 INFO L273 TraceCheckUtils]: 8: Hoare triple {12319#(<= 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; {12320#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:35,895 INFO L273 TraceCheckUtils]: 9: Hoare triple {12320#(<= 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; {12321#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:35,896 INFO L273 TraceCheckUtils]: 10: Hoare triple {12321#(<= 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; {12322#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:35,897 INFO L273 TraceCheckUtils]: 11: Hoare triple {12322#(<= 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; {12323#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:35,898 INFO L273 TraceCheckUtils]: 12: Hoare triple {12323#(<= 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; {12324#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:35,899 INFO L273 TraceCheckUtils]: 13: Hoare triple {12324#(<= 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; {12325#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:35,900 INFO L273 TraceCheckUtils]: 14: Hoare triple {12325#(<= 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; {12326#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:35,902 INFO L273 TraceCheckUtils]: 15: Hoare triple {12326#(<= 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; {12327#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:35,903 INFO L273 TraceCheckUtils]: 16: Hoare triple {12327#(<= 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; {12328#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:35,904 INFO L273 TraceCheckUtils]: 17: Hoare triple {12328#(<= 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; {12329#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:35,905 INFO L273 TraceCheckUtils]: 18: Hoare triple {12329#(<= 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; {12330#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:35,906 INFO L273 TraceCheckUtils]: 19: Hoare triple {12330#(<= 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; {12331#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:35,907 INFO L273 TraceCheckUtils]: 20: Hoare triple {12331#(<= 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; {12332#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:35,908 INFO L273 TraceCheckUtils]: 21: Hoare triple {12332#(<= 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; {12333#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:35,908 INFO L273 TraceCheckUtils]: 22: Hoare triple {12333#(<= 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; {12334#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:35,909 INFO L273 TraceCheckUtils]: 23: Hoare triple {12334#(<= 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; {12335#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:35,910 INFO L273 TraceCheckUtils]: 24: Hoare triple {12335#(<= 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; {12336#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:35,911 INFO L273 TraceCheckUtils]: 25: Hoare triple {12336#(<= 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; {12337#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:35,912 INFO L273 TraceCheckUtils]: 26: Hoare triple {12337#(<= 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; {12338#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:35,913 INFO L273 TraceCheckUtils]: 27: Hoare triple {12338#(<= 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; {12339#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:35,914 INFO L273 TraceCheckUtils]: 28: Hoare triple {12339#(<= 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; {12340#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:35,915 INFO L273 TraceCheckUtils]: 29: Hoare triple {12340#(<= 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; {12341#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:35,916 INFO L273 TraceCheckUtils]: 30: Hoare triple {12341#(<= 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; {12342#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:35,917 INFO L273 TraceCheckUtils]: 31: Hoare triple {12342#(<= 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; {12343#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:35,918 INFO L273 TraceCheckUtils]: 32: Hoare triple {12343#(<= 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; {12344#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:35,919 INFO L273 TraceCheckUtils]: 33: Hoare triple {12344#(<= 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; {12345#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:35,920 INFO L273 TraceCheckUtils]: 34: Hoare triple {12345#(<= 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; {12346#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:35,921 INFO L273 TraceCheckUtils]: 35: Hoare triple {12346#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12347#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:35,922 INFO L273 TraceCheckUtils]: 36: Hoare triple {12347#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12348#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:35,923 INFO L273 TraceCheckUtils]: 37: Hoare triple {12348#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12349#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:35,924 INFO L273 TraceCheckUtils]: 38: Hoare triple {12349#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12350#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:35,925 INFO L273 TraceCheckUtils]: 39: Hoare triple {12350#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12351#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:35,926 INFO L273 TraceCheckUtils]: 40: Hoare triple {12351#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:35,926 INFO L273 TraceCheckUtils]: 41: Hoare triple {12352#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12353#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:35,927 INFO L273 TraceCheckUtils]: 42: Hoare triple {12353#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#(<= main_~i~0 37)} is VALID [2018-11-23 11:56:35,928 INFO L273 TraceCheckUtils]: 43: Hoare triple {12354#(<= main_~i~0 37)} assume !(~i~0 < 100000); {12316#false} is VALID [2018-11-23 11:56:35,928 INFO L273 TraceCheckUtils]: 44: Hoare triple {12316#false} havoc ~x~0;~x~0 := 0; {12316#false} is VALID [2018-11-23 11:56:35,929 INFO L273 TraceCheckUtils]: 45: Hoare triple {12316#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {12316#false} is VALID [2018-11-23 11:56:35,929 INFO L256 TraceCheckUtils]: 46: Hoare triple {12316#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {12316#false} is VALID [2018-11-23 11:56:35,929 INFO L273 TraceCheckUtils]: 47: Hoare triple {12316#false} ~cond := #in~cond; {12316#false} is VALID [2018-11-23 11:56:35,929 INFO L273 TraceCheckUtils]: 48: Hoare triple {12316#false} assume 0 == ~cond; {12316#false} is VALID [2018-11-23 11:56:35,929 INFO L273 TraceCheckUtils]: 49: Hoare triple {12316#false} assume !false; {12316#false} is VALID [2018-11-23 11:56:35,932 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:56:35,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:56:35,933 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:56:35,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:56:35,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:35,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:35,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:56:36,238 INFO L256 TraceCheckUtils]: 0: Hoare triple {12315#true} call ULTIMATE.init(); {12315#true} is VALID [2018-11-23 11:56:36,239 INFO L273 TraceCheckUtils]: 1: Hoare triple {12315#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12315#true} is VALID [2018-11-23 11:56:36,239 INFO L273 TraceCheckUtils]: 2: Hoare triple {12315#true} assume true; {12315#true} is VALID [2018-11-23 11:56:36,239 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12315#true} {12315#true} #48#return; {12315#true} is VALID [2018-11-23 11:56:36,239 INFO L256 TraceCheckUtils]: 4: Hoare triple {12315#true} call #t~ret2 := main(); {12315#true} is VALID [2018-11-23 11:56:36,240 INFO L273 TraceCheckUtils]: 5: Hoare triple {12315#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {12373#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:36,241 INFO L273 TraceCheckUtils]: 6: Hoare triple {12373#(<= 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; {12318#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:36,242 INFO L273 TraceCheckUtils]: 7: Hoare triple {12318#(<= 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; {12319#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:36,242 INFO L273 TraceCheckUtils]: 8: Hoare triple {12319#(<= 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; {12320#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:36,243 INFO L273 TraceCheckUtils]: 9: Hoare triple {12320#(<= 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; {12321#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:36,244 INFO L273 TraceCheckUtils]: 10: Hoare triple {12321#(<= 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; {12322#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:36,245 INFO L273 TraceCheckUtils]: 11: Hoare triple {12322#(<= 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; {12323#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:36,245 INFO L273 TraceCheckUtils]: 12: Hoare triple {12323#(<= 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; {12324#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:36,246 INFO L273 TraceCheckUtils]: 13: Hoare triple {12324#(<= 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; {12325#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:36,247 INFO L273 TraceCheckUtils]: 14: Hoare triple {12325#(<= 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; {12326#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:36,248 INFO L273 TraceCheckUtils]: 15: Hoare triple {12326#(<= 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; {12327#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:36,249 INFO L273 TraceCheckUtils]: 16: Hoare triple {12327#(<= 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; {12328#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:36,250 INFO L273 TraceCheckUtils]: 17: Hoare triple {12328#(<= 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; {12329#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:36,251 INFO L273 TraceCheckUtils]: 18: Hoare triple {12329#(<= 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; {12330#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:36,252 INFO L273 TraceCheckUtils]: 19: Hoare triple {12330#(<= 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; {12331#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:36,253 INFO L273 TraceCheckUtils]: 20: Hoare triple {12331#(<= 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; {12332#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:36,254 INFO L273 TraceCheckUtils]: 21: Hoare triple {12332#(<= 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; {12333#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:36,255 INFO L273 TraceCheckUtils]: 22: Hoare triple {12333#(<= 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; {12334#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:36,256 INFO L273 TraceCheckUtils]: 23: Hoare triple {12334#(<= 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; {12335#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:36,257 INFO L273 TraceCheckUtils]: 24: Hoare triple {12335#(<= 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; {12336#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:36,258 INFO L273 TraceCheckUtils]: 25: Hoare triple {12336#(<= 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; {12337#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:36,259 INFO L273 TraceCheckUtils]: 26: Hoare triple {12337#(<= 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; {12338#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:36,260 INFO L273 TraceCheckUtils]: 27: Hoare triple {12338#(<= 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; {12339#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:36,261 INFO L273 TraceCheckUtils]: 28: Hoare triple {12339#(<= 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; {12340#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:36,262 INFO L273 TraceCheckUtils]: 29: Hoare triple {12340#(<= 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; {12341#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:36,263 INFO L273 TraceCheckUtils]: 30: Hoare triple {12341#(<= 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; {12342#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:36,263 INFO L273 TraceCheckUtils]: 31: Hoare triple {12342#(<= 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; {12343#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:36,264 INFO L273 TraceCheckUtils]: 32: Hoare triple {12343#(<= 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; {12344#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:36,265 INFO L273 TraceCheckUtils]: 33: Hoare triple {12344#(<= 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; {12345#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:36,266 INFO L273 TraceCheckUtils]: 34: Hoare triple {12345#(<= 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; {12346#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:36,267 INFO L273 TraceCheckUtils]: 35: Hoare triple {12346#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12347#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:36,268 INFO L273 TraceCheckUtils]: 36: Hoare triple {12347#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12348#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:36,269 INFO L273 TraceCheckUtils]: 37: Hoare triple {12348#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12349#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:36,270 INFO L273 TraceCheckUtils]: 38: Hoare triple {12349#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12350#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:36,271 INFO L273 TraceCheckUtils]: 39: Hoare triple {12350#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12351#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:36,272 INFO L273 TraceCheckUtils]: 40: Hoare triple {12351#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:36,273 INFO L273 TraceCheckUtils]: 41: Hoare triple {12352#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12353#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:36,274 INFO L273 TraceCheckUtils]: 42: Hoare triple {12353#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#(<= main_~i~0 37)} is VALID [2018-11-23 11:56:36,274 INFO L273 TraceCheckUtils]: 43: Hoare triple {12354#(<= main_~i~0 37)} assume !(~i~0 < 100000); {12316#false} is VALID [2018-11-23 11:56:36,275 INFO L273 TraceCheckUtils]: 44: Hoare triple {12316#false} havoc ~x~0;~x~0 := 0; {12316#false} is VALID [2018-11-23 11:56:36,275 INFO L273 TraceCheckUtils]: 45: Hoare triple {12316#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {12316#false} is VALID [2018-11-23 11:56:36,275 INFO L256 TraceCheckUtils]: 46: Hoare triple {12316#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {12316#false} is VALID [2018-11-23 11:56:36,275 INFO L273 TraceCheckUtils]: 47: Hoare triple {12316#false} ~cond := #in~cond; {12316#false} is VALID [2018-11-23 11:56:36,276 INFO L273 TraceCheckUtils]: 48: Hoare triple {12316#false} assume 0 == ~cond; {12316#false} is VALID [2018-11-23 11:56:36,276 INFO L273 TraceCheckUtils]: 49: Hoare triple {12316#false} assume !false; {12316#false} is VALID [2018-11-23 11:56:36,279 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:56:36,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:56:36,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2018-11-23 11:56:36,298 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 50 [2018-11-23 11:56:36,298 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:56:36,299 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states. [2018-11-23 11:56:36,371 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:56:36,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-23 11:56:36,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-23 11:56:36,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 11:56:36,373 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 41 states. [2018-11-23 11:56:36,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:36,554 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-11-23 11:56:36,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-23 11:56:36,554 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 50 [2018-11-23 11:56:36,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:56:36,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 11:56:36,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 69 transitions. [2018-11-23 11:56:36,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 11:56:36,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 69 transitions. [2018-11-23 11:56:36,557 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 69 transitions. [2018-11-23 11:56:36,608 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:36,610 INFO L225 Difference]: With dead ends: 67 [2018-11-23 11:56:36,610 INFO L226 Difference]: Without dead ends: 56 [2018-11-23 11:56:36,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 11:56:36,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-23 11:56:36,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-11-23 11:56:36,647 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:56:36,647 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 56 states. [2018-11-23 11:56:36,647 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2018-11-23 11:56:36,648 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2018-11-23 11:56:36,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:36,649 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2018-11-23 11:56:36,649 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2018-11-23 11:56:36,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:36,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:36,650 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2018-11-23 11:56:36,650 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2018-11-23 11:56:36,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:36,651 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2018-11-23 11:56:36,651 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2018-11-23 11:56:36,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:36,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:36,652 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:56:36,652 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:56:36,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 11:56:36,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2018-11-23 11:56:36,653 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 50 [2018-11-23 11:56:36,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:56:36,653 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2018-11-23 11:56:36,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-23 11:56:36,653 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2018-11-23 11:56:36,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 11:56:36,654 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:56:36,654 INFO L402 BasicCegarLoop]: trace histogram [38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:56:36,654 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:56:36,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:56:36,654 INFO L82 PathProgramCache]: Analyzing trace with hash 327811634, now seen corresponding path program 38 times [2018-11-23 11:56:36,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:56:36,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:56:36,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:36,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:56:36,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:36,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:37,824 INFO L256 TraceCheckUtils]: 0: Hoare triple {12835#true} call ULTIMATE.init(); {12835#true} is VALID [2018-11-23 11:56:37,824 INFO L273 TraceCheckUtils]: 1: Hoare triple {12835#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12835#true} is VALID [2018-11-23 11:56:37,824 INFO L273 TraceCheckUtils]: 2: Hoare triple {12835#true} assume true; {12835#true} is VALID [2018-11-23 11:56:37,825 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12835#true} {12835#true} #48#return; {12835#true} is VALID [2018-11-23 11:56:37,825 INFO L256 TraceCheckUtils]: 4: Hoare triple {12835#true} call #t~ret2 := main(); {12835#true} is VALID [2018-11-23 11:56:37,825 INFO L273 TraceCheckUtils]: 5: Hoare triple {12835#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {12837#(= main_~i~0 0)} is VALID [2018-11-23 11:56:37,826 INFO L273 TraceCheckUtils]: 6: Hoare triple {12837#(= 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; {12838#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:37,827 INFO L273 TraceCheckUtils]: 7: Hoare triple {12838#(<= 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; {12839#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:37,828 INFO L273 TraceCheckUtils]: 8: Hoare triple {12839#(<= 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; {12840#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:37,829 INFO L273 TraceCheckUtils]: 9: Hoare triple {12840#(<= 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; {12841#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:37,830 INFO L273 TraceCheckUtils]: 10: Hoare triple {12841#(<= 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; {12842#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:37,831 INFO L273 TraceCheckUtils]: 11: Hoare triple {12842#(<= 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; {12843#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:37,832 INFO L273 TraceCheckUtils]: 12: Hoare triple {12843#(<= 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; {12844#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:37,833 INFO L273 TraceCheckUtils]: 13: Hoare triple {12844#(<= 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; {12845#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:37,834 INFO L273 TraceCheckUtils]: 14: Hoare triple {12845#(<= 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; {12846#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:37,835 INFO L273 TraceCheckUtils]: 15: Hoare triple {12846#(<= 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; {12847#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:37,836 INFO L273 TraceCheckUtils]: 16: Hoare triple {12847#(<= 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; {12848#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:37,837 INFO L273 TraceCheckUtils]: 17: Hoare triple {12848#(<= 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; {12849#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:37,838 INFO L273 TraceCheckUtils]: 18: Hoare triple {12849#(<= 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; {12850#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:37,839 INFO L273 TraceCheckUtils]: 19: Hoare triple {12850#(<= 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; {12851#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:37,840 INFO L273 TraceCheckUtils]: 20: Hoare triple {12851#(<= 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; {12852#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:37,841 INFO L273 TraceCheckUtils]: 21: Hoare triple {12852#(<= 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; {12853#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:37,841 INFO L273 TraceCheckUtils]: 22: Hoare triple {12853#(<= 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; {12854#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:37,842 INFO L273 TraceCheckUtils]: 23: Hoare triple {12854#(<= 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; {12855#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:37,843 INFO L273 TraceCheckUtils]: 24: Hoare triple {12855#(<= 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; {12856#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:37,844 INFO L273 TraceCheckUtils]: 25: Hoare triple {12856#(<= 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; {12857#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:37,845 INFO L273 TraceCheckUtils]: 26: Hoare triple {12857#(<= 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; {12858#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:37,846 INFO L273 TraceCheckUtils]: 27: Hoare triple {12858#(<= 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; {12859#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:37,847 INFO L273 TraceCheckUtils]: 28: Hoare triple {12859#(<= 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; {12860#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:37,848 INFO L273 TraceCheckUtils]: 29: Hoare triple {12860#(<= 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; {12861#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:37,849 INFO L273 TraceCheckUtils]: 30: Hoare triple {12861#(<= 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; {12862#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:37,850 INFO L273 TraceCheckUtils]: 31: Hoare triple {12862#(<= 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; {12863#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:37,851 INFO L273 TraceCheckUtils]: 32: Hoare triple {12863#(<= 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; {12864#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:37,852 INFO L273 TraceCheckUtils]: 33: Hoare triple {12864#(<= 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; {12865#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:37,853 INFO L273 TraceCheckUtils]: 34: Hoare triple {12865#(<= 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; {12866#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:37,854 INFO L273 TraceCheckUtils]: 35: Hoare triple {12866#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12867#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:37,855 INFO L273 TraceCheckUtils]: 36: Hoare triple {12867#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12868#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:37,856 INFO L273 TraceCheckUtils]: 37: Hoare triple {12868#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12869#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:37,857 INFO L273 TraceCheckUtils]: 38: Hoare triple {12869#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12870#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:37,857 INFO L273 TraceCheckUtils]: 39: Hoare triple {12870#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12871#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:37,858 INFO L273 TraceCheckUtils]: 40: Hoare triple {12871#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12872#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:37,859 INFO L273 TraceCheckUtils]: 41: Hoare triple {12872#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12873#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:37,860 INFO L273 TraceCheckUtils]: 42: Hoare triple {12873#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12874#(<= main_~i~0 37)} is VALID [2018-11-23 11:56:37,861 INFO L273 TraceCheckUtils]: 43: Hoare triple {12874#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12875#(<= main_~i~0 38)} is VALID [2018-11-23 11:56:37,862 INFO L273 TraceCheckUtils]: 44: Hoare triple {12875#(<= main_~i~0 38)} assume !(~i~0 < 100000); {12836#false} is VALID [2018-11-23 11:56:37,862 INFO L273 TraceCheckUtils]: 45: Hoare triple {12836#false} havoc ~x~0;~x~0 := 0; {12836#false} is VALID [2018-11-23 11:56:37,862 INFO L273 TraceCheckUtils]: 46: Hoare triple {12836#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {12836#false} is VALID [2018-11-23 11:56:37,863 INFO L256 TraceCheckUtils]: 47: Hoare triple {12836#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {12836#false} is VALID [2018-11-23 11:56:37,863 INFO L273 TraceCheckUtils]: 48: Hoare triple {12836#false} ~cond := #in~cond; {12836#false} is VALID [2018-11-23 11:56:37,863 INFO L273 TraceCheckUtils]: 49: Hoare triple {12836#false} assume 0 == ~cond; {12836#false} is VALID [2018-11-23 11:56:37,863 INFO L273 TraceCheckUtils]: 50: Hoare triple {12836#false} assume !false; {12836#false} is VALID [2018-11-23 11:56:37,867 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:56:37,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:56:37,867 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:56:37,876 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:56:37,922 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:56:37,922 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:56:37,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:37,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:56:38,319 INFO L256 TraceCheckUtils]: 0: Hoare triple {12835#true} call ULTIMATE.init(); {12835#true} is VALID [2018-11-23 11:56:38,320 INFO L273 TraceCheckUtils]: 1: Hoare triple {12835#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12835#true} is VALID [2018-11-23 11:56:38,320 INFO L273 TraceCheckUtils]: 2: Hoare triple {12835#true} assume true; {12835#true} is VALID [2018-11-23 11:56:38,320 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12835#true} {12835#true} #48#return; {12835#true} is VALID [2018-11-23 11:56:38,320 INFO L256 TraceCheckUtils]: 4: Hoare triple {12835#true} call #t~ret2 := main(); {12835#true} is VALID [2018-11-23 11:56:38,321 INFO L273 TraceCheckUtils]: 5: Hoare triple {12835#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {12894#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:38,322 INFO L273 TraceCheckUtils]: 6: Hoare triple {12894#(<= 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; {12838#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:38,323 INFO L273 TraceCheckUtils]: 7: Hoare triple {12838#(<= 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; {12839#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:38,323 INFO L273 TraceCheckUtils]: 8: Hoare triple {12839#(<= 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; {12840#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:38,324 INFO L273 TraceCheckUtils]: 9: Hoare triple {12840#(<= 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; {12841#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:38,325 INFO L273 TraceCheckUtils]: 10: Hoare triple {12841#(<= 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; {12842#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:38,325 INFO L273 TraceCheckUtils]: 11: Hoare triple {12842#(<= 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; {12843#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:38,326 INFO L273 TraceCheckUtils]: 12: Hoare triple {12843#(<= 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; {12844#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:38,327 INFO L273 TraceCheckUtils]: 13: Hoare triple {12844#(<= 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; {12845#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:38,328 INFO L273 TraceCheckUtils]: 14: Hoare triple {12845#(<= 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; {12846#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:38,329 INFO L273 TraceCheckUtils]: 15: Hoare triple {12846#(<= 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; {12847#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:38,330 INFO L273 TraceCheckUtils]: 16: Hoare triple {12847#(<= 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; {12848#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:38,331 INFO L273 TraceCheckUtils]: 17: Hoare triple {12848#(<= 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; {12849#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:38,332 INFO L273 TraceCheckUtils]: 18: Hoare triple {12849#(<= 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; {12850#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:38,333 INFO L273 TraceCheckUtils]: 19: Hoare triple {12850#(<= 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; {12851#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:38,334 INFO L273 TraceCheckUtils]: 20: Hoare triple {12851#(<= 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; {12852#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:38,335 INFO L273 TraceCheckUtils]: 21: Hoare triple {12852#(<= 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; {12853#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:38,335 INFO L273 TraceCheckUtils]: 22: Hoare triple {12853#(<= 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; {12854#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:38,336 INFO L273 TraceCheckUtils]: 23: Hoare triple {12854#(<= 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; {12855#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:38,337 INFO L273 TraceCheckUtils]: 24: Hoare triple {12855#(<= 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; {12856#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:38,338 INFO L273 TraceCheckUtils]: 25: Hoare triple {12856#(<= 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; {12857#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:38,339 INFO L273 TraceCheckUtils]: 26: Hoare triple {12857#(<= 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; {12858#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:38,347 INFO L273 TraceCheckUtils]: 27: Hoare triple {12858#(<= 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; {12859#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:38,348 INFO L273 TraceCheckUtils]: 28: Hoare triple {12859#(<= 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; {12860#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:38,349 INFO L273 TraceCheckUtils]: 29: Hoare triple {12860#(<= 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; {12861#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:38,350 INFO L273 TraceCheckUtils]: 30: Hoare triple {12861#(<= 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; {12862#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:38,350 INFO L273 TraceCheckUtils]: 31: Hoare triple {12862#(<= 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; {12863#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:38,351 INFO L273 TraceCheckUtils]: 32: Hoare triple {12863#(<= 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; {12864#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:38,352 INFO L273 TraceCheckUtils]: 33: Hoare triple {12864#(<= 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; {12865#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:38,353 INFO L273 TraceCheckUtils]: 34: Hoare triple {12865#(<= 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; {12866#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:38,354 INFO L273 TraceCheckUtils]: 35: Hoare triple {12866#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12867#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:38,355 INFO L273 TraceCheckUtils]: 36: Hoare triple {12867#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12868#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:38,356 INFO L273 TraceCheckUtils]: 37: Hoare triple {12868#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12869#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:38,369 INFO L273 TraceCheckUtils]: 38: Hoare triple {12869#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12870#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:38,370 INFO L273 TraceCheckUtils]: 39: Hoare triple {12870#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12871#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:38,370 INFO L273 TraceCheckUtils]: 40: Hoare triple {12871#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12872#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:38,371 INFO L273 TraceCheckUtils]: 41: Hoare triple {12872#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12873#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:38,372 INFO L273 TraceCheckUtils]: 42: Hoare triple {12873#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12874#(<= main_~i~0 37)} is VALID [2018-11-23 11:56:38,372 INFO L273 TraceCheckUtils]: 43: Hoare triple {12874#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12875#(<= main_~i~0 38)} is VALID [2018-11-23 11:56:38,372 INFO L273 TraceCheckUtils]: 44: Hoare triple {12875#(<= main_~i~0 38)} assume !(~i~0 < 100000); {12836#false} is VALID [2018-11-23 11:56:38,373 INFO L273 TraceCheckUtils]: 45: Hoare triple {12836#false} havoc ~x~0;~x~0 := 0; {12836#false} is VALID [2018-11-23 11:56:38,373 INFO L273 TraceCheckUtils]: 46: Hoare triple {12836#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {12836#false} is VALID [2018-11-23 11:56:38,373 INFO L256 TraceCheckUtils]: 47: Hoare triple {12836#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {12836#false} is VALID [2018-11-23 11:56:38,373 INFO L273 TraceCheckUtils]: 48: Hoare triple {12836#false} ~cond := #in~cond; {12836#false} is VALID [2018-11-23 11:56:38,373 INFO L273 TraceCheckUtils]: 49: Hoare triple {12836#false} assume 0 == ~cond; {12836#false} is VALID [2018-11-23 11:56:38,373 INFO L273 TraceCheckUtils]: 50: Hoare triple {12836#false} assume !false; {12836#false} is VALID [2018-11-23 11:56:38,377 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:56:38,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:56:38,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2018-11-23 11:56:38,396 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 51 [2018-11-23 11:56:38,396 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:56:38,396 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-23 11:56:38,435 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:38,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 11:56:38,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 11:56:38,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 11:56:38,437 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 42 states. [2018-11-23 11:56:38,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:38,701 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2018-11-23 11:56:38,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-23 11:56:38,702 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 51 [2018-11-23 11:56:38,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:56:38,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 11:56:38,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 70 transitions. [2018-11-23 11:56:38,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 11:56:38,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 70 transitions. [2018-11-23 11:56:38,704 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 70 transitions. [2018-11-23 11:56:38,753 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:56:38,754 INFO L225 Difference]: With dead ends: 68 [2018-11-23 11:56:38,754 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 11:56:38,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 11:56:38,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 11:56:38,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-11-23 11:56:38,789 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:56:38,789 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 57 states. [2018-11-23 11:56:38,789 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 57 states. [2018-11-23 11:56:38,790 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 57 states. [2018-11-23 11:56:38,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:38,791 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2018-11-23 11:56:38,791 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-11-23 11:56:38,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:38,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:38,791 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 57 states. [2018-11-23 11:56:38,791 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 57 states. [2018-11-23 11:56:38,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:38,792 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2018-11-23 11:56:38,793 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-11-23 11:56:38,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:38,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:38,793 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:56:38,793 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:56:38,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 11:56:38,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-11-23 11:56:38,794 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 51 [2018-11-23 11:56:38,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:56:38,795 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-11-23 11:56:38,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 11:56:38,795 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-11-23 11:56:38,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 11:56:38,795 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:56:38,796 INFO L402 BasicCegarLoop]: trace histogram [39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:56:38,796 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:56:38,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:56:38,796 INFO L82 PathProgramCache]: Analyzing trace with hash -518852626, now seen corresponding path program 39 times [2018-11-23 11:56:38,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:56:38,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:56:38,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:38,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:56:38,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:38,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:39,787 INFO L256 TraceCheckUtils]: 0: Hoare triple {13365#true} call ULTIMATE.init(); {13365#true} is VALID [2018-11-23 11:56:39,787 INFO L273 TraceCheckUtils]: 1: Hoare triple {13365#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13365#true} is VALID [2018-11-23 11:56:39,787 INFO L273 TraceCheckUtils]: 2: Hoare triple {13365#true} assume true; {13365#true} is VALID [2018-11-23 11:56:39,787 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13365#true} {13365#true} #48#return; {13365#true} is VALID [2018-11-23 11:56:39,787 INFO L256 TraceCheckUtils]: 4: Hoare triple {13365#true} call #t~ret2 := main(); {13365#true} is VALID [2018-11-23 11:56:39,788 INFO L273 TraceCheckUtils]: 5: Hoare triple {13365#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {13367#(= main_~i~0 0)} is VALID [2018-11-23 11:56:39,788 INFO L273 TraceCheckUtils]: 6: Hoare triple {13367#(= 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; {13368#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:39,789 INFO L273 TraceCheckUtils]: 7: Hoare triple {13368#(<= 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; {13369#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:39,789 INFO L273 TraceCheckUtils]: 8: Hoare triple {13369#(<= 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; {13370#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:39,790 INFO L273 TraceCheckUtils]: 9: Hoare triple {13370#(<= 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; {13371#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:39,791 INFO L273 TraceCheckUtils]: 10: Hoare triple {13371#(<= 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; {13372#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:39,792 INFO L273 TraceCheckUtils]: 11: Hoare triple {13372#(<= 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; {13373#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:39,793 INFO L273 TraceCheckUtils]: 12: Hoare triple {13373#(<= 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; {13374#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:39,794 INFO L273 TraceCheckUtils]: 13: Hoare triple {13374#(<= 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; {13375#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:39,795 INFO L273 TraceCheckUtils]: 14: Hoare triple {13375#(<= 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; {13376#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:39,796 INFO L273 TraceCheckUtils]: 15: Hoare triple {13376#(<= 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; {13377#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:39,797 INFO L273 TraceCheckUtils]: 16: Hoare triple {13377#(<= 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; {13378#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:39,798 INFO L273 TraceCheckUtils]: 17: Hoare triple {13378#(<= 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; {13379#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:39,799 INFO L273 TraceCheckUtils]: 18: Hoare triple {13379#(<= 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; {13380#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:39,800 INFO L273 TraceCheckUtils]: 19: Hoare triple {13380#(<= 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; {13381#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:39,822 INFO L273 TraceCheckUtils]: 20: Hoare triple {13381#(<= 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; {13382#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:39,835 INFO L273 TraceCheckUtils]: 21: Hoare triple {13382#(<= 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; {13383#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:39,850 INFO L273 TraceCheckUtils]: 22: Hoare triple {13383#(<= 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; {13384#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:39,859 INFO L273 TraceCheckUtils]: 23: Hoare triple {13384#(<= 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; {13385#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:39,871 INFO L273 TraceCheckUtils]: 24: Hoare triple {13385#(<= 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; {13386#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:39,884 INFO L273 TraceCheckUtils]: 25: Hoare triple {13386#(<= 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; {13387#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:39,885 INFO L273 TraceCheckUtils]: 26: Hoare triple {13387#(<= 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; {13388#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:39,886 INFO L273 TraceCheckUtils]: 27: Hoare triple {13388#(<= 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; {13389#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:39,886 INFO L273 TraceCheckUtils]: 28: Hoare triple {13389#(<= 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; {13390#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:39,887 INFO L273 TraceCheckUtils]: 29: Hoare triple {13390#(<= 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; {13391#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:39,887 INFO L273 TraceCheckUtils]: 30: Hoare triple {13391#(<= 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; {13392#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:39,889 INFO L273 TraceCheckUtils]: 31: Hoare triple {13392#(<= 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; {13393#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:39,890 INFO L273 TraceCheckUtils]: 32: Hoare triple {13393#(<= 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; {13394#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:39,890 INFO L273 TraceCheckUtils]: 33: Hoare triple {13394#(<= 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; {13395#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:39,891 INFO L273 TraceCheckUtils]: 34: Hoare triple {13395#(<= 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; {13396#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:39,891 INFO L273 TraceCheckUtils]: 35: Hoare triple {13396#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13397#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:39,892 INFO L273 TraceCheckUtils]: 36: Hoare triple {13397#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13398#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:39,892 INFO L273 TraceCheckUtils]: 37: Hoare triple {13398#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13399#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:39,893 INFO L273 TraceCheckUtils]: 38: Hoare triple {13399#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13400#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:39,894 INFO L273 TraceCheckUtils]: 39: Hoare triple {13400#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13401#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:39,895 INFO L273 TraceCheckUtils]: 40: Hoare triple {13401#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13402#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:39,896 INFO L273 TraceCheckUtils]: 41: Hoare triple {13402#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13403#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:39,897 INFO L273 TraceCheckUtils]: 42: Hoare triple {13403#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13404#(<= main_~i~0 37)} is VALID [2018-11-23 11:56:39,898 INFO L273 TraceCheckUtils]: 43: Hoare triple {13404#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13405#(<= main_~i~0 38)} is VALID [2018-11-23 11:56:39,899 INFO L273 TraceCheckUtils]: 44: Hoare triple {13405#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13406#(<= main_~i~0 39)} is VALID [2018-11-23 11:56:39,899 INFO L273 TraceCheckUtils]: 45: Hoare triple {13406#(<= main_~i~0 39)} assume !(~i~0 < 100000); {13366#false} is VALID [2018-11-23 11:56:39,900 INFO L273 TraceCheckUtils]: 46: Hoare triple {13366#false} havoc ~x~0;~x~0 := 0; {13366#false} is VALID [2018-11-23 11:56:39,900 INFO L273 TraceCheckUtils]: 47: Hoare triple {13366#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {13366#false} is VALID [2018-11-23 11:56:39,900 INFO L256 TraceCheckUtils]: 48: Hoare triple {13366#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {13366#false} is VALID [2018-11-23 11:56:39,900 INFO L273 TraceCheckUtils]: 49: Hoare triple {13366#false} ~cond := #in~cond; {13366#false} is VALID [2018-11-23 11:56:39,900 INFO L273 TraceCheckUtils]: 50: Hoare triple {13366#false} assume 0 == ~cond; {13366#false} is VALID [2018-11-23 11:56:39,901 INFO L273 TraceCheckUtils]: 51: Hoare triple {13366#false} assume !false; {13366#false} is VALID [2018-11-23 11:56:39,904 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:56:39,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:56:39,904 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:56:39,912 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:57:00,447 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-11-23 11:57:00,447 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:57:00,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:00,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:57:00,720 INFO L256 TraceCheckUtils]: 0: Hoare triple {13365#true} call ULTIMATE.init(); {13365#true} is VALID [2018-11-23 11:57:00,720 INFO L273 TraceCheckUtils]: 1: Hoare triple {13365#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13365#true} is VALID [2018-11-23 11:57:00,720 INFO L273 TraceCheckUtils]: 2: Hoare triple {13365#true} assume true; {13365#true} is VALID [2018-11-23 11:57:00,721 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13365#true} {13365#true} #48#return; {13365#true} is VALID [2018-11-23 11:57:00,721 INFO L256 TraceCheckUtils]: 4: Hoare triple {13365#true} call #t~ret2 := main(); {13365#true} is VALID [2018-11-23 11:57:00,721 INFO L273 TraceCheckUtils]: 5: Hoare triple {13365#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {13425#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:00,722 INFO L273 TraceCheckUtils]: 6: Hoare triple {13425#(<= 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; {13368#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:00,723 INFO L273 TraceCheckUtils]: 7: Hoare triple {13368#(<= 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; {13369#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:00,723 INFO L273 TraceCheckUtils]: 8: Hoare triple {13369#(<= 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; {13370#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:00,724 INFO L273 TraceCheckUtils]: 9: Hoare triple {13370#(<= 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; {13371#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:00,724 INFO L273 TraceCheckUtils]: 10: Hoare triple {13371#(<= 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; {13372#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:00,725 INFO L273 TraceCheckUtils]: 11: Hoare triple {13372#(<= 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; {13373#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:00,726 INFO L273 TraceCheckUtils]: 12: Hoare triple {13373#(<= 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; {13374#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:00,727 INFO L273 TraceCheckUtils]: 13: Hoare triple {13374#(<= 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; {13375#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:00,728 INFO L273 TraceCheckUtils]: 14: Hoare triple {13375#(<= 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; {13376#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:00,729 INFO L273 TraceCheckUtils]: 15: Hoare triple {13376#(<= 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; {13377#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:00,730 INFO L273 TraceCheckUtils]: 16: Hoare triple {13377#(<= 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; {13378#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:00,731 INFO L273 TraceCheckUtils]: 17: Hoare triple {13378#(<= 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; {13379#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:00,732 INFO L273 TraceCheckUtils]: 18: Hoare triple {13379#(<= 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; {13380#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:00,733 INFO L273 TraceCheckUtils]: 19: Hoare triple {13380#(<= 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; {13381#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:00,734 INFO L273 TraceCheckUtils]: 20: Hoare triple {13381#(<= 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; {13382#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:00,735 INFO L273 TraceCheckUtils]: 21: Hoare triple {13382#(<= 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; {13383#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:00,736 INFO L273 TraceCheckUtils]: 22: Hoare triple {13383#(<= 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; {13384#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:00,737 INFO L273 TraceCheckUtils]: 23: Hoare triple {13384#(<= 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; {13385#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:00,737 INFO L273 TraceCheckUtils]: 24: Hoare triple {13385#(<= 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; {13386#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:00,738 INFO L273 TraceCheckUtils]: 25: Hoare triple {13386#(<= 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; {13387#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:00,739 INFO L273 TraceCheckUtils]: 26: Hoare triple {13387#(<= 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; {13388#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:00,740 INFO L273 TraceCheckUtils]: 27: Hoare triple {13388#(<= 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; {13389#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:00,741 INFO L273 TraceCheckUtils]: 28: Hoare triple {13389#(<= 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; {13390#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:00,742 INFO L273 TraceCheckUtils]: 29: Hoare triple {13390#(<= 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; {13391#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:00,743 INFO L273 TraceCheckUtils]: 30: Hoare triple {13391#(<= 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; {13392#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:00,744 INFO L273 TraceCheckUtils]: 31: Hoare triple {13392#(<= 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; {13393#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:00,745 INFO L273 TraceCheckUtils]: 32: Hoare triple {13393#(<= 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; {13394#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:00,746 INFO L273 TraceCheckUtils]: 33: Hoare triple {13394#(<= 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; {13395#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:00,747 INFO L273 TraceCheckUtils]: 34: Hoare triple {13395#(<= 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; {13396#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:00,748 INFO L273 TraceCheckUtils]: 35: Hoare triple {13396#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13397#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:00,749 INFO L273 TraceCheckUtils]: 36: Hoare triple {13397#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13398#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:00,750 INFO L273 TraceCheckUtils]: 37: Hoare triple {13398#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13399#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:00,751 INFO L273 TraceCheckUtils]: 38: Hoare triple {13399#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13400#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:00,751 INFO L273 TraceCheckUtils]: 39: Hoare triple {13400#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13401#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:00,752 INFO L273 TraceCheckUtils]: 40: Hoare triple {13401#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13402#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:00,753 INFO L273 TraceCheckUtils]: 41: Hoare triple {13402#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13403#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:00,754 INFO L273 TraceCheckUtils]: 42: Hoare triple {13403#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13404#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:00,755 INFO L273 TraceCheckUtils]: 43: Hoare triple {13404#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13405#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:00,756 INFO L273 TraceCheckUtils]: 44: Hoare triple {13405#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13406#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:00,757 INFO L273 TraceCheckUtils]: 45: Hoare triple {13406#(<= main_~i~0 39)} assume !(~i~0 < 100000); {13366#false} is VALID [2018-11-23 11:57:00,757 INFO L273 TraceCheckUtils]: 46: Hoare triple {13366#false} havoc ~x~0;~x~0 := 0; {13366#false} is VALID [2018-11-23 11:57:00,757 INFO L273 TraceCheckUtils]: 47: Hoare triple {13366#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {13366#false} is VALID [2018-11-23 11:57:00,757 INFO L256 TraceCheckUtils]: 48: Hoare triple {13366#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {13366#false} is VALID [2018-11-23 11:57:00,758 INFO L273 TraceCheckUtils]: 49: Hoare triple {13366#false} ~cond := #in~cond; {13366#false} is VALID [2018-11-23 11:57:00,758 INFO L273 TraceCheckUtils]: 50: Hoare triple {13366#false} assume 0 == ~cond; {13366#false} is VALID [2018-11-23 11:57:00,758 INFO L273 TraceCheckUtils]: 51: Hoare triple {13366#false} assume !false; {13366#false} is VALID [2018-11-23 11:57:00,762 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:57:00,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:57:00,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 43 [2018-11-23 11:57:00,789 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 52 [2018-11-23 11:57:00,789 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:57:00,789 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states. [2018-11-23 11:57:00,905 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:57:00,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-23 11:57:00,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-23 11:57:00,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 11:57:00,907 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 43 states. [2018-11-23 11:57:01,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:01,403 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2018-11-23 11:57:01,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-23 11:57:01,403 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 52 [2018-11-23 11:57:01,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:57:01,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 11:57:01,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 71 transitions. [2018-11-23 11:57:01,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 11:57:01,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 71 transitions. [2018-11-23 11:57:01,406 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 71 transitions. [2018-11-23 11:57:01,491 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:01,492 INFO L225 Difference]: With dead ends: 69 [2018-11-23 11:57:01,492 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 11:57:01,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 11:57:01,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 11:57:01,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-11-23 11:57:01,527 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:57:01,528 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 58 states. [2018-11-23 11:57:01,528 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-23 11:57:01,528 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-23 11:57:01,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:01,529 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2018-11-23 11:57:01,529 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-11-23 11:57:01,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:01,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:01,530 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-23 11:57:01,531 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-23 11:57:01,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:01,532 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2018-11-23 11:57:01,532 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-11-23 11:57:01,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:01,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:01,533 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:57:01,533 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:57:01,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 11:57:01,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2018-11-23 11:57:01,534 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 52 [2018-11-23 11:57:01,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:57:01,534 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2018-11-23 11:57:01,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-23 11:57:01,534 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-11-23 11:57:01,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 11:57:01,534 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:57:01,534 INFO L402 BasicCegarLoop]: trace histogram [40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:57:01,535 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:57:01,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:57:01,535 INFO L82 PathProgramCache]: Analyzing trace with hash -995640910, now seen corresponding path program 40 times [2018-11-23 11:57:01,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:57:01,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:57:01,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:01,536 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:57:01,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:01,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:02,421 INFO L256 TraceCheckUtils]: 0: Hoare triple {13905#true} call ULTIMATE.init(); {13905#true} is VALID [2018-11-23 11:57:02,421 INFO L273 TraceCheckUtils]: 1: Hoare triple {13905#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13905#true} is VALID [2018-11-23 11:57:02,421 INFO L273 TraceCheckUtils]: 2: Hoare triple {13905#true} assume true; {13905#true} is VALID [2018-11-23 11:57:02,421 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13905#true} {13905#true} #48#return; {13905#true} is VALID [2018-11-23 11:57:02,421 INFO L256 TraceCheckUtils]: 4: Hoare triple {13905#true} call #t~ret2 := main(); {13905#true} is VALID [2018-11-23 11:57:02,422 INFO L273 TraceCheckUtils]: 5: Hoare triple {13905#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {13907#(= main_~i~0 0)} is VALID [2018-11-23 11:57:02,423 INFO L273 TraceCheckUtils]: 6: Hoare triple {13907#(= 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; {13908#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:02,424 INFO L273 TraceCheckUtils]: 7: Hoare triple {13908#(<= 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; {13909#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:02,425 INFO L273 TraceCheckUtils]: 8: Hoare triple {13909#(<= 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; {13910#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:02,425 INFO L273 TraceCheckUtils]: 9: Hoare triple {13910#(<= 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; {13911#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:02,426 INFO L273 TraceCheckUtils]: 10: Hoare triple {13911#(<= 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; {13912#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:02,427 INFO L273 TraceCheckUtils]: 11: Hoare triple {13912#(<= 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; {13913#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:02,428 INFO L273 TraceCheckUtils]: 12: Hoare triple {13913#(<= 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; {13914#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:02,429 INFO L273 TraceCheckUtils]: 13: Hoare triple {13914#(<= 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; {13915#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:02,430 INFO L273 TraceCheckUtils]: 14: Hoare triple {13915#(<= 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; {13916#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:02,431 INFO L273 TraceCheckUtils]: 15: Hoare triple {13916#(<= 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; {13917#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:02,432 INFO L273 TraceCheckUtils]: 16: Hoare triple {13917#(<= 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; {13918#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:02,433 INFO L273 TraceCheckUtils]: 17: Hoare triple {13918#(<= 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; {13919#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:02,434 INFO L273 TraceCheckUtils]: 18: Hoare triple {13919#(<= 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; {13920#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:02,435 INFO L273 TraceCheckUtils]: 19: Hoare triple {13920#(<= 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; {13921#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:02,436 INFO L273 TraceCheckUtils]: 20: Hoare triple {13921#(<= 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; {13922#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:02,437 INFO L273 TraceCheckUtils]: 21: Hoare triple {13922#(<= 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; {13923#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:02,438 INFO L273 TraceCheckUtils]: 22: Hoare triple {13923#(<= 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; {13924#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:02,439 INFO L273 TraceCheckUtils]: 23: Hoare triple {13924#(<= 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; {13925#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:02,440 INFO L273 TraceCheckUtils]: 24: Hoare triple {13925#(<= 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; {13926#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:02,440 INFO L273 TraceCheckUtils]: 25: Hoare triple {13926#(<= 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; {13927#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:02,441 INFO L273 TraceCheckUtils]: 26: Hoare triple {13927#(<= 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; {13928#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:02,442 INFO L273 TraceCheckUtils]: 27: Hoare triple {13928#(<= 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; {13929#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:02,443 INFO L273 TraceCheckUtils]: 28: Hoare triple {13929#(<= 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; {13930#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:02,444 INFO L273 TraceCheckUtils]: 29: Hoare triple {13930#(<= 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; {13931#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:02,445 INFO L273 TraceCheckUtils]: 30: Hoare triple {13931#(<= 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; {13932#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:02,446 INFO L273 TraceCheckUtils]: 31: Hoare triple {13932#(<= 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; {13933#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:02,447 INFO L273 TraceCheckUtils]: 32: Hoare triple {13933#(<= 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; {13934#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:02,448 INFO L273 TraceCheckUtils]: 33: Hoare triple {13934#(<= 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; {13935#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:02,449 INFO L273 TraceCheckUtils]: 34: Hoare triple {13935#(<= 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; {13936#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:02,450 INFO L273 TraceCheckUtils]: 35: Hoare triple {13936#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13937#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:02,451 INFO L273 TraceCheckUtils]: 36: Hoare triple {13937#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13938#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:02,452 INFO L273 TraceCheckUtils]: 37: Hoare triple {13938#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13939#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:02,453 INFO L273 TraceCheckUtils]: 38: Hoare triple {13939#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13940#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:02,453 INFO L273 TraceCheckUtils]: 39: Hoare triple {13940#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13941#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:02,454 INFO L273 TraceCheckUtils]: 40: Hoare triple {13941#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13942#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:02,455 INFO L273 TraceCheckUtils]: 41: Hoare triple {13942#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13943#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:02,456 INFO L273 TraceCheckUtils]: 42: Hoare triple {13943#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13944#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:02,457 INFO L273 TraceCheckUtils]: 43: Hoare triple {13944#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13945#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:02,458 INFO L273 TraceCheckUtils]: 44: Hoare triple {13945#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13946#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:02,459 INFO L273 TraceCheckUtils]: 45: Hoare triple {13946#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13947#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:02,460 INFO L273 TraceCheckUtils]: 46: Hoare triple {13947#(<= main_~i~0 40)} assume !(~i~0 < 100000); {13906#false} is VALID [2018-11-23 11:57:02,460 INFO L273 TraceCheckUtils]: 47: Hoare triple {13906#false} havoc ~x~0;~x~0 := 0; {13906#false} is VALID [2018-11-23 11:57:02,460 INFO L273 TraceCheckUtils]: 48: Hoare triple {13906#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {13906#false} is VALID [2018-11-23 11:57:02,461 INFO L256 TraceCheckUtils]: 49: Hoare triple {13906#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {13906#false} is VALID [2018-11-23 11:57:02,461 INFO L273 TraceCheckUtils]: 50: Hoare triple {13906#false} ~cond := #in~cond; {13906#false} is VALID [2018-11-23 11:57:02,461 INFO L273 TraceCheckUtils]: 51: Hoare triple {13906#false} assume 0 == ~cond; {13906#false} is VALID [2018-11-23 11:57:02,461 INFO L273 TraceCheckUtils]: 52: Hoare triple {13906#false} assume !false; {13906#false} is VALID [2018-11-23 11:57:02,465 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:57:02,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:57:02,466 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:57:02,481 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:57:02,518 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:57:02,518 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:57:02,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:02,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:57:02,748 INFO L256 TraceCheckUtils]: 0: Hoare triple {13905#true} call ULTIMATE.init(); {13905#true} is VALID [2018-11-23 11:57:02,749 INFO L273 TraceCheckUtils]: 1: Hoare triple {13905#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13905#true} is VALID [2018-11-23 11:57:02,749 INFO L273 TraceCheckUtils]: 2: Hoare triple {13905#true} assume true; {13905#true} is VALID [2018-11-23 11:57:02,749 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13905#true} {13905#true} #48#return; {13905#true} is VALID [2018-11-23 11:57:02,749 INFO L256 TraceCheckUtils]: 4: Hoare triple {13905#true} call #t~ret2 := main(); {13905#true} is VALID [2018-11-23 11:57:02,750 INFO L273 TraceCheckUtils]: 5: Hoare triple {13905#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {13966#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:02,751 INFO L273 TraceCheckUtils]: 6: Hoare triple {13966#(<= 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; {13908#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:02,751 INFO L273 TraceCheckUtils]: 7: Hoare triple {13908#(<= 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; {13909#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:02,752 INFO L273 TraceCheckUtils]: 8: Hoare triple {13909#(<= 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; {13910#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:02,752 INFO L273 TraceCheckUtils]: 9: Hoare triple {13910#(<= 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; {13911#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:02,753 INFO L273 TraceCheckUtils]: 10: Hoare triple {13911#(<= 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; {13912#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:02,754 INFO L273 TraceCheckUtils]: 11: Hoare triple {13912#(<= 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; {13913#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:02,755 INFO L273 TraceCheckUtils]: 12: Hoare triple {13913#(<= 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; {13914#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:02,756 INFO L273 TraceCheckUtils]: 13: Hoare triple {13914#(<= 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; {13915#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:02,757 INFO L273 TraceCheckUtils]: 14: Hoare triple {13915#(<= 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; {13916#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:02,758 INFO L273 TraceCheckUtils]: 15: Hoare triple {13916#(<= 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; {13917#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:02,759 INFO L273 TraceCheckUtils]: 16: Hoare triple {13917#(<= 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; {13918#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:02,759 INFO L273 TraceCheckUtils]: 17: Hoare triple {13918#(<= 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; {13919#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:02,760 INFO L273 TraceCheckUtils]: 18: Hoare triple {13919#(<= 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; {13920#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:02,761 INFO L273 TraceCheckUtils]: 19: Hoare triple {13920#(<= 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; {13921#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:02,762 INFO L273 TraceCheckUtils]: 20: Hoare triple {13921#(<= 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; {13922#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:02,763 INFO L273 TraceCheckUtils]: 21: Hoare triple {13922#(<= 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; {13923#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:02,764 INFO L273 TraceCheckUtils]: 22: Hoare triple {13923#(<= 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; {13924#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:02,765 INFO L273 TraceCheckUtils]: 23: Hoare triple {13924#(<= 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; {13925#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:02,766 INFO L273 TraceCheckUtils]: 24: Hoare triple {13925#(<= 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; {13926#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:02,767 INFO L273 TraceCheckUtils]: 25: Hoare triple {13926#(<= 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; {13927#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:02,768 INFO L273 TraceCheckUtils]: 26: Hoare triple {13927#(<= 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; {13928#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:02,769 INFO L273 TraceCheckUtils]: 27: Hoare triple {13928#(<= 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; {13929#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:02,770 INFO L273 TraceCheckUtils]: 28: Hoare triple {13929#(<= 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; {13930#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:02,771 INFO L273 TraceCheckUtils]: 29: Hoare triple {13930#(<= 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; {13931#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:02,772 INFO L273 TraceCheckUtils]: 30: Hoare triple {13931#(<= 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; {13932#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:02,773 INFO L273 TraceCheckUtils]: 31: Hoare triple {13932#(<= 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; {13933#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:02,774 INFO L273 TraceCheckUtils]: 32: Hoare triple {13933#(<= 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; {13934#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:02,775 INFO L273 TraceCheckUtils]: 33: Hoare triple {13934#(<= 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; {13935#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:02,776 INFO L273 TraceCheckUtils]: 34: Hoare triple {13935#(<= 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; {13936#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:02,779 INFO L273 TraceCheckUtils]: 35: Hoare triple {13936#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13937#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:02,780 INFO L273 TraceCheckUtils]: 36: Hoare triple {13937#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13938#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:02,782 INFO L273 TraceCheckUtils]: 37: Hoare triple {13938#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13939#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:02,783 INFO L273 TraceCheckUtils]: 38: Hoare triple {13939#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13940#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:02,784 INFO L273 TraceCheckUtils]: 39: Hoare triple {13940#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13941#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:02,785 INFO L273 TraceCheckUtils]: 40: Hoare triple {13941#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13942#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:02,786 INFO L273 TraceCheckUtils]: 41: Hoare triple {13942#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13943#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:02,787 INFO L273 TraceCheckUtils]: 42: Hoare triple {13943#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13944#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:02,788 INFO L273 TraceCheckUtils]: 43: Hoare triple {13944#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13945#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:02,789 INFO L273 TraceCheckUtils]: 44: Hoare triple {13945#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13946#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:02,790 INFO L273 TraceCheckUtils]: 45: Hoare triple {13946#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13947#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:02,790 INFO L273 TraceCheckUtils]: 46: Hoare triple {13947#(<= main_~i~0 40)} assume !(~i~0 < 100000); {13906#false} is VALID [2018-11-23 11:57:02,790 INFO L273 TraceCheckUtils]: 47: Hoare triple {13906#false} havoc ~x~0;~x~0 := 0; {13906#false} is VALID [2018-11-23 11:57:02,791 INFO L273 TraceCheckUtils]: 48: Hoare triple {13906#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {13906#false} is VALID [2018-11-23 11:57:02,791 INFO L256 TraceCheckUtils]: 49: Hoare triple {13906#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {13906#false} is VALID [2018-11-23 11:57:02,791 INFO L273 TraceCheckUtils]: 50: Hoare triple {13906#false} ~cond := #in~cond; {13906#false} is VALID [2018-11-23 11:57:02,791 INFO L273 TraceCheckUtils]: 51: Hoare triple {13906#false} assume 0 == ~cond; {13906#false} is VALID [2018-11-23 11:57:02,791 INFO L273 TraceCheckUtils]: 52: Hoare triple {13906#false} assume !false; {13906#false} is VALID [2018-11-23 11:57:02,795 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:57:02,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:57:02,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2018-11-23 11:57:02,814 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 53 [2018-11-23 11:57:02,814 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:57:02,815 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states. [2018-11-23 11:57:02,864 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:02,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-23 11:57:02,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-23 11:57:02,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 11:57:02,866 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 44 states. [2018-11-23 11:57:03,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:03,458 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2018-11-23 11:57:03,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-23 11:57:03,458 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 53 [2018-11-23 11:57:03,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:57:03,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 11:57:03,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 72 transitions. [2018-11-23 11:57:03,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 11:57:03,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 72 transitions. [2018-11-23 11:57:03,461 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 72 transitions. [2018-11-23 11:57:03,525 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:57:03,526 INFO L225 Difference]: With dead ends: 70 [2018-11-23 11:57:03,527 INFO L226 Difference]: Without dead ends: 59 [2018-11-23 11:57:03,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 11:57:03,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-23 11:57:03,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-11-23 11:57:03,567 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:57:03,567 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 59 states. [2018-11-23 11:57:03,567 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2018-11-23 11:57:03,568 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2018-11-23 11:57:03,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:03,569 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2018-11-23 11:57:03,569 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-11-23 11:57:03,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:03,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:03,570 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2018-11-23 11:57:03,570 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2018-11-23 11:57:03,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:03,571 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2018-11-23 11:57:03,571 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-11-23 11:57:03,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:03,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:03,571 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:57:03,571 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:57:03,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 11:57:03,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-11-23 11:57:03,572 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 53 [2018-11-23 11:57:03,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:57:03,572 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-11-23 11:57:03,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-23 11:57:03,573 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-11-23 11:57:03,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-23 11:57:03,573 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:57:03,573 INFO L402 BasicCegarLoop]: trace histogram [41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:57:03,573 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:57:03,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:57:03,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1403791470, now seen corresponding path program 41 times [2018-11-23 11:57:03,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:57:03,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:57:03,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:03,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:57:03,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:03,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:04,502 INFO L256 TraceCheckUtils]: 0: Hoare triple {14455#true} call ULTIMATE.init(); {14455#true} is VALID [2018-11-23 11:57:04,503 INFO L273 TraceCheckUtils]: 1: Hoare triple {14455#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14455#true} is VALID [2018-11-23 11:57:04,503 INFO L273 TraceCheckUtils]: 2: Hoare triple {14455#true} assume true; {14455#true} is VALID [2018-11-23 11:57:04,503 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14455#true} {14455#true} #48#return; {14455#true} is VALID [2018-11-23 11:57:04,503 INFO L256 TraceCheckUtils]: 4: Hoare triple {14455#true} call #t~ret2 := main(); {14455#true} is VALID [2018-11-23 11:57:04,527 INFO L273 TraceCheckUtils]: 5: Hoare triple {14455#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {14457#(= main_~i~0 0)} is VALID [2018-11-23 11:57:04,530 INFO L273 TraceCheckUtils]: 6: Hoare triple {14457#(= 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; {14458#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:04,530 INFO L273 TraceCheckUtils]: 7: Hoare triple {14458#(<= 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; {14459#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:04,531 INFO L273 TraceCheckUtils]: 8: Hoare triple {14459#(<= 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; {14460#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:04,532 INFO L273 TraceCheckUtils]: 9: Hoare triple {14460#(<= 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; {14461#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:04,532 INFO L273 TraceCheckUtils]: 10: Hoare triple {14461#(<= 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; {14462#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:04,533 INFO L273 TraceCheckUtils]: 11: Hoare triple {14462#(<= 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; {14463#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:04,533 INFO L273 TraceCheckUtils]: 12: Hoare triple {14463#(<= 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; {14464#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:04,534 INFO L273 TraceCheckUtils]: 13: Hoare triple {14464#(<= 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; {14465#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:04,534 INFO L273 TraceCheckUtils]: 14: Hoare triple {14465#(<= 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; {14466#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:04,535 INFO L273 TraceCheckUtils]: 15: Hoare triple {14466#(<= 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; {14467#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:04,536 INFO L273 TraceCheckUtils]: 16: Hoare triple {14467#(<= 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; {14468#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:04,537 INFO L273 TraceCheckUtils]: 17: Hoare triple {14468#(<= 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; {14469#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:04,538 INFO L273 TraceCheckUtils]: 18: Hoare triple {14469#(<= 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; {14470#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:04,539 INFO L273 TraceCheckUtils]: 19: Hoare triple {14470#(<= 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; {14471#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:04,540 INFO L273 TraceCheckUtils]: 20: Hoare triple {14471#(<= 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; {14472#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:04,541 INFO L273 TraceCheckUtils]: 21: Hoare triple {14472#(<= 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; {14473#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:04,542 INFO L273 TraceCheckUtils]: 22: Hoare triple {14473#(<= 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; {14474#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:04,543 INFO L273 TraceCheckUtils]: 23: Hoare triple {14474#(<= 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; {14475#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:04,544 INFO L273 TraceCheckUtils]: 24: Hoare triple {14475#(<= 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; {14476#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:04,545 INFO L273 TraceCheckUtils]: 25: Hoare triple {14476#(<= 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; {14477#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:04,546 INFO L273 TraceCheckUtils]: 26: Hoare triple {14477#(<= 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; {14478#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:04,547 INFO L273 TraceCheckUtils]: 27: Hoare triple {14478#(<= 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; {14479#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:04,548 INFO L273 TraceCheckUtils]: 28: Hoare triple {14479#(<= 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; {14480#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:04,549 INFO L273 TraceCheckUtils]: 29: Hoare triple {14480#(<= 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; {14481#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:04,549 INFO L273 TraceCheckUtils]: 30: Hoare triple {14481#(<= 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; {14482#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:04,550 INFO L273 TraceCheckUtils]: 31: Hoare triple {14482#(<= 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; {14483#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:04,551 INFO L273 TraceCheckUtils]: 32: Hoare triple {14483#(<= 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; {14484#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:04,552 INFO L273 TraceCheckUtils]: 33: Hoare triple {14484#(<= 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; {14485#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:04,553 INFO L273 TraceCheckUtils]: 34: Hoare triple {14485#(<= 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; {14486#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:04,554 INFO L273 TraceCheckUtils]: 35: Hoare triple {14486#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14487#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:04,555 INFO L273 TraceCheckUtils]: 36: Hoare triple {14487#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14488#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:04,556 INFO L273 TraceCheckUtils]: 37: Hoare triple {14488#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14489#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:04,557 INFO L273 TraceCheckUtils]: 38: Hoare triple {14489#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14490#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:04,558 INFO L273 TraceCheckUtils]: 39: Hoare triple {14490#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14491#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:04,559 INFO L273 TraceCheckUtils]: 40: Hoare triple {14491#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14492#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:04,560 INFO L273 TraceCheckUtils]: 41: Hoare triple {14492#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14493#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:04,561 INFO L273 TraceCheckUtils]: 42: Hoare triple {14493#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14494#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:04,562 INFO L273 TraceCheckUtils]: 43: Hoare triple {14494#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14495#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:04,562 INFO L273 TraceCheckUtils]: 44: Hoare triple {14495#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14496#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:04,563 INFO L273 TraceCheckUtils]: 45: Hoare triple {14496#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14497#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:04,567 INFO L273 TraceCheckUtils]: 46: Hoare triple {14497#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14498#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:04,568 INFO L273 TraceCheckUtils]: 47: Hoare triple {14498#(<= main_~i~0 41)} assume !(~i~0 < 100000); {14456#false} is VALID [2018-11-23 11:57:04,568 INFO L273 TraceCheckUtils]: 48: Hoare triple {14456#false} havoc ~x~0;~x~0 := 0; {14456#false} is VALID [2018-11-23 11:57:04,568 INFO L273 TraceCheckUtils]: 49: Hoare triple {14456#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {14456#false} is VALID [2018-11-23 11:57:04,568 INFO L256 TraceCheckUtils]: 50: Hoare triple {14456#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {14456#false} is VALID [2018-11-23 11:57:04,568 INFO L273 TraceCheckUtils]: 51: Hoare triple {14456#false} ~cond := #in~cond; {14456#false} is VALID [2018-11-23 11:57:04,568 INFO L273 TraceCheckUtils]: 52: Hoare triple {14456#false} assume 0 == ~cond; {14456#false} is VALID [2018-11-23 11:57:04,568 INFO L273 TraceCheckUtils]: 53: Hoare triple {14456#false} assume !false; {14456#false} is VALID [2018-11-23 11:57:04,571 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:57:04,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:57:04,571 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:57:04,580 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:57:06,384 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2018-11-23 11:57:06,384 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:57:06,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:06,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:57:06,644 INFO L256 TraceCheckUtils]: 0: Hoare triple {14455#true} call ULTIMATE.init(); {14455#true} is VALID [2018-11-23 11:57:06,644 INFO L273 TraceCheckUtils]: 1: Hoare triple {14455#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14455#true} is VALID [2018-11-23 11:57:06,644 INFO L273 TraceCheckUtils]: 2: Hoare triple {14455#true} assume true; {14455#true} is VALID [2018-11-23 11:57:06,645 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14455#true} {14455#true} #48#return; {14455#true} is VALID [2018-11-23 11:57:06,645 INFO L256 TraceCheckUtils]: 4: Hoare triple {14455#true} call #t~ret2 := main(); {14455#true} is VALID [2018-11-23 11:57:06,646 INFO L273 TraceCheckUtils]: 5: Hoare triple {14455#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {14517#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:06,646 INFO L273 TraceCheckUtils]: 6: Hoare triple {14517#(<= 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; {14458#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:06,647 INFO L273 TraceCheckUtils]: 7: Hoare triple {14458#(<= 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; {14459#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:06,648 INFO L273 TraceCheckUtils]: 8: Hoare triple {14459#(<= 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; {14460#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:06,648 INFO L273 TraceCheckUtils]: 9: Hoare triple {14460#(<= 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; {14461#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:06,649 INFO L273 TraceCheckUtils]: 10: Hoare triple {14461#(<= 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; {14462#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:06,649 INFO L273 TraceCheckUtils]: 11: Hoare triple {14462#(<= 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; {14463#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:06,650 INFO L273 TraceCheckUtils]: 12: Hoare triple {14463#(<= 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; {14464#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:06,651 INFO L273 TraceCheckUtils]: 13: Hoare triple {14464#(<= 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; {14465#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:06,652 INFO L273 TraceCheckUtils]: 14: Hoare triple {14465#(<= 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; {14466#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:06,653 INFO L273 TraceCheckUtils]: 15: Hoare triple {14466#(<= 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; {14467#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:06,654 INFO L273 TraceCheckUtils]: 16: Hoare triple {14467#(<= 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; {14468#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:06,655 INFO L273 TraceCheckUtils]: 17: Hoare triple {14468#(<= 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; {14469#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:06,656 INFO L273 TraceCheckUtils]: 18: Hoare triple {14469#(<= 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; {14470#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:06,657 INFO L273 TraceCheckUtils]: 19: Hoare triple {14470#(<= 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; {14471#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:06,658 INFO L273 TraceCheckUtils]: 20: Hoare triple {14471#(<= 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; {14472#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:06,659 INFO L273 TraceCheckUtils]: 21: Hoare triple {14472#(<= 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; {14473#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:06,660 INFO L273 TraceCheckUtils]: 22: Hoare triple {14473#(<= 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; {14474#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:06,661 INFO L273 TraceCheckUtils]: 23: Hoare triple {14474#(<= 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; {14475#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:06,662 INFO L273 TraceCheckUtils]: 24: Hoare triple {14475#(<= 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; {14476#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:06,663 INFO L273 TraceCheckUtils]: 25: Hoare triple {14476#(<= 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; {14477#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:06,663 INFO L273 TraceCheckUtils]: 26: Hoare triple {14477#(<= 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; {14478#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:06,664 INFO L273 TraceCheckUtils]: 27: Hoare triple {14478#(<= 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; {14479#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:06,665 INFO L273 TraceCheckUtils]: 28: Hoare triple {14479#(<= 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; {14480#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:06,666 INFO L273 TraceCheckUtils]: 29: Hoare triple {14480#(<= 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; {14481#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:06,667 INFO L273 TraceCheckUtils]: 30: Hoare triple {14481#(<= 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; {14482#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:06,668 INFO L273 TraceCheckUtils]: 31: Hoare triple {14482#(<= 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; {14483#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:06,669 INFO L273 TraceCheckUtils]: 32: Hoare triple {14483#(<= 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; {14484#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:06,670 INFO L273 TraceCheckUtils]: 33: Hoare triple {14484#(<= 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; {14485#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:06,671 INFO L273 TraceCheckUtils]: 34: Hoare triple {14485#(<= 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; {14486#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:06,672 INFO L273 TraceCheckUtils]: 35: Hoare triple {14486#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14487#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:06,673 INFO L273 TraceCheckUtils]: 36: Hoare triple {14487#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14488#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:06,674 INFO L273 TraceCheckUtils]: 37: Hoare triple {14488#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14489#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:06,675 INFO L273 TraceCheckUtils]: 38: Hoare triple {14489#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14490#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:06,676 INFO L273 TraceCheckUtils]: 39: Hoare triple {14490#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14491#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:06,677 INFO L273 TraceCheckUtils]: 40: Hoare triple {14491#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14492#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:06,678 INFO L273 TraceCheckUtils]: 41: Hoare triple {14492#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14493#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:06,679 INFO L273 TraceCheckUtils]: 42: Hoare triple {14493#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14494#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:06,680 INFO L273 TraceCheckUtils]: 43: Hoare triple {14494#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14495#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:06,681 INFO L273 TraceCheckUtils]: 44: Hoare triple {14495#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14496#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:06,681 INFO L273 TraceCheckUtils]: 45: Hoare triple {14496#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14497#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:06,682 INFO L273 TraceCheckUtils]: 46: Hoare triple {14497#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14498#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:06,683 INFO L273 TraceCheckUtils]: 47: Hoare triple {14498#(<= main_~i~0 41)} assume !(~i~0 < 100000); {14456#false} is VALID [2018-11-23 11:57:06,683 INFO L273 TraceCheckUtils]: 48: Hoare triple {14456#false} havoc ~x~0;~x~0 := 0; {14456#false} is VALID [2018-11-23 11:57:06,684 INFO L273 TraceCheckUtils]: 49: Hoare triple {14456#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {14456#false} is VALID [2018-11-23 11:57:06,684 INFO L256 TraceCheckUtils]: 50: Hoare triple {14456#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {14456#false} is VALID [2018-11-23 11:57:06,684 INFO L273 TraceCheckUtils]: 51: Hoare triple {14456#false} ~cond := #in~cond; {14456#false} is VALID [2018-11-23 11:57:06,684 INFO L273 TraceCheckUtils]: 52: Hoare triple {14456#false} assume 0 == ~cond; {14456#false} is VALID [2018-11-23 11:57:06,684 INFO L273 TraceCheckUtils]: 53: Hoare triple {14456#false} assume !false; {14456#false} is VALID [2018-11-23 11:57:06,688 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:57:06,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:57:06,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 45 [2018-11-23 11:57:06,709 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 54 [2018-11-23 11:57:06,709 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:57:06,710 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states. [2018-11-23 11:57:06,752 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:57:06,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-23 11:57:06,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-23 11:57:06,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-11-23 11:57:06,754 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 45 states. [2018-11-23 11:57:07,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:07,461 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2018-11-23 11:57:07,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-23 11:57:07,462 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 54 [2018-11-23 11:57:07,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:57:07,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 11:57:07,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 73 transitions. [2018-11-23 11:57:07,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 11:57:07,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 73 transitions. [2018-11-23 11:57:07,465 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states and 73 transitions. [2018-11-23 11:57:07,651 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:07,652 INFO L225 Difference]: With dead ends: 71 [2018-11-23 11:57:07,652 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 11:57:07,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-11-23 11:57:07,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 11:57:08,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-11-23 11:57:08,800 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:57:08,800 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 60 states. [2018-11-23 11:57:08,801 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 60 states. [2018-11-23 11:57:08,801 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 60 states. [2018-11-23 11:57:08,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:08,802 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2018-11-23 11:57:08,802 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-11-23 11:57:08,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:08,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:08,803 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 60 states. [2018-11-23 11:57:08,803 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 60 states. [2018-11-23 11:57:08,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:08,806 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2018-11-23 11:57:08,806 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-11-23 11:57:08,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:08,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:08,807 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:57:08,807 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:57:08,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 11:57:08,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-11-23 11:57:08,808 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 54 [2018-11-23 11:57:08,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:57:08,809 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-11-23 11:57:08,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-23 11:57:08,809 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-11-23 11:57:08,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 11:57:08,809 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:57:08,810 INFO L402 BasicCegarLoop]: trace histogram [42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:57:08,810 INFO L423 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:57:08,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:57:08,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1523216078, now seen corresponding path program 42 times [2018-11-23 11:57:08,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:57:08,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:57:08,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:08,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:57:08,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:08,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:10,928 INFO L256 TraceCheckUtils]: 0: Hoare triple {15015#true} call ULTIMATE.init(); {15015#true} is VALID [2018-11-23 11:57:10,928 INFO L273 TraceCheckUtils]: 1: Hoare triple {15015#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15015#true} is VALID [2018-11-23 11:57:10,928 INFO L273 TraceCheckUtils]: 2: Hoare triple {15015#true} assume true; {15015#true} is VALID [2018-11-23 11:57:10,928 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15015#true} {15015#true} #48#return; {15015#true} is VALID [2018-11-23 11:57:10,929 INFO L256 TraceCheckUtils]: 4: Hoare triple {15015#true} call #t~ret2 := main(); {15015#true} is VALID [2018-11-23 11:57:10,929 INFO L273 TraceCheckUtils]: 5: Hoare triple {15015#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {15017#(= main_~i~0 0)} is VALID [2018-11-23 11:57:10,929 INFO L273 TraceCheckUtils]: 6: Hoare triple {15017#(= 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; {15018#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:10,930 INFO L273 TraceCheckUtils]: 7: Hoare triple {15018#(<= 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; {15019#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:10,931 INFO L273 TraceCheckUtils]: 8: Hoare triple {15019#(<= 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; {15020#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:10,932 INFO L273 TraceCheckUtils]: 9: Hoare triple {15020#(<= 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; {15021#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:10,933 INFO L273 TraceCheckUtils]: 10: Hoare triple {15021#(<= 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; {15022#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:10,933 INFO L273 TraceCheckUtils]: 11: Hoare triple {15022#(<= 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; {15023#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:10,934 INFO L273 TraceCheckUtils]: 12: Hoare triple {15023#(<= 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; {15024#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:10,935 INFO L273 TraceCheckUtils]: 13: Hoare triple {15024#(<= 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; {15025#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:10,936 INFO L273 TraceCheckUtils]: 14: Hoare triple {15025#(<= 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; {15026#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:10,937 INFO L273 TraceCheckUtils]: 15: Hoare triple {15026#(<= 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; {15027#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:10,938 INFO L273 TraceCheckUtils]: 16: Hoare triple {15027#(<= 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; {15028#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:10,939 INFO L273 TraceCheckUtils]: 17: Hoare triple {15028#(<= 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; {15029#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:10,940 INFO L273 TraceCheckUtils]: 18: Hoare triple {15029#(<= 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; {15030#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:10,941 INFO L273 TraceCheckUtils]: 19: Hoare triple {15030#(<= 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; {15031#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:10,942 INFO L273 TraceCheckUtils]: 20: Hoare triple {15031#(<= 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; {15032#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:10,943 INFO L273 TraceCheckUtils]: 21: Hoare triple {15032#(<= 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; {15033#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:10,944 INFO L273 TraceCheckUtils]: 22: Hoare triple {15033#(<= 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; {15034#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:10,945 INFO L273 TraceCheckUtils]: 23: Hoare triple {15034#(<= 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; {15035#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:10,946 INFO L273 TraceCheckUtils]: 24: Hoare triple {15035#(<= 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; {15036#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:10,947 INFO L273 TraceCheckUtils]: 25: Hoare triple {15036#(<= 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; {15037#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:10,948 INFO L273 TraceCheckUtils]: 26: Hoare triple {15037#(<= 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; {15038#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:10,948 INFO L273 TraceCheckUtils]: 27: Hoare triple {15038#(<= 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; {15039#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:10,949 INFO L273 TraceCheckUtils]: 28: Hoare triple {15039#(<= 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; {15040#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:10,950 INFO L273 TraceCheckUtils]: 29: Hoare triple {15040#(<= 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; {15041#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:10,951 INFO L273 TraceCheckUtils]: 30: Hoare triple {15041#(<= 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; {15042#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:10,952 INFO L273 TraceCheckUtils]: 31: Hoare triple {15042#(<= 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; {15043#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:10,953 INFO L273 TraceCheckUtils]: 32: Hoare triple {15043#(<= 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; {15044#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:10,954 INFO L273 TraceCheckUtils]: 33: Hoare triple {15044#(<= 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; {15045#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:10,955 INFO L273 TraceCheckUtils]: 34: Hoare triple {15045#(<= 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; {15046#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:10,956 INFO L273 TraceCheckUtils]: 35: Hoare triple {15046#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15047#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:10,957 INFO L273 TraceCheckUtils]: 36: Hoare triple {15047#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15048#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:10,958 INFO L273 TraceCheckUtils]: 37: Hoare triple {15048#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15049#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:10,959 INFO L273 TraceCheckUtils]: 38: Hoare triple {15049#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15050#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:10,960 INFO L273 TraceCheckUtils]: 39: Hoare triple {15050#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15051#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:10,961 INFO L273 TraceCheckUtils]: 40: Hoare triple {15051#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15052#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:10,962 INFO L273 TraceCheckUtils]: 41: Hoare triple {15052#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15053#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:10,963 INFO L273 TraceCheckUtils]: 42: Hoare triple {15053#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15054#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:10,964 INFO L273 TraceCheckUtils]: 43: Hoare triple {15054#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15055#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:10,964 INFO L273 TraceCheckUtils]: 44: Hoare triple {15055#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15056#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:10,965 INFO L273 TraceCheckUtils]: 45: Hoare triple {15056#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15057#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:10,966 INFO L273 TraceCheckUtils]: 46: Hoare triple {15057#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15058#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:10,967 INFO L273 TraceCheckUtils]: 47: Hoare triple {15058#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15059#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:10,968 INFO L273 TraceCheckUtils]: 48: Hoare triple {15059#(<= main_~i~0 42)} assume !(~i~0 < 100000); {15016#false} is VALID [2018-11-23 11:57:10,968 INFO L273 TraceCheckUtils]: 49: Hoare triple {15016#false} havoc ~x~0;~x~0 := 0; {15016#false} is VALID [2018-11-23 11:57:10,968 INFO L273 TraceCheckUtils]: 50: Hoare triple {15016#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {15016#false} is VALID [2018-11-23 11:57:10,969 INFO L256 TraceCheckUtils]: 51: Hoare triple {15016#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {15016#false} is VALID [2018-11-23 11:57:10,969 INFO L273 TraceCheckUtils]: 52: Hoare triple {15016#false} ~cond := #in~cond; {15016#false} is VALID [2018-11-23 11:57:10,969 INFO L273 TraceCheckUtils]: 53: Hoare triple {15016#false} assume 0 == ~cond; {15016#false} is VALID [2018-11-23 11:57:10,969 INFO L273 TraceCheckUtils]: 54: Hoare triple {15016#false} assume !false; {15016#false} is VALID [2018-11-23 11:57:10,973 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:57:10,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:57:10,973 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:57:10,982 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:57:57,200 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2018-11-23 11:57:57,200 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:57:57,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:57,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:57:57,471 INFO L256 TraceCheckUtils]: 0: Hoare triple {15015#true} call ULTIMATE.init(); {15015#true} is VALID [2018-11-23 11:57:57,471 INFO L273 TraceCheckUtils]: 1: Hoare triple {15015#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15015#true} is VALID [2018-11-23 11:57:57,472 INFO L273 TraceCheckUtils]: 2: Hoare triple {15015#true} assume true; {15015#true} is VALID [2018-11-23 11:57:57,472 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15015#true} {15015#true} #48#return; {15015#true} is VALID [2018-11-23 11:57:57,472 INFO L256 TraceCheckUtils]: 4: Hoare triple {15015#true} call #t~ret2 := main(); {15015#true} is VALID [2018-11-23 11:57:57,473 INFO L273 TraceCheckUtils]: 5: Hoare triple {15015#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {15078#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:57,474 INFO L273 TraceCheckUtils]: 6: Hoare triple {15078#(<= 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; {15018#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:57,475 INFO L273 TraceCheckUtils]: 7: Hoare triple {15018#(<= 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; {15019#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:57,475 INFO L273 TraceCheckUtils]: 8: Hoare triple {15019#(<= 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; {15020#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:57,476 INFO L273 TraceCheckUtils]: 9: Hoare triple {15020#(<= 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; {15021#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:57,477 INFO L273 TraceCheckUtils]: 10: Hoare triple {15021#(<= 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; {15022#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:57,478 INFO L273 TraceCheckUtils]: 11: Hoare triple {15022#(<= 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; {15023#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:57,479 INFO L273 TraceCheckUtils]: 12: Hoare triple {15023#(<= 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; {15024#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:57,480 INFO L273 TraceCheckUtils]: 13: Hoare triple {15024#(<= 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; {15025#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:57,481 INFO L273 TraceCheckUtils]: 14: Hoare triple {15025#(<= 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; {15026#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:57,482 INFO L273 TraceCheckUtils]: 15: Hoare triple {15026#(<= 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; {15027#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:57,483 INFO L273 TraceCheckUtils]: 16: Hoare triple {15027#(<= 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; {15028#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:57,483 INFO L273 TraceCheckUtils]: 17: Hoare triple {15028#(<= 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; {15029#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:57,484 INFO L273 TraceCheckUtils]: 18: Hoare triple {15029#(<= 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; {15030#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:57,485 INFO L273 TraceCheckUtils]: 19: Hoare triple {15030#(<= 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; {15031#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:57,486 INFO L273 TraceCheckUtils]: 20: Hoare triple {15031#(<= 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; {15032#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:57,487 INFO L273 TraceCheckUtils]: 21: Hoare triple {15032#(<= 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; {15033#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:57,488 INFO L273 TraceCheckUtils]: 22: Hoare triple {15033#(<= 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; {15034#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:57,489 INFO L273 TraceCheckUtils]: 23: Hoare triple {15034#(<= 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; {15035#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:57,490 INFO L273 TraceCheckUtils]: 24: Hoare triple {15035#(<= 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; {15036#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:57,491 INFO L273 TraceCheckUtils]: 25: Hoare triple {15036#(<= 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; {15037#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:57,492 INFO L273 TraceCheckUtils]: 26: Hoare triple {15037#(<= 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; {15038#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:57,493 INFO L273 TraceCheckUtils]: 27: Hoare triple {15038#(<= 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; {15039#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:57,494 INFO L273 TraceCheckUtils]: 28: Hoare triple {15039#(<= 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; {15040#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:57,495 INFO L273 TraceCheckUtils]: 29: Hoare triple {15040#(<= 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; {15041#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:57,496 INFO L273 TraceCheckUtils]: 30: Hoare triple {15041#(<= 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; {15042#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:57,497 INFO L273 TraceCheckUtils]: 31: Hoare triple {15042#(<= 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; {15043#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:57,497 INFO L273 TraceCheckUtils]: 32: Hoare triple {15043#(<= 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; {15044#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:57,498 INFO L273 TraceCheckUtils]: 33: Hoare triple {15044#(<= 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; {15045#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:57,499 INFO L273 TraceCheckUtils]: 34: Hoare triple {15045#(<= 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; {15046#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:57,500 INFO L273 TraceCheckUtils]: 35: Hoare triple {15046#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15047#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:57,501 INFO L273 TraceCheckUtils]: 36: Hoare triple {15047#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15048#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:57,502 INFO L273 TraceCheckUtils]: 37: Hoare triple {15048#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15049#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:57,503 INFO L273 TraceCheckUtils]: 38: Hoare triple {15049#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15050#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:57,504 INFO L273 TraceCheckUtils]: 39: Hoare triple {15050#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15051#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:57,505 INFO L273 TraceCheckUtils]: 40: Hoare triple {15051#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15052#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:57,506 INFO L273 TraceCheckUtils]: 41: Hoare triple {15052#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15053#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:57,507 INFO L273 TraceCheckUtils]: 42: Hoare triple {15053#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15054#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:57,508 INFO L273 TraceCheckUtils]: 43: Hoare triple {15054#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15055#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:57,509 INFO L273 TraceCheckUtils]: 44: Hoare triple {15055#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15056#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:57,509 INFO L273 TraceCheckUtils]: 45: Hoare triple {15056#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15057#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:57,510 INFO L273 TraceCheckUtils]: 46: Hoare triple {15057#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15058#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:57,511 INFO L273 TraceCheckUtils]: 47: Hoare triple {15058#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15059#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:57,512 INFO L273 TraceCheckUtils]: 48: Hoare triple {15059#(<= main_~i~0 42)} assume !(~i~0 < 100000); {15016#false} is VALID [2018-11-23 11:57:57,512 INFO L273 TraceCheckUtils]: 49: Hoare triple {15016#false} havoc ~x~0;~x~0 := 0; {15016#false} is VALID [2018-11-23 11:57:57,512 INFO L273 TraceCheckUtils]: 50: Hoare triple {15016#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {15016#false} is VALID [2018-11-23 11:57:57,513 INFO L256 TraceCheckUtils]: 51: Hoare triple {15016#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {15016#false} is VALID [2018-11-23 11:57:57,513 INFO L273 TraceCheckUtils]: 52: Hoare triple {15016#false} ~cond := #in~cond; {15016#false} is VALID [2018-11-23 11:57:57,513 INFO L273 TraceCheckUtils]: 53: Hoare triple {15016#false} assume 0 == ~cond; {15016#false} is VALID [2018-11-23 11:57:57,513 INFO L273 TraceCheckUtils]: 54: Hoare triple {15016#false} assume !false; {15016#false} is VALID [2018-11-23 11:57:57,518 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:57:57,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:57:57,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 46 [2018-11-23 11:57:57,544 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 55 [2018-11-23 11:57:57,544 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:57:57,545 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states. [2018-11-23 11:57:57,587 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:57,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-23 11:57:57,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-23 11:57:57,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 11:57:57,588 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 46 states. [2018-11-23 11:57:57,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:57,983 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2018-11-23 11:57:57,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-23 11:57:57,984 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 55 [2018-11-23 11:57:57,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:57:57,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 11:57:57,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 74 transitions. [2018-11-23 11:57:57,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 11:57:57,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 74 transitions. [2018-11-23 11:57:57,986 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states and 74 transitions. [2018-11-23 11:57:58,042 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:57:58,043 INFO L225 Difference]: With dead ends: 72 [2018-11-23 11:57:58,043 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 11:57:58,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 11:57:58,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 11:57:58,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-11-23 11:57:58,096 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:57:58,096 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 61 states. [2018-11-23 11:57:58,096 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 61 states. [2018-11-23 11:57:58,097 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 61 states. [2018-11-23 11:57:58,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:58,098 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2018-11-23 11:57:58,099 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-11-23 11:57:58,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:58,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:58,099 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 61 states. [2018-11-23 11:57:58,099 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 61 states. [2018-11-23 11:57:58,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:58,100 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2018-11-23 11:57:58,100 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-11-23 11:57:58,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:58,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:58,101 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:57:58,101 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:57:58,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 11:57:58,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2018-11-23 11:57:58,102 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 55 [2018-11-23 11:57:58,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:57:58,102 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-11-23 11:57:58,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-23 11:57:58,103 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-11-23 11:57:58,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 11:57:58,103 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:57:58,103 INFO L402 BasicCegarLoop]: trace histogram [43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:57:58,104 INFO L423 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:57:58,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:57:58,104 INFO L82 PathProgramCache]: Analyzing trace with hash -2066136850, now seen corresponding path program 43 times [2018-11-23 11:57:58,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:57:58,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:57:58,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:58,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:57:58,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:58,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:59,497 INFO L256 TraceCheckUtils]: 0: Hoare triple {15585#true} call ULTIMATE.init(); {15585#true} is VALID [2018-11-23 11:57:59,498 INFO L273 TraceCheckUtils]: 1: Hoare triple {15585#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15585#true} is VALID [2018-11-23 11:57:59,498 INFO L273 TraceCheckUtils]: 2: Hoare triple {15585#true} assume true; {15585#true} is VALID [2018-11-23 11:57:59,498 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15585#true} {15585#true} #48#return; {15585#true} is VALID [2018-11-23 11:57:59,498 INFO L256 TraceCheckUtils]: 4: Hoare triple {15585#true} call #t~ret2 := main(); {15585#true} is VALID [2018-11-23 11:57:59,499 INFO L273 TraceCheckUtils]: 5: Hoare triple {15585#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {15587#(= main_~i~0 0)} is VALID [2018-11-23 11:57:59,500 INFO L273 TraceCheckUtils]: 6: Hoare triple {15587#(= 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; {15588#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:59,500 INFO L273 TraceCheckUtils]: 7: Hoare triple {15588#(<= 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; {15589#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:59,501 INFO L273 TraceCheckUtils]: 8: Hoare triple {15589#(<= 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; {15590#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:59,502 INFO L273 TraceCheckUtils]: 9: Hoare triple {15590#(<= 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; {15591#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:59,503 INFO L273 TraceCheckUtils]: 10: Hoare triple {15591#(<= 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; {15592#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:59,504 INFO L273 TraceCheckUtils]: 11: Hoare triple {15592#(<= 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; {15593#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:59,505 INFO L273 TraceCheckUtils]: 12: Hoare triple {15593#(<= 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; {15594#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:59,506 INFO L273 TraceCheckUtils]: 13: Hoare triple {15594#(<= 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; {15595#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:59,507 INFO L273 TraceCheckUtils]: 14: Hoare triple {15595#(<= 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; {15596#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:59,508 INFO L273 TraceCheckUtils]: 15: Hoare triple {15596#(<= 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; {15597#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:59,509 INFO L273 TraceCheckUtils]: 16: Hoare triple {15597#(<= 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; {15598#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:59,510 INFO L273 TraceCheckUtils]: 17: Hoare triple {15598#(<= 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; {15599#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:59,511 INFO L273 TraceCheckUtils]: 18: Hoare triple {15599#(<= 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; {15600#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:59,512 INFO L273 TraceCheckUtils]: 19: Hoare triple {15600#(<= 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; {15601#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:59,513 INFO L273 TraceCheckUtils]: 20: Hoare triple {15601#(<= 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; {15602#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:59,514 INFO L273 TraceCheckUtils]: 21: Hoare triple {15602#(<= 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; {15603#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:59,514 INFO L273 TraceCheckUtils]: 22: Hoare triple {15603#(<= 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; {15604#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:59,515 INFO L273 TraceCheckUtils]: 23: Hoare triple {15604#(<= 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; {15605#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:59,516 INFO L273 TraceCheckUtils]: 24: Hoare triple {15605#(<= 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; {15606#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:59,517 INFO L273 TraceCheckUtils]: 25: Hoare triple {15606#(<= 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; {15607#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:59,518 INFO L273 TraceCheckUtils]: 26: Hoare triple {15607#(<= 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; {15608#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:59,519 INFO L273 TraceCheckUtils]: 27: Hoare triple {15608#(<= 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; {15609#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:59,520 INFO L273 TraceCheckUtils]: 28: Hoare triple {15609#(<= 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; {15610#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:59,521 INFO L273 TraceCheckUtils]: 29: Hoare triple {15610#(<= 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; {15611#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:59,522 INFO L273 TraceCheckUtils]: 30: Hoare triple {15611#(<= 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; {15612#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:59,523 INFO L273 TraceCheckUtils]: 31: Hoare triple {15612#(<= 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; {15613#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:59,524 INFO L273 TraceCheckUtils]: 32: Hoare triple {15613#(<= 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; {15614#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:59,525 INFO L273 TraceCheckUtils]: 33: Hoare triple {15614#(<= 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; {15615#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:59,526 INFO L273 TraceCheckUtils]: 34: Hoare triple {15615#(<= 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; {15616#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:59,527 INFO L273 TraceCheckUtils]: 35: Hoare triple {15616#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15617#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:59,528 INFO L273 TraceCheckUtils]: 36: Hoare triple {15617#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15618#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:59,528 INFO L273 TraceCheckUtils]: 37: Hoare triple {15618#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15619#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:59,529 INFO L273 TraceCheckUtils]: 38: Hoare triple {15619#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15620#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:59,530 INFO L273 TraceCheckUtils]: 39: Hoare triple {15620#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15621#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:59,531 INFO L273 TraceCheckUtils]: 40: Hoare triple {15621#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15622#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:59,532 INFO L273 TraceCheckUtils]: 41: Hoare triple {15622#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15623#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:59,533 INFO L273 TraceCheckUtils]: 42: Hoare triple {15623#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15624#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:59,534 INFO L273 TraceCheckUtils]: 43: Hoare triple {15624#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15625#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:59,535 INFO L273 TraceCheckUtils]: 44: Hoare triple {15625#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15626#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:59,536 INFO L273 TraceCheckUtils]: 45: Hoare triple {15626#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15627#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:59,537 INFO L273 TraceCheckUtils]: 46: Hoare triple {15627#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15628#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:59,538 INFO L273 TraceCheckUtils]: 47: Hoare triple {15628#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15629#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:59,539 INFO L273 TraceCheckUtils]: 48: Hoare triple {15629#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15630#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:59,539 INFO L273 TraceCheckUtils]: 49: Hoare triple {15630#(<= main_~i~0 43)} assume !(~i~0 < 100000); {15586#false} is VALID [2018-11-23 11:57:59,540 INFO L273 TraceCheckUtils]: 50: Hoare triple {15586#false} havoc ~x~0;~x~0 := 0; {15586#false} is VALID [2018-11-23 11:57:59,540 INFO L273 TraceCheckUtils]: 51: Hoare triple {15586#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {15586#false} is VALID [2018-11-23 11:57:59,540 INFO L256 TraceCheckUtils]: 52: Hoare triple {15586#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {15586#false} is VALID [2018-11-23 11:57:59,540 INFO L273 TraceCheckUtils]: 53: Hoare triple {15586#false} ~cond := #in~cond; {15586#false} is VALID [2018-11-23 11:57:59,540 INFO L273 TraceCheckUtils]: 54: Hoare triple {15586#false} assume 0 == ~cond; {15586#false} is VALID [2018-11-23 11:57:59,541 INFO L273 TraceCheckUtils]: 55: Hoare triple {15586#false} assume !false; {15586#false} is VALID [2018-11-23 11:57:59,545 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:57:59,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:57:59,545 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:57:59,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:57:59,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:59,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:59,605 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:57:59,965 INFO L256 TraceCheckUtils]: 0: Hoare triple {15585#true} call ULTIMATE.init(); {15585#true} is VALID [2018-11-23 11:57:59,966 INFO L273 TraceCheckUtils]: 1: Hoare triple {15585#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15585#true} is VALID [2018-11-23 11:57:59,966 INFO L273 TraceCheckUtils]: 2: Hoare triple {15585#true} assume true; {15585#true} is VALID [2018-11-23 11:57:59,966 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15585#true} {15585#true} #48#return; {15585#true} is VALID [2018-11-23 11:57:59,966 INFO L256 TraceCheckUtils]: 4: Hoare triple {15585#true} call #t~ret2 := main(); {15585#true} is VALID [2018-11-23 11:57:59,967 INFO L273 TraceCheckUtils]: 5: Hoare triple {15585#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {15649#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:59,968 INFO L273 TraceCheckUtils]: 6: Hoare triple {15649#(<= 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; {15588#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:59,969 INFO L273 TraceCheckUtils]: 7: Hoare triple {15588#(<= 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; {15589#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:59,969 INFO L273 TraceCheckUtils]: 8: Hoare triple {15589#(<= 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; {15590#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:59,970 INFO L273 TraceCheckUtils]: 9: Hoare triple {15590#(<= 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; {15591#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:59,970 INFO L273 TraceCheckUtils]: 10: Hoare triple {15591#(<= 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; {15592#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:59,971 INFO L273 TraceCheckUtils]: 11: Hoare triple {15592#(<= 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; {15593#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:59,972 INFO L273 TraceCheckUtils]: 12: Hoare triple {15593#(<= 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; {15594#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:59,973 INFO L273 TraceCheckUtils]: 13: Hoare triple {15594#(<= 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; {15595#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:59,974 INFO L273 TraceCheckUtils]: 14: Hoare triple {15595#(<= 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; {15596#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:59,975 INFO L273 TraceCheckUtils]: 15: Hoare triple {15596#(<= 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; {15597#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:59,976 INFO L273 TraceCheckUtils]: 16: Hoare triple {15597#(<= 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; {15598#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:59,977 INFO L273 TraceCheckUtils]: 17: Hoare triple {15598#(<= 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; {15599#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:59,978 INFO L273 TraceCheckUtils]: 18: Hoare triple {15599#(<= 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; {15600#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:59,979 INFO L273 TraceCheckUtils]: 19: Hoare triple {15600#(<= 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; {15601#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:59,980 INFO L273 TraceCheckUtils]: 20: Hoare triple {15601#(<= 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; {15602#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:59,981 INFO L273 TraceCheckUtils]: 21: Hoare triple {15602#(<= 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; {15603#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:59,982 INFO L273 TraceCheckUtils]: 22: Hoare triple {15603#(<= 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; {15604#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:59,983 INFO L273 TraceCheckUtils]: 23: Hoare triple {15604#(<= 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; {15605#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:59,983 INFO L273 TraceCheckUtils]: 24: Hoare triple {15605#(<= 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; {15606#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:59,984 INFO L273 TraceCheckUtils]: 25: Hoare triple {15606#(<= 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; {15607#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:59,985 INFO L273 TraceCheckUtils]: 26: Hoare triple {15607#(<= 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; {15608#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:59,986 INFO L273 TraceCheckUtils]: 27: Hoare triple {15608#(<= 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; {15609#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:59,987 INFO L273 TraceCheckUtils]: 28: Hoare triple {15609#(<= 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; {15610#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:59,988 INFO L273 TraceCheckUtils]: 29: Hoare triple {15610#(<= 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; {15611#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:59,989 INFO L273 TraceCheckUtils]: 30: Hoare triple {15611#(<= 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; {15612#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:59,990 INFO L273 TraceCheckUtils]: 31: Hoare triple {15612#(<= 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; {15613#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:59,991 INFO L273 TraceCheckUtils]: 32: Hoare triple {15613#(<= 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; {15614#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:59,992 INFO L273 TraceCheckUtils]: 33: Hoare triple {15614#(<= 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; {15615#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:59,993 INFO L273 TraceCheckUtils]: 34: Hoare triple {15615#(<= 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; {15616#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:59,994 INFO L273 TraceCheckUtils]: 35: Hoare triple {15616#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15617#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:59,995 INFO L273 TraceCheckUtils]: 36: Hoare triple {15617#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15618#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:59,996 INFO L273 TraceCheckUtils]: 37: Hoare triple {15618#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15619#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:59,997 INFO L273 TraceCheckUtils]: 38: Hoare triple {15619#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15620#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:59,997 INFO L273 TraceCheckUtils]: 39: Hoare triple {15620#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15621#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:59,998 INFO L273 TraceCheckUtils]: 40: Hoare triple {15621#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15622#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:59,999 INFO L273 TraceCheckUtils]: 41: Hoare triple {15622#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15623#(<= main_~i~0 36)} is VALID [2018-11-23 11:58:00,000 INFO L273 TraceCheckUtils]: 42: Hoare triple {15623#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15624#(<= main_~i~0 37)} is VALID [2018-11-23 11:58:00,001 INFO L273 TraceCheckUtils]: 43: Hoare triple {15624#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15625#(<= main_~i~0 38)} is VALID [2018-11-23 11:58:00,002 INFO L273 TraceCheckUtils]: 44: Hoare triple {15625#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15626#(<= main_~i~0 39)} is VALID [2018-11-23 11:58:00,003 INFO L273 TraceCheckUtils]: 45: Hoare triple {15626#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15627#(<= main_~i~0 40)} is VALID [2018-11-23 11:58:00,004 INFO L273 TraceCheckUtils]: 46: Hoare triple {15627#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15628#(<= main_~i~0 41)} is VALID [2018-11-23 11:58:00,005 INFO L273 TraceCheckUtils]: 47: Hoare triple {15628#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15629#(<= main_~i~0 42)} is VALID [2018-11-23 11:58:00,006 INFO L273 TraceCheckUtils]: 48: Hoare triple {15629#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15630#(<= main_~i~0 43)} is VALID [2018-11-23 11:58:00,007 INFO L273 TraceCheckUtils]: 49: Hoare triple {15630#(<= main_~i~0 43)} assume !(~i~0 < 100000); {15586#false} is VALID [2018-11-23 11:58:00,007 INFO L273 TraceCheckUtils]: 50: Hoare triple {15586#false} havoc ~x~0;~x~0 := 0; {15586#false} is VALID [2018-11-23 11:58:00,007 INFO L273 TraceCheckUtils]: 51: Hoare triple {15586#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {15586#false} is VALID [2018-11-23 11:58:00,007 INFO L256 TraceCheckUtils]: 52: Hoare triple {15586#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {15586#false} is VALID [2018-11-23 11:58:00,007 INFO L273 TraceCheckUtils]: 53: Hoare triple {15586#false} ~cond := #in~cond; {15586#false} is VALID [2018-11-23 11:58:00,008 INFO L273 TraceCheckUtils]: 54: Hoare triple {15586#false} assume 0 == ~cond; {15586#false} is VALID [2018-11-23 11:58:00,008 INFO L273 TraceCheckUtils]: 55: Hoare triple {15586#false} assume !false; {15586#false} is VALID [2018-11-23 11:58:00,011 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:00,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:00,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 47 [2018-11-23 11:58:00,031 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 56 [2018-11-23 11:58:00,032 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:00,032 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states. [2018-11-23 11:58:00,073 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:58:00,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-23 11:58:00,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-23 11:58:00,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-11-23 11:58:00,074 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 47 states. [2018-11-23 11:58:00,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:00,381 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2018-11-23 11:58:00,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-23 11:58:00,381 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 56 [2018-11-23 11:58:00,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:00,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 11:58:00,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 75 transitions. [2018-11-23 11:58:00,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 11:58:00,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 75 transitions. [2018-11-23 11:58:00,384 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states and 75 transitions. [2018-11-23 11:58:00,439 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:00,440 INFO L225 Difference]: With dead ends: 73 [2018-11-23 11:58:00,441 INFO L226 Difference]: Without dead ends: 62 [2018-11-23 11:58:00,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-11-23 11:58:00,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-23 11:58:00,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-11-23 11:58:00,488 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:00,488 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 62 states. [2018-11-23 11:58:00,488 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 62 states. [2018-11-23 11:58:00,488 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 62 states. [2018-11-23 11:58:00,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:00,489 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2018-11-23 11:58:00,489 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2018-11-23 11:58:00,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:00,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:00,489 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 62 states. [2018-11-23 11:58:00,489 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 62 states. [2018-11-23 11:58:00,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:00,490 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2018-11-23 11:58:00,490 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2018-11-23 11:58:00,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:00,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:00,491 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:00,491 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:00,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-23 11:58:00,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2018-11-23 11:58:00,491 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 56 [2018-11-23 11:58:00,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:00,492 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2018-11-23 11:58:00,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-23 11:58:00,492 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2018-11-23 11:58:00,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 11:58:00,492 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:00,492 INFO L402 BasicCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:00,492 INFO L423 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:00,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:00,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1716811598, now seen corresponding path program 44 times [2018-11-23 11:58:00,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:00,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:00,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:00,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:00,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:00,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:02,160 INFO L256 TraceCheckUtils]: 0: Hoare triple {16165#true} call ULTIMATE.init(); {16165#true} is VALID [2018-11-23 11:58:02,161 INFO L273 TraceCheckUtils]: 1: Hoare triple {16165#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16165#true} is VALID [2018-11-23 11:58:02,161 INFO L273 TraceCheckUtils]: 2: Hoare triple {16165#true} assume true; {16165#true} is VALID [2018-11-23 11:58:02,161 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16165#true} {16165#true} #48#return; {16165#true} is VALID [2018-11-23 11:58:02,161 INFO L256 TraceCheckUtils]: 4: Hoare triple {16165#true} call #t~ret2 := main(); {16165#true} is VALID [2018-11-23 11:58:02,161 INFO L273 TraceCheckUtils]: 5: Hoare triple {16165#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {16167#(= main_~i~0 0)} is VALID [2018-11-23 11:58:02,162 INFO L273 TraceCheckUtils]: 6: Hoare triple {16167#(= 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; {16168#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:02,163 INFO L273 TraceCheckUtils]: 7: Hoare triple {16168#(<= 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; {16169#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:02,163 INFO L273 TraceCheckUtils]: 8: Hoare triple {16169#(<= 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; {16170#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:02,164 INFO L273 TraceCheckUtils]: 9: Hoare triple {16170#(<= 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; {16171#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:02,165 INFO L273 TraceCheckUtils]: 10: Hoare triple {16171#(<= 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; {16172#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:02,166 INFO L273 TraceCheckUtils]: 11: Hoare triple {16172#(<= 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; {16173#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:02,167 INFO L273 TraceCheckUtils]: 12: Hoare triple {16173#(<= 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; {16174#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:02,168 INFO L273 TraceCheckUtils]: 13: Hoare triple {16174#(<= 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; {16175#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:02,169 INFO L273 TraceCheckUtils]: 14: Hoare triple {16175#(<= 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; {16176#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:02,169 INFO L273 TraceCheckUtils]: 15: Hoare triple {16176#(<= 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; {16177#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:02,170 INFO L273 TraceCheckUtils]: 16: Hoare triple {16177#(<= 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; {16178#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:02,171 INFO L273 TraceCheckUtils]: 17: Hoare triple {16178#(<= 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; {16179#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:02,172 INFO L273 TraceCheckUtils]: 18: Hoare triple {16179#(<= 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; {16180#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:02,173 INFO L273 TraceCheckUtils]: 19: Hoare triple {16180#(<= 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; {16181#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:02,174 INFO L273 TraceCheckUtils]: 20: Hoare triple {16181#(<= 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; {16182#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:02,175 INFO L273 TraceCheckUtils]: 21: Hoare triple {16182#(<= 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; {16183#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:02,176 INFO L273 TraceCheckUtils]: 22: Hoare triple {16183#(<= 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; {16184#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:02,177 INFO L273 TraceCheckUtils]: 23: Hoare triple {16184#(<= 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; {16185#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:02,178 INFO L273 TraceCheckUtils]: 24: Hoare triple {16185#(<= 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; {16186#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:02,179 INFO L273 TraceCheckUtils]: 25: Hoare triple {16186#(<= 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; {16187#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:02,180 INFO L273 TraceCheckUtils]: 26: Hoare triple {16187#(<= 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; {16188#(<= main_~i~0 21)} is VALID [2018-11-23 11:58:02,181 INFO L273 TraceCheckUtils]: 27: Hoare triple {16188#(<= 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; {16189#(<= main_~i~0 22)} is VALID [2018-11-23 11:58:02,182 INFO L273 TraceCheckUtils]: 28: Hoare triple {16189#(<= 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; {16190#(<= main_~i~0 23)} is VALID [2018-11-23 11:58:02,183 INFO L273 TraceCheckUtils]: 29: Hoare triple {16190#(<= 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; {16191#(<= main_~i~0 24)} is VALID [2018-11-23 11:58:02,183 INFO L273 TraceCheckUtils]: 30: Hoare triple {16191#(<= 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; {16192#(<= main_~i~0 25)} is VALID [2018-11-23 11:58:02,184 INFO L273 TraceCheckUtils]: 31: Hoare triple {16192#(<= 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; {16193#(<= main_~i~0 26)} is VALID [2018-11-23 11:58:02,185 INFO L273 TraceCheckUtils]: 32: Hoare triple {16193#(<= 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; {16194#(<= main_~i~0 27)} is VALID [2018-11-23 11:58:02,186 INFO L273 TraceCheckUtils]: 33: Hoare triple {16194#(<= 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; {16195#(<= main_~i~0 28)} is VALID [2018-11-23 11:58:02,187 INFO L273 TraceCheckUtils]: 34: Hoare triple {16195#(<= 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; {16196#(<= main_~i~0 29)} is VALID [2018-11-23 11:58:02,188 INFO L273 TraceCheckUtils]: 35: Hoare triple {16196#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16197#(<= main_~i~0 30)} is VALID [2018-11-23 11:58:02,189 INFO L273 TraceCheckUtils]: 36: Hoare triple {16197#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16198#(<= main_~i~0 31)} is VALID [2018-11-23 11:58:02,190 INFO L273 TraceCheckUtils]: 37: Hoare triple {16198#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16199#(<= main_~i~0 32)} is VALID [2018-11-23 11:58:02,191 INFO L273 TraceCheckUtils]: 38: Hoare triple {16199#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16200#(<= main_~i~0 33)} is VALID [2018-11-23 11:58:02,192 INFO L273 TraceCheckUtils]: 39: Hoare triple {16200#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16201#(<= main_~i~0 34)} is VALID [2018-11-23 11:58:02,193 INFO L273 TraceCheckUtils]: 40: Hoare triple {16201#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16202#(<= main_~i~0 35)} is VALID [2018-11-23 11:58:02,194 INFO L273 TraceCheckUtils]: 41: Hoare triple {16202#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16203#(<= main_~i~0 36)} is VALID [2018-11-23 11:58:02,195 INFO L273 TraceCheckUtils]: 42: Hoare triple {16203#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16204#(<= main_~i~0 37)} is VALID [2018-11-23 11:58:02,196 INFO L273 TraceCheckUtils]: 43: Hoare triple {16204#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16205#(<= main_~i~0 38)} is VALID [2018-11-23 11:58:02,197 INFO L273 TraceCheckUtils]: 44: Hoare triple {16205#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16206#(<= main_~i~0 39)} is VALID [2018-11-23 11:58:02,198 INFO L273 TraceCheckUtils]: 45: Hoare triple {16206#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16207#(<= main_~i~0 40)} is VALID [2018-11-23 11:58:02,199 INFO L273 TraceCheckUtils]: 46: Hoare triple {16207#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16208#(<= main_~i~0 41)} is VALID [2018-11-23 11:58:02,200 INFO L273 TraceCheckUtils]: 47: Hoare triple {16208#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16209#(<= main_~i~0 42)} is VALID [2018-11-23 11:58:02,201 INFO L273 TraceCheckUtils]: 48: Hoare triple {16209#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16210#(<= main_~i~0 43)} is VALID [2018-11-23 11:58:02,202 INFO L273 TraceCheckUtils]: 49: Hoare triple {16210#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16211#(<= main_~i~0 44)} is VALID [2018-11-23 11:58:02,202 INFO L273 TraceCheckUtils]: 50: Hoare triple {16211#(<= main_~i~0 44)} assume !(~i~0 < 100000); {16166#false} is VALID [2018-11-23 11:58:02,202 INFO L273 TraceCheckUtils]: 51: Hoare triple {16166#false} havoc ~x~0;~x~0 := 0; {16166#false} is VALID [2018-11-23 11:58:02,203 INFO L273 TraceCheckUtils]: 52: Hoare triple {16166#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {16166#false} is VALID [2018-11-23 11:58:02,203 INFO L256 TraceCheckUtils]: 53: Hoare triple {16166#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {16166#false} is VALID [2018-11-23 11:58:02,203 INFO L273 TraceCheckUtils]: 54: Hoare triple {16166#false} ~cond := #in~cond; {16166#false} is VALID [2018-11-23 11:58:02,203 INFO L273 TraceCheckUtils]: 55: Hoare triple {16166#false} assume 0 == ~cond; {16166#false} is VALID [2018-11-23 11:58:02,203 INFO L273 TraceCheckUtils]: 56: Hoare triple {16166#false} assume !false; {16166#false} is VALID [2018-11-23 11:58:02,207 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:02,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:02,207 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:58:02,216 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:58:02,251 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:58:02,252 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:02,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:02,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:02,568 INFO L256 TraceCheckUtils]: 0: Hoare triple {16165#true} call ULTIMATE.init(); {16165#true} is VALID [2018-11-23 11:58:02,569 INFO L273 TraceCheckUtils]: 1: Hoare triple {16165#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16165#true} is VALID [2018-11-23 11:58:02,569 INFO L273 TraceCheckUtils]: 2: Hoare triple {16165#true} assume true; {16165#true} is VALID [2018-11-23 11:58:02,569 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16165#true} {16165#true} #48#return; {16165#true} is VALID [2018-11-23 11:58:02,569 INFO L256 TraceCheckUtils]: 4: Hoare triple {16165#true} call #t~ret2 := main(); {16165#true} is VALID [2018-11-23 11:58:02,570 INFO L273 TraceCheckUtils]: 5: Hoare triple {16165#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {16230#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:02,571 INFO L273 TraceCheckUtils]: 6: Hoare triple {16230#(<= 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; {16168#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:02,572 INFO L273 TraceCheckUtils]: 7: Hoare triple {16168#(<= 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; {16169#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:02,572 INFO L273 TraceCheckUtils]: 8: Hoare triple {16169#(<= 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; {16170#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:02,573 INFO L273 TraceCheckUtils]: 9: Hoare triple {16170#(<= 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; {16171#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:02,573 INFO L273 TraceCheckUtils]: 10: Hoare triple {16171#(<= 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; {16172#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:02,574 INFO L273 TraceCheckUtils]: 11: Hoare triple {16172#(<= 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; {16173#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:02,575 INFO L273 TraceCheckUtils]: 12: Hoare triple {16173#(<= 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; {16174#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:02,576 INFO L273 TraceCheckUtils]: 13: Hoare triple {16174#(<= 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; {16175#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:02,577 INFO L273 TraceCheckUtils]: 14: Hoare triple {16175#(<= 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; {16176#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:02,578 INFO L273 TraceCheckUtils]: 15: Hoare triple {16176#(<= 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; {16177#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:02,579 INFO L273 TraceCheckUtils]: 16: Hoare triple {16177#(<= 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; {16178#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:02,580 INFO L273 TraceCheckUtils]: 17: Hoare triple {16178#(<= 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; {16179#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:02,581 INFO L273 TraceCheckUtils]: 18: Hoare triple {16179#(<= 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; {16180#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:02,582 INFO L273 TraceCheckUtils]: 19: Hoare triple {16180#(<= 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; {16181#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:02,583 INFO L273 TraceCheckUtils]: 20: Hoare triple {16181#(<= 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; {16182#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:02,584 INFO L273 TraceCheckUtils]: 21: Hoare triple {16182#(<= 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; {16183#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:02,585 INFO L273 TraceCheckUtils]: 22: Hoare triple {16183#(<= 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; {16184#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:02,586 INFO L273 TraceCheckUtils]: 23: Hoare triple {16184#(<= 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; {16185#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:02,587 INFO L273 TraceCheckUtils]: 24: Hoare triple {16185#(<= 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; {16186#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:02,588 INFO L273 TraceCheckUtils]: 25: Hoare triple {16186#(<= 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; {16187#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:02,589 INFO L273 TraceCheckUtils]: 26: Hoare triple {16187#(<= 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; {16188#(<= main_~i~0 21)} is VALID [2018-11-23 11:58:02,590 INFO L273 TraceCheckUtils]: 27: Hoare triple {16188#(<= 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; {16189#(<= main_~i~0 22)} is VALID [2018-11-23 11:58:02,591 INFO L273 TraceCheckUtils]: 28: Hoare triple {16189#(<= 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; {16190#(<= main_~i~0 23)} is VALID [2018-11-23 11:58:02,591 INFO L273 TraceCheckUtils]: 29: Hoare triple {16190#(<= 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; {16191#(<= main_~i~0 24)} is VALID [2018-11-23 11:58:02,592 INFO L273 TraceCheckUtils]: 30: Hoare triple {16191#(<= 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; {16192#(<= main_~i~0 25)} is VALID [2018-11-23 11:58:02,593 INFO L273 TraceCheckUtils]: 31: Hoare triple {16192#(<= 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; {16193#(<= main_~i~0 26)} is VALID [2018-11-23 11:58:02,594 INFO L273 TraceCheckUtils]: 32: Hoare triple {16193#(<= 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; {16194#(<= main_~i~0 27)} is VALID [2018-11-23 11:58:02,595 INFO L273 TraceCheckUtils]: 33: Hoare triple {16194#(<= 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; {16195#(<= main_~i~0 28)} is VALID [2018-11-23 11:58:02,596 INFO L273 TraceCheckUtils]: 34: Hoare triple {16195#(<= 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; {16196#(<= main_~i~0 29)} is VALID [2018-11-23 11:58:02,597 INFO L273 TraceCheckUtils]: 35: Hoare triple {16196#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16197#(<= main_~i~0 30)} is VALID [2018-11-23 11:58:02,598 INFO L273 TraceCheckUtils]: 36: Hoare triple {16197#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16198#(<= main_~i~0 31)} is VALID [2018-11-23 11:58:02,599 INFO L273 TraceCheckUtils]: 37: Hoare triple {16198#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16199#(<= main_~i~0 32)} is VALID [2018-11-23 11:58:02,600 INFO L273 TraceCheckUtils]: 38: Hoare triple {16199#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16200#(<= main_~i~0 33)} is VALID [2018-11-23 11:58:02,601 INFO L273 TraceCheckUtils]: 39: Hoare triple {16200#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16201#(<= main_~i~0 34)} is VALID [2018-11-23 11:58:02,602 INFO L273 TraceCheckUtils]: 40: Hoare triple {16201#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16202#(<= main_~i~0 35)} is VALID [2018-11-23 11:58:02,603 INFO L273 TraceCheckUtils]: 41: Hoare triple {16202#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16203#(<= main_~i~0 36)} is VALID [2018-11-23 11:58:02,604 INFO L273 TraceCheckUtils]: 42: Hoare triple {16203#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16204#(<= main_~i~0 37)} is VALID [2018-11-23 11:58:02,605 INFO L273 TraceCheckUtils]: 43: Hoare triple {16204#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16205#(<= main_~i~0 38)} is VALID [2018-11-23 11:58:02,605 INFO L273 TraceCheckUtils]: 44: Hoare triple {16205#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16206#(<= main_~i~0 39)} is VALID [2018-11-23 11:58:02,606 INFO L273 TraceCheckUtils]: 45: Hoare triple {16206#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16207#(<= main_~i~0 40)} is VALID [2018-11-23 11:58:02,616 INFO L273 TraceCheckUtils]: 46: Hoare triple {16207#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16208#(<= main_~i~0 41)} is VALID [2018-11-23 11:58:02,636 INFO L273 TraceCheckUtils]: 47: Hoare triple {16208#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16209#(<= main_~i~0 42)} is VALID [2018-11-23 11:58:02,649 INFO L273 TraceCheckUtils]: 48: Hoare triple {16209#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16210#(<= main_~i~0 43)} is VALID [2018-11-23 11:58:02,651 INFO L273 TraceCheckUtils]: 49: Hoare triple {16210#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16211#(<= main_~i~0 44)} is VALID [2018-11-23 11:58:02,651 INFO L273 TraceCheckUtils]: 50: Hoare triple {16211#(<= main_~i~0 44)} assume !(~i~0 < 100000); {16166#false} is VALID [2018-11-23 11:58:02,651 INFO L273 TraceCheckUtils]: 51: Hoare triple {16166#false} havoc ~x~0;~x~0 := 0; {16166#false} is VALID [2018-11-23 11:58:02,652 INFO L273 TraceCheckUtils]: 52: Hoare triple {16166#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {16166#false} is VALID [2018-11-23 11:58:02,652 INFO L256 TraceCheckUtils]: 53: Hoare triple {16166#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {16166#false} is VALID [2018-11-23 11:58:02,652 INFO L273 TraceCheckUtils]: 54: Hoare triple {16166#false} ~cond := #in~cond; {16166#false} is VALID [2018-11-23 11:58:02,652 INFO L273 TraceCheckUtils]: 55: Hoare triple {16166#false} assume 0 == ~cond; {16166#false} is VALID [2018-11-23 11:58:02,652 INFO L273 TraceCheckUtils]: 56: Hoare triple {16166#false} assume !false; {16166#false} is VALID [2018-11-23 11:58:02,655 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:02,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:02,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 48 [2018-11-23 11:58:02,674 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 57 [2018-11-23 11:58:02,675 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:02,675 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 11:58:02,718 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:02,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 11:58:02,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 11:58:02,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 11:58:02,720 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 48 states. [2018-11-23 11:58:03,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:03,483 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2018-11-23 11:58:03,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-23 11:58:03,483 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 57 [2018-11-23 11:58:03,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:03,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 11:58:03,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 76 transitions. [2018-11-23 11:58:03,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 11:58:03,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 76 transitions. [2018-11-23 11:58:03,485 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states and 76 transitions. [2018-11-23 11:58:03,541 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:58:03,542 INFO L225 Difference]: With dead ends: 74 [2018-11-23 11:58:03,542 INFO L226 Difference]: Without dead ends: 63 [2018-11-23 11:58:03,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 11:58:03,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-23 11:58:03,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-11-23 11:58:03,591 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:03,591 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 63 states. [2018-11-23 11:58:03,591 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 63 states. [2018-11-23 11:58:03,591 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 63 states. [2018-11-23 11:58:03,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:03,592 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2018-11-23 11:58:03,592 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-11-23 11:58:03,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:03,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:03,593 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 63 states. [2018-11-23 11:58:03,593 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 63 states. [2018-11-23 11:58:03,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:03,594 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2018-11-23 11:58:03,594 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-11-23 11:58:03,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:03,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:03,594 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:03,594 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:03,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 11:58:03,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-11-23 11:58:03,595 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 57 [2018-11-23 11:58:03,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:03,596 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-11-23 11:58:03,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 11:58:03,596 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-11-23 11:58:03,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-23 11:58:03,596 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:03,597 INFO L402 BasicCegarLoop]: trace histogram [45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:03,597 INFO L423 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:03,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:03,597 INFO L82 PathProgramCache]: Analyzing trace with hash 522336622, now seen corresponding path program 45 times [2018-11-23 11:58:03,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:03,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:03,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:03,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:03,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:03,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:04,909 INFO L256 TraceCheckUtils]: 0: Hoare triple {16755#true} call ULTIMATE.init(); {16755#true} is VALID [2018-11-23 11:58:04,910 INFO L273 TraceCheckUtils]: 1: Hoare triple {16755#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16755#true} is VALID [2018-11-23 11:58:04,910 INFO L273 TraceCheckUtils]: 2: Hoare triple {16755#true} assume true; {16755#true} is VALID [2018-11-23 11:58:04,910 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16755#true} {16755#true} #48#return; {16755#true} is VALID [2018-11-23 11:58:04,911 INFO L256 TraceCheckUtils]: 4: Hoare triple {16755#true} call #t~ret2 := main(); {16755#true} is VALID [2018-11-23 11:58:04,911 INFO L273 TraceCheckUtils]: 5: Hoare triple {16755#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {16757#(= main_~i~0 0)} is VALID [2018-11-23 11:58:04,912 INFO L273 TraceCheckUtils]: 6: Hoare triple {16757#(= 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; {16758#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:04,913 INFO L273 TraceCheckUtils]: 7: Hoare triple {16758#(<= 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; {16759#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:04,914 INFO L273 TraceCheckUtils]: 8: Hoare triple {16759#(<= 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; {16760#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:04,914 INFO L273 TraceCheckUtils]: 9: Hoare triple {16760#(<= 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; {16761#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:04,915 INFO L273 TraceCheckUtils]: 10: Hoare triple {16761#(<= 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; {16762#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:04,915 INFO L273 TraceCheckUtils]: 11: Hoare triple {16762#(<= 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; {16763#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:04,916 INFO L273 TraceCheckUtils]: 12: Hoare triple {16763#(<= 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; {16764#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:04,917 INFO L273 TraceCheckUtils]: 13: Hoare triple {16764#(<= 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; {16765#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:04,918 INFO L273 TraceCheckUtils]: 14: Hoare triple {16765#(<= 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; {16766#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:04,919 INFO L273 TraceCheckUtils]: 15: Hoare triple {16766#(<= 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; {16767#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:04,920 INFO L273 TraceCheckUtils]: 16: Hoare triple {16767#(<= 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; {16768#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:04,921 INFO L273 TraceCheckUtils]: 17: Hoare triple {16768#(<= 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; {16769#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:04,922 INFO L273 TraceCheckUtils]: 18: Hoare triple {16769#(<= 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; {16770#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:04,923 INFO L273 TraceCheckUtils]: 19: Hoare triple {16770#(<= 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; {16771#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:04,924 INFO L273 TraceCheckUtils]: 20: Hoare triple {16771#(<= 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; {16772#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:04,925 INFO L273 TraceCheckUtils]: 21: Hoare triple {16772#(<= 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; {16773#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:04,926 INFO L273 TraceCheckUtils]: 22: Hoare triple {16773#(<= 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; {16774#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:04,927 INFO L273 TraceCheckUtils]: 23: Hoare triple {16774#(<= 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; {16775#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:04,928 INFO L273 TraceCheckUtils]: 24: Hoare triple {16775#(<= 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; {16776#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:04,929 INFO L273 TraceCheckUtils]: 25: Hoare triple {16776#(<= 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; {16777#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:04,929 INFO L273 TraceCheckUtils]: 26: Hoare triple {16777#(<= 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; {16778#(<= main_~i~0 21)} is VALID [2018-11-23 11:58:04,930 INFO L273 TraceCheckUtils]: 27: Hoare triple {16778#(<= 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; {16779#(<= main_~i~0 22)} is VALID [2018-11-23 11:58:04,931 INFO L273 TraceCheckUtils]: 28: Hoare triple {16779#(<= 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; {16780#(<= main_~i~0 23)} is VALID [2018-11-23 11:58:04,932 INFO L273 TraceCheckUtils]: 29: Hoare triple {16780#(<= 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; {16781#(<= main_~i~0 24)} is VALID [2018-11-23 11:58:04,933 INFO L273 TraceCheckUtils]: 30: Hoare triple {16781#(<= 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; {16782#(<= main_~i~0 25)} is VALID [2018-11-23 11:58:04,934 INFO L273 TraceCheckUtils]: 31: Hoare triple {16782#(<= 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; {16783#(<= main_~i~0 26)} is VALID [2018-11-23 11:58:04,935 INFO L273 TraceCheckUtils]: 32: Hoare triple {16783#(<= 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; {16784#(<= main_~i~0 27)} is VALID [2018-11-23 11:58:04,936 INFO L273 TraceCheckUtils]: 33: Hoare triple {16784#(<= 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; {16785#(<= main_~i~0 28)} is VALID [2018-11-23 11:58:04,937 INFO L273 TraceCheckUtils]: 34: Hoare triple {16785#(<= 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; {16786#(<= main_~i~0 29)} is VALID [2018-11-23 11:58:04,938 INFO L273 TraceCheckUtils]: 35: Hoare triple {16786#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16787#(<= main_~i~0 30)} is VALID [2018-11-23 11:58:04,939 INFO L273 TraceCheckUtils]: 36: Hoare triple {16787#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16788#(<= main_~i~0 31)} is VALID [2018-11-23 11:58:04,940 INFO L273 TraceCheckUtils]: 37: Hoare triple {16788#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16789#(<= main_~i~0 32)} is VALID [2018-11-23 11:58:04,941 INFO L273 TraceCheckUtils]: 38: Hoare triple {16789#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16790#(<= main_~i~0 33)} is VALID [2018-11-23 11:58:04,942 INFO L273 TraceCheckUtils]: 39: Hoare triple {16790#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16791#(<= main_~i~0 34)} is VALID [2018-11-23 11:58:04,943 INFO L273 TraceCheckUtils]: 40: Hoare triple {16791#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16792#(<= main_~i~0 35)} is VALID [2018-11-23 11:58:04,944 INFO L273 TraceCheckUtils]: 41: Hoare triple {16792#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16793#(<= main_~i~0 36)} is VALID [2018-11-23 11:58:04,945 INFO L273 TraceCheckUtils]: 42: Hoare triple {16793#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16794#(<= main_~i~0 37)} is VALID [2018-11-23 11:58:04,946 INFO L273 TraceCheckUtils]: 43: Hoare triple {16794#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16795#(<= main_~i~0 38)} is VALID [2018-11-23 11:58:04,946 INFO L273 TraceCheckUtils]: 44: Hoare triple {16795#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16796#(<= main_~i~0 39)} is VALID [2018-11-23 11:58:04,947 INFO L273 TraceCheckUtils]: 45: Hoare triple {16796#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16797#(<= main_~i~0 40)} is VALID [2018-11-23 11:58:04,948 INFO L273 TraceCheckUtils]: 46: Hoare triple {16797#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16798#(<= main_~i~0 41)} is VALID [2018-11-23 11:58:04,949 INFO L273 TraceCheckUtils]: 47: Hoare triple {16798#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16799#(<= main_~i~0 42)} is VALID [2018-11-23 11:58:04,950 INFO L273 TraceCheckUtils]: 48: Hoare triple {16799#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16800#(<= main_~i~0 43)} is VALID [2018-11-23 11:58:04,951 INFO L273 TraceCheckUtils]: 49: Hoare triple {16800#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16801#(<= main_~i~0 44)} is VALID [2018-11-23 11:58:04,952 INFO L273 TraceCheckUtils]: 50: Hoare triple {16801#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16802#(<= main_~i~0 45)} is VALID [2018-11-23 11:58:04,953 INFO L273 TraceCheckUtils]: 51: Hoare triple {16802#(<= main_~i~0 45)} assume !(~i~0 < 100000); {16756#false} is VALID [2018-11-23 11:58:04,953 INFO L273 TraceCheckUtils]: 52: Hoare triple {16756#false} havoc ~x~0;~x~0 := 0; {16756#false} is VALID [2018-11-23 11:58:04,953 INFO L273 TraceCheckUtils]: 53: Hoare triple {16756#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {16756#false} is VALID [2018-11-23 11:58:04,953 INFO L256 TraceCheckUtils]: 54: Hoare triple {16756#false} call __VERIFIER_assert((if 43 == #t~mem1 then 1 else 0)); {16756#false} is VALID [2018-11-23 11:58:04,954 INFO L273 TraceCheckUtils]: 55: Hoare triple {16756#false} ~cond := #in~cond; {16756#false} is VALID [2018-11-23 11:58:04,954 INFO L273 TraceCheckUtils]: 56: Hoare triple {16756#false} assume 0 == ~cond; {16756#false} is VALID [2018-11-23 11:58:04,954 INFO L273 TraceCheckUtils]: 57: Hoare triple {16756#false} assume !false; {16756#false} is VALID [2018-11-23 11:58:04,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:04,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:04,958 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:58:04,968 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2