java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/standard_init4_false-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 16:52:04,884 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 16:52:04,886 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 16:52:04,902 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 16:52:04,902 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 16:52:04,904 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 16:52:04,905 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 16:52:04,907 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 16:52:04,909 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 16:52:04,910 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 16:52:04,911 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 16:52:04,911 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 16:52:04,912 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 16:52:04,913 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 16:52:04,914 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 16:52:04,915 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 16:52:04,916 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 16:52:04,918 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 16:52:04,920 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 16:52:04,922 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 16:52:04,923 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 16:52:04,924 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 16:52:04,927 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 16:52:04,927 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 16:52:04,928 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 16:52:04,929 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 16:52:04,930 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 16:52:04,930 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 16:52:04,931 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 16:52:04,933 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 16:52:04,933 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 16:52:04,934 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 16:52:04,934 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 16:52:04,934 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 16:52:04,936 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 16:52:04,938 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 16:52:04,939 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-14 16:52:04,970 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 16:52:04,970 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 16:52:04,971 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 16:52:04,971 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 16:52:04,973 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 16:52:04,973 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 16:52:04,973 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 16:52:04,976 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 16:52:04,976 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 16:52:04,976 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 16:52:04,977 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 16:52:04,977 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 16:52:04,977 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 16:52:04,977 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 16:52:04,977 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 16:52:04,977 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 16:52:04,978 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 16:52:04,978 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 16:52:04,978 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 16:52:04,978 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 16:52:04,978 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 16:52:04,979 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 16:52:04,979 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:52:04,979 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 16:52:04,979 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 16:52:04,979 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 16:52:04,980 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 16:52:04,980 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 16:52:04,980 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 16:52:04,980 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 16:52:05,037 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 16:52:05,053 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 16:52:05,058 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 16:52:05,060 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 16:52:05,060 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 16:52:05,061 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_init4_false-unreach-call_ground.i [2018-11-14 16:52:05,133 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62730e075/e3191425ace84b07992b02713aa7488a/FLAG31a0f20e7 [2018-11-14 16:52:05,634 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 16:52:05,635 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_init4_false-unreach-call_ground.i [2018-11-14 16:52:05,641 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62730e075/e3191425ace84b07992b02713aa7488a/FLAG31a0f20e7 [2018-11-14 16:52:05,656 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62730e075/e3191425ace84b07992b02713aa7488a [2018-11-14 16:52:05,667 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 16:52:05,669 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 16:52:05,670 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 16:52:05,670 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 16:52:05,674 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 16:52:05,676 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:52:05" (1/1) ... [2018-11-14 16:52:05,679 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56b74e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:52:05, skipping insertion in model container [2018-11-14 16:52:05,680 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:52:05" (1/1) ... [2018-11-14 16:52:05,690 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 16:52:05,711 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 16:52:05,930 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:52:05,934 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 16:52:05,961 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:52:05,988 INFO L195 MainTranslator]: Completed translation [2018-11-14 16:52:05,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:52:05 WrapperNode [2018-11-14 16:52:05,989 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 16:52:05,992 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 16:52:05,992 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 16:52:05,992 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 16:52:06,007 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:52:05" (1/1) ... [2018-11-14 16:52:06,007 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:52:05" (1/1) ... [2018-11-14 16:52:06,016 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:52:05" (1/1) ... [2018-11-14 16:52:06,016 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:52:05" (1/1) ... [2018-11-14 16:52:06,027 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:52:05" (1/1) ... [2018-11-14 16:52:06,035 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:52:05" (1/1) ... [2018-11-14 16:52:06,037 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:52:05" (1/1) ... [2018-11-14 16:52:06,040 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 16:52:06,041 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 16:52:06,041 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 16:52:06,041 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 16:52:06,045 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:52:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:52:06,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 16:52:06,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 16:52:06,168 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 16:52:06,168 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 16:52:06,168 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 16:52:06,168 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 16:52:06,168 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 16:52:06,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 16:52:06,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 16:52:06,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 16:52:06,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 16:52:06,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 16:52:06,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 16:52:06,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 16:52:06,728 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 16:52:06,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:52:06 BoogieIcfgContainer [2018-11-14 16:52:06,729 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 16:52:06,730 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 16:52:06,730 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 16:52:06,734 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 16:52:06,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:52:05" (1/3) ... [2018-11-14 16:52:06,735 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20a484a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:52:06, skipping insertion in model container [2018-11-14 16:52:06,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:52:05" (2/3) ... [2018-11-14 16:52:06,735 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20a484a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:52:06, skipping insertion in model container [2018-11-14 16:52:06,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:52:06" (3/3) ... [2018-11-14 16:52:06,737 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_init4_false-unreach-call_ground.i [2018-11-14 16:52:06,746 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 16:52:06,753 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 16:52:06,771 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 16:52:06,803 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 16:52:06,803 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 16:52:06,803 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 16:52:06,803 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 16:52:06,804 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 16:52:06,804 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 16:52:06,804 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 16:52:06,804 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 16:52:06,804 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 16:52:06,822 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-11-14 16:52:06,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 16:52:06,829 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:52:06,831 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:52:06,834 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:52:06,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:52:06,840 INFO L82 PathProgramCache]: Analyzing trace with hash -744292695, now seen corresponding path program 1 times [2018-11-14 16:52:06,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:52:06,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:52:06,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:06,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:52:06,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:06,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:06,984 INFO L256 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {37#true} is VALID [2018-11-14 16:52:06,989 INFO L273 TraceCheckUtils]: 1: Hoare triple {37#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {37#true} is VALID [2018-11-14 16:52:06,989 INFO L273 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2018-11-14 16:52:06,990 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #92#return; {37#true} is VALID [2018-11-14 16:52:06,990 INFO L256 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret2 := main(); {37#true} is VALID [2018-11-14 16:52:06,990 INFO L273 TraceCheckUtils]: 5: Hoare triple {37#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {37#true} is VALID [2018-11-14 16:52:07,006 INFO L273 TraceCheckUtils]: 6: Hoare triple {37#true} assume !true; {38#false} is VALID [2018-11-14 16:52:07,007 INFO L273 TraceCheckUtils]: 7: Hoare triple {38#false} ~i~0 := 0; {38#false} is VALID [2018-11-14 16:52:07,007 INFO L273 TraceCheckUtils]: 8: Hoare triple {38#false} assume !true; {38#false} is VALID [2018-11-14 16:52:07,007 INFO L273 TraceCheckUtils]: 9: Hoare triple {38#false} ~i~0 := 0; {38#false} is VALID [2018-11-14 16:52:07,008 INFO L273 TraceCheckUtils]: 10: Hoare triple {38#false} assume !true; {38#false} is VALID [2018-11-14 16:52:07,008 INFO L273 TraceCheckUtils]: 11: Hoare triple {38#false} ~i~0 := 0; {38#false} is VALID [2018-11-14 16:52:07,009 INFO L273 TraceCheckUtils]: 12: Hoare triple {38#false} assume !true; {38#false} is VALID [2018-11-14 16:52:07,009 INFO L273 TraceCheckUtils]: 13: Hoare triple {38#false} havoc ~x~0;~x~0 := 0; {38#false} is VALID [2018-11-14 16:52:07,010 INFO L273 TraceCheckUtils]: 14: Hoare triple {38#false} assume true; {38#false} is VALID [2018-11-14 16:52:07,010 INFO L273 TraceCheckUtils]: 15: Hoare triple {38#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {38#false} is VALID [2018-11-14 16:52:07,010 INFO L256 TraceCheckUtils]: 16: Hoare triple {38#false} call __VERIFIER_assert((if #t~mem1 == 46 then 1 else 0)); {38#false} is VALID [2018-11-14 16:52:07,011 INFO L273 TraceCheckUtils]: 17: Hoare triple {38#false} ~cond := #in~cond; {38#false} is VALID [2018-11-14 16:52:07,011 INFO L273 TraceCheckUtils]: 18: Hoare triple {38#false} assume ~cond == 0; {38#false} is VALID [2018-11-14 16:52:07,011 INFO L273 TraceCheckUtils]: 19: Hoare triple {38#false} assume !false; {38#false} is VALID [2018-11-14 16:52:07,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:52:07,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:52:07,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 16:52:07,024 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-11-14 16:52:07,027 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:52:07,031 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 16:52:07,217 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:52:07,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 16:52:07,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 16:52:07,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:52:07,232 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2018-11-14 16:52:07,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:07,545 INFO L93 Difference]: Finished difference Result 60 states and 79 transitions. [2018-11-14 16:52:07,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 16:52:07,546 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-11-14 16:52:07,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:52:07,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:52:07,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 79 transitions. [2018-11-14 16:52:07,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:52:07,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 79 transitions. [2018-11-14 16:52:07,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 79 transitions. [2018-11-14 16:52:07,824 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:52:07,836 INFO L225 Difference]: With dead ends: 60 [2018-11-14 16:52:07,836 INFO L226 Difference]: Without dead ends: 29 [2018-11-14 16:52:07,840 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:52:07,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-14 16:52:07,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-14 16:52:07,944 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:52:07,945 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2018-11-14 16:52:07,945 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-14 16:52:07,945 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-14 16:52:07,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:07,951 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-14 16:52:07,951 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-14 16:52:07,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:07,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:07,952 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-14 16:52:07,953 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-14 16:52:07,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:07,957 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-14 16:52:07,957 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-14 16:52:07,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:07,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:07,958 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:52:07,959 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:52:07,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 16:52:07,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-11-14 16:52:07,964 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 20 [2018-11-14 16:52:07,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:52:07,964 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-14 16:52:07,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 16:52:07,965 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-14 16:52:07,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-14 16:52:07,966 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:52:07,966 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:52:07,966 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:52:07,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:52:07,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1804086013, now seen corresponding path program 1 times [2018-11-14 16:52:07,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:52:07,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:52:07,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:07,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:52:07,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:07,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:08,085 INFO L256 TraceCheckUtils]: 0: Hoare triple {216#true} call ULTIMATE.init(); {216#true} is VALID [2018-11-14 16:52:08,086 INFO L273 TraceCheckUtils]: 1: Hoare triple {216#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {216#true} is VALID [2018-11-14 16:52:08,086 INFO L273 TraceCheckUtils]: 2: Hoare triple {216#true} assume true; {216#true} is VALID [2018-11-14 16:52:08,086 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {216#true} {216#true} #92#return; {216#true} is VALID [2018-11-14 16:52:08,086 INFO L256 TraceCheckUtils]: 4: Hoare triple {216#true} call #t~ret2 := main(); {216#true} is VALID [2018-11-14 16:52:08,087 INFO L273 TraceCheckUtils]: 5: Hoare triple {216#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {218#(= main_~i~0 0)} is VALID [2018-11-14 16:52:08,090 INFO L273 TraceCheckUtils]: 6: Hoare triple {218#(= main_~i~0 0)} assume true; {218#(= main_~i~0 0)} is VALID [2018-11-14 16:52:08,091 INFO L273 TraceCheckUtils]: 7: Hoare triple {218#(= main_~i~0 0)} assume !(~i~0 < 100000); {217#false} is VALID [2018-11-14 16:52:08,091 INFO L273 TraceCheckUtils]: 8: Hoare triple {217#false} ~i~0 := 0; {217#false} is VALID [2018-11-14 16:52:08,091 INFO L273 TraceCheckUtils]: 9: Hoare triple {217#false} assume true; {217#false} is VALID [2018-11-14 16:52:08,092 INFO L273 TraceCheckUtils]: 10: Hoare triple {217#false} assume !(~i~0 < 100000); {217#false} is VALID [2018-11-14 16:52:08,092 INFO L273 TraceCheckUtils]: 11: Hoare triple {217#false} ~i~0 := 0; {217#false} is VALID [2018-11-14 16:52:08,092 INFO L273 TraceCheckUtils]: 12: Hoare triple {217#false} assume true; {217#false} is VALID [2018-11-14 16:52:08,093 INFO L273 TraceCheckUtils]: 13: Hoare triple {217#false} assume !(~i~0 < 100000); {217#false} is VALID [2018-11-14 16:52:08,093 INFO L273 TraceCheckUtils]: 14: Hoare triple {217#false} ~i~0 := 0; {217#false} is VALID [2018-11-14 16:52:08,093 INFO L273 TraceCheckUtils]: 15: Hoare triple {217#false} assume true; {217#false} is VALID [2018-11-14 16:52:08,094 INFO L273 TraceCheckUtils]: 16: Hoare triple {217#false} assume !(~i~0 < 100000); {217#false} is VALID [2018-11-14 16:52:08,094 INFO L273 TraceCheckUtils]: 17: Hoare triple {217#false} havoc ~x~0;~x~0 := 0; {217#false} is VALID [2018-11-14 16:52:08,094 INFO L273 TraceCheckUtils]: 18: Hoare triple {217#false} assume true; {217#false} is VALID [2018-11-14 16:52:08,095 INFO L273 TraceCheckUtils]: 19: Hoare triple {217#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {217#false} is VALID [2018-11-14 16:52:08,095 INFO L256 TraceCheckUtils]: 20: Hoare triple {217#false} call __VERIFIER_assert((if #t~mem1 == 46 then 1 else 0)); {217#false} is VALID [2018-11-14 16:52:08,095 INFO L273 TraceCheckUtils]: 21: Hoare triple {217#false} ~cond := #in~cond; {217#false} is VALID [2018-11-14 16:52:08,096 INFO L273 TraceCheckUtils]: 22: Hoare triple {217#false} assume ~cond == 0; {217#false} is VALID [2018-11-14 16:52:08,096 INFO L273 TraceCheckUtils]: 23: Hoare triple {217#false} assume !false; {217#false} is VALID [2018-11-14 16:52:08,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:52:08,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:52:08,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:52:08,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-14 16:52:08,101 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:52:08,101 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:52:08,145 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:52:08,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:52:08,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:52:08,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:52:08,146 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 3 states. [2018-11-14 16:52:08,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:08,678 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2018-11-14 16:52:08,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:52:08,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-14 16:52:08,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:52:08,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:52:08,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2018-11-14 16:52:08,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:52:08,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2018-11-14 16:52:08,686 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 69 transitions. [2018-11-14 16:52:08,836 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-14 16:52:08,839 INFO L225 Difference]: With dead ends: 58 [2018-11-14 16:52:08,839 INFO L226 Difference]: Without dead ends: 37 [2018-11-14 16:52:08,840 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:52:08,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-14 16:52:08,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-14 16:52:08,868 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:52:08,868 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2018-11-14 16:52:08,868 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-14 16:52:08,868 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-14 16:52:08,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:08,871 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-14 16:52:08,873 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-14 16:52:08,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:08,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:08,874 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-14 16:52:08,874 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-14 16:52:08,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:08,877 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-14 16:52:08,878 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-14 16:52:08,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:08,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:08,879 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:52:08,879 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:52:08,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-14 16:52:08,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-14 16:52:08,882 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 24 [2018-11-14 16:52:08,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:52:08,882 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-14 16:52:08,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:52:08,883 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-14 16:52:08,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-14 16:52:08,884 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:52:08,884 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:52:08,885 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:52:08,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:52:08,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1411719555, now seen corresponding path program 1 times [2018-11-14 16:52:08,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:52:08,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:52:08,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:08,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:52:08,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:08,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:09,029 INFO L256 TraceCheckUtils]: 0: Hoare triple {426#true} call ULTIMATE.init(); {426#true} is VALID [2018-11-14 16:52:09,029 INFO L273 TraceCheckUtils]: 1: Hoare triple {426#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {426#true} is VALID [2018-11-14 16:52:09,030 INFO L273 TraceCheckUtils]: 2: Hoare triple {426#true} assume true; {426#true} is VALID [2018-11-14 16:52:09,030 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {426#true} {426#true} #92#return; {426#true} is VALID [2018-11-14 16:52:09,030 INFO L256 TraceCheckUtils]: 4: Hoare triple {426#true} call #t~ret2 := main(); {426#true} is VALID [2018-11-14 16:52:09,033 INFO L273 TraceCheckUtils]: 5: Hoare triple {426#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {428#(= main_~i~0 0)} is VALID [2018-11-14 16:52:09,033 INFO L273 TraceCheckUtils]: 6: Hoare triple {428#(= main_~i~0 0)} assume true; {428#(= main_~i~0 0)} is VALID [2018-11-14 16:52:09,038 INFO L273 TraceCheckUtils]: 7: Hoare triple {428#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {429#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:09,039 INFO L273 TraceCheckUtils]: 8: Hoare triple {429#(<= main_~i~0 1)} assume true; {429#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:09,040 INFO L273 TraceCheckUtils]: 9: Hoare triple {429#(<= main_~i~0 1)} assume !(~i~0 < 100000); {427#false} is VALID [2018-11-14 16:52:09,040 INFO L273 TraceCheckUtils]: 10: Hoare triple {427#false} ~i~0 := 0; {427#false} is VALID [2018-11-14 16:52:09,040 INFO L273 TraceCheckUtils]: 11: Hoare triple {427#false} assume true; {427#false} is VALID [2018-11-14 16:52:09,041 INFO L273 TraceCheckUtils]: 12: Hoare triple {427#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {427#false} is VALID [2018-11-14 16:52:09,041 INFO L273 TraceCheckUtils]: 13: Hoare triple {427#false} assume true; {427#false} is VALID [2018-11-14 16:52:09,041 INFO L273 TraceCheckUtils]: 14: Hoare triple {427#false} assume !(~i~0 < 100000); {427#false} is VALID [2018-11-14 16:52:09,042 INFO L273 TraceCheckUtils]: 15: Hoare triple {427#false} ~i~0 := 0; {427#false} is VALID [2018-11-14 16:52:09,042 INFO L273 TraceCheckUtils]: 16: Hoare triple {427#false} assume true; {427#false} is VALID [2018-11-14 16:52:09,042 INFO L273 TraceCheckUtils]: 17: Hoare triple {427#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {427#false} is VALID [2018-11-14 16:52:09,043 INFO L273 TraceCheckUtils]: 18: Hoare triple {427#false} assume true; {427#false} is VALID [2018-11-14 16:52:09,043 INFO L273 TraceCheckUtils]: 19: Hoare triple {427#false} assume !(~i~0 < 100000); {427#false} is VALID [2018-11-14 16:52:09,043 INFO L273 TraceCheckUtils]: 20: Hoare triple {427#false} ~i~0 := 0; {427#false} is VALID [2018-11-14 16:52:09,044 INFO L273 TraceCheckUtils]: 21: Hoare triple {427#false} assume true; {427#false} is VALID [2018-11-14 16:52:09,044 INFO L273 TraceCheckUtils]: 22: Hoare triple {427#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {427#false} is VALID [2018-11-14 16:52:09,044 INFO L273 TraceCheckUtils]: 23: Hoare triple {427#false} assume true; {427#false} is VALID [2018-11-14 16:52:09,045 INFO L273 TraceCheckUtils]: 24: Hoare triple {427#false} assume !(~i~0 < 100000); {427#false} is VALID [2018-11-14 16:52:09,045 INFO L273 TraceCheckUtils]: 25: Hoare triple {427#false} havoc ~x~0;~x~0 := 0; {427#false} is VALID [2018-11-14 16:52:09,045 INFO L273 TraceCheckUtils]: 26: Hoare triple {427#false} assume true; {427#false} is VALID [2018-11-14 16:52:09,046 INFO L273 TraceCheckUtils]: 27: Hoare triple {427#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {427#false} is VALID [2018-11-14 16:52:09,046 INFO L256 TraceCheckUtils]: 28: Hoare triple {427#false} call __VERIFIER_assert((if #t~mem1 == 46 then 1 else 0)); {427#false} is VALID [2018-11-14 16:52:09,046 INFO L273 TraceCheckUtils]: 29: Hoare triple {427#false} ~cond := #in~cond; {427#false} is VALID [2018-11-14 16:52:09,047 INFO L273 TraceCheckUtils]: 30: Hoare triple {427#false} assume ~cond == 0; {427#false} is VALID [2018-11-14 16:52:09,047 INFO L273 TraceCheckUtils]: 31: Hoare triple {427#false} assume !false; {427#false} is VALID [2018-11-14 16:52:09,049 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-14 16:52:09,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:52:09,050 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:52:09,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:52:09,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:09,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:09,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:52:09,318 INFO L256 TraceCheckUtils]: 0: Hoare triple {426#true} call ULTIMATE.init(); {426#true} is VALID [2018-11-14 16:52:09,319 INFO L273 TraceCheckUtils]: 1: Hoare triple {426#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {426#true} is VALID [2018-11-14 16:52:09,319 INFO L273 TraceCheckUtils]: 2: Hoare triple {426#true} assume true; {426#true} is VALID [2018-11-14 16:52:09,319 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {426#true} {426#true} #92#return; {426#true} is VALID [2018-11-14 16:52:09,320 INFO L256 TraceCheckUtils]: 4: Hoare triple {426#true} call #t~ret2 := main(); {426#true} is VALID [2018-11-14 16:52:09,321 INFO L273 TraceCheckUtils]: 5: Hoare triple {426#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {448#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:09,322 INFO L273 TraceCheckUtils]: 6: Hoare triple {448#(<= main_~i~0 0)} assume true; {448#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:09,326 INFO L273 TraceCheckUtils]: 7: Hoare triple {448#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {429#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:09,326 INFO L273 TraceCheckUtils]: 8: Hoare triple {429#(<= main_~i~0 1)} assume true; {429#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:09,327 INFO L273 TraceCheckUtils]: 9: Hoare triple {429#(<= main_~i~0 1)} assume !(~i~0 < 100000); {427#false} is VALID [2018-11-14 16:52:09,327 INFO L273 TraceCheckUtils]: 10: Hoare triple {427#false} ~i~0 := 0; {427#false} is VALID [2018-11-14 16:52:09,327 INFO L273 TraceCheckUtils]: 11: Hoare triple {427#false} assume true; {427#false} is VALID [2018-11-14 16:52:09,328 INFO L273 TraceCheckUtils]: 12: Hoare triple {427#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {427#false} is VALID [2018-11-14 16:52:09,328 INFO L273 TraceCheckUtils]: 13: Hoare triple {427#false} assume true; {427#false} is VALID [2018-11-14 16:52:09,328 INFO L273 TraceCheckUtils]: 14: Hoare triple {427#false} assume !(~i~0 < 100000); {427#false} is VALID [2018-11-14 16:52:09,329 INFO L273 TraceCheckUtils]: 15: Hoare triple {427#false} ~i~0 := 0; {427#false} is VALID [2018-11-14 16:52:09,329 INFO L273 TraceCheckUtils]: 16: Hoare triple {427#false} assume true; {427#false} is VALID [2018-11-14 16:52:09,329 INFO L273 TraceCheckUtils]: 17: Hoare triple {427#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {427#false} is VALID [2018-11-14 16:52:09,330 INFO L273 TraceCheckUtils]: 18: Hoare triple {427#false} assume true; {427#false} is VALID [2018-11-14 16:52:09,330 INFO L273 TraceCheckUtils]: 19: Hoare triple {427#false} assume !(~i~0 < 100000); {427#false} is VALID [2018-11-14 16:52:09,330 INFO L273 TraceCheckUtils]: 20: Hoare triple {427#false} ~i~0 := 0; {427#false} is VALID [2018-11-14 16:52:09,331 INFO L273 TraceCheckUtils]: 21: Hoare triple {427#false} assume true; {427#false} is VALID [2018-11-14 16:52:09,331 INFO L273 TraceCheckUtils]: 22: Hoare triple {427#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {427#false} is VALID [2018-11-14 16:52:09,331 INFO L273 TraceCheckUtils]: 23: Hoare triple {427#false} assume true; {427#false} is VALID [2018-11-14 16:52:09,332 INFO L273 TraceCheckUtils]: 24: Hoare triple {427#false} assume !(~i~0 < 100000); {427#false} is VALID [2018-11-14 16:52:09,332 INFO L273 TraceCheckUtils]: 25: Hoare triple {427#false} havoc ~x~0;~x~0 := 0; {427#false} is VALID [2018-11-14 16:52:09,332 INFO L273 TraceCheckUtils]: 26: Hoare triple {427#false} assume true; {427#false} is VALID [2018-11-14 16:52:09,332 INFO L273 TraceCheckUtils]: 27: Hoare triple {427#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {427#false} is VALID [2018-11-14 16:52:09,333 INFO L256 TraceCheckUtils]: 28: Hoare triple {427#false} call __VERIFIER_assert((if #t~mem1 == 46 then 1 else 0)); {427#false} is VALID [2018-11-14 16:52:09,333 INFO L273 TraceCheckUtils]: 29: Hoare triple {427#false} ~cond := #in~cond; {427#false} is VALID [2018-11-14 16:52:09,333 INFO L273 TraceCheckUtils]: 30: Hoare triple {427#false} assume ~cond == 0; {427#false} is VALID [2018-11-14 16:52:09,334 INFO L273 TraceCheckUtils]: 31: Hoare triple {427#false} assume !false; {427#false} is VALID [2018-11-14 16:52:09,336 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-14 16:52:09,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:52:09,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-14 16:52:09,359 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-11-14 16:52:09,359 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:52:09,359 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 16:52:09,412 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:52:09,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 16:52:09,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 16:52:09,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:52:09,413 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 5 states. [2018-11-14 16:52:09,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:09,873 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2018-11-14 16:52:09,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 16:52:09,874 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-11-14 16:52:09,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:52:09,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:52:09,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2018-11-14 16:52:09,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:52:09,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2018-11-14 16:52:09,881 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 77 transitions. [2018-11-14 16:52:10,049 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:52:10,052 INFO L225 Difference]: With dead ends: 72 [2018-11-14 16:52:10,052 INFO L226 Difference]: Without dead ends: 45 [2018-11-14 16:52:10,053 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:52:10,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-14 16:52:10,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-14 16:52:10,072 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:52:10,072 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 45 states. [2018-11-14 16:52:10,073 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2018-11-14 16:52:10,073 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2018-11-14 16:52:10,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:10,076 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-11-14 16:52:10,076 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-14 16:52:10,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:10,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:10,077 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2018-11-14 16:52:10,077 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2018-11-14 16:52:10,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:10,080 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-11-14 16:52:10,080 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-14 16:52:10,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:10,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:10,081 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:52:10,081 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:52:10,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-14 16:52:10,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-11-14 16:52:10,084 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 32 [2018-11-14 16:52:10,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:52:10,084 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-11-14 16:52:10,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 16:52:10,085 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-14 16:52:10,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-14 16:52:10,086 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:52:10,086 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:52:10,087 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:52:10,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:52:10,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1602425859, now seen corresponding path program 2 times [2018-11-14 16:52:10,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:52:10,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:52:10,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:10,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:52:10,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:10,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:10,235 INFO L256 TraceCheckUtils]: 0: Hoare triple {780#true} call ULTIMATE.init(); {780#true} is VALID [2018-11-14 16:52:10,235 INFO L273 TraceCheckUtils]: 1: Hoare triple {780#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {780#true} is VALID [2018-11-14 16:52:10,236 INFO L273 TraceCheckUtils]: 2: Hoare triple {780#true} assume true; {780#true} is VALID [2018-11-14 16:52:10,236 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {780#true} {780#true} #92#return; {780#true} is VALID [2018-11-14 16:52:10,236 INFO L256 TraceCheckUtils]: 4: Hoare triple {780#true} call #t~ret2 := main(); {780#true} is VALID [2018-11-14 16:52:10,237 INFO L273 TraceCheckUtils]: 5: Hoare triple {780#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {782#(= main_~i~0 0)} is VALID [2018-11-14 16:52:10,238 INFO L273 TraceCheckUtils]: 6: Hoare triple {782#(= main_~i~0 0)} assume true; {782#(= main_~i~0 0)} is VALID [2018-11-14 16:52:10,242 INFO L273 TraceCheckUtils]: 7: Hoare triple {782#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {783#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:10,242 INFO L273 TraceCheckUtils]: 8: Hoare triple {783#(<= main_~i~0 1)} assume true; {783#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:10,245 INFO L273 TraceCheckUtils]: 9: Hoare triple {783#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {784#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:10,245 INFO L273 TraceCheckUtils]: 10: Hoare triple {784#(<= main_~i~0 2)} assume true; {784#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:10,247 INFO L273 TraceCheckUtils]: 11: Hoare triple {784#(<= main_~i~0 2)} assume !(~i~0 < 100000); {781#false} is VALID [2018-11-14 16:52:10,247 INFO L273 TraceCheckUtils]: 12: Hoare triple {781#false} ~i~0 := 0; {781#false} is VALID [2018-11-14 16:52:10,247 INFO L273 TraceCheckUtils]: 13: Hoare triple {781#false} assume true; {781#false} is VALID [2018-11-14 16:52:10,247 INFO L273 TraceCheckUtils]: 14: Hoare triple {781#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {781#false} is VALID [2018-11-14 16:52:10,248 INFO L273 TraceCheckUtils]: 15: Hoare triple {781#false} assume true; {781#false} is VALID [2018-11-14 16:52:10,248 INFO L273 TraceCheckUtils]: 16: Hoare triple {781#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {781#false} is VALID [2018-11-14 16:52:10,248 INFO L273 TraceCheckUtils]: 17: Hoare triple {781#false} assume true; {781#false} is VALID [2018-11-14 16:52:10,249 INFO L273 TraceCheckUtils]: 18: Hoare triple {781#false} assume !(~i~0 < 100000); {781#false} is VALID [2018-11-14 16:52:10,249 INFO L273 TraceCheckUtils]: 19: Hoare triple {781#false} ~i~0 := 0; {781#false} is VALID [2018-11-14 16:52:10,249 INFO L273 TraceCheckUtils]: 20: Hoare triple {781#false} assume true; {781#false} is VALID [2018-11-14 16:52:10,250 INFO L273 TraceCheckUtils]: 21: Hoare triple {781#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {781#false} is VALID [2018-11-14 16:52:10,250 INFO L273 TraceCheckUtils]: 22: Hoare triple {781#false} assume true; {781#false} is VALID [2018-11-14 16:52:10,250 INFO L273 TraceCheckUtils]: 23: Hoare triple {781#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {781#false} is VALID [2018-11-14 16:52:10,251 INFO L273 TraceCheckUtils]: 24: Hoare triple {781#false} assume true; {781#false} is VALID [2018-11-14 16:52:10,251 INFO L273 TraceCheckUtils]: 25: Hoare triple {781#false} assume !(~i~0 < 100000); {781#false} is VALID [2018-11-14 16:52:10,251 INFO L273 TraceCheckUtils]: 26: Hoare triple {781#false} ~i~0 := 0; {781#false} is VALID [2018-11-14 16:52:10,251 INFO L273 TraceCheckUtils]: 27: Hoare triple {781#false} assume true; {781#false} is VALID [2018-11-14 16:52:10,252 INFO L273 TraceCheckUtils]: 28: Hoare triple {781#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {781#false} is VALID [2018-11-14 16:52:10,252 INFO L273 TraceCheckUtils]: 29: Hoare triple {781#false} assume true; {781#false} is VALID [2018-11-14 16:52:10,252 INFO L273 TraceCheckUtils]: 30: Hoare triple {781#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {781#false} is VALID [2018-11-14 16:52:10,253 INFO L273 TraceCheckUtils]: 31: Hoare triple {781#false} assume true; {781#false} is VALID [2018-11-14 16:52:10,253 INFO L273 TraceCheckUtils]: 32: Hoare triple {781#false} assume !(~i~0 < 100000); {781#false} is VALID [2018-11-14 16:52:10,253 INFO L273 TraceCheckUtils]: 33: Hoare triple {781#false} havoc ~x~0;~x~0 := 0; {781#false} is VALID [2018-11-14 16:52:10,253 INFO L273 TraceCheckUtils]: 34: Hoare triple {781#false} assume true; {781#false} is VALID [2018-11-14 16:52:10,254 INFO L273 TraceCheckUtils]: 35: Hoare triple {781#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {781#false} is VALID [2018-11-14 16:52:10,254 INFO L256 TraceCheckUtils]: 36: Hoare triple {781#false} call __VERIFIER_assert((if #t~mem1 == 46 then 1 else 0)); {781#false} is VALID [2018-11-14 16:52:10,254 INFO L273 TraceCheckUtils]: 37: Hoare triple {781#false} ~cond := #in~cond; {781#false} is VALID [2018-11-14 16:52:10,255 INFO L273 TraceCheckUtils]: 38: Hoare triple {781#false} assume ~cond == 0; {781#false} is VALID [2018-11-14 16:52:10,255 INFO L273 TraceCheckUtils]: 39: Hoare triple {781#false} assume !false; {781#false} is VALID [2018-11-14 16:52:10,258 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-14 16:52:10,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:52:10,259 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:52:10,272 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 16:52:10,297 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:52:10,298 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:52:10,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:10,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:52:10,427 INFO L256 TraceCheckUtils]: 0: Hoare triple {780#true} call ULTIMATE.init(); {780#true} is VALID [2018-11-14 16:52:10,428 INFO L273 TraceCheckUtils]: 1: Hoare triple {780#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {780#true} is VALID [2018-11-14 16:52:10,428 INFO L273 TraceCheckUtils]: 2: Hoare triple {780#true} assume true; {780#true} is VALID [2018-11-14 16:52:10,429 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {780#true} {780#true} #92#return; {780#true} is VALID [2018-11-14 16:52:10,429 INFO L256 TraceCheckUtils]: 4: Hoare triple {780#true} call #t~ret2 := main(); {780#true} is VALID [2018-11-14 16:52:10,430 INFO L273 TraceCheckUtils]: 5: Hoare triple {780#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {803#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:10,430 INFO L273 TraceCheckUtils]: 6: Hoare triple {803#(<= main_~i~0 0)} assume true; {803#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:10,431 INFO L273 TraceCheckUtils]: 7: Hoare triple {803#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {783#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:10,432 INFO L273 TraceCheckUtils]: 8: Hoare triple {783#(<= main_~i~0 1)} assume true; {783#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:10,433 INFO L273 TraceCheckUtils]: 9: Hoare triple {783#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {784#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:10,433 INFO L273 TraceCheckUtils]: 10: Hoare triple {784#(<= main_~i~0 2)} assume true; {784#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:10,434 INFO L273 TraceCheckUtils]: 11: Hoare triple {784#(<= main_~i~0 2)} assume !(~i~0 < 100000); {781#false} is VALID [2018-11-14 16:52:10,435 INFO L273 TraceCheckUtils]: 12: Hoare triple {781#false} ~i~0 := 0; {781#false} is VALID [2018-11-14 16:52:10,435 INFO L273 TraceCheckUtils]: 13: Hoare triple {781#false} assume true; {781#false} is VALID [2018-11-14 16:52:10,436 INFO L273 TraceCheckUtils]: 14: Hoare triple {781#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {781#false} is VALID [2018-11-14 16:52:10,436 INFO L273 TraceCheckUtils]: 15: Hoare triple {781#false} assume true; {781#false} is VALID [2018-11-14 16:52:10,436 INFO L273 TraceCheckUtils]: 16: Hoare triple {781#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {781#false} is VALID [2018-11-14 16:52:10,437 INFO L273 TraceCheckUtils]: 17: Hoare triple {781#false} assume true; {781#false} is VALID [2018-11-14 16:52:10,437 INFO L273 TraceCheckUtils]: 18: Hoare triple {781#false} assume !(~i~0 < 100000); {781#false} is VALID [2018-11-14 16:52:10,438 INFO L273 TraceCheckUtils]: 19: Hoare triple {781#false} ~i~0 := 0; {781#false} is VALID [2018-11-14 16:52:10,438 INFO L273 TraceCheckUtils]: 20: Hoare triple {781#false} assume true; {781#false} is VALID [2018-11-14 16:52:10,438 INFO L273 TraceCheckUtils]: 21: Hoare triple {781#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {781#false} is VALID [2018-11-14 16:52:10,438 INFO L273 TraceCheckUtils]: 22: Hoare triple {781#false} assume true; {781#false} is VALID [2018-11-14 16:52:10,439 INFO L273 TraceCheckUtils]: 23: Hoare triple {781#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {781#false} is VALID [2018-11-14 16:52:10,439 INFO L273 TraceCheckUtils]: 24: Hoare triple {781#false} assume true; {781#false} is VALID [2018-11-14 16:52:10,439 INFO L273 TraceCheckUtils]: 25: Hoare triple {781#false} assume !(~i~0 < 100000); {781#false} is VALID [2018-11-14 16:52:10,439 INFO L273 TraceCheckUtils]: 26: Hoare triple {781#false} ~i~0 := 0; {781#false} is VALID [2018-11-14 16:52:10,440 INFO L273 TraceCheckUtils]: 27: Hoare triple {781#false} assume true; {781#false} is VALID [2018-11-14 16:52:10,440 INFO L273 TraceCheckUtils]: 28: Hoare triple {781#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {781#false} is VALID [2018-11-14 16:52:10,440 INFO L273 TraceCheckUtils]: 29: Hoare triple {781#false} assume true; {781#false} is VALID [2018-11-14 16:52:10,441 INFO L273 TraceCheckUtils]: 30: Hoare triple {781#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {781#false} is VALID [2018-11-14 16:52:10,441 INFO L273 TraceCheckUtils]: 31: Hoare triple {781#false} assume true; {781#false} is VALID [2018-11-14 16:52:10,441 INFO L273 TraceCheckUtils]: 32: Hoare triple {781#false} assume !(~i~0 < 100000); {781#false} is VALID [2018-11-14 16:52:10,441 INFO L273 TraceCheckUtils]: 33: Hoare triple {781#false} havoc ~x~0;~x~0 := 0; {781#false} is VALID [2018-11-14 16:52:10,442 INFO L273 TraceCheckUtils]: 34: Hoare triple {781#false} assume true; {781#false} is VALID [2018-11-14 16:52:10,442 INFO L273 TraceCheckUtils]: 35: Hoare triple {781#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {781#false} is VALID [2018-11-14 16:52:10,442 INFO L256 TraceCheckUtils]: 36: Hoare triple {781#false} call __VERIFIER_assert((if #t~mem1 == 46 then 1 else 0)); {781#false} is VALID [2018-11-14 16:52:10,442 INFO L273 TraceCheckUtils]: 37: Hoare triple {781#false} ~cond := #in~cond; {781#false} is VALID [2018-11-14 16:52:10,443 INFO L273 TraceCheckUtils]: 38: Hoare triple {781#false} assume ~cond == 0; {781#false} is VALID [2018-11-14 16:52:10,443 INFO L273 TraceCheckUtils]: 39: Hoare triple {781#false} assume !false; {781#false} is VALID [2018-11-14 16:52:10,446 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-14 16:52:10,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:52:10,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-14 16:52:10,473 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-11-14 16:52:10,474 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:52:10,474 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 16:52:10,564 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:52:10,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 16:52:10,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 16:52:10,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:52:10,565 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 6 states. [2018-11-14 16:52:10,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:10,865 INFO L93 Difference]: Finished difference Result 86 states and 97 transitions. [2018-11-14 16:52:10,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 16:52:10,865 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-11-14 16:52:10,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:52:10,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:52:10,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2018-11-14 16:52:10,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:52:10,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2018-11-14 16:52:10,872 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 85 transitions. [2018-11-14 16:52:11,079 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:52:11,081 INFO L225 Difference]: With dead ends: 86 [2018-11-14 16:52:11,082 INFO L226 Difference]: Without dead ends: 53 [2018-11-14 16:52:11,083 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:52:11,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-14 16:52:11,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-11-14 16:52:11,116 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:52:11,116 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 53 states. [2018-11-14 16:52:11,116 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2018-11-14 16:52:11,116 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2018-11-14 16:52:11,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:11,120 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-11-14 16:52:11,120 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2018-11-14 16:52:11,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:11,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:11,121 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2018-11-14 16:52:11,121 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2018-11-14 16:52:11,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:11,124 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-11-14 16:52:11,124 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2018-11-14 16:52:11,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:11,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:11,125 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:52:11,126 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:52:11,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-14 16:52:11,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2018-11-14 16:52:11,128 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 40 [2018-11-14 16:52:11,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:52:11,129 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2018-11-14 16:52:11,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 16:52:11,129 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2018-11-14 16:52:11,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-14 16:52:11,131 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:52:11,131 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:52:11,131 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:52:11,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:52:11,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1961405571, now seen corresponding path program 3 times [2018-11-14 16:52:11,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:52:11,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:52:11,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:11,133 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:52:11,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:11,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:11,302 INFO L256 TraceCheckUtils]: 0: Hoare triple {1208#true} call ULTIMATE.init(); {1208#true} is VALID [2018-11-14 16:52:11,302 INFO L273 TraceCheckUtils]: 1: Hoare triple {1208#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1208#true} is VALID [2018-11-14 16:52:11,302 INFO L273 TraceCheckUtils]: 2: Hoare triple {1208#true} assume true; {1208#true} is VALID [2018-11-14 16:52:11,303 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1208#true} {1208#true} #92#return; {1208#true} is VALID [2018-11-14 16:52:11,303 INFO L256 TraceCheckUtils]: 4: Hoare triple {1208#true} call #t~ret2 := main(); {1208#true} is VALID [2018-11-14 16:52:11,307 INFO L273 TraceCheckUtils]: 5: Hoare triple {1208#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1210#(= main_~i~0 0)} is VALID [2018-11-14 16:52:11,308 INFO L273 TraceCheckUtils]: 6: Hoare triple {1210#(= main_~i~0 0)} assume true; {1210#(= main_~i~0 0)} is VALID [2018-11-14 16:52:11,309 INFO L273 TraceCheckUtils]: 7: Hoare triple {1210#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1211#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:11,312 INFO L273 TraceCheckUtils]: 8: Hoare triple {1211#(<= main_~i~0 1)} assume true; {1211#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:11,313 INFO L273 TraceCheckUtils]: 9: Hoare triple {1211#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1212#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:11,314 INFO L273 TraceCheckUtils]: 10: Hoare triple {1212#(<= main_~i~0 2)} assume true; {1212#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:11,315 INFO L273 TraceCheckUtils]: 11: Hoare triple {1212#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1213#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:11,316 INFO L273 TraceCheckUtils]: 12: Hoare triple {1213#(<= main_~i~0 3)} assume true; {1213#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:11,316 INFO L273 TraceCheckUtils]: 13: Hoare triple {1213#(<= main_~i~0 3)} assume !(~i~0 < 100000); {1209#false} is VALID [2018-11-14 16:52:11,317 INFO L273 TraceCheckUtils]: 14: Hoare triple {1209#false} ~i~0 := 0; {1209#false} is VALID [2018-11-14 16:52:11,317 INFO L273 TraceCheckUtils]: 15: Hoare triple {1209#false} assume true; {1209#false} is VALID [2018-11-14 16:52:11,317 INFO L273 TraceCheckUtils]: 16: Hoare triple {1209#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1209#false} is VALID [2018-11-14 16:52:11,317 INFO L273 TraceCheckUtils]: 17: Hoare triple {1209#false} assume true; {1209#false} is VALID [2018-11-14 16:52:11,318 INFO L273 TraceCheckUtils]: 18: Hoare triple {1209#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1209#false} is VALID [2018-11-14 16:52:11,318 INFO L273 TraceCheckUtils]: 19: Hoare triple {1209#false} assume true; {1209#false} is VALID [2018-11-14 16:52:11,318 INFO L273 TraceCheckUtils]: 20: Hoare triple {1209#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1209#false} is VALID [2018-11-14 16:52:11,319 INFO L273 TraceCheckUtils]: 21: Hoare triple {1209#false} assume true; {1209#false} is VALID [2018-11-14 16:52:11,319 INFO L273 TraceCheckUtils]: 22: Hoare triple {1209#false} assume !(~i~0 < 100000); {1209#false} is VALID [2018-11-14 16:52:11,320 INFO L273 TraceCheckUtils]: 23: Hoare triple {1209#false} ~i~0 := 0; {1209#false} is VALID [2018-11-14 16:52:11,320 INFO L273 TraceCheckUtils]: 24: Hoare triple {1209#false} assume true; {1209#false} is VALID [2018-11-14 16:52:11,320 INFO L273 TraceCheckUtils]: 25: Hoare triple {1209#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1209#false} is VALID [2018-11-14 16:52:11,321 INFO L273 TraceCheckUtils]: 26: Hoare triple {1209#false} assume true; {1209#false} is VALID [2018-11-14 16:52:11,321 INFO L273 TraceCheckUtils]: 27: Hoare triple {1209#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1209#false} is VALID [2018-11-14 16:52:11,321 INFO L273 TraceCheckUtils]: 28: Hoare triple {1209#false} assume true; {1209#false} is VALID [2018-11-14 16:52:11,321 INFO L273 TraceCheckUtils]: 29: Hoare triple {1209#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1209#false} is VALID [2018-11-14 16:52:11,322 INFO L273 TraceCheckUtils]: 30: Hoare triple {1209#false} assume true; {1209#false} is VALID [2018-11-14 16:52:11,322 INFO L273 TraceCheckUtils]: 31: Hoare triple {1209#false} assume !(~i~0 < 100000); {1209#false} is VALID [2018-11-14 16:52:11,322 INFO L273 TraceCheckUtils]: 32: Hoare triple {1209#false} ~i~0 := 0; {1209#false} is VALID [2018-11-14 16:52:11,323 INFO L273 TraceCheckUtils]: 33: Hoare triple {1209#false} assume true; {1209#false} is VALID [2018-11-14 16:52:11,323 INFO L273 TraceCheckUtils]: 34: Hoare triple {1209#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1209#false} is VALID [2018-11-14 16:52:11,323 INFO L273 TraceCheckUtils]: 35: Hoare triple {1209#false} assume true; {1209#false} is VALID [2018-11-14 16:52:11,323 INFO L273 TraceCheckUtils]: 36: Hoare triple {1209#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1209#false} is VALID [2018-11-14 16:52:11,324 INFO L273 TraceCheckUtils]: 37: Hoare triple {1209#false} assume true; {1209#false} is VALID [2018-11-14 16:52:11,324 INFO L273 TraceCheckUtils]: 38: Hoare triple {1209#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1209#false} is VALID [2018-11-14 16:52:11,324 INFO L273 TraceCheckUtils]: 39: Hoare triple {1209#false} assume true; {1209#false} is VALID [2018-11-14 16:52:11,324 INFO L273 TraceCheckUtils]: 40: Hoare triple {1209#false} assume !(~i~0 < 100000); {1209#false} is VALID [2018-11-14 16:52:11,325 INFO L273 TraceCheckUtils]: 41: Hoare triple {1209#false} havoc ~x~0;~x~0 := 0; {1209#false} is VALID [2018-11-14 16:52:11,325 INFO L273 TraceCheckUtils]: 42: Hoare triple {1209#false} assume true; {1209#false} is VALID [2018-11-14 16:52:11,325 INFO L273 TraceCheckUtils]: 43: Hoare triple {1209#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {1209#false} is VALID [2018-11-14 16:52:11,326 INFO L256 TraceCheckUtils]: 44: Hoare triple {1209#false} call __VERIFIER_assert((if #t~mem1 == 46 then 1 else 0)); {1209#false} is VALID [2018-11-14 16:52:11,326 INFO L273 TraceCheckUtils]: 45: Hoare triple {1209#false} ~cond := #in~cond; {1209#false} is VALID [2018-11-14 16:52:11,326 INFO L273 TraceCheckUtils]: 46: Hoare triple {1209#false} assume ~cond == 0; {1209#false} is VALID [2018-11-14 16:52:11,326 INFO L273 TraceCheckUtils]: 47: Hoare triple {1209#false} assume !false; {1209#false} is VALID [2018-11-14 16:52:11,330 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-14 16:52:11,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:52:11,330 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:52:11,351 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 16:52:11,390 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-14 16:52:11,390 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:52:11,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:11,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:52:11,541 INFO L256 TraceCheckUtils]: 0: Hoare triple {1208#true} call ULTIMATE.init(); {1208#true} is VALID [2018-11-14 16:52:11,541 INFO L273 TraceCheckUtils]: 1: Hoare triple {1208#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1208#true} is VALID [2018-11-14 16:52:11,541 INFO L273 TraceCheckUtils]: 2: Hoare triple {1208#true} assume true; {1208#true} is VALID [2018-11-14 16:52:11,541 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1208#true} {1208#true} #92#return; {1208#true} is VALID [2018-11-14 16:52:11,542 INFO L256 TraceCheckUtils]: 4: Hoare triple {1208#true} call #t~ret2 := main(); {1208#true} is VALID [2018-11-14 16:52:11,542 INFO L273 TraceCheckUtils]: 5: Hoare triple {1208#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1208#true} is VALID [2018-11-14 16:52:11,542 INFO L273 TraceCheckUtils]: 6: Hoare triple {1208#true} assume true; {1208#true} is VALID [2018-11-14 16:52:11,542 INFO L273 TraceCheckUtils]: 7: Hoare triple {1208#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1208#true} is VALID [2018-11-14 16:52:11,543 INFO L273 TraceCheckUtils]: 8: Hoare triple {1208#true} assume true; {1208#true} is VALID [2018-11-14 16:52:11,543 INFO L273 TraceCheckUtils]: 9: Hoare triple {1208#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1208#true} is VALID [2018-11-14 16:52:11,543 INFO L273 TraceCheckUtils]: 10: Hoare triple {1208#true} assume true; {1208#true} is VALID [2018-11-14 16:52:11,543 INFO L273 TraceCheckUtils]: 11: Hoare triple {1208#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1208#true} is VALID [2018-11-14 16:52:11,543 INFO L273 TraceCheckUtils]: 12: Hoare triple {1208#true} assume true; {1208#true} is VALID [2018-11-14 16:52:11,543 INFO L273 TraceCheckUtils]: 13: Hoare triple {1208#true} assume !(~i~0 < 100000); {1208#true} is VALID [2018-11-14 16:52:11,544 INFO L273 TraceCheckUtils]: 14: Hoare triple {1208#true} ~i~0 := 0; {1259#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:11,544 INFO L273 TraceCheckUtils]: 15: Hoare triple {1259#(<= main_~i~0 0)} assume true; {1259#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:11,545 INFO L273 TraceCheckUtils]: 16: Hoare triple {1259#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1211#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:11,547 INFO L273 TraceCheckUtils]: 17: Hoare triple {1211#(<= main_~i~0 1)} assume true; {1211#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:11,550 INFO L273 TraceCheckUtils]: 18: Hoare triple {1211#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1212#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:11,553 INFO L273 TraceCheckUtils]: 19: Hoare triple {1212#(<= main_~i~0 2)} assume true; {1212#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:11,555 INFO L273 TraceCheckUtils]: 20: Hoare triple {1212#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1213#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:11,565 INFO L273 TraceCheckUtils]: 21: Hoare triple {1213#(<= main_~i~0 3)} assume true; {1213#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:11,580 INFO L273 TraceCheckUtils]: 22: Hoare triple {1213#(<= main_~i~0 3)} assume !(~i~0 < 100000); {1209#false} is VALID [2018-11-14 16:52:11,580 INFO L273 TraceCheckUtils]: 23: Hoare triple {1209#false} ~i~0 := 0; {1209#false} is VALID [2018-11-14 16:52:11,581 INFO L273 TraceCheckUtils]: 24: Hoare triple {1209#false} assume true; {1209#false} is VALID [2018-11-14 16:52:11,581 INFO L273 TraceCheckUtils]: 25: Hoare triple {1209#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1209#false} is VALID [2018-11-14 16:52:11,581 INFO L273 TraceCheckUtils]: 26: Hoare triple {1209#false} assume true; {1209#false} is VALID [2018-11-14 16:52:11,581 INFO L273 TraceCheckUtils]: 27: Hoare triple {1209#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1209#false} is VALID [2018-11-14 16:52:11,582 INFO L273 TraceCheckUtils]: 28: Hoare triple {1209#false} assume true; {1209#false} is VALID [2018-11-14 16:52:11,582 INFO L273 TraceCheckUtils]: 29: Hoare triple {1209#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1209#false} is VALID [2018-11-14 16:52:11,582 INFO L273 TraceCheckUtils]: 30: Hoare triple {1209#false} assume true; {1209#false} is VALID [2018-11-14 16:52:11,582 INFO L273 TraceCheckUtils]: 31: Hoare triple {1209#false} assume !(~i~0 < 100000); {1209#false} is VALID [2018-11-14 16:52:11,583 INFO L273 TraceCheckUtils]: 32: Hoare triple {1209#false} ~i~0 := 0; {1209#false} is VALID [2018-11-14 16:52:11,583 INFO L273 TraceCheckUtils]: 33: Hoare triple {1209#false} assume true; {1209#false} is VALID [2018-11-14 16:52:11,583 INFO L273 TraceCheckUtils]: 34: Hoare triple {1209#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1209#false} is VALID [2018-11-14 16:52:11,583 INFO L273 TraceCheckUtils]: 35: Hoare triple {1209#false} assume true; {1209#false} is VALID [2018-11-14 16:52:11,584 INFO L273 TraceCheckUtils]: 36: Hoare triple {1209#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1209#false} is VALID [2018-11-14 16:52:11,584 INFO L273 TraceCheckUtils]: 37: Hoare triple {1209#false} assume true; {1209#false} is VALID [2018-11-14 16:52:11,584 INFO L273 TraceCheckUtils]: 38: Hoare triple {1209#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1209#false} is VALID [2018-11-14 16:52:11,585 INFO L273 TraceCheckUtils]: 39: Hoare triple {1209#false} assume true; {1209#false} is VALID [2018-11-14 16:52:11,585 INFO L273 TraceCheckUtils]: 40: Hoare triple {1209#false} assume !(~i~0 < 100000); {1209#false} is VALID [2018-11-14 16:52:11,585 INFO L273 TraceCheckUtils]: 41: Hoare triple {1209#false} havoc ~x~0;~x~0 := 0; {1209#false} is VALID [2018-11-14 16:52:11,585 INFO L273 TraceCheckUtils]: 42: Hoare triple {1209#false} assume true; {1209#false} is VALID [2018-11-14 16:52:11,586 INFO L273 TraceCheckUtils]: 43: Hoare triple {1209#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {1209#false} is VALID [2018-11-14 16:52:11,586 INFO L256 TraceCheckUtils]: 44: Hoare triple {1209#false} call __VERIFIER_assert((if #t~mem1 == 46 then 1 else 0)); {1209#false} is VALID [2018-11-14 16:52:11,586 INFO L273 TraceCheckUtils]: 45: Hoare triple {1209#false} ~cond := #in~cond; {1209#false} is VALID [2018-11-14 16:52:11,586 INFO L273 TraceCheckUtils]: 46: Hoare triple {1209#false} assume ~cond == 0; {1209#false} is VALID [2018-11-14 16:52:11,587 INFO L273 TraceCheckUtils]: 47: Hoare triple {1209#false} assume !false; {1209#false} is VALID [2018-11-14 16:52:11,590 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-14 16:52:11,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:52:11,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-14 16:52:11,614 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-11-14 16:52:11,614 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:52:11,615 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 16:52:11,671 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:52:11,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 16:52:11,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 16:52:11,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:52:11,673 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 7 states. [2018-11-14 16:52:11,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:11,946 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2018-11-14 16:52:11,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 16:52:11,946 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-11-14 16:52:11,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:52:11,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:52:11,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2018-11-14 16:52:11,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:52:11,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2018-11-14 16:52:11,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 93 transitions. [2018-11-14 16:52:12,073 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:52:12,076 INFO L225 Difference]: With dead ends: 100 [2018-11-14 16:52:12,076 INFO L226 Difference]: Without dead ends: 61 [2018-11-14 16:52:12,077 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:52:12,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-14 16:52:12,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-11-14 16:52:12,114 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:52:12,114 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 61 states. [2018-11-14 16:52:12,115 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 61 states. [2018-11-14 16:52:12,115 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 61 states. [2018-11-14 16:52:12,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:12,118 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-11-14 16:52:12,119 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-11-14 16:52:12,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:12,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:12,120 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 61 states. [2018-11-14 16:52:12,120 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 61 states. [2018-11-14 16:52:12,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:12,123 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-11-14 16:52:12,123 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-11-14 16:52:12,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:12,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:12,124 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:52:12,124 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:52:12,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-14 16:52:12,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-11-14 16:52:12,127 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 48 [2018-11-14 16:52:12,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:52:12,128 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-11-14 16:52:12,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 16:52:12,128 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-11-14 16:52:12,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-14 16:52:12,129 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:52:12,130 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:52:12,130 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:52:12,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:52:12,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1068700925, now seen corresponding path program 4 times [2018-11-14 16:52:12,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:52:12,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:52:12,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:12,132 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:52:12,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:12,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:12,275 INFO L256 TraceCheckUtils]: 0: Hoare triple {1710#true} call ULTIMATE.init(); {1710#true} is VALID [2018-11-14 16:52:12,276 INFO L273 TraceCheckUtils]: 1: Hoare triple {1710#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1710#true} is VALID [2018-11-14 16:52:12,276 INFO L273 TraceCheckUtils]: 2: Hoare triple {1710#true} assume true; {1710#true} is VALID [2018-11-14 16:52:12,276 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1710#true} {1710#true} #92#return; {1710#true} is VALID [2018-11-14 16:52:12,276 INFO L256 TraceCheckUtils]: 4: Hoare triple {1710#true} call #t~ret2 := main(); {1710#true} is VALID [2018-11-14 16:52:12,277 INFO L273 TraceCheckUtils]: 5: Hoare triple {1710#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1712#(= main_~i~0 0)} is VALID [2018-11-14 16:52:12,277 INFO L273 TraceCheckUtils]: 6: Hoare triple {1712#(= main_~i~0 0)} assume true; {1712#(= main_~i~0 0)} is VALID [2018-11-14 16:52:12,287 INFO L273 TraceCheckUtils]: 7: Hoare triple {1712#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1713#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:12,288 INFO L273 TraceCheckUtils]: 8: Hoare triple {1713#(<= main_~i~0 1)} assume true; {1713#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:12,289 INFO L273 TraceCheckUtils]: 9: Hoare triple {1713#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1714#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:12,289 INFO L273 TraceCheckUtils]: 10: Hoare triple {1714#(<= main_~i~0 2)} assume true; {1714#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:12,290 INFO L273 TraceCheckUtils]: 11: Hoare triple {1714#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1715#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:12,291 INFO L273 TraceCheckUtils]: 12: Hoare triple {1715#(<= main_~i~0 3)} assume true; {1715#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:12,292 INFO L273 TraceCheckUtils]: 13: Hoare triple {1715#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1716#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:12,297 INFO L273 TraceCheckUtils]: 14: Hoare triple {1716#(<= main_~i~0 4)} assume true; {1716#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:12,298 INFO L273 TraceCheckUtils]: 15: Hoare triple {1716#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1711#false} is VALID [2018-11-14 16:52:12,298 INFO L273 TraceCheckUtils]: 16: Hoare triple {1711#false} ~i~0 := 0; {1711#false} is VALID [2018-11-14 16:52:12,298 INFO L273 TraceCheckUtils]: 17: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-14 16:52:12,299 INFO L273 TraceCheckUtils]: 18: Hoare triple {1711#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1711#false} is VALID [2018-11-14 16:52:12,299 INFO L273 TraceCheckUtils]: 19: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-14 16:52:12,299 INFO L273 TraceCheckUtils]: 20: Hoare triple {1711#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1711#false} is VALID [2018-11-14 16:52:12,299 INFO L273 TraceCheckUtils]: 21: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-14 16:52:12,299 INFO L273 TraceCheckUtils]: 22: Hoare triple {1711#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1711#false} is VALID [2018-11-14 16:52:12,300 INFO L273 TraceCheckUtils]: 23: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-14 16:52:12,300 INFO L273 TraceCheckUtils]: 24: Hoare triple {1711#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1711#false} is VALID [2018-11-14 16:52:12,300 INFO L273 TraceCheckUtils]: 25: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-14 16:52:12,300 INFO L273 TraceCheckUtils]: 26: Hoare triple {1711#false} assume !(~i~0 < 100000); {1711#false} is VALID [2018-11-14 16:52:12,301 INFO L273 TraceCheckUtils]: 27: Hoare triple {1711#false} ~i~0 := 0; {1711#false} is VALID [2018-11-14 16:52:12,301 INFO L273 TraceCheckUtils]: 28: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-14 16:52:12,301 INFO L273 TraceCheckUtils]: 29: Hoare triple {1711#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1711#false} is VALID [2018-11-14 16:52:12,301 INFO L273 TraceCheckUtils]: 30: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-14 16:52:12,301 INFO L273 TraceCheckUtils]: 31: Hoare triple {1711#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1711#false} is VALID [2018-11-14 16:52:12,302 INFO L273 TraceCheckUtils]: 32: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-14 16:52:12,302 INFO L273 TraceCheckUtils]: 33: Hoare triple {1711#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1711#false} is VALID [2018-11-14 16:52:12,302 INFO L273 TraceCheckUtils]: 34: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-14 16:52:12,302 INFO L273 TraceCheckUtils]: 35: Hoare triple {1711#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1711#false} is VALID [2018-11-14 16:52:12,302 INFO L273 TraceCheckUtils]: 36: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-14 16:52:12,303 INFO L273 TraceCheckUtils]: 37: Hoare triple {1711#false} assume !(~i~0 < 100000); {1711#false} is VALID [2018-11-14 16:52:12,303 INFO L273 TraceCheckUtils]: 38: Hoare triple {1711#false} ~i~0 := 0; {1711#false} is VALID [2018-11-14 16:52:12,303 INFO L273 TraceCheckUtils]: 39: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-14 16:52:12,303 INFO L273 TraceCheckUtils]: 40: Hoare triple {1711#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1711#false} is VALID [2018-11-14 16:52:12,303 INFO L273 TraceCheckUtils]: 41: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-14 16:52:12,303 INFO L273 TraceCheckUtils]: 42: Hoare triple {1711#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1711#false} is VALID [2018-11-14 16:52:12,304 INFO L273 TraceCheckUtils]: 43: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-14 16:52:12,304 INFO L273 TraceCheckUtils]: 44: Hoare triple {1711#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1711#false} is VALID [2018-11-14 16:52:12,304 INFO L273 TraceCheckUtils]: 45: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-14 16:52:12,304 INFO L273 TraceCheckUtils]: 46: Hoare triple {1711#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1711#false} is VALID [2018-11-14 16:52:12,304 INFO L273 TraceCheckUtils]: 47: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-14 16:52:12,305 INFO L273 TraceCheckUtils]: 48: Hoare triple {1711#false} assume !(~i~0 < 100000); {1711#false} is VALID [2018-11-14 16:52:12,305 INFO L273 TraceCheckUtils]: 49: Hoare triple {1711#false} havoc ~x~0;~x~0 := 0; {1711#false} is VALID [2018-11-14 16:52:12,305 INFO L273 TraceCheckUtils]: 50: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-14 16:52:12,305 INFO L273 TraceCheckUtils]: 51: Hoare triple {1711#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {1711#false} is VALID [2018-11-14 16:52:12,305 INFO L256 TraceCheckUtils]: 52: Hoare triple {1711#false} call __VERIFIER_assert((if #t~mem1 == 46 then 1 else 0)); {1711#false} is VALID [2018-11-14 16:52:12,305 INFO L273 TraceCheckUtils]: 53: Hoare triple {1711#false} ~cond := #in~cond; {1711#false} is VALID [2018-11-14 16:52:12,306 INFO L273 TraceCheckUtils]: 54: Hoare triple {1711#false} assume ~cond == 0; {1711#false} is VALID [2018-11-14 16:52:12,306 INFO L273 TraceCheckUtils]: 55: Hoare triple {1711#false} assume !false; {1711#false} is VALID [2018-11-14 16:52:12,309 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-14 16:52:12,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:52:12,310 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:52:12,319 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 16:52:12,370 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 16:52:12,370 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:52:12,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:12,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:52:12,601 INFO L256 TraceCheckUtils]: 0: Hoare triple {1710#true} call ULTIMATE.init(); {1710#true} is VALID [2018-11-14 16:52:12,602 INFO L273 TraceCheckUtils]: 1: Hoare triple {1710#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1710#true} is VALID [2018-11-14 16:52:12,602 INFO L273 TraceCheckUtils]: 2: Hoare triple {1710#true} assume true; {1710#true} is VALID [2018-11-14 16:52:12,602 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1710#true} {1710#true} #92#return; {1710#true} is VALID [2018-11-14 16:52:12,602 INFO L256 TraceCheckUtils]: 4: Hoare triple {1710#true} call #t~ret2 := main(); {1710#true} is VALID [2018-11-14 16:52:12,603 INFO L273 TraceCheckUtils]: 5: Hoare triple {1710#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1735#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:12,604 INFO L273 TraceCheckUtils]: 6: Hoare triple {1735#(<= main_~i~0 0)} assume true; {1735#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:12,604 INFO L273 TraceCheckUtils]: 7: Hoare triple {1735#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1713#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:12,605 INFO L273 TraceCheckUtils]: 8: Hoare triple {1713#(<= main_~i~0 1)} assume true; {1713#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:12,606 INFO L273 TraceCheckUtils]: 9: Hoare triple {1713#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1714#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:12,606 INFO L273 TraceCheckUtils]: 10: Hoare triple {1714#(<= main_~i~0 2)} assume true; {1714#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:12,607 INFO L273 TraceCheckUtils]: 11: Hoare triple {1714#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1715#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:12,608 INFO L273 TraceCheckUtils]: 12: Hoare triple {1715#(<= main_~i~0 3)} assume true; {1715#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:12,609 INFO L273 TraceCheckUtils]: 13: Hoare triple {1715#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1716#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:12,610 INFO L273 TraceCheckUtils]: 14: Hoare triple {1716#(<= main_~i~0 4)} assume true; {1716#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:12,611 INFO L273 TraceCheckUtils]: 15: Hoare triple {1716#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1711#false} is VALID [2018-11-14 16:52:12,611 INFO L273 TraceCheckUtils]: 16: Hoare triple {1711#false} ~i~0 := 0; {1711#false} is VALID [2018-11-14 16:52:12,612 INFO L273 TraceCheckUtils]: 17: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-14 16:52:12,612 INFO L273 TraceCheckUtils]: 18: Hoare triple {1711#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1711#false} is VALID [2018-11-14 16:52:12,613 INFO L273 TraceCheckUtils]: 19: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-14 16:52:12,613 INFO L273 TraceCheckUtils]: 20: Hoare triple {1711#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1711#false} is VALID [2018-11-14 16:52:12,613 INFO L273 TraceCheckUtils]: 21: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-14 16:52:12,614 INFO L273 TraceCheckUtils]: 22: Hoare triple {1711#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1711#false} is VALID [2018-11-14 16:52:12,614 INFO L273 TraceCheckUtils]: 23: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-14 16:52:12,614 INFO L273 TraceCheckUtils]: 24: Hoare triple {1711#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1711#false} is VALID [2018-11-14 16:52:12,615 INFO L273 TraceCheckUtils]: 25: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-14 16:52:12,615 INFO L273 TraceCheckUtils]: 26: Hoare triple {1711#false} assume !(~i~0 < 100000); {1711#false} is VALID [2018-11-14 16:52:12,615 INFO L273 TraceCheckUtils]: 27: Hoare triple {1711#false} ~i~0 := 0; {1711#false} is VALID [2018-11-14 16:52:12,615 INFO L273 TraceCheckUtils]: 28: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-14 16:52:12,615 INFO L273 TraceCheckUtils]: 29: Hoare triple {1711#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1711#false} is VALID [2018-11-14 16:52:12,616 INFO L273 TraceCheckUtils]: 30: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-14 16:52:12,616 INFO L273 TraceCheckUtils]: 31: Hoare triple {1711#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1711#false} is VALID [2018-11-14 16:52:12,616 INFO L273 TraceCheckUtils]: 32: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-14 16:52:12,616 INFO L273 TraceCheckUtils]: 33: Hoare triple {1711#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1711#false} is VALID [2018-11-14 16:52:12,617 INFO L273 TraceCheckUtils]: 34: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-14 16:52:12,617 INFO L273 TraceCheckUtils]: 35: Hoare triple {1711#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1711#false} is VALID [2018-11-14 16:52:12,617 INFO L273 TraceCheckUtils]: 36: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-14 16:52:12,617 INFO L273 TraceCheckUtils]: 37: Hoare triple {1711#false} assume !(~i~0 < 100000); {1711#false} is VALID [2018-11-14 16:52:12,617 INFO L273 TraceCheckUtils]: 38: Hoare triple {1711#false} ~i~0 := 0; {1711#false} is VALID [2018-11-14 16:52:12,618 INFO L273 TraceCheckUtils]: 39: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-14 16:52:12,618 INFO L273 TraceCheckUtils]: 40: Hoare triple {1711#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1711#false} is VALID [2018-11-14 16:52:12,618 INFO L273 TraceCheckUtils]: 41: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-14 16:52:12,618 INFO L273 TraceCheckUtils]: 42: Hoare triple {1711#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1711#false} is VALID [2018-11-14 16:52:12,618 INFO L273 TraceCheckUtils]: 43: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-14 16:52:12,619 INFO L273 TraceCheckUtils]: 44: Hoare triple {1711#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1711#false} is VALID [2018-11-14 16:52:12,619 INFO L273 TraceCheckUtils]: 45: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-14 16:52:12,619 INFO L273 TraceCheckUtils]: 46: Hoare triple {1711#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1711#false} is VALID [2018-11-14 16:52:12,619 INFO L273 TraceCheckUtils]: 47: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-14 16:52:12,619 INFO L273 TraceCheckUtils]: 48: Hoare triple {1711#false} assume !(~i~0 < 100000); {1711#false} is VALID [2018-11-14 16:52:12,620 INFO L273 TraceCheckUtils]: 49: Hoare triple {1711#false} havoc ~x~0;~x~0 := 0; {1711#false} is VALID [2018-11-14 16:52:12,620 INFO L273 TraceCheckUtils]: 50: Hoare triple {1711#false} assume true; {1711#false} is VALID [2018-11-14 16:52:12,621 INFO L273 TraceCheckUtils]: 51: Hoare triple {1711#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {1711#false} is VALID [2018-11-14 16:52:12,621 INFO L256 TraceCheckUtils]: 52: Hoare triple {1711#false} call __VERIFIER_assert((if #t~mem1 == 46 then 1 else 0)); {1711#false} is VALID [2018-11-14 16:52:12,621 INFO L273 TraceCheckUtils]: 53: Hoare triple {1711#false} ~cond := #in~cond; {1711#false} is VALID [2018-11-14 16:52:12,621 INFO L273 TraceCheckUtils]: 54: Hoare triple {1711#false} assume ~cond == 0; {1711#false} is VALID [2018-11-14 16:52:12,622 INFO L273 TraceCheckUtils]: 55: Hoare triple {1711#false} assume !false; {1711#false} is VALID [2018-11-14 16:52:12,630 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-14 16:52:12,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:52:12,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-14 16:52:12,653 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2018-11-14 16:52:12,653 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:52:12,653 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 16:52:12,729 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:52:12,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 16:52:12,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 16:52:12,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 16:52:12,730 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 8 states. [2018-11-14 16:52:13,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:13,577 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2018-11-14 16:52:13,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 16:52:13,577 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2018-11-14 16:52:13,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:52:13,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 16:52:13,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2018-11-14 16:52:13,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 16:52:13,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2018-11-14 16:52:13,585 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 101 transitions. [2018-11-14 16:52:13,819 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:52:13,821 INFO L225 Difference]: With dead ends: 114 [2018-11-14 16:52:13,822 INFO L226 Difference]: Without dead ends: 69 [2018-11-14 16:52:13,823 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 16:52:13,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-14 16:52:13,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-11-14 16:52:13,858 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:52:13,858 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 69 states. [2018-11-14 16:52:13,859 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 69 states. [2018-11-14 16:52:13,859 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 69 states. [2018-11-14 16:52:13,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:13,862 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-14 16:52:13,862 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-14 16:52:13,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:13,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:13,863 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 69 states. [2018-11-14 16:52:13,863 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 69 states. [2018-11-14 16:52:13,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:13,866 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-14 16:52:13,866 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-14 16:52:13,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:13,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:13,867 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:52:13,867 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:52:13,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-14 16:52:13,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-11-14 16:52:13,870 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 56 [2018-11-14 16:52:13,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:52:13,870 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-11-14 16:52:13,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 16:52:13,870 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-14 16:52:13,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-14 16:52:13,872 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:52:13,872 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:52:13,872 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:52:13,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:52:13,873 INFO L82 PathProgramCache]: Analyzing trace with hash 884551805, now seen corresponding path program 5 times [2018-11-14 16:52:13,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:52:13,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:52:13,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:13,874 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:52:13,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:13,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:14,033 INFO L256 TraceCheckUtils]: 0: Hoare triple {2286#true} call ULTIMATE.init(); {2286#true} is VALID [2018-11-14 16:52:14,034 INFO L273 TraceCheckUtils]: 1: Hoare triple {2286#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2286#true} is VALID [2018-11-14 16:52:14,035 INFO L273 TraceCheckUtils]: 2: Hoare triple {2286#true} assume true; {2286#true} is VALID [2018-11-14 16:52:14,035 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2286#true} {2286#true} #92#return; {2286#true} is VALID [2018-11-14 16:52:14,035 INFO L256 TraceCheckUtils]: 4: Hoare triple {2286#true} call #t~ret2 := main(); {2286#true} is VALID [2018-11-14 16:52:14,038 INFO L273 TraceCheckUtils]: 5: Hoare triple {2286#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2288#(= main_~i~0 0)} is VALID [2018-11-14 16:52:14,038 INFO L273 TraceCheckUtils]: 6: Hoare triple {2288#(= main_~i~0 0)} assume true; {2288#(= main_~i~0 0)} is VALID [2018-11-14 16:52:14,040 INFO L273 TraceCheckUtils]: 7: Hoare triple {2288#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2289#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:14,040 INFO L273 TraceCheckUtils]: 8: Hoare triple {2289#(<= main_~i~0 1)} assume true; {2289#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:14,042 INFO L273 TraceCheckUtils]: 9: Hoare triple {2289#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2290#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:14,042 INFO L273 TraceCheckUtils]: 10: Hoare triple {2290#(<= main_~i~0 2)} assume true; {2290#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:14,045 INFO L273 TraceCheckUtils]: 11: Hoare triple {2290#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2291#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:14,045 INFO L273 TraceCheckUtils]: 12: Hoare triple {2291#(<= main_~i~0 3)} assume true; {2291#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:14,069 INFO L273 TraceCheckUtils]: 13: Hoare triple {2291#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2292#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:14,081 INFO L273 TraceCheckUtils]: 14: Hoare triple {2292#(<= main_~i~0 4)} assume true; {2292#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:14,082 INFO L273 TraceCheckUtils]: 15: Hoare triple {2292#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2293#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:14,087 INFO L273 TraceCheckUtils]: 16: Hoare triple {2293#(<= main_~i~0 5)} assume true; {2293#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:14,089 INFO L273 TraceCheckUtils]: 17: Hoare triple {2293#(<= main_~i~0 5)} assume !(~i~0 < 100000); {2287#false} is VALID [2018-11-14 16:52:14,089 INFO L273 TraceCheckUtils]: 18: Hoare triple {2287#false} ~i~0 := 0; {2287#false} is VALID [2018-11-14 16:52:14,089 INFO L273 TraceCheckUtils]: 19: Hoare triple {2287#false} assume true; {2287#false} is VALID [2018-11-14 16:52:14,089 INFO L273 TraceCheckUtils]: 20: Hoare triple {2287#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2287#false} is VALID [2018-11-14 16:52:14,089 INFO L273 TraceCheckUtils]: 21: Hoare triple {2287#false} assume true; {2287#false} is VALID [2018-11-14 16:52:14,090 INFO L273 TraceCheckUtils]: 22: Hoare triple {2287#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2287#false} is VALID [2018-11-14 16:52:14,090 INFO L273 TraceCheckUtils]: 23: Hoare triple {2287#false} assume true; {2287#false} is VALID [2018-11-14 16:52:14,090 INFO L273 TraceCheckUtils]: 24: Hoare triple {2287#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2287#false} is VALID [2018-11-14 16:52:14,090 INFO L273 TraceCheckUtils]: 25: Hoare triple {2287#false} assume true; {2287#false} is VALID [2018-11-14 16:52:14,090 INFO L273 TraceCheckUtils]: 26: Hoare triple {2287#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2287#false} is VALID [2018-11-14 16:52:14,090 INFO L273 TraceCheckUtils]: 27: Hoare triple {2287#false} assume true; {2287#false} is VALID [2018-11-14 16:52:14,091 INFO L273 TraceCheckUtils]: 28: Hoare triple {2287#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2287#false} is VALID [2018-11-14 16:52:14,091 INFO L273 TraceCheckUtils]: 29: Hoare triple {2287#false} assume true; {2287#false} is VALID [2018-11-14 16:52:14,091 INFO L273 TraceCheckUtils]: 30: Hoare triple {2287#false} assume !(~i~0 < 100000); {2287#false} is VALID [2018-11-14 16:52:14,091 INFO L273 TraceCheckUtils]: 31: Hoare triple {2287#false} ~i~0 := 0; {2287#false} is VALID [2018-11-14 16:52:14,091 INFO L273 TraceCheckUtils]: 32: Hoare triple {2287#false} assume true; {2287#false} is VALID [2018-11-14 16:52:14,091 INFO L273 TraceCheckUtils]: 33: Hoare triple {2287#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2287#false} is VALID [2018-11-14 16:52:14,092 INFO L273 TraceCheckUtils]: 34: Hoare triple {2287#false} assume true; {2287#false} is VALID [2018-11-14 16:52:14,092 INFO L273 TraceCheckUtils]: 35: Hoare triple {2287#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2287#false} is VALID [2018-11-14 16:52:14,092 INFO L273 TraceCheckUtils]: 36: Hoare triple {2287#false} assume true; {2287#false} is VALID [2018-11-14 16:52:14,092 INFO L273 TraceCheckUtils]: 37: Hoare triple {2287#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2287#false} is VALID [2018-11-14 16:52:14,092 INFO L273 TraceCheckUtils]: 38: Hoare triple {2287#false} assume true; {2287#false} is VALID [2018-11-14 16:52:14,092 INFO L273 TraceCheckUtils]: 39: Hoare triple {2287#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2287#false} is VALID [2018-11-14 16:52:14,093 INFO L273 TraceCheckUtils]: 40: Hoare triple {2287#false} assume true; {2287#false} is VALID [2018-11-14 16:52:14,093 INFO L273 TraceCheckUtils]: 41: Hoare triple {2287#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2287#false} is VALID [2018-11-14 16:52:14,093 INFO L273 TraceCheckUtils]: 42: Hoare triple {2287#false} assume true; {2287#false} is VALID [2018-11-14 16:52:14,093 INFO L273 TraceCheckUtils]: 43: Hoare triple {2287#false} assume !(~i~0 < 100000); {2287#false} is VALID [2018-11-14 16:52:14,093 INFO L273 TraceCheckUtils]: 44: Hoare triple {2287#false} ~i~0 := 0; {2287#false} is VALID [2018-11-14 16:52:14,093 INFO L273 TraceCheckUtils]: 45: Hoare triple {2287#false} assume true; {2287#false} is VALID [2018-11-14 16:52:14,094 INFO L273 TraceCheckUtils]: 46: Hoare triple {2287#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2287#false} is VALID [2018-11-14 16:52:14,094 INFO L273 TraceCheckUtils]: 47: Hoare triple {2287#false} assume true; {2287#false} is VALID [2018-11-14 16:52:14,094 INFO L273 TraceCheckUtils]: 48: Hoare triple {2287#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2287#false} is VALID [2018-11-14 16:52:14,094 INFO L273 TraceCheckUtils]: 49: Hoare triple {2287#false} assume true; {2287#false} is VALID [2018-11-14 16:52:14,094 INFO L273 TraceCheckUtils]: 50: Hoare triple {2287#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2287#false} is VALID [2018-11-14 16:52:14,094 INFO L273 TraceCheckUtils]: 51: Hoare triple {2287#false} assume true; {2287#false} is VALID [2018-11-14 16:52:14,095 INFO L273 TraceCheckUtils]: 52: Hoare triple {2287#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2287#false} is VALID [2018-11-14 16:52:14,095 INFO L273 TraceCheckUtils]: 53: Hoare triple {2287#false} assume true; {2287#false} is VALID [2018-11-14 16:52:14,095 INFO L273 TraceCheckUtils]: 54: Hoare triple {2287#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2287#false} is VALID [2018-11-14 16:52:14,095 INFO L273 TraceCheckUtils]: 55: Hoare triple {2287#false} assume true; {2287#false} is VALID [2018-11-14 16:52:14,095 INFO L273 TraceCheckUtils]: 56: Hoare triple {2287#false} assume !(~i~0 < 100000); {2287#false} is VALID [2018-11-14 16:52:14,095 INFO L273 TraceCheckUtils]: 57: Hoare triple {2287#false} havoc ~x~0;~x~0 := 0; {2287#false} is VALID [2018-11-14 16:52:14,096 INFO L273 TraceCheckUtils]: 58: Hoare triple {2287#false} assume true; {2287#false} is VALID [2018-11-14 16:52:14,096 INFO L273 TraceCheckUtils]: 59: Hoare triple {2287#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {2287#false} is VALID [2018-11-14 16:52:14,096 INFO L256 TraceCheckUtils]: 60: Hoare triple {2287#false} call __VERIFIER_assert((if #t~mem1 == 46 then 1 else 0)); {2287#false} is VALID [2018-11-14 16:52:14,096 INFO L273 TraceCheckUtils]: 61: Hoare triple {2287#false} ~cond := #in~cond; {2287#false} is VALID [2018-11-14 16:52:14,096 INFO L273 TraceCheckUtils]: 62: Hoare triple {2287#false} assume ~cond == 0; {2287#false} is VALID [2018-11-14 16:52:14,096 INFO L273 TraceCheckUtils]: 63: Hoare triple {2287#false} assume !false; {2287#false} is VALID [2018-11-14 16:52:14,100 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-11-14 16:52:14,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:52:14,101 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:52:14,109 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 16:52:15,731 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-14 16:52:15,731 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:52:15,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:15,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:52:15,923 INFO L256 TraceCheckUtils]: 0: Hoare triple {2286#true} call ULTIMATE.init(); {2286#true} is VALID [2018-11-14 16:52:15,923 INFO L273 TraceCheckUtils]: 1: Hoare triple {2286#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2286#true} is VALID [2018-11-14 16:52:15,924 INFO L273 TraceCheckUtils]: 2: Hoare triple {2286#true} assume true; {2286#true} is VALID [2018-11-14 16:52:15,924 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2286#true} {2286#true} #92#return; {2286#true} is VALID [2018-11-14 16:52:15,924 INFO L256 TraceCheckUtils]: 4: Hoare triple {2286#true} call #t~ret2 := main(); {2286#true} is VALID [2018-11-14 16:52:15,925 INFO L273 TraceCheckUtils]: 5: Hoare triple {2286#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2286#true} is VALID [2018-11-14 16:52:15,925 INFO L273 TraceCheckUtils]: 6: Hoare triple {2286#true} assume true; {2286#true} is VALID [2018-11-14 16:52:15,925 INFO L273 TraceCheckUtils]: 7: Hoare triple {2286#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2286#true} is VALID [2018-11-14 16:52:15,925 INFO L273 TraceCheckUtils]: 8: Hoare triple {2286#true} assume true; {2286#true} is VALID [2018-11-14 16:52:15,925 INFO L273 TraceCheckUtils]: 9: Hoare triple {2286#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2286#true} is VALID [2018-11-14 16:52:15,926 INFO L273 TraceCheckUtils]: 10: Hoare triple {2286#true} assume true; {2286#true} is VALID [2018-11-14 16:52:15,926 INFO L273 TraceCheckUtils]: 11: Hoare triple {2286#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2286#true} is VALID [2018-11-14 16:52:15,926 INFO L273 TraceCheckUtils]: 12: Hoare triple {2286#true} assume true; {2286#true} is VALID [2018-11-14 16:52:15,926 INFO L273 TraceCheckUtils]: 13: Hoare triple {2286#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2286#true} is VALID [2018-11-14 16:52:15,926 INFO L273 TraceCheckUtils]: 14: Hoare triple {2286#true} assume true; {2286#true} is VALID [2018-11-14 16:52:15,926 INFO L273 TraceCheckUtils]: 15: Hoare triple {2286#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2286#true} is VALID [2018-11-14 16:52:15,926 INFO L273 TraceCheckUtils]: 16: Hoare triple {2286#true} assume true; {2286#true} is VALID [2018-11-14 16:52:15,927 INFO L273 TraceCheckUtils]: 17: Hoare triple {2286#true} assume !(~i~0 < 100000); {2286#true} is VALID [2018-11-14 16:52:15,927 INFO L273 TraceCheckUtils]: 18: Hoare triple {2286#true} ~i~0 := 0; {2286#true} is VALID [2018-11-14 16:52:15,927 INFO L273 TraceCheckUtils]: 19: Hoare triple {2286#true} assume true; {2286#true} is VALID [2018-11-14 16:52:15,927 INFO L273 TraceCheckUtils]: 20: Hoare triple {2286#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2286#true} is VALID [2018-11-14 16:52:15,927 INFO L273 TraceCheckUtils]: 21: Hoare triple {2286#true} assume true; {2286#true} is VALID [2018-11-14 16:52:15,927 INFO L273 TraceCheckUtils]: 22: Hoare triple {2286#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2286#true} is VALID [2018-11-14 16:52:15,927 INFO L273 TraceCheckUtils]: 23: Hoare triple {2286#true} assume true; {2286#true} is VALID [2018-11-14 16:52:15,928 INFO L273 TraceCheckUtils]: 24: Hoare triple {2286#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2286#true} is VALID [2018-11-14 16:52:15,928 INFO L273 TraceCheckUtils]: 25: Hoare triple {2286#true} assume true; {2286#true} is VALID [2018-11-14 16:52:15,928 INFO L273 TraceCheckUtils]: 26: Hoare triple {2286#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2286#true} is VALID [2018-11-14 16:52:15,928 INFO L273 TraceCheckUtils]: 27: Hoare triple {2286#true} assume true; {2286#true} is VALID [2018-11-14 16:52:15,928 INFO L273 TraceCheckUtils]: 28: Hoare triple {2286#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2286#true} is VALID [2018-11-14 16:52:15,928 INFO L273 TraceCheckUtils]: 29: Hoare triple {2286#true} assume true; {2286#true} is VALID [2018-11-14 16:52:15,929 INFO L273 TraceCheckUtils]: 30: Hoare triple {2286#true} assume !(~i~0 < 100000); {2286#true} is VALID [2018-11-14 16:52:15,929 INFO L273 TraceCheckUtils]: 31: Hoare triple {2286#true} ~i~0 := 0; {2286#true} is VALID [2018-11-14 16:52:15,929 INFO L273 TraceCheckUtils]: 32: Hoare triple {2286#true} assume true; {2286#true} is VALID [2018-11-14 16:52:15,929 INFO L273 TraceCheckUtils]: 33: Hoare triple {2286#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2286#true} is VALID [2018-11-14 16:52:15,929 INFO L273 TraceCheckUtils]: 34: Hoare triple {2286#true} assume true; {2286#true} is VALID [2018-11-14 16:52:15,929 INFO L273 TraceCheckUtils]: 35: Hoare triple {2286#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2286#true} is VALID [2018-11-14 16:52:15,930 INFO L273 TraceCheckUtils]: 36: Hoare triple {2286#true} assume true; {2286#true} is VALID [2018-11-14 16:52:15,930 INFO L273 TraceCheckUtils]: 37: Hoare triple {2286#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2286#true} is VALID [2018-11-14 16:52:15,930 INFO L273 TraceCheckUtils]: 38: Hoare triple {2286#true} assume true; {2286#true} is VALID [2018-11-14 16:52:15,930 INFO L273 TraceCheckUtils]: 39: Hoare triple {2286#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2286#true} is VALID [2018-11-14 16:52:15,930 INFO L273 TraceCheckUtils]: 40: Hoare triple {2286#true} assume true; {2286#true} is VALID [2018-11-14 16:52:15,931 INFO L273 TraceCheckUtils]: 41: Hoare triple {2286#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2286#true} is VALID [2018-11-14 16:52:15,931 INFO L273 TraceCheckUtils]: 42: Hoare triple {2286#true} assume true; {2286#true} is VALID [2018-11-14 16:52:15,931 INFO L273 TraceCheckUtils]: 43: Hoare triple {2286#true} assume !(~i~0 < 100000); {2286#true} is VALID [2018-11-14 16:52:15,949 INFO L273 TraceCheckUtils]: 44: Hoare triple {2286#true} ~i~0 := 0; {2429#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:15,958 INFO L273 TraceCheckUtils]: 45: Hoare triple {2429#(<= main_~i~0 0)} assume true; {2429#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:15,972 INFO L273 TraceCheckUtils]: 46: Hoare triple {2429#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2289#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:15,981 INFO L273 TraceCheckUtils]: 47: Hoare triple {2289#(<= main_~i~0 1)} assume true; {2289#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:15,994 INFO L273 TraceCheckUtils]: 48: Hoare triple {2289#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2290#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:15,995 INFO L273 TraceCheckUtils]: 49: Hoare triple {2290#(<= main_~i~0 2)} assume true; {2290#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:15,996 INFO L273 TraceCheckUtils]: 50: Hoare triple {2290#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2291#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:15,999 INFO L273 TraceCheckUtils]: 51: Hoare triple {2291#(<= main_~i~0 3)} assume true; {2291#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:16,000 INFO L273 TraceCheckUtils]: 52: Hoare triple {2291#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2292#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:16,001 INFO L273 TraceCheckUtils]: 53: Hoare triple {2292#(<= main_~i~0 4)} assume true; {2292#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:16,002 INFO L273 TraceCheckUtils]: 54: Hoare triple {2292#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2293#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:16,002 INFO L273 TraceCheckUtils]: 55: Hoare triple {2293#(<= main_~i~0 5)} assume true; {2293#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:16,004 INFO L273 TraceCheckUtils]: 56: Hoare triple {2293#(<= main_~i~0 5)} assume !(~i~0 < 100000); {2287#false} is VALID [2018-11-14 16:52:16,004 INFO L273 TraceCheckUtils]: 57: Hoare triple {2287#false} havoc ~x~0;~x~0 := 0; {2287#false} is VALID [2018-11-14 16:52:16,004 INFO L273 TraceCheckUtils]: 58: Hoare triple {2287#false} assume true; {2287#false} is VALID [2018-11-14 16:52:16,004 INFO L273 TraceCheckUtils]: 59: Hoare triple {2287#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {2287#false} is VALID [2018-11-14 16:52:16,005 INFO L256 TraceCheckUtils]: 60: Hoare triple {2287#false} call __VERIFIER_assert((if #t~mem1 == 46 then 1 else 0)); {2287#false} is VALID [2018-11-14 16:52:16,005 INFO L273 TraceCheckUtils]: 61: Hoare triple {2287#false} ~cond := #in~cond; {2287#false} is VALID [2018-11-14 16:52:16,005 INFO L273 TraceCheckUtils]: 62: Hoare triple {2287#false} assume ~cond == 0; {2287#false} is VALID [2018-11-14 16:52:16,006 INFO L273 TraceCheckUtils]: 63: Hoare triple {2287#false} assume !false; {2287#false} is VALID [2018-11-14 16:52:16,008 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-11-14 16:52:16,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:52:16,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-14 16:52:16,031 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2018-11-14 16:52:16,032 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:52:16,032 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 16:52:16,142 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:52:16,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 16:52:16,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 16:52:16,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-14 16:52:16,143 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 9 states. [2018-11-14 16:52:16,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:16,638 INFO L93 Difference]: Finished difference Result 128 states and 139 transitions. [2018-11-14 16:52:16,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 16:52:16,638 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2018-11-14 16:52:16,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:52:16,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 16:52:16,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions. [2018-11-14 16:52:16,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 16:52:16,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions. [2018-11-14 16:52:16,644 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 109 transitions. [2018-11-14 16:52:16,782 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:52:16,784 INFO L225 Difference]: With dead ends: 128 [2018-11-14 16:52:16,784 INFO L226 Difference]: Without dead ends: 77 [2018-11-14 16:52:16,785 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-14 16:52:16,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-14 16:52:16,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-11-14 16:52:16,868 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:52:16,868 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand 77 states. [2018-11-14 16:52:16,868 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 77 states. [2018-11-14 16:52:16,868 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 77 states. [2018-11-14 16:52:16,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:16,872 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-11-14 16:52:16,872 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-11-14 16:52:16,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:16,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:16,872 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 77 states. [2018-11-14 16:52:16,873 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 77 states. [2018-11-14 16:52:16,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:16,875 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-11-14 16:52:16,875 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-11-14 16:52:16,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:16,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:16,876 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:52:16,876 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:52:16,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-14 16:52:16,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-11-14 16:52:16,879 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 64 [2018-11-14 16:52:16,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:52:16,879 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-11-14 16:52:16,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 16:52:16,879 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-11-14 16:52:16,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-14 16:52:16,881 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:52:16,882 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:52:16,882 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:52:16,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:52:16,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1829591555, now seen corresponding path program 6 times [2018-11-14 16:52:16,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:52:16,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:52:16,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:16,885 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:52:16,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:16,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:17,118 INFO L256 TraceCheckUtils]: 0: Hoare triple {2936#true} call ULTIMATE.init(); {2936#true} is VALID [2018-11-14 16:52:17,119 INFO L273 TraceCheckUtils]: 1: Hoare triple {2936#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2936#true} is VALID [2018-11-14 16:52:17,119 INFO L273 TraceCheckUtils]: 2: Hoare triple {2936#true} assume true; {2936#true} is VALID [2018-11-14 16:52:17,119 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2936#true} {2936#true} #92#return; {2936#true} is VALID [2018-11-14 16:52:17,119 INFO L256 TraceCheckUtils]: 4: Hoare triple {2936#true} call #t~ret2 := main(); {2936#true} is VALID [2018-11-14 16:52:17,120 INFO L273 TraceCheckUtils]: 5: Hoare triple {2936#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2938#(= main_~i~0 0)} is VALID [2018-11-14 16:52:17,120 INFO L273 TraceCheckUtils]: 6: Hoare triple {2938#(= main_~i~0 0)} assume true; {2938#(= main_~i~0 0)} is VALID [2018-11-14 16:52:17,121 INFO L273 TraceCheckUtils]: 7: Hoare triple {2938#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2939#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:17,121 INFO L273 TraceCheckUtils]: 8: Hoare triple {2939#(<= main_~i~0 1)} assume true; {2939#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:17,122 INFO L273 TraceCheckUtils]: 9: Hoare triple {2939#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2940#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:17,122 INFO L273 TraceCheckUtils]: 10: Hoare triple {2940#(<= main_~i~0 2)} assume true; {2940#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:17,123 INFO L273 TraceCheckUtils]: 11: Hoare triple {2940#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2941#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:17,123 INFO L273 TraceCheckUtils]: 12: Hoare triple {2941#(<= main_~i~0 3)} assume true; {2941#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:17,124 INFO L273 TraceCheckUtils]: 13: Hoare triple {2941#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2942#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:17,125 INFO L273 TraceCheckUtils]: 14: Hoare triple {2942#(<= main_~i~0 4)} assume true; {2942#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:17,126 INFO L273 TraceCheckUtils]: 15: Hoare triple {2942#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2943#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:17,127 INFO L273 TraceCheckUtils]: 16: Hoare triple {2943#(<= main_~i~0 5)} assume true; {2943#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:17,127 INFO L273 TraceCheckUtils]: 17: Hoare triple {2943#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2944#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:17,128 INFO L273 TraceCheckUtils]: 18: Hoare triple {2944#(<= main_~i~0 6)} assume true; {2944#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:17,129 INFO L273 TraceCheckUtils]: 19: Hoare triple {2944#(<= main_~i~0 6)} assume !(~i~0 < 100000); {2937#false} is VALID [2018-11-14 16:52:17,129 INFO L273 TraceCheckUtils]: 20: Hoare triple {2937#false} ~i~0 := 0; {2937#false} is VALID [2018-11-14 16:52:17,129 INFO L273 TraceCheckUtils]: 21: Hoare triple {2937#false} assume true; {2937#false} is VALID [2018-11-14 16:52:17,129 INFO L273 TraceCheckUtils]: 22: Hoare triple {2937#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2937#false} is VALID [2018-11-14 16:52:17,130 INFO L273 TraceCheckUtils]: 23: Hoare triple {2937#false} assume true; {2937#false} is VALID [2018-11-14 16:52:17,130 INFO L273 TraceCheckUtils]: 24: Hoare triple {2937#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2937#false} is VALID [2018-11-14 16:52:17,130 INFO L273 TraceCheckUtils]: 25: Hoare triple {2937#false} assume true; {2937#false} is VALID [2018-11-14 16:52:17,130 INFO L273 TraceCheckUtils]: 26: Hoare triple {2937#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2937#false} is VALID [2018-11-14 16:52:17,130 INFO L273 TraceCheckUtils]: 27: Hoare triple {2937#false} assume true; {2937#false} is VALID [2018-11-14 16:52:17,131 INFO L273 TraceCheckUtils]: 28: Hoare triple {2937#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2937#false} is VALID [2018-11-14 16:52:17,131 INFO L273 TraceCheckUtils]: 29: Hoare triple {2937#false} assume true; {2937#false} is VALID [2018-11-14 16:52:17,131 INFO L273 TraceCheckUtils]: 30: Hoare triple {2937#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2937#false} is VALID [2018-11-14 16:52:17,131 INFO L273 TraceCheckUtils]: 31: Hoare triple {2937#false} assume true; {2937#false} is VALID [2018-11-14 16:52:17,132 INFO L273 TraceCheckUtils]: 32: Hoare triple {2937#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2937#false} is VALID [2018-11-14 16:52:17,132 INFO L273 TraceCheckUtils]: 33: Hoare triple {2937#false} assume true; {2937#false} is VALID [2018-11-14 16:52:17,132 INFO L273 TraceCheckUtils]: 34: Hoare triple {2937#false} assume !(~i~0 < 100000); {2937#false} is VALID [2018-11-14 16:52:17,132 INFO L273 TraceCheckUtils]: 35: Hoare triple {2937#false} ~i~0 := 0; {2937#false} is VALID [2018-11-14 16:52:17,132 INFO L273 TraceCheckUtils]: 36: Hoare triple {2937#false} assume true; {2937#false} is VALID [2018-11-14 16:52:17,133 INFO L273 TraceCheckUtils]: 37: Hoare triple {2937#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2937#false} is VALID [2018-11-14 16:52:17,133 INFO L273 TraceCheckUtils]: 38: Hoare triple {2937#false} assume true; {2937#false} is VALID [2018-11-14 16:52:17,133 INFO L273 TraceCheckUtils]: 39: Hoare triple {2937#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2937#false} is VALID [2018-11-14 16:52:17,133 INFO L273 TraceCheckUtils]: 40: Hoare triple {2937#false} assume true; {2937#false} is VALID [2018-11-14 16:52:17,133 INFO L273 TraceCheckUtils]: 41: Hoare triple {2937#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2937#false} is VALID [2018-11-14 16:52:17,133 INFO L273 TraceCheckUtils]: 42: Hoare triple {2937#false} assume true; {2937#false} is VALID [2018-11-14 16:52:17,134 INFO L273 TraceCheckUtils]: 43: Hoare triple {2937#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2937#false} is VALID [2018-11-14 16:52:17,134 INFO L273 TraceCheckUtils]: 44: Hoare triple {2937#false} assume true; {2937#false} is VALID [2018-11-14 16:52:17,134 INFO L273 TraceCheckUtils]: 45: Hoare triple {2937#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2937#false} is VALID [2018-11-14 16:52:17,134 INFO L273 TraceCheckUtils]: 46: Hoare triple {2937#false} assume true; {2937#false} is VALID [2018-11-14 16:52:17,134 INFO L273 TraceCheckUtils]: 47: Hoare triple {2937#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2937#false} is VALID [2018-11-14 16:52:17,134 INFO L273 TraceCheckUtils]: 48: Hoare triple {2937#false} assume true; {2937#false} is VALID [2018-11-14 16:52:17,134 INFO L273 TraceCheckUtils]: 49: Hoare triple {2937#false} assume !(~i~0 < 100000); {2937#false} is VALID [2018-11-14 16:52:17,134 INFO L273 TraceCheckUtils]: 50: Hoare triple {2937#false} ~i~0 := 0; {2937#false} is VALID [2018-11-14 16:52:17,135 INFO L273 TraceCheckUtils]: 51: Hoare triple {2937#false} assume true; {2937#false} is VALID [2018-11-14 16:52:17,135 INFO L273 TraceCheckUtils]: 52: Hoare triple {2937#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2937#false} is VALID [2018-11-14 16:52:17,135 INFO L273 TraceCheckUtils]: 53: Hoare triple {2937#false} assume true; {2937#false} is VALID [2018-11-14 16:52:17,135 INFO L273 TraceCheckUtils]: 54: Hoare triple {2937#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2937#false} is VALID [2018-11-14 16:52:17,135 INFO L273 TraceCheckUtils]: 55: Hoare triple {2937#false} assume true; {2937#false} is VALID [2018-11-14 16:52:17,135 INFO L273 TraceCheckUtils]: 56: Hoare triple {2937#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2937#false} is VALID [2018-11-14 16:52:17,135 INFO L273 TraceCheckUtils]: 57: Hoare triple {2937#false} assume true; {2937#false} is VALID [2018-11-14 16:52:17,135 INFO L273 TraceCheckUtils]: 58: Hoare triple {2937#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2937#false} is VALID [2018-11-14 16:52:17,136 INFO L273 TraceCheckUtils]: 59: Hoare triple {2937#false} assume true; {2937#false} is VALID [2018-11-14 16:52:17,136 INFO L273 TraceCheckUtils]: 60: Hoare triple {2937#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2937#false} is VALID [2018-11-14 16:52:17,136 INFO L273 TraceCheckUtils]: 61: Hoare triple {2937#false} assume true; {2937#false} is VALID [2018-11-14 16:52:17,136 INFO L273 TraceCheckUtils]: 62: Hoare triple {2937#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2937#false} is VALID [2018-11-14 16:52:17,136 INFO L273 TraceCheckUtils]: 63: Hoare triple {2937#false} assume true; {2937#false} is VALID [2018-11-14 16:52:17,136 INFO L273 TraceCheckUtils]: 64: Hoare triple {2937#false} assume !(~i~0 < 100000); {2937#false} is VALID [2018-11-14 16:52:17,136 INFO L273 TraceCheckUtils]: 65: Hoare triple {2937#false} havoc ~x~0;~x~0 := 0; {2937#false} is VALID [2018-11-14 16:52:17,136 INFO L273 TraceCheckUtils]: 66: Hoare triple {2937#false} assume true; {2937#false} is VALID [2018-11-14 16:52:17,137 INFO L273 TraceCheckUtils]: 67: Hoare triple {2937#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {2937#false} is VALID [2018-11-14 16:52:17,137 INFO L256 TraceCheckUtils]: 68: Hoare triple {2937#false} call __VERIFIER_assert((if #t~mem1 == 46 then 1 else 0)); {2937#false} is VALID [2018-11-14 16:52:17,137 INFO L273 TraceCheckUtils]: 69: Hoare triple {2937#false} ~cond := #in~cond; {2937#false} is VALID [2018-11-14 16:52:17,137 INFO L273 TraceCheckUtils]: 70: Hoare triple {2937#false} assume ~cond == 0; {2937#false} is VALID [2018-11-14 16:52:17,137 INFO L273 TraceCheckUtils]: 71: Hoare triple {2937#false} assume !false; {2937#false} is VALID [2018-11-14 16:52:17,139 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-14 16:52:17,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:52:17,140 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:52:17,150 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 16:52:17,525 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-14 16:52:17,526 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:52:17,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:17,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:52:17,691 INFO L256 TraceCheckUtils]: 0: Hoare triple {2936#true} call ULTIMATE.init(); {2936#true} is VALID [2018-11-14 16:52:17,691 INFO L273 TraceCheckUtils]: 1: Hoare triple {2936#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2936#true} is VALID [2018-11-14 16:52:17,692 INFO L273 TraceCheckUtils]: 2: Hoare triple {2936#true} assume true; {2936#true} is VALID [2018-11-14 16:52:17,692 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2936#true} {2936#true} #92#return; {2936#true} is VALID [2018-11-14 16:52:17,692 INFO L256 TraceCheckUtils]: 4: Hoare triple {2936#true} call #t~ret2 := main(); {2936#true} is VALID [2018-11-14 16:52:17,692 INFO L273 TraceCheckUtils]: 5: Hoare triple {2936#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2936#true} is VALID [2018-11-14 16:52:17,692 INFO L273 TraceCheckUtils]: 6: Hoare triple {2936#true} assume true; {2936#true} is VALID [2018-11-14 16:52:17,693 INFO L273 TraceCheckUtils]: 7: Hoare triple {2936#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2936#true} is VALID [2018-11-14 16:52:17,693 INFO L273 TraceCheckUtils]: 8: Hoare triple {2936#true} assume true; {2936#true} is VALID [2018-11-14 16:52:17,693 INFO L273 TraceCheckUtils]: 9: Hoare triple {2936#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2936#true} is VALID [2018-11-14 16:52:17,693 INFO L273 TraceCheckUtils]: 10: Hoare triple {2936#true} assume true; {2936#true} is VALID [2018-11-14 16:52:17,694 INFO L273 TraceCheckUtils]: 11: Hoare triple {2936#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2936#true} is VALID [2018-11-14 16:52:17,694 INFO L273 TraceCheckUtils]: 12: Hoare triple {2936#true} assume true; {2936#true} is VALID [2018-11-14 16:52:17,694 INFO L273 TraceCheckUtils]: 13: Hoare triple {2936#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2936#true} is VALID [2018-11-14 16:52:17,694 INFO L273 TraceCheckUtils]: 14: Hoare triple {2936#true} assume true; {2936#true} is VALID [2018-11-14 16:52:17,694 INFO L273 TraceCheckUtils]: 15: Hoare triple {2936#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2936#true} is VALID [2018-11-14 16:52:17,694 INFO L273 TraceCheckUtils]: 16: Hoare triple {2936#true} assume true; {2936#true} is VALID [2018-11-14 16:52:17,694 INFO L273 TraceCheckUtils]: 17: Hoare triple {2936#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2936#true} is VALID [2018-11-14 16:52:17,695 INFO L273 TraceCheckUtils]: 18: Hoare triple {2936#true} assume true; {2936#true} is VALID [2018-11-14 16:52:17,695 INFO L273 TraceCheckUtils]: 19: Hoare triple {2936#true} assume !(~i~0 < 100000); {2936#true} is VALID [2018-11-14 16:52:17,695 INFO L273 TraceCheckUtils]: 20: Hoare triple {2936#true} ~i~0 := 0; {2936#true} is VALID [2018-11-14 16:52:17,695 INFO L273 TraceCheckUtils]: 21: Hoare triple {2936#true} assume true; {2936#true} is VALID [2018-11-14 16:52:17,695 INFO L273 TraceCheckUtils]: 22: Hoare triple {2936#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2936#true} is VALID [2018-11-14 16:52:17,695 INFO L273 TraceCheckUtils]: 23: Hoare triple {2936#true} assume true; {2936#true} is VALID [2018-11-14 16:52:17,695 INFO L273 TraceCheckUtils]: 24: Hoare triple {2936#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2936#true} is VALID [2018-11-14 16:52:17,696 INFO L273 TraceCheckUtils]: 25: Hoare triple {2936#true} assume true; {2936#true} is VALID [2018-11-14 16:52:17,696 INFO L273 TraceCheckUtils]: 26: Hoare triple {2936#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2936#true} is VALID [2018-11-14 16:52:17,696 INFO L273 TraceCheckUtils]: 27: Hoare triple {2936#true} assume true; {2936#true} is VALID [2018-11-14 16:52:17,696 INFO L273 TraceCheckUtils]: 28: Hoare triple {2936#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2936#true} is VALID [2018-11-14 16:52:17,696 INFO L273 TraceCheckUtils]: 29: Hoare triple {2936#true} assume true; {2936#true} is VALID [2018-11-14 16:52:17,696 INFO L273 TraceCheckUtils]: 30: Hoare triple {2936#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2936#true} is VALID [2018-11-14 16:52:17,696 INFO L273 TraceCheckUtils]: 31: Hoare triple {2936#true} assume true; {2936#true} is VALID [2018-11-14 16:52:17,696 INFO L273 TraceCheckUtils]: 32: Hoare triple {2936#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2936#true} is VALID [2018-11-14 16:52:17,697 INFO L273 TraceCheckUtils]: 33: Hoare triple {2936#true} assume true; {2936#true} is VALID [2018-11-14 16:52:17,697 INFO L273 TraceCheckUtils]: 34: Hoare triple {2936#true} assume !(~i~0 < 100000); {2936#true} is VALID [2018-11-14 16:52:17,697 INFO L273 TraceCheckUtils]: 35: Hoare triple {2936#true} ~i~0 := 0; {2936#true} is VALID [2018-11-14 16:52:17,697 INFO L273 TraceCheckUtils]: 36: Hoare triple {2936#true} assume true; {2936#true} is VALID [2018-11-14 16:52:17,697 INFO L273 TraceCheckUtils]: 37: Hoare triple {2936#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2936#true} is VALID [2018-11-14 16:52:17,697 INFO L273 TraceCheckUtils]: 38: Hoare triple {2936#true} assume true; {2936#true} is VALID [2018-11-14 16:52:17,697 INFO L273 TraceCheckUtils]: 39: Hoare triple {2936#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2936#true} is VALID [2018-11-14 16:52:17,697 INFO L273 TraceCheckUtils]: 40: Hoare triple {2936#true} assume true; {2936#true} is VALID [2018-11-14 16:52:17,698 INFO L273 TraceCheckUtils]: 41: Hoare triple {2936#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2936#true} is VALID [2018-11-14 16:52:17,698 INFO L273 TraceCheckUtils]: 42: Hoare triple {2936#true} assume true; {2936#true} is VALID [2018-11-14 16:52:17,698 INFO L273 TraceCheckUtils]: 43: Hoare triple {2936#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2936#true} is VALID [2018-11-14 16:52:17,698 INFO L273 TraceCheckUtils]: 44: Hoare triple {2936#true} assume true; {2936#true} is VALID [2018-11-14 16:52:17,698 INFO L273 TraceCheckUtils]: 45: Hoare triple {2936#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2936#true} is VALID [2018-11-14 16:52:17,698 INFO L273 TraceCheckUtils]: 46: Hoare triple {2936#true} assume true; {2936#true} is VALID [2018-11-14 16:52:17,698 INFO L273 TraceCheckUtils]: 47: Hoare triple {2936#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2936#true} is VALID [2018-11-14 16:52:17,698 INFO L273 TraceCheckUtils]: 48: Hoare triple {2936#true} assume true; {2936#true} is VALID [2018-11-14 16:52:17,699 INFO L273 TraceCheckUtils]: 49: Hoare triple {2936#true} assume !(~i~0 < 100000); {2936#true} is VALID [2018-11-14 16:52:17,699 INFO L273 TraceCheckUtils]: 50: Hoare triple {2936#true} ~i~0 := 0; {3098#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:17,699 INFO L273 TraceCheckUtils]: 51: Hoare triple {3098#(<= main_~i~0 0)} assume true; {3098#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:17,700 INFO L273 TraceCheckUtils]: 52: Hoare triple {3098#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2939#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:17,701 INFO L273 TraceCheckUtils]: 53: Hoare triple {2939#(<= main_~i~0 1)} assume true; {2939#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:17,701 INFO L273 TraceCheckUtils]: 54: Hoare triple {2939#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2940#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:17,701 INFO L273 TraceCheckUtils]: 55: Hoare triple {2940#(<= main_~i~0 2)} assume true; {2940#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:17,702 INFO L273 TraceCheckUtils]: 56: Hoare triple {2940#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2941#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:17,703 INFO L273 TraceCheckUtils]: 57: Hoare triple {2941#(<= main_~i~0 3)} assume true; {2941#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:17,704 INFO L273 TraceCheckUtils]: 58: Hoare triple {2941#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2942#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:17,704 INFO L273 TraceCheckUtils]: 59: Hoare triple {2942#(<= main_~i~0 4)} assume true; {2942#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:17,705 INFO L273 TraceCheckUtils]: 60: Hoare triple {2942#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2943#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:17,706 INFO L273 TraceCheckUtils]: 61: Hoare triple {2943#(<= main_~i~0 5)} assume true; {2943#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:17,707 INFO L273 TraceCheckUtils]: 62: Hoare triple {2943#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2944#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:17,707 INFO L273 TraceCheckUtils]: 63: Hoare triple {2944#(<= main_~i~0 6)} assume true; {2944#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:17,708 INFO L273 TraceCheckUtils]: 64: Hoare triple {2944#(<= main_~i~0 6)} assume !(~i~0 < 100000); {2937#false} is VALID [2018-11-14 16:52:17,708 INFO L273 TraceCheckUtils]: 65: Hoare triple {2937#false} havoc ~x~0;~x~0 := 0; {2937#false} is VALID [2018-11-14 16:52:17,709 INFO L273 TraceCheckUtils]: 66: Hoare triple {2937#false} assume true; {2937#false} is VALID [2018-11-14 16:52:17,709 INFO L273 TraceCheckUtils]: 67: Hoare triple {2937#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {2937#false} is VALID [2018-11-14 16:52:17,709 INFO L256 TraceCheckUtils]: 68: Hoare triple {2937#false} call __VERIFIER_assert((if #t~mem1 == 46 then 1 else 0)); {2937#false} is VALID [2018-11-14 16:52:17,709 INFO L273 TraceCheckUtils]: 69: Hoare triple {2937#false} ~cond := #in~cond; {2937#false} is VALID [2018-11-14 16:52:17,710 INFO L273 TraceCheckUtils]: 70: Hoare triple {2937#false} assume ~cond == 0; {2937#false} is VALID [2018-11-14 16:52:17,710 INFO L273 TraceCheckUtils]: 71: Hoare triple {2937#false} assume !false; {2937#false} is VALID [2018-11-14 16:52:17,715 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-14 16:52:17,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:52:17,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-14 16:52:17,742 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 72 [2018-11-14 16:52:17,742 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:52:17,742 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 16:52:17,806 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:52:17,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 16:52:17,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 16:52:17,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-14 16:52:17,807 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 10 states. [2018-11-14 16:52:18,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:18,239 INFO L93 Difference]: Finished difference Result 142 states and 153 transitions. [2018-11-14 16:52:18,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 16:52:18,239 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 72 [2018-11-14 16:52:18,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:52:18,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 16:52:18,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2018-11-14 16:52:18,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 16:52:18,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2018-11-14 16:52:18,244 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 117 transitions. [2018-11-14 16:52:18,417 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:52:18,418 INFO L225 Difference]: With dead ends: 142 [2018-11-14 16:52:18,419 INFO L226 Difference]: Without dead ends: 85 [2018-11-14 16:52:18,419 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-14 16:52:18,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-14 16:52:18,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-11-14 16:52:18,558 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:52:18,558 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand 85 states. [2018-11-14 16:52:18,558 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 85 states. [2018-11-14 16:52:18,558 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 85 states. [2018-11-14 16:52:18,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:18,561 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2018-11-14 16:52:18,561 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-11-14 16:52:18,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:18,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:18,562 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 85 states. [2018-11-14 16:52:18,562 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 85 states. [2018-11-14 16:52:18,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:18,565 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2018-11-14 16:52:18,565 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-11-14 16:52:18,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:18,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:18,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:52:18,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:52:18,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-14 16:52:18,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2018-11-14 16:52:18,569 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 72 [2018-11-14 16:52:18,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:52:18,569 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2018-11-14 16:52:18,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 16:52:18,569 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-11-14 16:52:18,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-14 16:52:18,570 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:52:18,570 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:52:18,571 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:52:18,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:52:18,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1166570877, now seen corresponding path program 7 times [2018-11-14 16:52:18,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:52:18,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:52:18,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:18,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:52:18,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:18,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:18,797 INFO L256 TraceCheckUtils]: 0: Hoare triple {3660#true} call ULTIMATE.init(); {3660#true} is VALID [2018-11-14 16:52:18,798 INFO L273 TraceCheckUtils]: 1: Hoare triple {3660#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3660#true} is VALID [2018-11-14 16:52:18,798 INFO L273 TraceCheckUtils]: 2: Hoare triple {3660#true} assume true; {3660#true} is VALID [2018-11-14 16:52:18,798 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3660#true} {3660#true} #92#return; {3660#true} is VALID [2018-11-14 16:52:18,798 INFO L256 TraceCheckUtils]: 4: Hoare triple {3660#true} call #t~ret2 := main(); {3660#true} is VALID [2018-11-14 16:52:18,799 INFO L273 TraceCheckUtils]: 5: Hoare triple {3660#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3662#(= main_~i~0 0)} is VALID [2018-11-14 16:52:18,799 INFO L273 TraceCheckUtils]: 6: Hoare triple {3662#(= main_~i~0 0)} assume true; {3662#(= main_~i~0 0)} is VALID [2018-11-14 16:52:18,800 INFO L273 TraceCheckUtils]: 7: Hoare triple {3662#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3663#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:18,801 INFO L273 TraceCheckUtils]: 8: Hoare triple {3663#(<= main_~i~0 1)} assume true; {3663#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:18,802 INFO L273 TraceCheckUtils]: 9: Hoare triple {3663#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3664#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:18,802 INFO L273 TraceCheckUtils]: 10: Hoare triple {3664#(<= main_~i~0 2)} assume true; {3664#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:18,803 INFO L273 TraceCheckUtils]: 11: Hoare triple {3664#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3665#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:18,804 INFO L273 TraceCheckUtils]: 12: Hoare triple {3665#(<= main_~i~0 3)} assume true; {3665#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:18,805 INFO L273 TraceCheckUtils]: 13: Hoare triple {3665#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3666#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:18,805 INFO L273 TraceCheckUtils]: 14: Hoare triple {3666#(<= main_~i~0 4)} assume true; {3666#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:18,806 INFO L273 TraceCheckUtils]: 15: Hoare triple {3666#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3667#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:18,807 INFO L273 TraceCheckUtils]: 16: Hoare triple {3667#(<= main_~i~0 5)} assume true; {3667#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:18,808 INFO L273 TraceCheckUtils]: 17: Hoare triple {3667#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3668#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:18,808 INFO L273 TraceCheckUtils]: 18: Hoare triple {3668#(<= main_~i~0 6)} assume true; {3668#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:18,809 INFO L273 TraceCheckUtils]: 19: Hoare triple {3668#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3669#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:18,810 INFO L273 TraceCheckUtils]: 20: Hoare triple {3669#(<= main_~i~0 7)} assume true; {3669#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:18,811 INFO L273 TraceCheckUtils]: 21: Hoare triple {3669#(<= main_~i~0 7)} assume !(~i~0 < 100000); {3661#false} is VALID [2018-11-14 16:52:18,811 INFO L273 TraceCheckUtils]: 22: Hoare triple {3661#false} ~i~0 := 0; {3661#false} is VALID [2018-11-14 16:52:18,811 INFO L273 TraceCheckUtils]: 23: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-14 16:52:18,811 INFO L273 TraceCheckUtils]: 24: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3661#false} is VALID [2018-11-14 16:52:18,812 INFO L273 TraceCheckUtils]: 25: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-14 16:52:18,812 INFO L273 TraceCheckUtils]: 26: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3661#false} is VALID [2018-11-14 16:52:18,812 INFO L273 TraceCheckUtils]: 27: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-14 16:52:18,812 INFO L273 TraceCheckUtils]: 28: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3661#false} is VALID [2018-11-14 16:52:18,812 INFO L273 TraceCheckUtils]: 29: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-14 16:52:18,812 INFO L273 TraceCheckUtils]: 30: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3661#false} is VALID [2018-11-14 16:52:18,813 INFO L273 TraceCheckUtils]: 31: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-14 16:52:18,813 INFO L273 TraceCheckUtils]: 32: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3661#false} is VALID [2018-11-14 16:52:18,813 INFO L273 TraceCheckUtils]: 33: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-14 16:52:18,813 INFO L273 TraceCheckUtils]: 34: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3661#false} is VALID [2018-11-14 16:52:18,813 INFO L273 TraceCheckUtils]: 35: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-14 16:52:18,813 INFO L273 TraceCheckUtils]: 36: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3661#false} is VALID [2018-11-14 16:52:18,813 INFO L273 TraceCheckUtils]: 37: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-14 16:52:18,813 INFO L273 TraceCheckUtils]: 38: Hoare triple {3661#false} assume !(~i~0 < 100000); {3661#false} is VALID [2018-11-14 16:52:18,814 INFO L273 TraceCheckUtils]: 39: Hoare triple {3661#false} ~i~0 := 0; {3661#false} is VALID [2018-11-14 16:52:18,814 INFO L273 TraceCheckUtils]: 40: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-14 16:52:18,814 INFO L273 TraceCheckUtils]: 41: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3661#false} is VALID [2018-11-14 16:52:18,814 INFO L273 TraceCheckUtils]: 42: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-14 16:52:18,814 INFO L273 TraceCheckUtils]: 43: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3661#false} is VALID [2018-11-14 16:52:18,814 INFO L273 TraceCheckUtils]: 44: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-14 16:52:18,814 INFO L273 TraceCheckUtils]: 45: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3661#false} is VALID [2018-11-14 16:52:18,814 INFO L273 TraceCheckUtils]: 46: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-14 16:52:18,815 INFO L273 TraceCheckUtils]: 47: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3661#false} is VALID [2018-11-14 16:52:18,815 INFO L273 TraceCheckUtils]: 48: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-14 16:52:18,815 INFO L273 TraceCheckUtils]: 49: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3661#false} is VALID [2018-11-14 16:52:18,815 INFO L273 TraceCheckUtils]: 50: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-14 16:52:18,815 INFO L273 TraceCheckUtils]: 51: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3661#false} is VALID [2018-11-14 16:52:18,815 INFO L273 TraceCheckUtils]: 52: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-14 16:52:18,815 INFO L273 TraceCheckUtils]: 53: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3661#false} is VALID [2018-11-14 16:52:18,815 INFO L273 TraceCheckUtils]: 54: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-14 16:52:18,816 INFO L273 TraceCheckUtils]: 55: Hoare triple {3661#false} assume !(~i~0 < 100000); {3661#false} is VALID [2018-11-14 16:52:18,816 INFO L273 TraceCheckUtils]: 56: Hoare triple {3661#false} ~i~0 := 0; {3661#false} is VALID [2018-11-14 16:52:18,816 INFO L273 TraceCheckUtils]: 57: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-14 16:52:18,816 INFO L273 TraceCheckUtils]: 58: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3661#false} is VALID [2018-11-14 16:52:18,816 INFO L273 TraceCheckUtils]: 59: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-14 16:52:18,816 INFO L273 TraceCheckUtils]: 60: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3661#false} is VALID [2018-11-14 16:52:18,816 INFO L273 TraceCheckUtils]: 61: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-14 16:52:18,816 INFO L273 TraceCheckUtils]: 62: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3661#false} is VALID [2018-11-14 16:52:18,817 INFO L273 TraceCheckUtils]: 63: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-14 16:52:18,817 INFO L273 TraceCheckUtils]: 64: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3661#false} is VALID [2018-11-14 16:52:18,817 INFO L273 TraceCheckUtils]: 65: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-14 16:52:18,817 INFO L273 TraceCheckUtils]: 66: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3661#false} is VALID [2018-11-14 16:52:18,817 INFO L273 TraceCheckUtils]: 67: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-14 16:52:18,817 INFO L273 TraceCheckUtils]: 68: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3661#false} is VALID [2018-11-14 16:52:18,817 INFO L273 TraceCheckUtils]: 69: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-14 16:52:18,817 INFO L273 TraceCheckUtils]: 70: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3661#false} is VALID [2018-11-14 16:52:18,817 INFO L273 TraceCheckUtils]: 71: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-14 16:52:18,818 INFO L273 TraceCheckUtils]: 72: Hoare triple {3661#false} assume !(~i~0 < 100000); {3661#false} is VALID [2018-11-14 16:52:18,818 INFO L273 TraceCheckUtils]: 73: Hoare triple {3661#false} havoc ~x~0;~x~0 := 0; {3661#false} is VALID [2018-11-14 16:52:18,818 INFO L273 TraceCheckUtils]: 74: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-14 16:52:18,818 INFO L273 TraceCheckUtils]: 75: Hoare triple {3661#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {3661#false} is VALID [2018-11-14 16:52:18,818 INFO L256 TraceCheckUtils]: 76: Hoare triple {3661#false} call __VERIFIER_assert((if #t~mem1 == 46 then 1 else 0)); {3661#false} is VALID [2018-11-14 16:52:18,818 INFO L273 TraceCheckUtils]: 77: Hoare triple {3661#false} ~cond := #in~cond; {3661#false} is VALID [2018-11-14 16:52:18,818 INFO L273 TraceCheckUtils]: 78: Hoare triple {3661#false} assume ~cond == 0; {3661#false} is VALID [2018-11-14 16:52:18,818 INFO L273 TraceCheckUtils]: 79: Hoare triple {3661#false} assume !false; {3661#false} is VALID [2018-11-14 16:52:18,821 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-11-14 16:52:18,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:52:18,822 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:52:18,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:52:18,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:18,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:18,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:52:19,087 INFO L256 TraceCheckUtils]: 0: Hoare triple {3660#true} call ULTIMATE.init(); {3660#true} is VALID [2018-11-14 16:52:19,087 INFO L273 TraceCheckUtils]: 1: Hoare triple {3660#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3660#true} is VALID [2018-11-14 16:52:19,087 INFO L273 TraceCheckUtils]: 2: Hoare triple {3660#true} assume true; {3660#true} is VALID [2018-11-14 16:52:19,087 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3660#true} {3660#true} #92#return; {3660#true} is VALID [2018-11-14 16:52:19,087 INFO L256 TraceCheckUtils]: 4: Hoare triple {3660#true} call #t~ret2 := main(); {3660#true} is VALID [2018-11-14 16:52:19,088 INFO L273 TraceCheckUtils]: 5: Hoare triple {3660#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3688#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:19,088 INFO L273 TraceCheckUtils]: 6: Hoare triple {3688#(<= main_~i~0 0)} assume true; {3688#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:19,089 INFO L273 TraceCheckUtils]: 7: Hoare triple {3688#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3663#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:19,089 INFO L273 TraceCheckUtils]: 8: Hoare triple {3663#(<= main_~i~0 1)} assume true; {3663#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:19,090 INFO L273 TraceCheckUtils]: 9: Hoare triple {3663#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3664#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:19,090 INFO L273 TraceCheckUtils]: 10: Hoare triple {3664#(<= main_~i~0 2)} assume true; {3664#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:19,091 INFO L273 TraceCheckUtils]: 11: Hoare triple {3664#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3665#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:19,091 INFO L273 TraceCheckUtils]: 12: Hoare triple {3665#(<= main_~i~0 3)} assume true; {3665#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:19,092 INFO L273 TraceCheckUtils]: 13: Hoare triple {3665#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3666#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:19,092 INFO L273 TraceCheckUtils]: 14: Hoare triple {3666#(<= main_~i~0 4)} assume true; {3666#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:19,093 INFO L273 TraceCheckUtils]: 15: Hoare triple {3666#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3667#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:19,094 INFO L273 TraceCheckUtils]: 16: Hoare triple {3667#(<= main_~i~0 5)} assume true; {3667#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:19,095 INFO L273 TraceCheckUtils]: 17: Hoare triple {3667#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3668#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:19,096 INFO L273 TraceCheckUtils]: 18: Hoare triple {3668#(<= main_~i~0 6)} assume true; {3668#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:19,097 INFO L273 TraceCheckUtils]: 19: Hoare triple {3668#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3669#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:19,097 INFO L273 TraceCheckUtils]: 20: Hoare triple {3669#(<= main_~i~0 7)} assume true; {3669#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:19,098 INFO L273 TraceCheckUtils]: 21: Hoare triple {3669#(<= main_~i~0 7)} assume !(~i~0 < 100000); {3661#false} is VALID [2018-11-14 16:52:19,098 INFO L273 TraceCheckUtils]: 22: Hoare triple {3661#false} ~i~0 := 0; {3661#false} is VALID [2018-11-14 16:52:19,099 INFO L273 TraceCheckUtils]: 23: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-14 16:52:19,099 INFO L273 TraceCheckUtils]: 24: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3661#false} is VALID [2018-11-14 16:52:19,099 INFO L273 TraceCheckUtils]: 25: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-14 16:52:19,099 INFO L273 TraceCheckUtils]: 26: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3661#false} is VALID [2018-11-14 16:52:19,100 INFO L273 TraceCheckUtils]: 27: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-14 16:52:19,100 INFO L273 TraceCheckUtils]: 28: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3661#false} is VALID [2018-11-14 16:52:19,100 INFO L273 TraceCheckUtils]: 29: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-14 16:52:19,101 INFO L273 TraceCheckUtils]: 30: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3661#false} is VALID [2018-11-14 16:52:19,101 INFO L273 TraceCheckUtils]: 31: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-14 16:52:19,101 INFO L273 TraceCheckUtils]: 32: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3661#false} is VALID [2018-11-14 16:52:19,101 INFO L273 TraceCheckUtils]: 33: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-14 16:52:19,102 INFO L273 TraceCheckUtils]: 34: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3661#false} is VALID [2018-11-14 16:52:19,102 INFO L273 TraceCheckUtils]: 35: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-14 16:52:19,102 INFO L273 TraceCheckUtils]: 36: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3661#false} is VALID [2018-11-14 16:52:19,102 INFO L273 TraceCheckUtils]: 37: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-14 16:52:19,102 INFO L273 TraceCheckUtils]: 38: Hoare triple {3661#false} assume !(~i~0 < 100000); {3661#false} is VALID [2018-11-14 16:52:19,103 INFO L273 TraceCheckUtils]: 39: Hoare triple {3661#false} ~i~0 := 0; {3661#false} is VALID [2018-11-14 16:52:19,103 INFO L273 TraceCheckUtils]: 40: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-14 16:52:19,103 INFO L273 TraceCheckUtils]: 41: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3661#false} is VALID [2018-11-14 16:52:19,103 INFO L273 TraceCheckUtils]: 42: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-14 16:52:19,104 INFO L273 TraceCheckUtils]: 43: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3661#false} is VALID [2018-11-14 16:52:19,104 INFO L273 TraceCheckUtils]: 44: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-14 16:52:19,104 INFO L273 TraceCheckUtils]: 45: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3661#false} is VALID [2018-11-14 16:52:19,104 INFO L273 TraceCheckUtils]: 46: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-14 16:52:19,104 INFO L273 TraceCheckUtils]: 47: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3661#false} is VALID [2018-11-14 16:52:19,105 INFO L273 TraceCheckUtils]: 48: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-14 16:52:19,105 INFO L273 TraceCheckUtils]: 49: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3661#false} is VALID [2018-11-14 16:52:19,105 INFO L273 TraceCheckUtils]: 50: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-14 16:52:19,105 INFO L273 TraceCheckUtils]: 51: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3661#false} is VALID [2018-11-14 16:52:19,106 INFO L273 TraceCheckUtils]: 52: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-14 16:52:19,106 INFO L273 TraceCheckUtils]: 53: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3661#false} is VALID [2018-11-14 16:52:19,106 INFO L273 TraceCheckUtils]: 54: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-14 16:52:19,106 INFO L273 TraceCheckUtils]: 55: Hoare triple {3661#false} assume !(~i~0 < 100000); {3661#false} is VALID [2018-11-14 16:52:19,106 INFO L273 TraceCheckUtils]: 56: Hoare triple {3661#false} ~i~0 := 0; {3661#false} is VALID [2018-11-14 16:52:19,107 INFO L273 TraceCheckUtils]: 57: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-14 16:52:19,107 INFO L273 TraceCheckUtils]: 58: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3661#false} is VALID [2018-11-14 16:52:19,107 INFO L273 TraceCheckUtils]: 59: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-14 16:52:19,107 INFO L273 TraceCheckUtils]: 60: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3661#false} is VALID [2018-11-14 16:52:19,108 INFO L273 TraceCheckUtils]: 61: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-14 16:52:19,108 INFO L273 TraceCheckUtils]: 62: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3661#false} is VALID [2018-11-14 16:52:19,108 INFO L273 TraceCheckUtils]: 63: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-14 16:52:19,108 INFO L273 TraceCheckUtils]: 64: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3661#false} is VALID [2018-11-14 16:52:19,108 INFO L273 TraceCheckUtils]: 65: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-14 16:52:19,109 INFO L273 TraceCheckUtils]: 66: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3661#false} is VALID [2018-11-14 16:52:19,109 INFO L273 TraceCheckUtils]: 67: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-14 16:52:19,109 INFO L273 TraceCheckUtils]: 68: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3661#false} is VALID [2018-11-14 16:52:19,109 INFO L273 TraceCheckUtils]: 69: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-14 16:52:19,109 INFO L273 TraceCheckUtils]: 70: Hoare triple {3661#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3661#false} is VALID [2018-11-14 16:52:19,110 INFO L273 TraceCheckUtils]: 71: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-14 16:52:19,110 INFO L273 TraceCheckUtils]: 72: Hoare triple {3661#false} assume !(~i~0 < 100000); {3661#false} is VALID [2018-11-14 16:52:19,110 INFO L273 TraceCheckUtils]: 73: Hoare triple {3661#false} havoc ~x~0;~x~0 := 0; {3661#false} is VALID [2018-11-14 16:52:19,110 INFO L273 TraceCheckUtils]: 74: Hoare triple {3661#false} assume true; {3661#false} is VALID [2018-11-14 16:52:19,111 INFO L273 TraceCheckUtils]: 75: Hoare triple {3661#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {3661#false} is VALID [2018-11-14 16:52:19,111 INFO L256 TraceCheckUtils]: 76: Hoare triple {3661#false} call __VERIFIER_assert((if #t~mem1 == 46 then 1 else 0)); {3661#false} is VALID [2018-11-14 16:52:19,111 INFO L273 TraceCheckUtils]: 77: Hoare triple {3661#false} ~cond := #in~cond; {3661#false} is VALID [2018-11-14 16:52:19,111 INFO L273 TraceCheckUtils]: 78: Hoare triple {3661#false} assume ~cond == 0; {3661#false} is VALID [2018-11-14 16:52:19,111 INFO L273 TraceCheckUtils]: 79: Hoare triple {3661#false} assume !false; {3661#false} is VALID [2018-11-14 16:52:19,118 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-11-14 16:52:19,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:52:19,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-14 16:52:19,148 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 80 [2018-11-14 16:52:19,148 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:52:19,148 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 16:52:19,223 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:52:19,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 16:52:19,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 16:52:19,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-14 16:52:19,224 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 11 states. [2018-11-14 16:52:19,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:19,578 INFO L93 Difference]: Finished difference Result 156 states and 167 transitions. [2018-11-14 16:52:19,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 16:52:19,578 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 80 [2018-11-14 16:52:19,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:52:19,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 16:52:19,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2018-11-14 16:52:19,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 16:52:19,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2018-11-14 16:52:19,584 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 125 transitions. [2018-11-14 16:52:19,706 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:52:19,709 INFO L225 Difference]: With dead ends: 156 [2018-11-14 16:52:19,709 INFO L226 Difference]: Without dead ends: 93 [2018-11-14 16:52:19,709 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-14 16:52:19,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-14 16:52:19,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-11-14 16:52:19,751 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:52:19,751 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand 93 states. [2018-11-14 16:52:19,751 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 93 states. [2018-11-14 16:52:19,751 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 93 states. [2018-11-14 16:52:19,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:19,754 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2018-11-14 16:52:19,754 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2018-11-14 16:52:19,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:19,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:19,755 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 93 states. [2018-11-14 16:52:19,755 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 93 states. [2018-11-14 16:52:19,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:19,757 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2018-11-14 16:52:19,758 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2018-11-14 16:52:19,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:19,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:19,758 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:52:19,758 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:52:19,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-14 16:52:19,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2018-11-14 16:52:19,760 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 80 [2018-11-14 16:52:19,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:52:19,761 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2018-11-14 16:52:19,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 16:52:19,761 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2018-11-14 16:52:19,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-14 16:52:19,762 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:52:19,762 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:52:19,762 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:52:19,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:52:19,763 INFO L82 PathProgramCache]: Analyzing trace with hash 168009469, now seen corresponding path program 8 times [2018-11-14 16:52:19,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:52:19,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:52:19,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:19,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:52:19,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:19,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:20,037 INFO L256 TraceCheckUtils]: 0: Hoare triple {4458#true} call ULTIMATE.init(); {4458#true} is VALID [2018-11-14 16:52:20,038 INFO L273 TraceCheckUtils]: 1: Hoare triple {4458#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4458#true} is VALID [2018-11-14 16:52:20,038 INFO L273 TraceCheckUtils]: 2: Hoare triple {4458#true} assume true; {4458#true} is VALID [2018-11-14 16:52:20,039 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4458#true} {4458#true} #92#return; {4458#true} is VALID [2018-11-14 16:52:20,039 INFO L256 TraceCheckUtils]: 4: Hoare triple {4458#true} call #t~ret2 := main(); {4458#true} is VALID [2018-11-14 16:52:20,039 INFO L273 TraceCheckUtils]: 5: Hoare triple {4458#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4460#(= main_~i~0 0)} is VALID [2018-11-14 16:52:20,040 INFO L273 TraceCheckUtils]: 6: Hoare triple {4460#(= main_~i~0 0)} assume true; {4460#(= main_~i~0 0)} is VALID [2018-11-14 16:52:20,041 INFO L273 TraceCheckUtils]: 7: Hoare triple {4460#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4461#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:20,041 INFO L273 TraceCheckUtils]: 8: Hoare triple {4461#(<= main_~i~0 1)} assume true; {4461#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:20,042 INFO L273 TraceCheckUtils]: 9: Hoare triple {4461#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4462#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:20,042 INFO L273 TraceCheckUtils]: 10: Hoare triple {4462#(<= main_~i~0 2)} assume true; {4462#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:20,044 INFO L273 TraceCheckUtils]: 11: Hoare triple {4462#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4463#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:20,044 INFO L273 TraceCheckUtils]: 12: Hoare triple {4463#(<= main_~i~0 3)} assume true; {4463#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:20,045 INFO L273 TraceCheckUtils]: 13: Hoare triple {4463#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4464#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:20,046 INFO L273 TraceCheckUtils]: 14: Hoare triple {4464#(<= main_~i~0 4)} assume true; {4464#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:20,047 INFO L273 TraceCheckUtils]: 15: Hoare triple {4464#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4465#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:20,048 INFO L273 TraceCheckUtils]: 16: Hoare triple {4465#(<= main_~i~0 5)} assume true; {4465#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:20,049 INFO L273 TraceCheckUtils]: 17: Hoare triple {4465#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4466#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:20,049 INFO L273 TraceCheckUtils]: 18: Hoare triple {4466#(<= main_~i~0 6)} assume true; {4466#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:20,050 INFO L273 TraceCheckUtils]: 19: Hoare triple {4466#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4467#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:20,051 INFO L273 TraceCheckUtils]: 20: Hoare triple {4467#(<= main_~i~0 7)} assume true; {4467#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:20,052 INFO L273 TraceCheckUtils]: 21: Hoare triple {4467#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4468#(<= main_~i~0 8)} is VALID [2018-11-14 16:52:20,072 INFO L273 TraceCheckUtils]: 22: Hoare triple {4468#(<= main_~i~0 8)} assume true; {4468#(<= main_~i~0 8)} is VALID [2018-11-14 16:52:20,086 INFO L273 TraceCheckUtils]: 23: Hoare triple {4468#(<= main_~i~0 8)} assume !(~i~0 < 100000); {4459#false} is VALID [2018-11-14 16:52:20,086 INFO L273 TraceCheckUtils]: 24: Hoare triple {4459#false} ~i~0 := 0; {4459#false} is VALID [2018-11-14 16:52:20,086 INFO L273 TraceCheckUtils]: 25: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-14 16:52:20,087 INFO L273 TraceCheckUtils]: 26: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4459#false} is VALID [2018-11-14 16:52:20,087 INFO L273 TraceCheckUtils]: 27: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-14 16:52:20,087 INFO L273 TraceCheckUtils]: 28: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4459#false} is VALID [2018-11-14 16:52:20,087 INFO L273 TraceCheckUtils]: 29: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-14 16:52:20,087 INFO L273 TraceCheckUtils]: 30: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4459#false} is VALID [2018-11-14 16:52:20,088 INFO L273 TraceCheckUtils]: 31: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-14 16:52:20,088 INFO L273 TraceCheckUtils]: 32: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4459#false} is VALID [2018-11-14 16:52:20,088 INFO L273 TraceCheckUtils]: 33: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-14 16:52:20,088 INFO L273 TraceCheckUtils]: 34: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4459#false} is VALID [2018-11-14 16:52:20,089 INFO L273 TraceCheckUtils]: 35: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-14 16:52:20,089 INFO L273 TraceCheckUtils]: 36: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4459#false} is VALID [2018-11-14 16:52:20,089 INFO L273 TraceCheckUtils]: 37: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-14 16:52:20,089 INFO L273 TraceCheckUtils]: 38: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4459#false} is VALID [2018-11-14 16:52:20,089 INFO L273 TraceCheckUtils]: 39: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-14 16:52:20,090 INFO L273 TraceCheckUtils]: 40: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4459#false} is VALID [2018-11-14 16:52:20,090 INFO L273 TraceCheckUtils]: 41: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-14 16:52:20,090 INFO L273 TraceCheckUtils]: 42: Hoare triple {4459#false} assume !(~i~0 < 100000); {4459#false} is VALID [2018-11-14 16:52:20,090 INFO L273 TraceCheckUtils]: 43: Hoare triple {4459#false} ~i~0 := 0; {4459#false} is VALID [2018-11-14 16:52:20,090 INFO L273 TraceCheckUtils]: 44: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-14 16:52:20,090 INFO L273 TraceCheckUtils]: 45: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4459#false} is VALID [2018-11-14 16:52:20,091 INFO L273 TraceCheckUtils]: 46: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-14 16:52:20,091 INFO L273 TraceCheckUtils]: 47: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4459#false} is VALID [2018-11-14 16:52:20,091 INFO L273 TraceCheckUtils]: 48: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-14 16:52:20,091 INFO L273 TraceCheckUtils]: 49: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4459#false} is VALID [2018-11-14 16:52:20,091 INFO L273 TraceCheckUtils]: 50: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-14 16:52:20,091 INFO L273 TraceCheckUtils]: 51: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4459#false} is VALID [2018-11-14 16:52:20,091 INFO L273 TraceCheckUtils]: 52: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-14 16:52:20,091 INFO L273 TraceCheckUtils]: 53: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4459#false} is VALID [2018-11-14 16:52:20,092 INFO L273 TraceCheckUtils]: 54: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-14 16:52:20,092 INFO L273 TraceCheckUtils]: 55: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4459#false} is VALID [2018-11-14 16:52:20,092 INFO L273 TraceCheckUtils]: 56: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-14 16:52:20,092 INFO L273 TraceCheckUtils]: 57: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4459#false} is VALID [2018-11-14 16:52:20,092 INFO L273 TraceCheckUtils]: 58: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-14 16:52:20,092 INFO L273 TraceCheckUtils]: 59: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4459#false} is VALID [2018-11-14 16:52:20,093 INFO L273 TraceCheckUtils]: 60: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-14 16:52:20,093 INFO L273 TraceCheckUtils]: 61: Hoare triple {4459#false} assume !(~i~0 < 100000); {4459#false} is VALID [2018-11-14 16:52:20,093 INFO L273 TraceCheckUtils]: 62: Hoare triple {4459#false} ~i~0 := 0; {4459#false} is VALID [2018-11-14 16:52:20,093 INFO L273 TraceCheckUtils]: 63: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-14 16:52:20,093 INFO L273 TraceCheckUtils]: 64: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4459#false} is VALID [2018-11-14 16:52:20,093 INFO L273 TraceCheckUtils]: 65: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-14 16:52:20,094 INFO L273 TraceCheckUtils]: 66: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4459#false} is VALID [2018-11-14 16:52:20,094 INFO L273 TraceCheckUtils]: 67: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-14 16:52:20,094 INFO L273 TraceCheckUtils]: 68: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4459#false} is VALID [2018-11-14 16:52:20,094 INFO L273 TraceCheckUtils]: 69: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-14 16:52:20,094 INFO L273 TraceCheckUtils]: 70: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4459#false} is VALID [2018-11-14 16:52:20,094 INFO L273 TraceCheckUtils]: 71: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-14 16:52:20,095 INFO L273 TraceCheckUtils]: 72: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4459#false} is VALID [2018-11-14 16:52:20,095 INFO L273 TraceCheckUtils]: 73: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-14 16:52:20,095 INFO L273 TraceCheckUtils]: 74: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4459#false} is VALID [2018-11-14 16:52:20,095 INFO L273 TraceCheckUtils]: 75: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-14 16:52:20,095 INFO L273 TraceCheckUtils]: 76: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4459#false} is VALID [2018-11-14 16:52:20,095 INFO L273 TraceCheckUtils]: 77: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-14 16:52:20,096 INFO L273 TraceCheckUtils]: 78: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4459#false} is VALID [2018-11-14 16:52:20,096 INFO L273 TraceCheckUtils]: 79: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-14 16:52:20,096 INFO L273 TraceCheckUtils]: 80: Hoare triple {4459#false} assume !(~i~0 < 100000); {4459#false} is VALID [2018-11-14 16:52:20,096 INFO L273 TraceCheckUtils]: 81: Hoare triple {4459#false} havoc ~x~0;~x~0 := 0; {4459#false} is VALID [2018-11-14 16:52:20,096 INFO L273 TraceCheckUtils]: 82: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-14 16:52:20,097 INFO L273 TraceCheckUtils]: 83: Hoare triple {4459#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {4459#false} is VALID [2018-11-14 16:52:20,097 INFO L256 TraceCheckUtils]: 84: Hoare triple {4459#false} call __VERIFIER_assert((if #t~mem1 == 46 then 1 else 0)); {4459#false} is VALID [2018-11-14 16:52:20,097 INFO L273 TraceCheckUtils]: 85: Hoare triple {4459#false} ~cond := #in~cond; {4459#false} is VALID [2018-11-14 16:52:20,097 INFO L273 TraceCheckUtils]: 86: Hoare triple {4459#false} assume ~cond == 0; {4459#false} is VALID [2018-11-14 16:52:20,097 INFO L273 TraceCheckUtils]: 87: Hoare triple {4459#false} assume !false; {4459#false} is VALID [2018-11-14 16:52:20,102 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2018-11-14 16:52:20,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:52:20,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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:52:20,119 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 16:52:20,155 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:52:20,155 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:52:20,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:20,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:52:20,347 INFO L256 TraceCheckUtils]: 0: Hoare triple {4458#true} call ULTIMATE.init(); {4458#true} is VALID [2018-11-14 16:52:20,347 INFO L273 TraceCheckUtils]: 1: Hoare triple {4458#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4458#true} is VALID [2018-11-14 16:52:20,348 INFO L273 TraceCheckUtils]: 2: Hoare triple {4458#true} assume true; {4458#true} is VALID [2018-11-14 16:52:20,348 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4458#true} {4458#true} #92#return; {4458#true} is VALID [2018-11-14 16:52:20,348 INFO L256 TraceCheckUtils]: 4: Hoare triple {4458#true} call #t~ret2 := main(); {4458#true} is VALID [2018-11-14 16:52:20,349 INFO L273 TraceCheckUtils]: 5: Hoare triple {4458#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4487#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:20,349 INFO L273 TraceCheckUtils]: 6: Hoare triple {4487#(<= main_~i~0 0)} assume true; {4487#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:20,350 INFO L273 TraceCheckUtils]: 7: Hoare triple {4487#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4461#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:20,351 INFO L273 TraceCheckUtils]: 8: Hoare triple {4461#(<= main_~i~0 1)} assume true; {4461#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:20,351 INFO L273 TraceCheckUtils]: 9: Hoare triple {4461#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4462#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:20,351 INFO L273 TraceCheckUtils]: 10: Hoare triple {4462#(<= main_~i~0 2)} assume true; {4462#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:20,352 INFO L273 TraceCheckUtils]: 11: Hoare triple {4462#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4463#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:20,353 INFO L273 TraceCheckUtils]: 12: Hoare triple {4463#(<= main_~i~0 3)} assume true; {4463#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:20,354 INFO L273 TraceCheckUtils]: 13: Hoare triple {4463#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4464#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:20,354 INFO L273 TraceCheckUtils]: 14: Hoare triple {4464#(<= main_~i~0 4)} assume true; {4464#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:20,355 INFO L273 TraceCheckUtils]: 15: Hoare triple {4464#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4465#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:20,355 INFO L273 TraceCheckUtils]: 16: Hoare triple {4465#(<= main_~i~0 5)} assume true; {4465#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:20,356 INFO L273 TraceCheckUtils]: 17: Hoare triple {4465#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4466#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:20,356 INFO L273 TraceCheckUtils]: 18: Hoare triple {4466#(<= main_~i~0 6)} assume true; {4466#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:20,357 INFO L273 TraceCheckUtils]: 19: Hoare triple {4466#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4467#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:20,357 INFO L273 TraceCheckUtils]: 20: Hoare triple {4467#(<= main_~i~0 7)} assume true; {4467#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:20,358 INFO L273 TraceCheckUtils]: 21: Hoare triple {4467#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4468#(<= main_~i~0 8)} is VALID [2018-11-14 16:52:20,359 INFO L273 TraceCheckUtils]: 22: Hoare triple {4468#(<= main_~i~0 8)} assume true; {4468#(<= main_~i~0 8)} is VALID [2018-11-14 16:52:20,359 INFO L273 TraceCheckUtils]: 23: Hoare triple {4468#(<= main_~i~0 8)} assume !(~i~0 < 100000); {4459#false} is VALID [2018-11-14 16:52:20,360 INFO L273 TraceCheckUtils]: 24: Hoare triple {4459#false} ~i~0 := 0; {4459#false} is VALID [2018-11-14 16:52:20,360 INFO L273 TraceCheckUtils]: 25: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-14 16:52:20,360 INFO L273 TraceCheckUtils]: 26: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4459#false} is VALID [2018-11-14 16:52:20,360 INFO L273 TraceCheckUtils]: 27: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-14 16:52:20,360 INFO L273 TraceCheckUtils]: 28: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4459#false} is VALID [2018-11-14 16:52:20,361 INFO L273 TraceCheckUtils]: 29: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-14 16:52:20,361 INFO L273 TraceCheckUtils]: 30: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4459#false} is VALID [2018-11-14 16:52:20,361 INFO L273 TraceCheckUtils]: 31: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-14 16:52:20,361 INFO L273 TraceCheckUtils]: 32: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4459#false} is VALID [2018-11-14 16:52:20,361 INFO L273 TraceCheckUtils]: 33: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-14 16:52:20,362 INFO L273 TraceCheckUtils]: 34: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4459#false} is VALID [2018-11-14 16:52:20,362 INFO L273 TraceCheckUtils]: 35: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-14 16:52:20,362 INFO L273 TraceCheckUtils]: 36: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4459#false} is VALID [2018-11-14 16:52:20,362 INFO L273 TraceCheckUtils]: 37: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-14 16:52:20,362 INFO L273 TraceCheckUtils]: 38: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4459#false} is VALID [2018-11-14 16:52:20,362 INFO L273 TraceCheckUtils]: 39: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-14 16:52:20,363 INFO L273 TraceCheckUtils]: 40: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4459#false} is VALID [2018-11-14 16:52:20,363 INFO L273 TraceCheckUtils]: 41: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-14 16:52:20,363 INFO L273 TraceCheckUtils]: 42: Hoare triple {4459#false} assume !(~i~0 < 100000); {4459#false} is VALID [2018-11-14 16:52:20,363 INFO L273 TraceCheckUtils]: 43: Hoare triple {4459#false} ~i~0 := 0; {4459#false} is VALID [2018-11-14 16:52:20,363 INFO L273 TraceCheckUtils]: 44: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-14 16:52:20,363 INFO L273 TraceCheckUtils]: 45: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4459#false} is VALID [2018-11-14 16:52:20,363 INFO L273 TraceCheckUtils]: 46: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-14 16:52:20,363 INFO L273 TraceCheckUtils]: 47: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4459#false} is VALID [2018-11-14 16:52:20,363 INFO L273 TraceCheckUtils]: 48: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-14 16:52:20,364 INFO L273 TraceCheckUtils]: 49: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4459#false} is VALID [2018-11-14 16:52:20,364 INFO L273 TraceCheckUtils]: 50: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-14 16:52:20,364 INFO L273 TraceCheckUtils]: 51: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4459#false} is VALID [2018-11-14 16:52:20,364 INFO L273 TraceCheckUtils]: 52: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-14 16:52:20,364 INFO L273 TraceCheckUtils]: 53: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4459#false} is VALID [2018-11-14 16:52:20,364 INFO L273 TraceCheckUtils]: 54: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-14 16:52:20,364 INFO L273 TraceCheckUtils]: 55: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4459#false} is VALID [2018-11-14 16:52:20,365 INFO L273 TraceCheckUtils]: 56: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-14 16:52:20,365 INFO L273 TraceCheckUtils]: 57: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4459#false} is VALID [2018-11-14 16:52:20,365 INFO L273 TraceCheckUtils]: 58: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-14 16:52:20,365 INFO L273 TraceCheckUtils]: 59: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4459#false} is VALID [2018-11-14 16:52:20,365 INFO L273 TraceCheckUtils]: 60: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-14 16:52:20,365 INFO L273 TraceCheckUtils]: 61: Hoare triple {4459#false} assume !(~i~0 < 100000); {4459#false} is VALID [2018-11-14 16:52:20,365 INFO L273 TraceCheckUtils]: 62: Hoare triple {4459#false} ~i~0 := 0; {4459#false} is VALID [2018-11-14 16:52:20,366 INFO L273 TraceCheckUtils]: 63: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-14 16:52:20,366 INFO L273 TraceCheckUtils]: 64: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4459#false} is VALID [2018-11-14 16:52:20,366 INFO L273 TraceCheckUtils]: 65: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-14 16:52:20,366 INFO L273 TraceCheckUtils]: 66: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4459#false} is VALID [2018-11-14 16:52:20,366 INFO L273 TraceCheckUtils]: 67: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-14 16:52:20,366 INFO L273 TraceCheckUtils]: 68: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4459#false} is VALID [2018-11-14 16:52:20,366 INFO L273 TraceCheckUtils]: 69: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-14 16:52:20,366 INFO L273 TraceCheckUtils]: 70: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4459#false} is VALID [2018-11-14 16:52:20,366 INFO L273 TraceCheckUtils]: 71: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-14 16:52:20,367 INFO L273 TraceCheckUtils]: 72: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4459#false} is VALID [2018-11-14 16:52:20,367 INFO L273 TraceCheckUtils]: 73: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-14 16:52:20,367 INFO L273 TraceCheckUtils]: 74: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4459#false} is VALID [2018-11-14 16:52:20,367 INFO L273 TraceCheckUtils]: 75: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-14 16:52:20,367 INFO L273 TraceCheckUtils]: 76: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4459#false} is VALID [2018-11-14 16:52:20,367 INFO L273 TraceCheckUtils]: 77: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-14 16:52:20,367 INFO L273 TraceCheckUtils]: 78: Hoare triple {4459#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4459#false} is VALID [2018-11-14 16:52:20,367 INFO L273 TraceCheckUtils]: 79: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-14 16:52:20,368 INFO L273 TraceCheckUtils]: 80: Hoare triple {4459#false} assume !(~i~0 < 100000); {4459#false} is VALID [2018-11-14 16:52:20,368 INFO L273 TraceCheckUtils]: 81: Hoare triple {4459#false} havoc ~x~0;~x~0 := 0; {4459#false} is VALID [2018-11-14 16:52:20,368 INFO L273 TraceCheckUtils]: 82: Hoare triple {4459#false} assume true; {4459#false} is VALID [2018-11-14 16:52:20,368 INFO L273 TraceCheckUtils]: 83: Hoare triple {4459#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {4459#false} is VALID [2018-11-14 16:52:20,368 INFO L256 TraceCheckUtils]: 84: Hoare triple {4459#false} call __VERIFIER_assert((if #t~mem1 == 46 then 1 else 0)); {4459#false} is VALID [2018-11-14 16:52:20,368 INFO L273 TraceCheckUtils]: 85: Hoare triple {4459#false} ~cond := #in~cond; {4459#false} is VALID [2018-11-14 16:52:20,368 INFO L273 TraceCheckUtils]: 86: Hoare triple {4459#false} assume ~cond == 0; {4459#false} is VALID [2018-11-14 16:52:20,368 INFO L273 TraceCheckUtils]: 87: Hoare triple {4459#false} assume !false; {4459#false} is VALID [2018-11-14 16:52:20,371 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2018-11-14 16:52:20,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:52:20,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-14 16:52:20,394 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 88 [2018-11-14 16:52:20,394 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:52:20,394 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 16:52:20,436 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:52:20,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 16:52:20,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 16:52:20,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-14 16:52:20,438 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand 12 states. [2018-11-14 16:52:20,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:20,801 INFO L93 Difference]: Finished difference Result 170 states and 181 transitions. [2018-11-14 16:52:20,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 16:52:20,802 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 88 [2018-11-14 16:52:20,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:52:20,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:52:20,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 133 transitions. [2018-11-14 16:52:20,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:52:20,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 133 transitions. [2018-11-14 16:52:20,807 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 133 transitions. [2018-11-14 16:52:20,988 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:52:20,991 INFO L225 Difference]: With dead ends: 170 [2018-11-14 16:52:20,991 INFO L226 Difference]: Without dead ends: 101 [2018-11-14 16:52:20,991 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-14 16:52:20,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-14 16:52:21,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-11-14 16:52:21,090 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:52:21,090 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 101 states. [2018-11-14 16:52:21,090 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 101 states. [2018-11-14 16:52:21,091 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 101 states. [2018-11-14 16:52:21,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:21,093 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2018-11-14 16:52:21,093 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2018-11-14 16:52:21,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:21,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:21,093 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 101 states. [2018-11-14 16:52:21,094 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 101 states. [2018-11-14 16:52:21,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:21,096 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2018-11-14 16:52:21,096 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2018-11-14 16:52:21,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:21,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:21,097 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:52:21,097 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:52:21,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-14 16:52:21,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2018-11-14 16:52:21,100 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 88 [2018-11-14 16:52:21,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:52:21,100 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2018-11-14 16:52:21,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 16:52:21,100 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2018-11-14 16:52:21,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-14 16:52:21,101 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:52:21,102 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:52:21,102 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:52:21,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:52:21,102 INFO L82 PathProgramCache]: Analyzing trace with hash -2142428547, now seen corresponding path program 9 times [2018-11-14 16:52:21,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:52:21,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:52:21,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:21,104 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:52:21,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:21,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:21,313 INFO L256 TraceCheckUtils]: 0: Hoare triple {5330#true} call ULTIMATE.init(); {5330#true} is VALID [2018-11-14 16:52:21,314 INFO L273 TraceCheckUtils]: 1: Hoare triple {5330#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5330#true} is VALID [2018-11-14 16:52:21,314 INFO L273 TraceCheckUtils]: 2: Hoare triple {5330#true} assume true; {5330#true} is VALID [2018-11-14 16:52:21,314 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5330#true} {5330#true} #92#return; {5330#true} is VALID [2018-11-14 16:52:21,315 INFO L256 TraceCheckUtils]: 4: Hoare triple {5330#true} call #t~ret2 := main(); {5330#true} is VALID [2018-11-14 16:52:21,315 INFO L273 TraceCheckUtils]: 5: Hoare triple {5330#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5332#(= main_~i~0 0)} is VALID [2018-11-14 16:52:21,316 INFO L273 TraceCheckUtils]: 6: Hoare triple {5332#(= main_~i~0 0)} assume true; {5332#(= main_~i~0 0)} is VALID [2018-11-14 16:52:21,316 INFO L273 TraceCheckUtils]: 7: Hoare triple {5332#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5333#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:21,317 INFO L273 TraceCheckUtils]: 8: Hoare triple {5333#(<= main_~i~0 1)} assume true; {5333#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:21,317 INFO L273 TraceCheckUtils]: 9: Hoare triple {5333#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5334#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:21,318 INFO L273 TraceCheckUtils]: 10: Hoare triple {5334#(<= main_~i~0 2)} assume true; {5334#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:21,318 INFO L273 TraceCheckUtils]: 11: Hoare triple {5334#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5335#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:21,319 INFO L273 TraceCheckUtils]: 12: Hoare triple {5335#(<= main_~i~0 3)} assume true; {5335#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:21,320 INFO L273 TraceCheckUtils]: 13: Hoare triple {5335#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5336#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:21,321 INFO L273 TraceCheckUtils]: 14: Hoare triple {5336#(<= main_~i~0 4)} assume true; {5336#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:21,322 INFO L273 TraceCheckUtils]: 15: Hoare triple {5336#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5337#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:21,322 INFO L273 TraceCheckUtils]: 16: Hoare triple {5337#(<= main_~i~0 5)} assume true; {5337#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:21,323 INFO L273 TraceCheckUtils]: 17: Hoare triple {5337#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5338#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:21,324 INFO L273 TraceCheckUtils]: 18: Hoare triple {5338#(<= main_~i~0 6)} assume true; {5338#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:21,325 INFO L273 TraceCheckUtils]: 19: Hoare triple {5338#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5339#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:21,325 INFO L273 TraceCheckUtils]: 20: Hoare triple {5339#(<= main_~i~0 7)} assume true; {5339#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:21,326 INFO L273 TraceCheckUtils]: 21: Hoare triple {5339#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5340#(<= main_~i~0 8)} is VALID [2018-11-14 16:52:21,327 INFO L273 TraceCheckUtils]: 22: Hoare triple {5340#(<= main_~i~0 8)} assume true; {5340#(<= main_~i~0 8)} is VALID [2018-11-14 16:52:21,328 INFO L273 TraceCheckUtils]: 23: Hoare triple {5340#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5341#(<= main_~i~0 9)} is VALID [2018-11-14 16:52:21,329 INFO L273 TraceCheckUtils]: 24: Hoare triple {5341#(<= main_~i~0 9)} assume true; {5341#(<= main_~i~0 9)} is VALID [2018-11-14 16:52:21,330 INFO L273 TraceCheckUtils]: 25: Hoare triple {5341#(<= main_~i~0 9)} assume !(~i~0 < 100000); {5331#false} is VALID [2018-11-14 16:52:21,330 INFO L273 TraceCheckUtils]: 26: Hoare triple {5331#false} ~i~0 := 0; {5331#false} is VALID [2018-11-14 16:52:21,330 INFO L273 TraceCheckUtils]: 27: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-14 16:52:21,330 INFO L273 TraceCheckUtils]: 28: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5331#false} is VALID [2018-11-14 16:52:21,331 INFO L273 TraceCheckUtils]: 29: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-14 16:52:21,331 INFO L273 TraceCheckUtils]: 30: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5331#false} is VALID [2018-11-14 16:52:21,331 INFO L273 TraceCheckUtils]: 31: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-14 16:52:21,331 INFO L273 TraceCheckUtils]: 32: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5331#false} is VALID [2018-11-14 16:52:21,332 INFO L273 TraceCheckUtils]: 33: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-14 16:52:21,332 INFO L273 TraceCheckUtils]: 34: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5331#false} is VALID [2018-11-14 16:52:21,332 INFO L273 TraceCheckUtils]: 35: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-14 16:52:21,332 INFO L273 TraceCheckUtils]: 36: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5331#false} is VALID [2018-11-14 16:52:21,333 INFO L273 TraceCheckUtils]: 37: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-14 16:52:21,333 INFO L273 TraceCheckUtils]: 38: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5331#false} is VALID [2018-11-14 16:52:21,333 INFO L273 TraceCheckUtils]: 39: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-14 16:52:21,333 INFO L273 TraceCheckUtils]: 40: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5331#false} is VALID [2018-11-14 16:52:21,334 INFO L273 TraceCheckUtils]: 41: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-14 16:52:21,334 INFO L273 TraceCheckUtils]: 42: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5331#false} is VALID [2018-11-14 16:52:21,334 INFO L273 TraceCheckUtils]: 43: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-14 16:52:21,334 INFO L273 TraceCheckUtils]: 44: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5331#false} is VALID [2018-11-14 16:52:21,334 INFO L273 TraceCheckUtils]: 45: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-14 16:52:21,334 INFO L273 TraceCheckUtils]: 46: Hoare triple {5331#false} assume !(~i~0 < 100000); {5331#false} is VALID [2018-11-14 16:52:21,335 INFO L273 TraceCheckUtils]: 47: Hoare triple {5331#false} ~i~0 := 0; {5331#false} is VALID [2018-11-14 16:52:21,335 INFO L273 TraceCheckUtils]: 48: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-14 16:52:21,335 INFO L273 TraceCheckUtils]: 49: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5331#false} is VALID [2018-11-14 16:52:21,335 INFO L273 TraceCheckUtils]: 50: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-14 16:52:21,335 INFO L273 TraceCheckUtils]: 51: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5331#false} is VALID [2018-11-14 16:52:21,335 INFO L273 TraceCheckUtils]: 52: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-14 16:52:21,335 INFO L273 TraceCheckUtils]: 53: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5331#false} is VALID [2018-11-14 16:52:21,336 INFO L273 TraceCheckUtils]: 54: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-14 16:52:21,336 INFO L273 TraceCheckUtils]: 55: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5331#false} is VALID [2018-11-14 16:52:21,336 INFO L273 TraceCheckUtils]: 56: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-14 16:52:21,336 INFO L273 TraceCheckUtils]: 57: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5331#false} is VALID [2018-11-14 16:52:21,336 INFO L273 TraceCheckUtils]: 58: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-14 16:52:21,336 INFO L273 TraceCheckUtils]: 59: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5331#false} is VALID [2018-11-14 16:52:21,337 INFO L273 TraceCheckUtils]: 60: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-14 16:52:21,337 INFO L273 TraceCheckUtils]: 61: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5331#false} is VALID [2018-11-14 16:52:21,337 INFO L273 TraceCheckUtils]: 62: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-14 16:52:21,337 INFO L273 TraceCheckUtils]: 63: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5331#false} is VALID [2018-11-14 16:52:21,337 INFO L273 TraceCheckUtils]: 64: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-14 16:52:21,337 INFO L273 TraceCheckUtils]: 65: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5331#false} is VALID [2018-11-14 16:52:21,337 INFO L273 TraceCheckUtils]: 66: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-14 16:52:21,338 INFO L273 TraceCheckUtils]: 67: Hoare triple {5331#false} assume !(~i~0 < 100000); {5331#false} is VALID [2018-11-14 16:52:21,338 INFO L273 TraceCheckUtils]: 68: Hoare triple {5331#false} ~i~0 := 0; {5331#false} is VALID [2018-11-14 16:52:21,338 INFO L273 TraceCheckUtils]: 69: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-14 16:52:21,338 INFO L273 TraceCheckUtils]: 70: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5331#false} is VALID [2018-11-14 16:52:21,338 INFO L273 TraceCheckUtils]: 71: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-14 16:52:21,338 INFO L273 TraceCheckUtils]: 72: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5331#false} is VALID [2018-11-14 16:52:21,338 INFO L273 TraceCheckUtils]: 73: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-14 16:52:21,339 INFO L273 TraceCheckUtils]: 74: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5331#false} is VALID [2018-11-14 16:52:21,339 INFO L273 TraceCheckUtils]: 75: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-14 16:52:21,339 INFO L273 TraceCheckUtils]: 76: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5331#false} is VALID [2018-11-14 16:52:21,339 INFO L273 TraceCheckUtils]: 77: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-14 16:52:21,339 INFO L273 TraceCheckUtils]: 78: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5331#false} is VALID [2018-11-14 16:52:21,339 INFO L273 TraceCheckUtils]: 79: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-14 16:52:21,340 INFO L273 TraceCheckUtils]: 80: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5331#false} is VALID [2018-11-14 16:52:21,340 INFO L273 TraceCheckUtils]: 81: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-14 16:52:21,340 INFO L273 TraceCheckUtils]: 82: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5331#false} is VALID [2018-11-14 16:52:21,340 INFO L273 TraceCheckUtils]: 83: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-14 16:52:21,340 INFO L273 TraceCheckUtils]: 84: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5331#false} is VALID [2018-11-14 16:52:21,340 INFO L273 TraceCheckUtils]: 85: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-14 16:52:21,340 INFO L273 TraceCheckUtils]: 86: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5331#false} is VALID [2018-11-14 16:52:21,341 INFO L273 TraceCheckUtils]: 87: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-14 16:52:21,341 INFO L273 TraceCheckUtils]: 88: Hoare triple {5331#false} assume !(~i~0 < 100000); {5331#false} is VALID [2018-11-14 16:52:21,341 INFO L273 TraceCheckUtils]: 89: Hoare triple {5331#false} havoc ~x~0;~x~0 := 0; {5331#false} is VALID [2018-11-14 16:52:21,341 INFO L273 TraceCheckUtils]: 90: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-14 16:52:21,341 INFO L273 TraceCheckUtils]: 91: Hoare triple {5331#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {5331#false} is VALID [2018-11-14 16:52:21,341 INFO L256 TraceCheckUtils]: 92: Hoare triple {5331#false} call __VERIFIER_assert((if #t~mem1 == 46 then 1 else 0)); {5331#false} is VALID [2018-11-14 16:52:21,342 INFO L273 TraceCheckUtils]: 93: Hoare triple {5331#false} ~cond := #in~cond; {5331#false} is VALID [2018-11-14 16:52:21,342 INFO L273 TraceCheckUtils]: 94: Hoare triple {5331#false} assume ~cond == 0; {5331#false} is VALID [2018-11-14 16:52:21,342 INFO L273 TraceCheckUtils]: 95: Hoare triple {5331#false} assume !false; {5331#false} is VALID [2018-11-14 16:52:21,351 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-11-14 16:52:21,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:52:21,351 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:52:21,363 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 16:52:25,091 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-14 16:52:25,091 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:52:25,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:25,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:52:25,274 INFO L256 TraceCheckUtils]: 0: Hoare triple {5330#true} call ULTIMATE.init(); {5330#true} is VALID [2018-11-14 16:52:25,275 INFO L273 TraceCheckUtils]: 1: Hoare triple {5330#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5330#true} is VALID [2018-11-14 16:52:25,275 INFO L273 TraceCheckUtils]: 2: Hoare triple {5330#true} assume true; {5330#true} is VALID [2018-11-14 16:52:25,275 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5330#true} {5330#true} #92#return; {5330#true} is VALID [2018-11-14 16:52:25,276 INFO L256 TraceCheckUtils]: 4: Hoare triple {5330#true} call #t~ret2 := main(); {5330#true} is VALID [2018-11-14 16:52:25,276 INFO L273 TraceCheckUtils]: 5: Hoare triple {5330#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5330#true} is VALID [2018-11-14 16:52:25,276 INFO L273 TraceCheckUtils]: 6: Hoare triple {5330#true} assume true; {5330#true} is VALID [2018-11-14 16:52:25,276 INFO L273 TraceCheckUtils]: 7: Hoare triple {5330#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5330#true} is VALID [2018-11-14 16:52:25,277 INFO L273 TraceCheckUtils]: 8: Hoare triple {5330#true} assume true; {5330#true} is VALID [2018-11-14 16:52:25,277 INFO L273 TraceCheckUtils]: 9: Hoare triple {5330#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5330#true} is VALID [2018-11-14 16:52:25,277 INFO L273 TraceCheckUtils]: 10: Hoare triple {5330#true} assume true; {5330#true} is VALID [2018-11-14 16:52:25,277 INFO L273 TraceCheckUtils]: 11: Hoare triple {5330#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5330#true} is VALID [2018-11-14 16:52:25,277 INFO L273 TraceCheckUtils]: 12: Hoare triple {5330#true} assume true; {5330#true} is VALID [2018-11-14 16:52:25,277 INFO L273 TraceCheckUtils]: 13: Hoare triple {5330#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5330#true} is VALID [2018-11-14 16:52:25,277 INFO L273 TraceCheckUtils]: 14: Hoare triple {5330#true} assume true; {5330#true} is VALID [2018-11-14 16:52:25,278 INFO L273 TraceCheckUtils]: 15: Hoare triple {5330#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5330#true} is VALID [2018-11-14 16:52:25,278 INFO L273 TraceCheckUtils]: 16: Hoare triple {5330#true} assume true; {5330#true} is VALID [2018-11-14 16:52:25,278 INFO L273 TraceCheckUtils]: 17: Hoare triple {5330#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5330#true} is VALID [2018-11-14 16:52:25,278 INFO L273 TraceCheckUtils]: 18: Hoare triple {5330#true} assume true; {5330#true} is VALID [2018-11-14 16:52:25,278 INFO L273 TraceCheckUtils]: 19: Hoare triple {5330#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5330#true} is VALID [2018-11-14 16:52:25,278 INFO L273 TraceCheckUtils]: 20: Hoare triple {5330#true} assume true; {5330#true} is VALID [2018-11-14 16:52:25,279 INFO L273 TraceCheckUtils]: 21: Hoare triple {5330#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5330#true} is VALID [2018-11-14 16:52:25,279 INFO L273 TraceCheckUtils]: 22: Hoare triple {5330#true} assume true; {5330#true} is VALID [2018-11-14 16:52:25,279 INFO L273 TraceCheckUtils]: 23: Hoare triple {5330#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5330#true} is VALID [2018-11-14 16:52:25,279 INFO L273 TraceCheckUtils]: 24: Hoare triple {5330#true} assume true; {5330#true} is VALID [2018-11-14 16:52:25,279 INFO L273 TraceCheckUtils]: 25: Hoare triple {5330#true} assume !(~i~0 < 100000); {5330#true} is VALID [2018-11-14 16:52:25,280 INFO L273 TraceCheckUtils]: 26: Hoare triple {5330#true} ~i~0 := 0; {5423#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:25,280 INFO L273 TraceCheckUtils]: 27: Hoare triple {5423#(<= main_~i~0 0)} assume true; {5423#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:25,281 INFO L273 TraceCheckUtils]: 28: Hoare triple {5423#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5333#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:25,281 INFO L273 TraceCheckUtils]: 29: Hoare triple {5333#(<= main_~i~0 1)} assume true; {5333#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:25,282 INFO L273 TraceCheckUtils]: 30: Hoare triple {5333#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5334#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:25,283 INFO L273 TraceCheckUtils]: 31: Hoare triple {5334#(<= main_~i~0 2)} assume true; {5334#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:25,284 INFO L273 TraceCheckUtils]: 32: Hoare triple {5334#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5335#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:25,284 INFO L273 TraceCheckUtils]: 33: Hoare triple {5335#(<= main_~i~0 3)} assume true; {5335#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:25,285 INFO L273 TraceCheckUtils]: 34: Hoare triple {5335#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5336#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:25,286 INFO L273 TraceCheckUtils]: 35: Hoare triple {5336#(<= main_~i~0 4)} assume true; {5336#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:25,287 INFO L273 TraceCheckUtils]: 36: Hoare triple {5336#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5337#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:25,291 INFO L273 TraceCheckUtils]: 37: Hoare triple {5337#(<= main_~i~0 5)} assume true; {5337#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:25,294 INFO L273 TraceCheckUtils]: 38: Hoare triple {5337#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5338#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:25,294 INFO L273 TraceCheckUtils]: 39: Hoare triple {5338#(<= main_~i~0 6)} assume true; {5338#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:25,295 INFO L273 TraceCheckUtils]: 40: Hoare triple {5338#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5339#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:25,295 INFO L273 TraceCheckUtils]: 41: Hoare triple {5339#(<= main_~i~0 7)} assume true; {5339#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:25,296 INFO L273 TraceCheckUtils]: 42: Hoare triple {5339#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5340#(<= main_~i~0 8)} is VALID [2018-11-14 16:52:25,296 INFO L273 TraceCheckUtils]: 43: Hoare triple {5340#(<= main_~i~0 8)} assume true; {5340#(<= main_~i~0 8)} is VALID [2018-11-14 16:52:25,297 INFO L273 TraceCheckUtils]: 44: Hoare triple {5340#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5341#(<= main_~i~0 9)} is VALID [2018-11-14 16:52:25,297 INFO L273 TraceCheckUtils]: 45: Hoare triple {5341#(<= main_~i~0 9)} assume true; {5341#(<= main_~i~0 9)} is VALID [2018-11-14 16:52:25,298 INFO L273 TraceCheckUtils]: 46: Hoare triple {5341#(<= main_~i~0 9)} assume !(~i~0 < 100000); {5331#false} is VALID [2018-11-14 16:52:25,298 INFO L273 TraceCheckUtils]: 47: Hoare triple {5331#false} ~i~0 := 0; {5331#false} is VALID [2018-11-14 16:52:25,298 INFO L273 TraceCheckUtils]: 48: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-14 16:52:25,298 INFO L273 TraceCheckUtils]: 49: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5331#false} is VALID [2018-11-14 16:52:25,298 INFO L273 TraceCheckUtils]: 50: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-14 16:52:25,299 INFO L273 TraceCheckUtils]: 51: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5331#false} is VALID [2018-11-14 16:52:25,299 INFO L273 TraceCheckUtils]: 52: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-14 16:52:25,299 INFO L273 TraceCheckUtils]: 53: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5331#false} is VALID [2018-11-14 16:52:25,299 INFO L273 TraceCheckUtils]: 54: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-14 16:52:25,300 INFO L273 TraceCheckUtils]: 55: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5331#false} is VALID [2018-11-14 16:52:25,300 INFO L273 TraceCheckUtils]: 56: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-14 16:52:25,300 INFO L273 TraceCheckUtils]: 57: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5331#false} is VALID [2018-11-14 16:52:25,300 INFO L273 TraceCheckUtils]: 58: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-14 16:52:25,301 INFO L273 TraceCheckUtils]: 59: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5331#false} is VALID [2018-11-14 16:52:25,301 INFO L273 TraceCheckUtils]: 60: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-14 16:52:25,301 INFO L273 TraceCheckUtils]: 61: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5331#false} is VALID [2018-11-14 16:52:25,301 INFO L273 TraceCheckUtils]: 62: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-14 16:52:25,302 INFO L273 TraceCheckUtils]: 63: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5331#false} is VALID [2018-11-14 16:52:25,302 INFO L273 TraceCheckUtils]: 64: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-14 16:52:25,302 INFO L273 TraceCheckUtils]: 65: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5331#false} is VALID [2018-11-14 16:52:25,303 INFO L273 TraceCheckUtils]: 66: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-14 16:52:25,303 INFO L273 TraceCheckUtils]: 67: Hoare triple {5331#false} assume !(~i~0 < 100000); {5331#false} is VALID [2018-11-14 16:52:25,318 INFO L273 TraceCheckUtils]: 68: Hoare triple {5331#false} ~i~0 := 0; {5331#false} is VALID [2018-11-14 16:52:25,318 INFO L273 TraceCheckUtils]: 69: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-14 16:52:25,318 INFO L273 TraceCheckUtils]: 70: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5331#false} is VALID [2018-11-14 16:52:25,318 INFO L273 TraceCheckUtils]: 71: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-14 16:52:25,318 INFO L273 TraceCheckUtils]: 72: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5331#false} is VALID [2018-11-14 16:52:25,320 INFO L273 TraceCheckUtils]: 73: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-14 16:52:25,320 INFO L273 TraceCheckUtils]: 74: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5331#false} is VALID [2018-11-14 16:52:25,320 INFO L273 TraceCheckUtils]: 75: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-14 16:52:25,320 INFO L273 TraceCheckUtils]: 76: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5331#false} is VALID [2018-11-14 16:52:25,320 INFO L273 TraceCheckUtils]: 77: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-14 16:52:25,320 INFO L273 TraceCheckUtils]: 78: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5331#false} is VALID [2018-11-14 16:52:25,321 INFO L273 TraceCheckUtils]: 79: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-14 16:52:25,322 INFO L273 TraceCheckUtils]: 80: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5331#false} is VALID [2018-11-14 16:52:25,322 INFO L273 TraceCheckUtils]: 81: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-14 16:52:25,322 INFO L273 TraceCheckUtils]: 82: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5331#false} is VALID [2018-11-14 16:52:25,322 INFO L273 TraceCheckUtils]: 83: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-14 16:52:25,322 INFO L273 TraceCheckUtils]: 84: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5331#false} is VALID [2018-11-14 16:52:25,322 INFO L273 TraceCheckUtils]: 85: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-14 16:52:25,323 INFO L273 TraceCheckUtils]: 86: Hoare triple {5331#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5331#false} is VALID [2018-11-14 16:52:25,323 INFO L273 TraceCheckUtils]: 87: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-14 16:52:25,323 INFO L273 TraceCheckUtils]: 88: Hoare triple {5331#false} assume !(~i~0 < 100000); {5331#false} is VALID [2018-11-14 16:52:25,323 INFO L273 TraceCheckUtils]: 89: Hoare triple {5331#false} havoc ~x~0;~x~0 := 0; {5331#false} is VALID [2018-11-14 16:52:25,323 INFO L273 TraceCheckUtils]: 90: Hoare triple {5331#false} assume true; {5331#false} is VALID [2018-11-14 16:52:25,323 INFO L273 TraceCheckUtils]: 91: Hoare triple {5331#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {5331#false} is VALID [2018-11-14 16:52:25,323 INFO L256 TraceCheckUtils]: 92: Hoare triple {5331#false} call __VERIFIER_assert((if #t~mem1 == 46 then 1 else 0)); {5331#false} is VALID [2018-11-14 16:52:25,323 INFO L273 TraceCheckUtils]: 93: Hoare triple {5331#false} ~cond := #in~cond; {5331#false} is VALID [2018-11-14 16:52:25,324 INFO L273 TraceCheckUtils]: 94: Hoare triple {5331#false} assume ~cond == 0; {5331#false} is VALID [2018-11-14 16:52:25,324 INFO L273 TraceCheckUtils]: 95: Hoare triple {5331#false} assume !false; {5331#false} is VALID [2018-11-14 16:52:25,328 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-11-14 16:52:25,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:52:25,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-14 16:52:25,352 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 96 [2018-11-14 16:52:25,353 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:52:25,353 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-14 16:52:25,418 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:52:25,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-14 16:52:25,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-14 16:52:25,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-14 16:52:25,419 INFO L87 Difference]: Start difference. First operand 101 states and 105 transitions. Second operand 13 states. [2018-11-14 16:52:26,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:26,227 INFO L93 Difference]: Finished difference Result 184 states and 195 transitions. [2018-11-14 16:52:26,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 16:52:26,227 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 96 [2018-11-14 16:52:26,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:52:26,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 16:52:26,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 141 transitions. [2018-11-14 16:52:26,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 16:52:26,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 141 transitions. [2018-11-14 16:52:26,231 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 141 transitions. [2018-11-14 16:52:26,795 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:52:26,798 INFO L225 Difference]: With dead ends: 184 [2018-11-14 16:52:26,798 INFO L226 Difference]: Without dead ends: 109 [2018-11-14 16:52:26,799 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-14 16:52:26,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-14 16:52:26,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-11-14 16:52:26,934 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:52:26,934 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand 109 states. [2018-11-14 16:52:26,934 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 109 states. [2018-11-14 16:52:26,934 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 109 states. [2018-11-14 16:52:26,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:26,936 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2018-11-14 16:52:26,936 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2018-11-14 16:52:26,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:26,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:26,937 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 109 states. [2018-11-14 16:52:26,937 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 109 states. [2018-11-14 16:52:26,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:26,940 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2018-11-14 16:52:26,940 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2018-11-14 16:52:26,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:26,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:26,941 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:52:26,941 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:52:26,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-14 16:52:26,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 113 transitions. [2018-11-14 16:52:26,943 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 113 transitions. Word has length 96 [2018-11-14 16:52:26,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:52:26,944 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 113 transitions. [2018-11-14 16:52:26,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-14 16:52:26,944 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2018-11-14 16:52:26,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-14 16:52:26,945 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:52:26,945 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:52:26,945 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:52:26,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:52:26,946 INFO L82 PathProgramCache]: Analyzing trace with hash 984481789, now seen corresponding path program 10 times [2018-11-14 16:52:26,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:52:26,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:52:26,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:26,947 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:52:26,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:26,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:27,519 INFO L256 TraceCheckUtils]: 0: Hoare triple {6276#true} call ULTIMATE.init(); {6276#true} is VALID [2018-11-14 16:52:27,519 INFO L273 TraceCheckUtils]: 1: Hoare triple {6276#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6276#true} is VALID [2018-11-14 16:52:27,520 INFO L273 TraceCheckUtils]: 2: Hoare triple {6276#true} assume true; {6276#true} is VALID [2018-11-14 16:52:27,520 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6276#true} {6276#true} #92#return; {6276#true} is VALID [2018-11-14 16:52:27,520 INFO L256 TraceCheckUtils]: 4: Hoare triple {6276#true} call #t~ret2 := main(); {6276#true} is VALID [2018-11-14 16:52:27,521 INFO L273 TraceCheckUtils]: 5: Hoare triple {6276#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6278#(= main_~i~0 0)} is VALID [2018-11-14 16:52:27,521 INFO L273 TraceCheckUtils]: 6: Hoare triple {6278#(= main_~i~0 0)} assume true; {6278#(= main_~i~0 0)} is VALID [2018-11-14 16:52:27,522 INFO L273 TraceCheckUtils]: 7: Hoare triple {6278#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6279#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:27,522 INFO L273 TraceCheckUtils]: 8: Hoare triple {6279#(<= main_~i~0 1)} assume true; {6279#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:27,523 INFO L273 TraceCheckUtils]: 9: Hoare triple {6279#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6280#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:27,523 INFO L273 TraceCheckUtils]: 10: Hoare triple {6280#(<= main_~i~0 2)} assume true; {6280#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:27,524 INFO L273 TraceCheckUtils]: 11: Hoare triple {6280#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6281#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:27,525 INFO L273 TraceCheckUtils]: 12: Hoare triple {6281#(<= main_~i~0 3)} assume true; {6281#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:27,526 INFO L273 TraceCheckUtils]: 13: Hoare triple {6281#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6282#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:27,527 INFO L273 TraceCheckUtils]: 14: Hoare triple {6282#(<= main_~i~0 4)} assume true; {6282#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:27,528 INFO L273 TraceCheckUtils]: 15: Hoare triple {6282#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6283#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:27,528 INFO L273 TraceCheckUtils]: 16: Hoare triple {6283#(<= main_~i~0 5)} assume true; {6283#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:27,529 INFO L273 TraceCheckUtils]: 17: Hoare triple {6283#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6284#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:27,530 INFO L273 TraceCheckUtils]: 18: Hoare triple {6284#(<= main_~i~0 6)} assume true; {6284#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:27,531 INFO L273 TraceCheckUtils]: 19: Hoare triple {6284#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6285#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:27,531 INFO L273 TraceCheckUtils]: 20: Hoare triple {6285#(<= main_~i~0 7)} assume true; {6285#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:27,532 INFO L273 TraceCheckUtils]: 21: Hoare triple {6285#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6286#(<= main_~i~0 8)} is VALID [2018-11-14 16:52:27,533 INFO L273 TraceCheckUtils]: 22: Hoare triple {6286#(<= main_~i~0 8)} assume true; {6286#(<= main_~i~0 8)} is VALID [2018-11-14 16:52:27,534 INFO L273 TraceCheckUtils]: 23: Hoare triple {6286#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6287#(<= main_~i~0 9)} is VALID [2018-11-14 16:52:27,535 INFO L273 TraceCheckUtils]: 24: Hoare triple {6287#(<= main_~i~0 9)} assume true; {6287#(<= main_~i~0 9)} is VALID [2018-11-14 16:52:27,536 INFO L273 TraceCheckUtils]: 25: Hoare triple {6287#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6288#(<= main_~i~0 10)} is VALID [2018-11-14 16:52:27,536 INFO L273 TraceCheckUtils]: 26: Hoare triple {6288#(<= main_~i~0 10)} assume true; {6288#(<= main_~i~0 10)} is VALID [2018-11-14 16:52:27,537 INFO L273 TraceCheckUtils]: 27: Hoare triple {6288#(<= main_~i~0 10)} assume !(~i~0 < 100000); {6277#false} is VALID [2018-11-14 16:52:27,537 INFO L273 TraceCheckUtils]: 28: Hoare triple {6277#false} ~i~0 := 0; {6277#false} is VALID [2018-11-14 16:52:27,537 INFO L273 TraceCheckUtils]: 29: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,538 INFO L273 TraceCheckUtils]: 30: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6277#false} is VALID [2018-11-14 16:52:27,538 INFO L273 TraceCheckUtils]: 31: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,538 INFO L273 TraceCheckUtils]: 32: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6277#false} is VALID [2018-11-14 16:52:27,538 INFO L273 TraceCheckUtils]: 33: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,539 INFO L273 TraceCheckUtils]: 34: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6277#false} is VALID [2018-11-14 16:52:27,539 INFO L273 TraceCheckUtils]: 35: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,539 INFO L273 TraceCheckUtils]: 36: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6277#false} is VALID [2018-11-14 16:52:27,539 INFO L273 TraceCheckUtils]: 37: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,540 INFO L273 TraceCheckUtils]: 38: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6277#false} is VALID [2018-11-14 16:52:27,540 INFO L273 TraceCheckUtils]: 39: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,540 INFO L273 TraceCheckUtils]: 40: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6277#false} is VALID [2018-11-14 16:52:27,541 INFO L273 TraceCheckUtils]: 41: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,541 INFO L273 TraceCheckUtils]: 42: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6277#false} is VALID [2018-11-14 16:52:27,541 INFO L273 TraceCheckUtils]: 43: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,541 INFO L273 TraceCheckUtils]: 44: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6277#false} is VALID [2018-11-14 16:52:27,541 INFO L273 TraceCheckUtils]: 45: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,541 INFO L273 TraceCheckUtils]: 46: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6277#false} is VALID [2018-11-14 16:52:27,542 INFO L273 TraceCheckUtils]: 47: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,542 INFO L273 TraceCheckUtils]: 48: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6277#false} is VALID [2018-11-14 16:52:27,542 INFO L273 TraceCheckUtils]: 49: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,542 INFO L273 TraceCheckUtils]: 50: Hoare triple {6277#false} assume !(~i~0 < 100000); {6277#false} is VALID [2018-11-14 16:52:27,542 INFO L273 TraceCheckUtils]: 51: Hoare triple {6277#false} ~i~0 := 0; {6277#false} is VALID [2018-11-14 16:52:27,542 INFO L273 TraceCheckUtils]: 52: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,543 INFO L273 TraceCheckUtils]: 53: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6277#false} is VALID [2018-11-14 16:52:27,543 INFO L273 TraceCheckUtils]: 54: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,543 INFO L273 TraceCheckUtils]: 55: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6277#false} is VALID [2018-11-14 16:52:27,543 INFO L273 TraceCheckUtils]: 56: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,543 INFO L273 TraceCheckUtils]: 57: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6277#false} is VALID [2018-11-14 16:52:27,543 INFO L273 TraceCheckUtils]: 58: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,544 INFO L273 TraceCheckUtils]: 59: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6277#false} is VALID [2018-11-14 16:52:27,544 INFO L273 TraceCheckUtils]: 60: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,544 INFO L273 TraceCheckUtils]: 61: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6277#false} is VALID [2018-11-14 16:52:27,544 INFO L273 TraceCheckUtils]: 62: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,544 INFO L273 TraceCheckUtils]: 63: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6277#false} is VALID [2018-11-14 16:52:27,544 INFO L273 TraceCheckUtils]: 64: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,545 INFO L273 TraceCheckUtils]: 65: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6277#false} is VALID [2018-11-14 16:52:27,545 INFO L273 TraceCheckUtils]: 66: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,545 INFO L273 TraceCheckUtils]: 67: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6277#false} is VALID [2018-11-14 16:52:27,545 INFO L273 TraceCheckUtils]: 68: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,545 INFO L273 TraceCheckUtils]: 69: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6277#false} is VALID [2018-11-14 16:52:27,545 INFO L273 TraceCheckUtils]: 70: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,545 INFO L273 TraceCheckUtils]: 71: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6277#false} is VALID [2018-11-14 16:52:27,546 INFO L273 TraceCheckUtils]: 72: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,546 INFO L273 TraceCheckUtils]: 73: Hoare triple {6277#false} assume !(~i~0 < 100000); {6277#false} is VALID [2018-11-14 16:52:27,546 INFO L273 TraceCheckUtils]: 74: Hoare triple {6277#false} ~i~0 := 0; {6277#false} is VALID [2018-11-14 16:52:27,546 INFO L273 TraceCheckUtils]: 75: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,546 INFO L273 TraceCheckUtils]: 76: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6277#false} is VALID [2018-11-14 16:52:27,546 INFO L273 TraceCheckUtils]: 77: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,546 INFO L273 TraceCheckUtils]: 78: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6277#false} is VALID [2018-11-14 16:52:27,547 INFO L273 TraceCheckUtils]: 79: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,547 INFO L273 TraceCheckUtils]: 80: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6277#false} is VALID [2018-11-14 16:52:27,547 INFO L273 TraceCheckUtils]: 81: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,547 INFO L273 TraceCheckUtils]: 82: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6277#false} is VALID [2018-11-14 16:52:27,547 INFO L273 TraceCheckUtils]: 83: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,547 INFO L273 TraceCheckUtils]: 84: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6277#false} is VALID [2018-11-14 16:52:27,547 INFO L273 TraceCheckUtils]: 85: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,547 INFO L273 TraceCheckUtils]: 86: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6277#false} is VALID [2018-11-14 16:52:27,548 INFO L273 TraceCheckUtils]: 87: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,548 INFO L273 TraceCheckUtils]: 88: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6277#false} is VALID [2018-11-14 16:52:27,548 INFO L273 TraceCheckUtils]: 89: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,548 INFO L273 TraceCheckUtils]: 90: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6277#false} is VALID [2018-11-14 16:52:27,548 INFO L273 TraceCheckUtils]: 91: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,548 INFO L273 TraceCheckUtils]: 92: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6277#false} is VALID [2018-11-14 16:52:27,548 INFO L273 TraceCheckUtils]: 93: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,548 INFO L273 TraceCheckUtils]: 94: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6277#false} is VALID [2018-11-14 16:52:27,549 INFO L273 TraceCheckUtils]: 95: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,549 INFO L273 TraceCheckUtils]: 96: Hoare triple {6277#false} assume !(~i~0 < 100000); {6277#false} is VALID [2018-11-14 16:52:27,549 INFO L273 TraceCheckUtils]: 97: Hoare triple {6277#false} havoc ~x~0;~x~0 := 0; {6277#false} is VALID [2018-11-14 16:52:27,549 INFO L273 TraceCheckUtils]: 98: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,549 INFO L273 TraceCheckUtils]: 99: Hoare triple {6277#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {6277#false} is VALID [2018-11-14 16:52:27,549 INFO L256 TraceCheckUtils]: 100: Hoare triple {6277#false} call __VERIFIER_assert((if #t~mem1 == 46 then 1 else 0)); {6277#false} is VALID [2018-11-14 16:52:27,549 INFO L273 TraceCheckUtils]: 101: Hoare triple {6277#false} ~cond := #in~cond; {6277#false} is VALID [2018-11-14 16:52:27,549 INFO L273 TraceCheckUtils]: 102: Hoare triple {6277#false} assume ~cond == 0; {6277#false} is VALID [2018-11-14 16:52:27,550 INFO L273 TraceCheckUtils]: 103: Hoare triple {6277#false} assume !false; {6277#false} is VALID [2018-11-14 16:52:27,554 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-11-14 16:52:27,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:52:27,554 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:52:27,563 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 16:52:27,603 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 16:52:27,603 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:52:27,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:27,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:52:27,759 INFO L256 TraceCheckUtils]: 0: Hoare triple {6276#true} call ULTIMATE.init(); {6276#true} is VALID [2018-11-14 16:52:27,759 INFO L273 TraceCheckUtils]: 1: Hoare triple {6276#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6276#true} is VALID [2018-11-14 16:52:27,759 INFO L273 TraceCheckUtils]: 2: Hoare triple {6276#true} assume true; {6276#true} is VALID [2018-11-14 16:52:27,759 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6276#true} {6276#true} #92#return; {6276#true} is VALID [2018-11-14 16:52:27,760 INFO L256 TraceCheckUtils]: 4: Hoare triple {6276#true} call #t~ret2 := main(); {6276#true} is VALID [2018-11-14 16:52:27,760 INFO L273 TraceCheckUtils]: 5: Hoare triple {6276#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6307#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:27,761 INFO L273 TraceCheckUtils]: 6: Hoare triple {6307#(<= main_~i~0 0)} assume true; {6307#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:27,762 INFO L273 TraceCheckUtils]: 7: Hoare triple {6307#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6279#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:27,762 INFO L273 TraceCheckUtils]: 8: Hoare triple {6279#(<= main_~i~0 1)} assume true; {6279#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:27,762 INFO L273 TraceCheckUtils]: 9: Hoare triple {6279#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6280#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:27,763 INFO L273 TraceCheckUtils]: 10: Hoare triple {6280#(<= main_~i~0 2)} assume true; {6280#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:27,764 INFO L273 TraceCheckUtils]: 11: Hoare triple {6280#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6281#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:27,764 INFO L273 TraceCheckUtils]: 12: Hoare triple {6281#(<= main_~i~0 3)} assume true; {6281#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:27,765 INFO L273 TraceCheckUtils]: 13: Hoare triple {6281#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6282#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:27,766 INFO L273 TraceCheckUtils]: 14: Hoare triple {6282#(<= main_~i~0 4)} assume true; {6282#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:27,767 INFO L273 TraceCheckUtils]: 15: Hoare triple {6282#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6283#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:27,767 INFO L273 TraceCheckUtils]: 16: Hoare triple {6283#(<= main_~i~0 5)} assume true; {6283#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:27,768 INFO L273 TraceCheckUtils]: 17: Hoare triple {6283#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6284#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:27,769 INFO L273 TraceCheckUtils]: 18: Hoare triple {6284#(<= main_~i~0 6)} assume true; {6284#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:27,770 INFO L273 TraceCheckUtils]: 19: Hoare triple {6284#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6285#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:27,770 INFO L273 TraceCheckUtils]: 20: Hoare triple {6285#(<= main_~i~0 7)} assume true; {6285#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:27,771 INFO L273 TraceCheckUtils]: 21: Hoare triple {6285#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6286#(<= main_~i~0 8)} is VALID [2018-11-14 16:52:27,772 INFO L273 TraceCheckUtils]: 22: Hoare triple {6286#(<= main_~i~0 8)} assume true; {6286#(<= main_~i~0 8)} is VALID [2018-11-14 16:52:27,773 INFO L273 TraceCheckUtils]: 23: Hoare triple {6286#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6287#(<= main_~i~0 9)} is VALID [2018-11-14 16:52:27,773 INFO L273 TraceCheckUtils]: 24: Hoare triple {6287#(<= main_~i~0 9)} assume true; {6287#(<= main_~i~0 9)} is VALID [2018-11-14 16:52:27,774 INFO L273 TraceCheckUtils]: 25: Hoare triple {6287#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6288#(<= main_~i~0 10)} is VALID [2018-11-14 16:52:27,775 INFO L273 TraceCheckUtils]: 26: Hoare triple {6288#(<= main_~i~0 10)} assume true; {6288#(<= main_~i~0 10)} is VALID [2018-11-14 16:52:27,775 INFO L273 TraceCheckUtils]: 27: Hoare triple {6288#(<= main_~i~0 10)} assume !(~i~0 < 100000); {6277#false} is VALID [2018-11-14 16:52:27,776 INFO L273 TraceCheckUtils]: 28: Hoare triple {6277#false} ~i~0 := 0; {6277#false} is VALID [2018-11-14 16:52:27,776 INFO L273 TraceCheckUtils]: 29: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,776 INFO L273 TraceCheckUtils]: 30: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6277#false} is VALID [2018-11-14 16:52:27,776 INFO L273 TraceCheckUtils]: 31: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,776 INFO L273 TraceCheckUtils]: 32: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6277#false} is VALID [2018-11-14 16:52:27,777 INFO L273 TraceCheckUtils]: 33: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,777 INFO L273 TraceCheckUtils]: 34: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6277#false} is VALID [2018-11-14 16:52:27,777 INFO L273 TraceCheckUtils]: 35: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,777 INFO L273 TraceCheckUtils]: 36: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6277#false} is VALID [2018-11-14 16:52:27,777 INFO L273 TraceCheckUtils]: 37: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,778 INFO L273 TraceCheckUtils]: 38: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6277#false} is VALID [2018-11-14 16:52:27,778 INFO L273 TraceCheckUtils]: 39: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,778 INFO L273 TraceCheckUtils]: 40: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6277#false} is VALID [2018-11-14 16:52:27,778 INFO L273 TraceCheckUtils]: 41: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,778 INFO L273 TraceCheckUtils]: 42: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6277#false} is VALID [2018-11-14 16:52:27,778 INFO L273 TraceCheckUtils]: 43: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,778 INFO L273 TraceCheckUtils]: 44: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6277#false} is VALID [2018-11-14 16:52:27,779 INFO L273 TraceCheckUtils]: 45: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,779 INFO L273 TraceCheckUtils]: 46: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6277#false} is VALID [2018-11-14 16:52:27,779 INFO L273 TraceCheckUtils]: 47: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,779 INFO L273 TraceCheckUtils]: 48: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6277#false} is VALID [2018-11-14 16:52:27,779 INFO L273 TraceCheckUtils]: 49: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,779 INFO L273 TraceCheckUtils]: 50: Hoare triple {6277#false} assume !(~i~0 < 100000); {6277#false} is VALID [2018-11-14 16:52:27,779 INFO L273 TraceCheckUtils]: 51: Hoare triple {6277#false} ~i~0 := 0; {6277#false} is VALID [2018-11-14 16:52:27,779 INFO L273 TraceCheckUtils]: 52: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,780 INFO L273 TraceCheckUtils]: 53: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6277#false} is VALID [2018-11-14 16:52:27,780 INFO L273 TraceCheckUtils]: 54: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,780 INFO L273 TraceCheckUtils]: 55: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6277#false} is VALID [2018-11-14 16:52:27,780 INFO L273 TraceCheckUtils]: 56: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,780 INFO L273 TraceCheckUtils]: 57: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6277#false} is VALID [2018-11-14 16:52:27,780 INFO L273 TraceCheckUtils]: 58: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,780 INFO L273 TraceCheckUtils]: 59: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6277#false} is VALID [2018-11-14 16:52:27,780 INFO L273 TraceCheckUtils]: 60: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,780 INFO L273 TraceCheckUtils]: 61: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6277#false} is VALID [2018-11-14 16:52:27,781 INFO L273 TraceCheckUtils]: 62: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,781 INFO L273 TraceCheckUtils]: 63: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6277#false} is VALID [2018-11-14 16:52:27,781 INFO L273 TraceCheckUtils]: 64: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,781 INFO L273 TraceCheckUtils]: 65: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6277#false} is VALID [2018-11-14 16:52:27,781 INFO L273 TraceCheckUtils]: 66: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,781 INFO L273 TraceCheckUtils]: 67: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6277#false} is VALID [2018-11-14 16:52:27,781 INFO L273 TraceCheckUtils]: 68: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,781 INFO L273 TraceCheckUtils]: 69: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6277#false} is VALID [2018-11-14 16:52:27,782 INFO L273 TraceCheckUtils]: 70: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,782 INFO L273 TraceCheckUtils]: 71: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6277#false} is VALID [2018-11-14 16:52:27,782 INFO L273 TraceCheckUtils]: 72: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,782 INFO L273 TraceCheckUtils]: 73: Hoare triple {6277#false} assume !(~i~0 < 100000); {6277#false} is VALID [2018-11-14 16:52:27,782 INFO L273 TraceCheckUtils]: 74: Hoare triple {6277#false} ~i~0 := 0; {6277#false} is VALID [2018-11-14 16:52:27,782 INFO L273 TraceCheckUtils]: 75: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,782 INFO L273 TraceCheckUtils]: 76: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6277#false} is VALID [2018-11-14 16:52:27,782 INFO L273 TraceCheckUtils]: 77: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,782 INFO L273 TraceCheckUtils]: 78: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6277#false} is VALID [2018-11-14 16:52:27,783 INFO L273 TraceCheckUtils]: 79: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,783 INFO L273 TraceCheckUtils]: 80: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6277#false} is VALID [2018-11-14 16:52:27,783 INFO L273 TraceCheckUtils]: 81: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,783 INFO L273 TraceCheckUtils]: 82: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6277#false} is VALID [2018-11-14 16:52:27,783 INFO L273 TraceCheckUtils]: 83: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,783 INFO L273 TraceCheckUtils]: 84: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6277#false} is VALID [2018-11-14 16:52:27,783 INFO L273 TraceCheckUtils]: 85: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,783 INFO L273 TraceCheckUtils]: 86: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6277#false} is VALID [2018-11-14 16:52:27,784 INFO L273 TraceCheckUtils]: 87: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,784 INFO L273 TraceCheckUtils]: 88: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6277#false} is VALID [2018-11-14 16:52:27,784 INFO L273 TraceCheckUtils]: 89: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,784 INFO L273 TraceCheckUtils]: 90: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6277#false} is VALID [2018-11-14 16:52:27,784 INFO L273 TraceCheckUtils]: 91: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,784 INFO L273 TraceCheckUtils]: 92: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6277#false} is VALID [2018-11-14 16:52:27,785 INFO L273 TraceCheckUtils]: 93: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,785 INFO L273 TraceCheckUtils]: 94: Hoare triple {6277#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6277#false} is VALID [2018-11-14 16:52:27,785 INFO L273 TraceCheckUtils]: 95: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,785 INFO L273 TraceCheckUtils]: 96: Hoare triple {6277#false} assume !(~i~0 < 100000); {6277#false} is VALID [2018-11-14 16:52:27,785 INFO L273 TraceCheckUtils]: 97: Hoare triple {6277#false} havoc ~x~0;~x~0 := 0; {6277#false} is VALID [2018-11-14 16:52:27,785 INFO L273 TraceCheckUtils]: 98: Hoare triple {6277#false} assume true; {6277#false} is VALID [2018-11-14 16:52:27,786 INFO L273 TraceCheckUtils]: 99: Hoare triple {6277#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {6277#false} is VALID [2018-11-14 16:52:27,786 INFO L256 TraceCheckUtils]: 100: Hoare triple {6277#false} call __VERIFIER_assert((if #t~mem1 == 46 then 1 else 0)); {6277#false} is VALID [2018-11-14 16:52:27,786 INFO L273 TraceCheckUtils]: 101: Hoare triple {6277#false} ~cond := #in~cond; {6277#false} is VALID [2018-11-14 16:52:27,786 INFO L273 TraceCheckUtils]: 102: Hoare triple {6277#false} assume ~cond == 0; {6277#false} is VALID [2018-11-14 16:52:27,787 INFO L273 TraceCheckUtils]: 103: Hoare triple {6277#false} assume !false; {6277#false} is VALID [2018-11-14 16:52:27,793 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-11-14 16:52:27,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:52:27,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-14 16:52:27,816 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 104 [2018-11-14 16:52:27,816 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:52:27,817 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-14 16:52:27,865 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:52:27,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-14 16:52:27,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-14 16:52:27,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-14 16:52:27,866 INFO L87 Difference]: Start difference. First operand 109 states and 113 transitions. Second operand 14 states. [2018-11-14 16:52:28,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:28,248 INFO L93 Difference]: Finished difference Result 198 states and 209 transitions. [2018-11-14 16:52:28,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-14 16:52:28,249 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 104 [2018-11-14 16:52:28,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:52:28,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 16:52:28,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 149 transitions. [2018-11-14 16:52:28,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 16:52:28,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 149 transitions. [2018-11-14 16:52:28,253 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 149 transitions. [2018-11-14 16:52:28,794 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:52:28,798 INFO L225 Difference]: With dead ends: 198 [2018-11-14 16:52:28,798 INFO L226 Difference]: Without dead ends: 117 [2018-11-14 16:52:28,799 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-14 16:52:28,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-14 16:52:29,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-11-14 16:52:29,334 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:52:29,334 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand 117 states. [2018-11-14 16:52:29,334 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 117 states. [2018-11-14 16:52:29,334 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 117 states. [2018-11-14 16:52:29,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:29,337 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2018-11-14 16:52:29,337 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2018-11-14 16:52:29,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:29,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:29,338 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 117 states. [2018-11-14 16:52:29,338 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 117 states. [2018-11-14 16:52:29,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:29,340 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2018-11-14 16:52:29,341 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2018-11-14 16:52:29,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:29,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:29,341 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:52:29,341 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:52:29,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-14 16:52:29,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 121 transitions. [2018-11-14 16:52:29,344 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 121 transitions. Word has length 104 [2018-11-14 16:52:29,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:52:29,345 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 121 transitions. [2018-11-14 16:52:29,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-14 16:52:29,345 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2018-11-14 16:52:29,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-14 16:52:29,346 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:52:29,346 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:52:29,346 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:52:29,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:52:29,347 INFO L82 PathProgramCache]: Analyzing trace with hash -842057859, now seen corresponding path program 11 times [2018-11-14 16:52:29,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:52:29,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:52:29,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:29,348 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:52:29,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:29,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:30,359 INFO L256 TraceCheckUtils]: 0: Hoare triple {7296#true} call ULTIMATE.init(); {7296#true} is VALID [2018-11-14 16:52:30,359 INFO L273 TraceCheckUtils]: 1: Hoare triple {7296#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7296#true} is VALID [2018-11-14 16:52:30,359 INFO L273 TraceCheckUtils]: 2: Hoare triple {7296#true} assume true; {7296#true} is VALID [2018-11-14 16:52:30,360 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7296#true} {7296#true} #92#return; {7296#true} is VALID [2018-11-14 16:52:30,360 INFO L256 TraceCheckUtils]: 4: Hoare triple {7296#true} call #t~ret2 := main(); {7296#true} is VALID [2018-11-14 16:52:30,360 INFO L273 TraceCheckUtils]: 5: Hoare triple {7296#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7298#(= main_~i~0 0)} is VALID [2018-11-14 16:52:30,361 INFO L273 TraceCheckUtils]: 6: Hoare triple {7298#(= main_~i~0 0)} assume true; {7298#(= main_~i~0 0)} is VALID [2018-11-14 16:52:30,362 INFO L273 TraceCheckUtils]: 7: Hoare triple {7298#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7299#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:30,362 INFO L273 TraceCheckUtils]: 8: Hoare triple {7299#(<= main_~i~0 1)} assume true; {7299#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:30,363 INFO L273 TraceCheckUtils]: 9: Hoare triple {7299#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7300#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:30,364 INFO L273 TraceCheckUtils]: 10: Hoare triple {7300#(<= main_~i~0 2)} assume true; {7300#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:30,365 INFO L273 TraceCheckUtils]: 11: Hoare triple {7300#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7301#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:30,365 INFO L273 TraceCheckUtils]: 12: Hoare triple {7301#(<= main_~i~0 3)} assume true; {7301#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:30,366 INFO L273 TraceCheckUtils]: 13: Hoare triple {7301#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7302#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:30,367 INFO L273 TraceCheckUtils]: 14: Hoare triple {7302#(<= main_~i~0 4)} assume true; {7302#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:30,368 INFO L273 TraceCheckUtils]: 15: Hoare triple {7302#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7303#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:30,368 INFO L273 TraceCheckUtils]: 16: Hoare triple {7303#(<= main_~i~0 5)} assume true; {7303#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:30,369 INFO L273 TraceCheckUtils]: 17: Hoare triple {7303#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7304#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:30,370 INFO L273 TraceCheckUtils]: 18: Hoare triple {7304#(<= main_~i~0 6)} assume true; {7304#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:30,371 INFO L273 TraceCheckUtils]: 19: Hoare triple {7304#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7305#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:30,371 INFO L273 TraceCheckUtils]: 20: Hoare triple {7305#(<= main_~i~0 7)} assume true; {7305#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:30,372 INFO L273 TraceCheckUtils]: 21: Hoare triple {7305#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7306#(<= main_~i~0 8)} is VALID [2018-11-14 16:52:30,373 INFO L273 TraceCheckUtils]: 22: Hoare triple {7306#(<= main_~i~0 8)} assume true; {7306#(<= main_~i~0 8)} is VALID [2018-11-14 16:52:30,374 INFO L273 TraceCheckUtils]: 23: Hoare triple {7306#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7307#(<= main_~i~0 9)} is VALID [2018-11-14 16:52:30,374 INFO L273 TraceCheckUtils]: 24: Hoare triple {7307#(<= main_~i~0 9)} assume true; {7307#(<= main_~i~0 9)} is VALID [2018-11-14 16:52:30,375 INFO L273 TraceCheckUtils]: 25: Hoare triple {7307#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7308#(<= main_~i~0 10)} is VALID [2018-11-14 16:52:30,376 INFO L273 TraceCheckUtils]: 26: Hoare triple {7308#(<= main_~i~0 10)} assume true; {7308#(<= main_~i~0 10)} is VALID [2018-11-14 16:52:30,377 INFO L273 TraceCheckUtils]: 27: Hoare triple {7308#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7309#(<= main_~i~0 11)} is VALID [2018-11-14 16:52:30,377 INFO L273 TraceCheckUtils]: 28: Hoare triple {7309#(<= main_~i~0 11)} assume true; {7309#(<= main_~i~0 11)} is VALID [2018-11-14 16:52:30,378 INFO L273 TraceCheckUtils]: 29: Hoare triple {7309#(<= main_~i~0 11)} assume !(~i~0 < 100000); {7297#false} is VALID [2018-11-14 16:52:30,378 INFO L273 TraceCheckUtils]: 30: Hoare triple {7297#false} ~i~0 := 0; {7297#false} is VALID [2018-11-14 16:52:30,378 INFO L273 TraceCheckUtils]: 31: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-14 16:52:30,379 INFO L273 TraceCheckUtils]: 32: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7297#false} is VALID [2018-11-14 16:52:30,379 INFO L273 TraceCheckUtils]: 33: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-14 16:52:30,379 INFO L273 TraceCheckUtils]: 34: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7297#false} is VALID [2018-11-14 16:52:30,379 INFO L273 TraceCheckUtils]: 35: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-14 16:52:30,379 INFO L273 TraceCheckUtils]: 36: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7297#false} is VALID [2018-11-14 16:52:30,380 INFO L273 TraceCheckUtils]: 37: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-14 16:52:30,380 INFO L273 TraceCheckUtils]: 38: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7297#false} is VALID [2018-11-14 16:52:30,380 INFO L273 TraceCheckUtils]: 39: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-14 16:52:30,380 INFO L273 TraceCheckUtils]: 40: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7297#false} is VALID [2018-11-14 16:52:30,380 INFO L273 TraceCheckUtils]: 41: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-14 16:52:30,381 INFO L273 TraceCheckUtils]: 42: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7297#false} is VALID [2018-11-14 16:52:30,381 INFO L273 TraceCheckUtils]: 43: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-14 16:52:30,381 INFO L273 TraceCheckUtils]: 44: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7297#false} is VALID [2018-11-14 16:52:30,381 INFO L273 TraceCheckUtils]: 45: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-14 16:52:30,381 INFO L273 TraceCheckUtils]: 46: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7297#false} is VALID [2018-11-14 16:52:30,382 INFO L273 TraceCheckUtils]: 47: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-14 16:52:30,382 INFO L273 TraceCheckUtils]: 48: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7297#false} is VALID [2018-11-14 16:52:30,382 INFO L273 TraceCheckUtils]: 49: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-14 16:52:30,382 INFO L273 TraceCheckUtils]: 50: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7297#false} is VALID [2018-11-14 16:52:30,382 INFO L273 TraceCheckUtils]: 51: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-14 16:52:30,383 INFO L273 TraceCheckUtils]: 52: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7297#false} is VALID [2018-11-14 16:52:30,383 INFO L273 TraceCheckUtils]: 53: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-14 16:52:30,383 INFO L273 TraceCheckUtils]: 54: Hoare triple {7297#false} assume !(~i~0 < 100000); {7297#false} is VALID [2018-11-14 16:52:30,383 INFO L273 TraceCheckUtils]: 55: Hoare triple {7297#false} ~i~0 := 0; {7297#false} is VALID [2018-11-14 16:52:30,383 INFO L273 TraceCheckUtils]: 56: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-14 16:52:30,383 INFO L273 TraceCheckUtils]: 57: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7297#false} is VALID [2018-11-14 16:52:30,383 INFO L273 TraceCheckUtils]: 58: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-14 16:52:30,384 INFO L273 TraceCheckUtils]: 59: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7297#false} is VALID [2018-11-14 16:52:30,384 INFO L273 TraceCheckUtils]: 60: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-14 16:52:30,384 INFO L273 TraceCheckUtils]: 61: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7297#false} is VALID [2018-11-14 16:52:30,384 INFO L273 TraceCheckUtils]: 62: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-14 16:52:30,384 INFO L273 TraceCheckUtils]: 63: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7297#false} is VALID [2018-11-14 16:52:30,384 INFO L273 TraceCheckUtils]: 64: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-14 16:52:30,384 INFO L273 TraceCheckUtils]: 65: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7297#false} is VALID [2018-11-14 16:52:30,384 INFO L273 TraceCheckUtils]: 66: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-14 16:52:30,384 INFO L273 TraceCheckUtils]: 67: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7297#false} is VALID [2018-11-14 16:52:30,385 INFO L273 TraceCheckUtils]: 68: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-14 16:52:30,385 INFO L273 TraceCheckUtils]: 69: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7297#false} is VALID [2018-11-14 16:52:30,385 INFO L273 TraceCheckUtils]: 70: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-14 16:52:30,385 INFO L273 TraceCheckUtils]: 71: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7297#false} is VALID [2018-11-14 16:52:30,385 INFO L273 TraceCheckUtils]: 72: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-14 16:52:30,385 INFO L273 TraceCheckUtils]: 73: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7297#false} is VALID [2018-11-14 16:52:30,385 INFO L273 TraceCheckUtils]: 74: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-14 16:52:30,385 INFO L273 TraceCheckUtils]: 75: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7297#false} is VALID [2018-11-14 16:52:30,386 INFO L273 TraceCheckUtils]: 76: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-14 16:52:30,386 INFO L273 TraceCheckUtils]: 77: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7297#false} is VALID [2018-11-14 16:52:30,386 INFO L273 TraceCheckUtils]: 78: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-14 16:52:30,386 INFO L273 TraceCheckUtils]: 79: Hoare triple {7297#false} assume !(~i~0 < 100000); {7297#false} is VALID [2018-11-14 16:52:30,386 INFO L273 TraceCheckUtils]: 80: Hoare triple {7297#false} ~i~0 := 0; {7297#false} is VALID [2018-11-14 16:52:30,386 INFO L273 TraceCheckUtils]: 81: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-14 16:52:30,386 INFO L273 TraceCheckUtils]: 82: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7297#false} is VALID [2018-11-14 16:52:30,386 INFO L273 TraceCheckUtils]: 83: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-14 16:52:30,386 INFO L273 TraceCheckUtils]: 84: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7297#false} is VALID [2018-11-14 16:52:30,387 INFO L273 TraceCheckUtils]: 85: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-14 16:52:30,387 INFO L273 TraceCheckUtils]: 86: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7297#false} is VALID [2018-11-14 16:52:30,387 INFO L273 TraceCheckUtils]: 87: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-14 16:52:30,387 INFO L273 TraceCheckUtils]: 88: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7297#false} is VALID [2018-11-14 16:52:30,387 INFO L273 TraceCheckUtils]: 89: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-14 16:52:30,387 INFO L273 TraceCheckUtils]: 90: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7297#false} is VALID [2018-11-14 16:52:30,387 INFO L273 TraceCheckUtils]: 91: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-14 16:52:30,387 INFO L273 TraceCheckUtils]: 92: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7297#false} is VALID [2018-11-14 16:52:30,388 INFO L273 TraceCheckUtils]: 93: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-14 16:52:30,388 INFO L273 TraceCheckUtils]: 94: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7297#false} is VALID [2018-11-14 16:52:30,388 INFO L273 TraceCheckUtils]: 95: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-14 16:52:30,388 INFO L273 TraceCheckUtils]: 96: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7297#false} is VALID [2018-11-14 16:52:30,388 INFO L273 TraceCheckUtils]: 97: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-14 16:52:30,388 INFO L273 TraceCheckUtils]: 98: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7297#false} is VALID [2018-11-14 16:52:30,388 INFO L273 TraceCheckUtils]: 99: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-14 16:52:30,388 INFO L273 TraceCheckUtils]: 100: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7297#false} is VALID [2018-11-14 16:52:30,388 INFO L273 TraceCheckUtils]: 101: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-14 16:52:30,389 INFO L273 TraceCheckUtils]: 102: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7297#false} is VALID [2018-11-14 16:52:30,389 INFO L273 TraceCheckUtils]: 103: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-14 16:52:30,389 INFO L273 TraceCheckUtils]: 104: Hoare triple {7297#false} assume !(~i~0 < 100000); {7297#false} is VALID [2018-11-14 16:52:30,389 INFO L273 TraceCheckUtils]: 105: Hoare triple {7297#false} havoc ~x~0;~x~0 := 0; {7297#false} is VALID [2018-11-14 16:52:30,389 INFO L273 TraceCheckUtils]: 106: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-14 16:52:30,389 INFO L273 TraceCheckUtils]: 107: Hoare triple {7297#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {7297#false} is VALID [2018-11-14 16:52:30,389 INFO L256 TraceCheckUtils]: 108: Hoare triple {7297#false} call __VERIFIER_assert((if #t~mem1 == 46 then 1 else 0)); {7297#false} is VALID [2018-11-14 16:52:30,389 INFO L273 TraceCheckUtils]: 109: Hoare triple {7297#false} ~cond := #in~cond; {7297#false} is VALID [2018-11-14 16:52:30,390 INFO L273 TraceCheckUtils]: 110: Hoare triple {7297#false} assume ~cond == 0; {7297#false} is VALID [2018-11-14 16:52:30,390 INFO L273 TraceCheckUtils]: 111: Hoare triple {7297#false} assume !false; {7297#false} is VALID [2018-11-14 16:52:30,395 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2018-11-14 16:52:30,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:52:30,395 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:52:30,404 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 16:53:14,570 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-14 16:53:14,571 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:53:14,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:53:14,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:53:15,032 INFO L256 TraceCheckUtils]: 0: Hoare triple {7296#true} call ULTIMATE.init(); {7296#true} is VALID [2018-11-14 16:53:15,033 INFO L273 TraceCheckUtils]: 1: Hoare triple {7296#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7296#true} is VALID [2018-11-14 16:53:15,033 INFO L273 TraceCheckUtils]: 2: Hoare triple {7296#true} assume true; {7296#true} is VALID [2018-11-14 16:53:15,033 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7296#true} {7296#true} #92#return; {7296#true} is VALID [2018-11-14 16:53:15,034 INFO L256 TraceCheckUtils]: 4: Hoare triple {7296#true} call #t~ret2 := main(); {7296#true} is VALID [2018-11-14 16:53:15,034 INFO L273 TraceCheckUtils]: 5: Hoare triple {7296#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7296#true} is VALID [2018-11-14 16:53:15,034 INFO L273 TraceCheckUtils]: 6: Hoare triple {7296#true} assume true; {7296#true} is VALID [2018-11-14 16:53:15,034 INFO L273 TraceCheckUtils]: 7: Hoare triple {7296#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7296#true} is VALID [2018-11-14 16:53:15,034 INFO L273 TraceCheckUtils]: 8: Hoare triple {7296#true} assume true; {7296#true} is VALID [2018-11-14 16:53:15,035 INFO L273 TraceCheckUtils]: 9: Hoare triple {7296#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7296#true} is VALID [2018-11-14 16:53:15,035 INFO L273 TraceCheckUtils]: 10: Hoare triple {7296#true} assume true; {7296#true} is VALID [2018-11-14 16:53:15,035 INFO L273 TraceCheckUtils]: 11: Hoare triple {7296#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7296#true} is VALID [2018-11-14 16:53:15,035 INFO L273 TraceCheckUtils]: 12: Hoare triple {7296#true} assume true; {7296#true} is VALID [2018-11-14 16:53:15,035 INFO L273 TraceCheckUtils]: 13: Hoare triple {7296#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7296#true} is VALID [2018-11-14 16:53:15,035 INFO L273 TraceCheckUtils]: 14: Hoare triple {7296#true} assume true; {7296#true} is VALID [2018-11-14 16:53:15,035 INFO L273 TraceCheckUtils]: 15: Hoare triple {7296#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7296#true} is VALID [2018-11-14 16:53:15,035 INFO L273 TraceCheckUtils]: 16: Hoare triple {7296#true} assume true; {7296#true} is VALID [2018-11-14 16:53:15,036 INFO L273 TraceCheckUtils]: 17: Hoare triple {7296#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7296#true} is VALID [2018-11-14 16:53:15,036 INFO L273 TraceCheckUtils]: 18: Hoare triple {7296#true} assume true; {7296#true} is VALID [2018-11-14 16:53:15,036 INFO L273 TraceCheckUtils]: 19: Hoare triple {7296#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7296#true} is VALID [2018-11-14 16:53:15,036 INFO L273 TraceCheckUtils]: 20: Hoare triple {7296#true} assume true; {7296#true} is VALID [2018-11-14 16:53:15,036 INFO L273 TraceCheckUtils]: 21: Hoare triple {7296#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7296#true} is VALID [2018-11-14 16:53:15,037 INFO L273 TraceCheckUtils]: 22: Hoare triple {7296#true} assume true; {7296#true} is VALID [2018-11-14 16:53:15,037 INFO L273 TraceCheckUtils]: 23: Hoare triple {7296#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7296#true} is VALID [2018-11-14 16:53:15,037 INFO L273 TraceCheckUtils]: 24: Hoare triple {7296#true} assume true; {7296#true} is VALID [2018-11-14 16:53:15,037 INFO L273 TraceCheckUtils]: 25: Hoare triple {7296#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7296#true} is VALID [2018-11-14 16:53:15,037 INFO L273 TraceCheckUtils]: 26: Hoare triple {7296#true} assume true; {7296#true} is VALID [2018-11-14 16:53:15,037 INFO L273 TraceCheckUtils]: 27: Hoare triple {7296#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7296#true} is VALID [2018-11-14 16:53:15,038 INFO L273 TraceCheckUtils]: 28: Hoare triple {7296#true} assume true; {7296#true} is VALID [2018-11-14 16:53:15,038 INFO L273 TraceCheckUtils]: 29: Hoare triple {7296#true} assume !(~i~0 < 100000); {7296#true} is VALID [2018-11-14 16:53:15,053 INFO L273 TraceCheckUtils]: 30: Hoare triple {7296#true} ~i~0 := 0; {7403#(<= main_~i~0 0)} is VALID [2018-11-14 16:53:15,059 INFO L273 TraceCheckUtils]: 31: Hoare triple {7403#(<= main_~i~0 0)} assume true; {7403#(<= main_~i~0 0)} is VALID [2018-11-14 16:53:15,060 INFO L273 TraceCheckUtils]: 32: Hoare triple {7403#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7299#(<= main_~i~0 1)} is VALID [2018-11-14 16:53:15,061 INFO L273 TraceCheckUtils]: 33: Hoare triple {7299#(<= main_~i~0 1)} assume true; {7299#(<= main_~i~0 1)} is VALID [2018-11-14 16:53:15,061 INFO L273 TraceCheckUtils]: 34: Hoare triple {7299#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7300#(<= main_~i~0 2)} is VALID [2018-11-14 16:53:15,064 INFO L273 TraceCheckUtils]: 35: Hoare triple {7300#(<= main_~i~0 2)} assume true; {7300#(<= main_~i~0 2)} is VALID [2018-11-14 16:53:15,064 INFO L273 TraceCheckUtils]: 36: Hoare triple {7300#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7301#(<= main_~i~0 3)} is VALID [2018-11-14 16:53:15,065 INFO L273 TraceCheckUtils]: 37: Hoare triple {7301#(<= main_~i~0 3)} assume true; {7301#(<= main_~i~0 3)} is VALID [2018-11-14 16:53:15,065 INFO L273 TraceCheckUtils]: 38: Hoare triple {7301#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7302#(<= main_~i~0 4)} is VALID [2018-11-14 16:53:15,066 INFO L273 TraceCheckUtils]: 39: Hoare triple {7302#(<= main_~i~0 4)} assume true; {7302#(<= main_~i~0 4)} is VALID [2018-11-14 16:53:15,066 INFO L273 TraceCheckUtils]: 40: Hoare triple {7302#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7303#(<= main_~i~0 5)} is VALID [2018-11-14 16:53:15,066 INFO L273 TraceCheckUtils]: 41: Hoare triple {7303#(<= main_~i~0 5)} assume true; {7303#(<= main_~i~0 5)} is VALID [2018-11-14 16:53:15,067 INFO L273 TraceCheckUtils]: 42: Hoare triple {7303#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7304#(<= main_~i~0 6)} is VALID [2018-11-14 16:53:15,068 INFO L273 TraceCheckUtils]: 43: Hoare triple {7304#(<= main_~i~0 6)} assume true; {7304#(<= main_~i~0 6)} is VALID [2018-11-14 16:53:15,069 INFO L273 TraceCheckUtils]: 44: Hoare triple {7304#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7305#(<= main_~i~0 7)} is VALID [2018-11-14 16:53:15,069 INFO L273 TraceCheckUtils]: 45: Hoare triple {7305#(<= main_~i~0 7)} assume true; {7305#(<= main_~i~0 7)} is VALID [2018-11-14 16:53:15,070 INFO L273 TraceCheckUtils]: 46: Hoare triple {7305#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7306#(<= main_~i~0 8)} is VALID [2018-11-14 16:53:15,071 INFO L273 TraceCheckUtils]: 47: Hoare triple {7306#(<= main_~i~0 8)} assume true; {7306#(<= main_~i~0 8)} is VALID [2018-11-14 16:53:15,072 INFO L273 TraceCheckUtils]: 48: Hoare triple {7306#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7307#(<= main_~i~0 9)} is VALID [2018-11-14 16:53:15,072 INFO L273 TraceCheckUtils]: 49: Hoare triple {7307#(<= main_~i~0 9)} assume true; {7307#(<= main_~i~0 9)} is VALID [2018-11-14 16:53:15,073 INFO L273 TraceCheckUtils]: 50: Hoare triple {7307#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7308#(<= main_~i~0 10)} is VALID [2018-11-14 16:53:15,074 INFO L273 TraceCheckUtils]: 51: Hoare triple {7308#(<= main_~i~0 10)} assume true; {7308#(<= main_~i~0 10)} is VALID [2018-11-14 16:53:15,075 INFO L273 TraceCheckUtils]: 52: Hoare triple {7308#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7309#(<= main_~i~0 11)} is VALID [2018-11-14 16:53:15,075 INFO L273 TraceCheckUtils]: 53: Hoare triple {7309#(<= main_~i~0 11)} assume true; {7309#(<= main_~i~0 11)} is VALID [2018-11-14 16:53:15,076 INFO L273 TraceCheckUtils]: 54: Hoare triple {7309#(<= main_~i~0 11)} assume !(~i~0 < 100000); {7297#false} is VALID [2018-11-14 16:53:15,076 INFO L273 TraceCheckUtils]: 55: Hoare triple {7297#false} ~i~0 := 0; {7297#false} is VALID [2018-11-14 16:53:15,076 INFO L273 TraceCheckUtils]: 56: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-14 16:53:15,077 INFO L273 TraceCheckUtils]: 57: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7297#false} is VALID [2018-11-14 16:53:15,077 INFO L273 TraceCheckUtils]: 58: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-14 16:53:15,077 INFO L273 TraceCheckUtils]: 59: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7297#false} is VALID [2018-11-14 16:53:15,077 INFO L273 TraceCheckUtils]: 60: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-14 16:53:15,077 INFO L273 TraceCheckUtils]: 61: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7297#false} is VALID [2018-11-14 16:53:15,078 INFO L273 TraceCheckUtils]: 62: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-14 16:53:15,078 INFO L273 TraceCheckUtils]: 63: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7297#false} is VALID [2018-11-14 16:53:15,078 INFO L273 TraceCheckUtils]: 64: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-14 16:53:15,078 INFO L273 TraceCheckUtils]: 65: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7297#false} is VALID [2018-11-14 16:53:15,078 INFO L273 TraceCheckUtils]: 66: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-14 16:53:15,079 INFO L273 TraceCheckUtils]: 67: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7297#false} is VALID [2018-11-14 16:53:15,079 INFO L273 TraceCheckUtils]: 68: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-14 16:53:15,079 INFO L273 TraceCheckUtils]: 69: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7297#false} is VALID [2018-11-14 16:53:15,079 INFO L273 TraceCheckUtils]: 70: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-14 16:53:15,079 INFO L273 TraceCheckUtils]: 71: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7297#false} is VALID [2018-11-14 16:53:15,079 INFO L273 TraceCheckUtils]: 72: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-14 16:53:15,079 INFO L273 TraceCheckUtils]: 73: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7297#false} is VALID [2018-11-14 16:53:15,079 INFO L273 TraceCheckUtils]: 74: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-14 16:53:15,079 INFO L273 TraceCheckUtils]: 75: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7297#false} is VALID [2018-11-14 16:53:15,080 INFO L273 TraceCheckUtils]: 76: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-14 16:53:15,080 INFO L273 TraceCheckUtils]: 77: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7297#false} is VALID [2018-11-14 16:53:15,080 INFO L273 TraceCheckUtils]: 78: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-14 16:53:15,080 INFO L273 TraceCheckUtils]: 79: Hoare triple {7297#false} assume !(~i~0 < 100000); {7297#false} is VALID [2018-11-14 16:53:15,080 INFO L273 TraceCheckUtils]: 80: Hoare triple {7297#false} ~i~0 := 0; {7297#false} is VALID [2018-11-14 16:53:15,080 INFO L273 TraceCheckUtils]: 81: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-14 16:53:15,080 INFO L273 TraceCheckUtils]: 82: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7297#false} is VALID [2018-11-14 16:53:15,080 INFO L273 TraceCheckUtils]: 83: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-14 16:53:15,081 INFO L273 TraceCheckUtils]: 84: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7297#false} is VALID [2018-11-14 16:53:15,081 INFO L273 TraceCheckUtils]: 85: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-14 16:53:15,081 INFO L273 TraceCheckUtils]: 86: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7297#false} is VALID [2018-11-14 16:53:15,081 INFO L273 TraceCheckUtils]: 87: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-14 16:53:15,081 INFO L273 TraceCheckUtils]: 88: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7297#false} is VALID [2018-11-14 16:53:15,081 INFO L273 TraceCheckUtils]: 89: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-14 16:53:15,081 INFO L273 TraceCheckUtils]: 90: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7297#false} is VALID [2018-11-14 16:53:15,081 INFO L273 TraceCheckUtils]: 91: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-14 16:53:15,081 INFO L273 TraceCheckUtils]: 92: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7297#false} is VALID [2018-11-14 16:53:15,082 INFO L273 TraceCheckUtils]: 93: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-14 16:53:15,082 INFO L273 TraceCheckUtils]: 94: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7297#false} is VALID [2018-11-14 16:53:15,082 INFO L273 TraceCheckUtils]: 95: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-14 16:53:15,082 INFO L273 TraceCheckUtils]: 96: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7297#false} is VALID [2018-11-14 16:53:15,082 INFO L273 TraceCheckUtils]: 97: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-14 16:53:15,082 INFO L273 TraceCheckUtils]: 98: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7297#false} is VALID [2018-11-14 16:53:15,082 INFO L273 TraceCheckUtils]: 99: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-14 16:53:15,082 INFO L273 TraceCheckUtils]: 100: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7297#false} is VALID [2018-11-14 16:53:15,083 INFO L273 TraceCheckUtils]: 101: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-14 16:53:15,083 INFO L273 TraceCheckUtils]: 102: Hoare triple {7297#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7297#false} is VALID [2018-11-14 16:53:15,083 INFO L273 TraceCheckUtils]: 103: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-14 16:53:15,083 INFO L273 TraceCheckUtils]: 104: Hoare triple {7297#false} assume !(~i~0 < 100000); {7297#false} is VALID [2018-11-14 16:53:15,083 INFO L273 TraceCheckUtils]: 105: Hoare triple {7297#false} havoc ~x~0;~x~0 := 0; {7297#false} is VALID [2018-11-14 16:53:15,083 INFO L273 TraceCheckUtils]: 106: Hoare triple {7297#false} assume true; {7297#false} is VALID [2018-11-14 16:53:15,083 INFO L273 TraceCheckUtils]: 107: Hoare triple {7297#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {7297#false} is VALID [2018-11-14 16:53:15,083 INFO L256 TraceCheckUtils]: 108: Hoare triple {7297#false} call __VERIFIER_assert((if #t~mem1 == 46 then 1 else 0)); {7297#false} is VALID [2018-11-14 16:53:15,084 INFO L273 TraceCheckUtils]: 109: Hoare triple {7297#false} ~cond := #in~cond; {7297#false} is VALID [2018-11-14 16:53:15,084 INFO L273 TraceCheckUtils]: 110: Hoare triple {7297#false} assume ~cond == 0; {7297#false} is VALID [2018-11-14 16:53:15,084 INFO L273 TraceCheckUtils]: 111: Hoare triple {7297#false} assume !false; {7297#false} is VALID [2018-11-14 16:53:15,089 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2018-11-14 16:53:15,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:53:15,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-14 16:53:15,116 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 112 [2018-11-14 16:53:15,117 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:53:15,117 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-14 16:53:15,186 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:53:15,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-14 16:53:15,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-14 16:53:15,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-14 16:53:15,187 INFO L87 Difference]: Start difference. First operand 117 states and 121 transitions. Second operand 15 states. [2018-11-14 16:53:16,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:53:16,276 INFO L93 Difference]: Finished difference Result 212 states and 223 transitions. [2018-11-14 16:53:16,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-14 16:53:16,276 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 112 [2018-11-14 16:53:16,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:53:16,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 16:53:16,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 157 transitions. [2018-11-14 16:53:16,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 16:53:16,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 157 transitions. [2018-11-14 16:53:16,281 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 157 transitions. [2018-11-14 16:53:16,837 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:53:16,841 INFO L225 Difference]: With dead ends: 212 [2018-11-14 16:53:16,841 INFO L226 Difference]: Without dead ends: 125 [2018-11-14 16:53:16,842 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-14 16:53:16,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-14 16:53:16,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-11-14 16:53:16,888 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:53:16,888 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand 125 states. [2018-11-14 16:53:16,889 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 125 states. [2018-11-14 16:53:16,889 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 125 states. [2018-11-14 16:53:16,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:53:16,891 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2018-11-14 16:53:16,892 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2018-11-14 16:53:16,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:53:16,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:53:16,892 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 125 states. [2018-11-14 16:53:16,893 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 125 states. [2018-11-14 16:53:16,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:53:16,895 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2018-11-14 16:53:16,895 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2018-11-14 16:53:16,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:53:16,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:53:16,896 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:53:16,896 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:53:16,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-14 16:53:16,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 129 transitions. [2018-11-14 16:53:16,899 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 129 transitions. Word has length 112 [2018-11-14 16:53:16,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:53:16,899 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 129 transitions. [2018-11-14 16:53:16,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-14 16:53:16,899 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2018-11-14 16:53:16,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-14 16:53:16,900 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:53:16,901 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:53:16,901 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:53:16,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:53:16,901 INFO L82 PathProgramCache]: Analyzing trace with hash -524695299, now seen corresponding path program 12 times [2018-11-14 16:53:16,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:53:16,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:53:16,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:53:16,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:53:16,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:53:16,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:53:17,567 INFO L256 TraceCheckUtils]: 0: Hoare triple {8390#true} call ULTIMATE.init(); {8390#true} is VALID [2018-11-14 16:53:17,567 INFO L273 TraceCheckUtils]: 1: Hoare triple {8390#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8390#true} is VALID [2018-11-14 16:53:17,567 INFO L273 TraceCheckUtils]: 2: Hoare triple {8390#true} assume true; {8390#true} is VALID [2018-11-14 16:53:17,567 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8390#true} {8390#true} #92#return; {8390#true} is VALID [2018-11-14 16:53:17,568 INFO L256 TraceCheckUtils]: 4: Hoare triple {8390#true} call #t~ret2 := main(); {8390#true} is VALID [2018-11-14 16:53:17,568 INFO L273 TraceCheckUtils]: 5: Hoare triple {8390#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8392#(= main_~i~0 0)} is VALID [2018-11-14 16:53:17,568 INFO L273 TraceCheckUtils]: 6: Hoare triple {8392#(= main_~i~0 0)} assume true; {8392#(= main_~i~0 0)} is VALID [2018-11-14 16:53:17,569 INFO L273 TraceCheckUtils]: 7: Hoare triple {8392#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8393#(<= main_~i~0 1)} is VALID [2018-11-14 16:53:17,569 INFO L273 TraceCheckUtils]: 8: Hoare triple {8393#(<= main_~i~0 1)} assume true; {8393#(<= main_~i~0 1)} is VALID [2018-11-14 16:53:17,570 INFO L273 TraceCheckUtils]: 9: Hoare triple {8393#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8394#(<= main_~i~0 2)} is VALID [2018-11-14 16:53:17,570 INFO L273 TraceCheckUtils]: 10: Hoare triple {8394#(<= main_~i~0 2)} assume true; {8394#(<= main_~i~0 2)} is VALID [2018-11-14 16:53:17,571 INFO L273 TraceCheckUtils]: 11: Hoare triple {8394#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8395#(<= main_~i~0 3)} is VALID [2018-11-14 16:53:17,571 INFO L273 TraceCheckUtils]: 12: Hoare triple {8395#(<= main_~i~0 3)} assume true; {8395#(<= main_~i~0 3)} is VALID [2018-11-14 16:53:17,572 INFO L273 TraceCheckUtils]: 13: Hoare triple {8395#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8396#(<= main_~i~0 4)} is VALID [2018-11-14 16:53:17,573 INFO L273 TraceCheckUtils]: 14: Hoare triple {8396#(<= main_~i~0 4)} assume true; {8396#(<= main_~i~0 4)} is VALID [2018-11-14 16:53:17,573 INFO L273 TraceCheckUtils]: 15: Hoare triple {8396#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8397#(<= main_~i~0 5)} is VALID [2018-11-14 16:53:17,574 INFO L273 TraceCheckUtils]: 16: Hoare triple {8397#(<= main_~i~0 5)} assume true; {8397#(<= main_~i~0 5)} is VALID [2018-11-14 16:53:17,575 INFO L273 TraceCheckUtils]: 17: Hoare triple {8397#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8398#(<= main_~i~0 6)} is VALID [2018-11-14 16:53:17,575 INFO L273 TraceCheckUtils]: 18: Hoare triple {8398#(<= main_~i~0 6)} assume true; {8398#(<= main_~i~0 6)} is VALID [2018-11-14 16:53:17,576 INFO L273 TraceCheckUtils]: 19: Hoare triple {8398#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8399#(<= main_~i~0 7)} is VALID [2018-11-14 16:53:17,577 INFO L273 TraceCheckUtils]: 20: Hoare triple {8399#(<= main_~i~0 7)} assume true; {8399#(<= main_~i~0 7)} is VALID [2018-11-14 16:53:17,577 INFO L273 TraceCheckUtils]: 21: Hoare triple {8399#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8400#(<= main_~i~0 8)} is VALID [2018-11-14 16:53:17,578 INFO L273 TraceCheckUtils]: 22: Hoare triple {8400#(<= main_~i~0 8)} assume true; {8400#(<= main_~i~0 8)} is VALID [2018-11-14 16:53:17,579 INFO L273 TraceCheckUtils]: 23: Hoare triple {8400#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8401#(<= main_~i~0 9)} is VALID [2018-11-14 16:53:17,579 INFO L273 TraceCheckUtils]: 24: Hoare triple {8401#(<= main_~i~0 9)} assume true; {8401#(<= main_~i~0 9)} is VALID [2018-11-14 16:53:17,580 INFO L273 TraceCheckUtils]: 25: Hoare triple {8401#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8402#(<= main_~i~0 10)} is VALID [2018-11-14 16:53:17,581 INFO L273 TraceCheckUtils]: 26: Hoare triple {8402#(<= main_~i~0 10)} assume true; {8402#(<= main_~i~0 10)} is VALID [2018-11-14 16:53:17,582 INFO L273 TraceCheckUtils]: 27: Hoare triple {8402#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8403#(<= main_~i~0 11)} is VALID [2018-11-14 16:53:17,582 INFO L273 TraceCheckUtils]: 28: Hoare triple {8403#(<= main_~i~0 11)} assume true; {8403#(<= main_~i~0 11)} is VALID [2018-11-14 16:53:17,583 INFO L273 TraceCheckUtils]: 29: Hoare triple {8403#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8404#(<= main_~i~0 12)} is VALID [2018-11-14 16:53:17,583 INFO L273 TraceCheckUtils]: 30: Hoare triple {8404#(<= main_~i~0 12)} assume true; {8404#(<= main_~i~0 12)} is VALID [2018-11-14 16:53:17,584 INFO L273 TraceCheckUtils]: 31: Hoare triple {8404#(<= main_~i~0 12)} assume !(~i~0 < 100000); {8391#false} is VALID [2018-11-14 16:53:17,584 INFO L273 TraceCheckUtils]: 32: Hoare triple {8391#false} ~i~0 := 0; {8391#false} is VALID [2018-11-14 16:53:17,584 INFO L273 TraceCheckUtils]: 33: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-14 16:53:17,585 INFO L273 TraceCheckUtils]: 34: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8391#false} is VALID [2018-11-14 16:53:17,585 INFO L273 TraceCheckUtils]: 35: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-14 16:53:17,585 INFO L273 TraceCheckUtils]: 36: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8391#false} is VALID [2018-11-14 16:53:17,585 INFO L273 TraceCheckUtils]: 37: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-14 16:53:17,585 INFO L273 TraceCheckUtils]: 38: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8391#false} is VALID [2018-11-14 16:53:17,586 INFO L273 TraceCheckUtils]: 39: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-14 16:53:17,586 INFO L273 TraceCheckUtils]: 40: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8391#false} is VALID [2018-11-14 16:53:17,586 INFO L273 TraceCheckUtils]: 41: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-14 16:53:17,586 INFO L273 TraceCheckUtils]: 42: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8391#false} is VALID [2018-11-14 16:53:17,586 INFO L273 TraceCheckUtils]: 43: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-14 16:53:17,586 INFO L273 TraceCheckUtils]: 44: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8391#false} is VALID [2018-11-14 16:53:17,586 INFO L273 TraceCheckUtils]: 45: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-14 16:53:17,587 INFO L273 TraceCheckUtils]: 46: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8391#false} is VALID [2018-11-14 16:53:17,587 INFO L273 TraceCheckUtils]: 47: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-14 16:53:17,587 INFO L273 TraceCheckUtils]: 48: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8391#false} is VALID [2018-11-14 16:53:17,587 INFO L273 TraceCheckUtils]: 49: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-14 16:53:17,587 INFO L273 TraceCheckUtils]: 50: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8391#false} is VALID [2018-11-14 16:53:17,587 INFO L273 TraceCheckUtils]: 51: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-14 16:53:17,587 INFO L273 TraceCheckUtils]: 52: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8391#false} is VALID [2018-11-14 16:53:17,587 INFO L273 TraceCheckUtils]: 53: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-14 16:53:17,588 INFO L273 TraceCheckUtils]: 54: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8391#false} is VALID [2018-11-14 16:53:17,588 INFO L273 TraceCheckUtils]: 55: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-14 16:53:17,588 INFO L273 TraceCheckUtils]: 56: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8391#false} is VALID [2018-11-14 16:53:17,588 INFO L273 TraceCheckUtils]: 57: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-14 16:53:17,588 INFO L273 TraceCheckUtils]: 58: Hoare triple {8391#false} assume !(~i~0 < 100000); {8391#false} is VALID [2018-11-14 16:53:17,588 INFO L273 TraceCheckUtils]: 59: Hoare triple {8391#false} ~i~0 := 0; {8391#false} is VALID [2018-11-14 16:53:17,588 INFO L273 TraceCheckUtils]: 60: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-14 16:53:17,588 INFO L273 TraceCheckUtils]: 61: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8391#false} is VALID [2018-11-14 16:53:17,588 INFO L273 TraceCheckUtils]: 62: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-14 16:53:17,589 INFO L273 TraceCheckUtils]: 63: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8391#false} is VALID [2018-11-14 16:53:17,589 INFO L273 TraceCheckUtils]: 64: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-14 16:53:17,589 INFO L273 TraceCheckUtils]: 65: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8391#false} is VALID [2018-11-14 16:53:17,589 INFO L273 TraceCheckUtils]: 66: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-14 16:53:17,589 INFO L273 TraceCheckUtils]: 67: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8391#false} is VALID [2018-11-14 16:53:17,589 INFO L273 TraceCheckUtils]: 68: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-14 16:53:17,589 INFO L273 TraceCheckUtils]: 69: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8391#false} is VALID [2018-11-14 16:53:17,589 INFO L273 TraceCheckUtils]: 70: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-14 16:53:17,589 INFO L273 TraceCheckUtils]: 71: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8391#false} is VALID [2018-11-14 16:53:17,590 INFO L273 TraceCheckUtils]: 72: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-14 16:53:17,590 INFO L273 TraceCheckUtils]: 73: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8391#false} is VALID [2018-11-14 16:53:17,590 INFO L273 TraceCheckUtils]: 74: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-14 16:53:17,590 INFO L273 TraceCheckUtils]: 75: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8391#false} is VALID [2018-11-14 16:53:17,590 INFO L273 TraceCheckUtils]: 76: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-14 16:53:17,590 INFO L273 TraceCheckUtils]: 77: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8391#false} is VALID [2018-11-14 16:53:17,590 INFO L273 TraceCheckUtils]: 78: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-14 16:53:17,591 INFO L273 TraceCheckUtils]: 79: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8391#false} is VALID [2018-11-14 16:53:17,591 INFO L273 TraceCheckUtils]: 80: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-14 16:53:17,591 INFO L273 TraceCheckUtils]: 81: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8391#false} is VALID [2018-11-14 16:53:17,591 INFO L273 TraceCheckUtils]: 82: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-14 16:53:17,591 INFO L273 TraceCheckUtils]: 83: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8391#false} is VALID [2018-11-14 16:53:17,591 INFO L273 TraceCheckUtils]: 84: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-14 16:53:17,592 INFO L273 TraceCheckUtils]: 85: Hoare triple {8391#false} assume !(~i~0 < 100000); {8391#false} is VALID [2018-11-14 16:53:17,592 INFO L273 TraceCheckUtils]: 86: Hoare triple {8391#false} ~i~0 := 0; {8391#false} is VALID [2018-11-14 16:53:17,592 INFO L273 TraceCheckUtils]: 87: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-14 16:53:17,592 INFO L273 TraceCheckUtils]: 88: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8391#false} is VALID [2018-11-14 16:53:17,592 INFO L273 TraceCheckUtils]: 89: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-14 16:53:17,592 INFO L273 TraceCheckUtils]: 90: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8391#false} is VALID [2018-11-14 16:53:17,593 INFO L273 TraceCheckUtils]: 91: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-14 16:53:17,593 INFO L273 TraceCheckUtils]: 92: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8391#false} is VALID [2018-11-14 16:53:17,593 INFO L273 TraceCheckUtils]: 93: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-14 16:53:17,593 INFO L273 TraceCheckUtils]: 94: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8391#false} is VALID [2018-11-14 16:53:17,593 INFO L273 TraceCheckUtils]: 95: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-14 16:53:17,593 INFO L273 TraceCheckUtils]: 96: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8391#false} is VALID [2018-11-14 16:53:17,593 INFO L273 TraceCheckUtils]: 97: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-14 16:53:17,594 INFO L273 TraceCheckUtils]: 98: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8391#false} is VALID [2018-11-14 16:53:17,594 INFO L273 TraceCheckUtils]: 99: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-14 16:53:17,594 INFO L273 TraceCheckUtils]: 100: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8391#false} is VALID [2018-11-14 16:53:17,594 INFO L273 TraceCheckUtils]: 101: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-14 16:53:17,594 INFO L273 TraceCheckUtils]: 102: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8391#false} is VALID [2018-11-14 16:53:17,594 INFO L273 TraceCheckUtils]: 103: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-14 16:53:17,595 INFO L273 TraceCheckUtils]: 104: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8391#false} is VALID [2018-11-14 16:53:17,595 INFO L273 TraceCheckUtils]: 105: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-14 16:53:17,595 INFO L273 TraceCheckUtils]: 106: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8391#false} is VALID [2018-11-14 16:53:17,595 INFO L273 TraceCheckUtils]: 107: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-14 16:53:17,595 INFO L273 TraceCheckUtils]: 108: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8391#false} is VALID [2018-11-14 16:53:17,595 INFO L273 TraceCheckUtils]: 109: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-14 16:53:17,596 INFO L273 TraceCheckUtils]: 110: Hoare triple {8391#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8391#false} is VALID [2018-11-14 16:53:17,596 INFO L273 TraceCheckUtils]: 111: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-14 16:53:17,596 INFO L273 TraceCheckUtils]: 112: Hoare triple {8391#false} assume !(~i~0 < 100000); {8391#false} is VALID [2018-11-14 16:53:17,596 INFO L273 TraceCheckUtils]: 113: Hoare triple {8391#false} havoc ~x~0;~x~0 := 0; {8391#false} is VALID [2018-11-14 16:53:17,596 INFO L273 TraceCheckUtils]: 114: Hoare triple {8391#false} assume true; {8391#false} is VALID [2018-11-14 16:53:17,596 INFO L273 TraceCheckUtils]: 115: Hoare triple {8391#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {8391#false} is VALID [2018-11-14 16:53:17,597 INFO L256 TraceCheckUtils]: 116: Hoare triple {8391#false} call __VERIFIER_assert((if #t~mem1 == 46 then 1 else 0)); {8391#false} is VALID [2018-11-14 16:53:17,597 INFO L273 TraceCheckUtils]: 117: Hoare triple {8391#false} ~cond := #in~cond; {8391#false} is VALID [2018-11-14 16:53:17,597 INFO L273 TraceCheckUtils]: 118: Hoare triple {8391#false} assume ~cond == 0; {8391#false} is VALID [2018-11-14 16:53:17,597 INFO L273 TraceCheckUtils]: 119: Hoare triple {8391#false} assume !false; {8391#false} is VALID [2018-11-14 16:53:17,605 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2018-11-14 16:53:17,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:53:17,605 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:53:17,614 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE