java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/array-examples/standard_init3_false-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 09:58:31,881 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 09:58:31,883 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 09:58:31,895 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 09:58:31,896 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 09:58:31,897 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 09:58:31,898 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 09:58:31,900 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 09:58:31,902 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 09:58:31,903 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 09:58:31,904 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 09:58:31,904 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 09:58:31,905 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 09:58:31,906 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 09:58:31,907 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 09:58:31,908 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 09:58:31,909 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 09:58:31,911 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 09:58:31,913 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 09:58:31,915 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 09:58:31,916 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 09:58:31,917 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 09:58:31,922 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 09:58:31,922 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 09:58:31,922 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 09:58:31,923 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 09:58:31,928 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 09:58:31,929 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 09:58:31,930 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 09:58:31,931 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 09:58:31,931 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 09:58:31,932 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 09:58:31,932 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 09:58:31,933 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 09:58:31,934 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 09:58:31,934 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 09:58:31,935 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 09:58:31,959 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 09:58:31,959 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 09:58:31,960 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 09:58:31,963 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 09:58:31,964 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 09:58:31,964 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 09:58:31,964 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 09:58:31,965 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 09:58:31,965 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 09:58:31,965 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 09:58:31,965 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 09:58:31,965 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 09:58:31,966 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 09:58:31,967 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 09:58:31,967 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 09:58:31,967 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 09:58:31,967 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 09:58:31,967 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 09:58:31,967 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 09:58:31,968 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 09:58:31,969 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 09:58:31,969 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 09:58:31,969 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 09:58:31,969 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 09:58:31,969 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 09:58:31,970 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 09:58:31,970 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 09:58:31,970 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 09:58:31,970 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 09:58:31,970 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 09:58:31,970 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 09:58:31,971 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 09:58:31,971 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 09:58:32,024 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 09:58:32,042 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 09:58:32,048 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 09:58:32,049 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 09:58:32,050 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 09:58:32,051 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_init3_false-unreach-call_ground.i [2018-11-23 09:58:32,116 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3759100e/329536c1d91a4123a44546b118e3a4d7/FLAG0c0bdf06e [2018-11-23 09:58:32,556 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 09:58:32,556 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_init3_false-unreach-call_ground.i [2018-11-23 09:58:32,562 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3759100e/329536c1d91a4123a44546b118e3a4d7/FLAG0c0bdf06e [2018-11-23 09:58:32,921 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3759100e/329536c1d91a4123a44546b118e3a4d7 [2018-11-23 09:58:32,931 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 09:58:32,933 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 09:58:32,934 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 09:58:32,934 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 09:58:32,939 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 09:58:32,940 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:58:32" (1/1) ... [2018-11-23 09:58:32,944 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@506d41ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:32, skipping insertion in model container [2018-11-23 09:58:32,944 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:58:32" (1/1) ... [2018-11-23 09:58:32,955 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 09:58:32,981 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 09:58:33,259 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:58:33,264 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 09:58:33,290 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:58:33,321 INFO L195 MainTranslator]: Completed translation [2018-11-23 09:58:33,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:33 WrapperNode [2018-11-23 09:58:33,321 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 09:58:33,322 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 09:58:33,323 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 09:58:33,323 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 09:58:33,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:33" (1/1) ... [2018-11-23 09:58:33,347 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:33" (1/1) ... [2018-11-23 09:58:33,354 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 09:58:33,354 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 09:58:33,354 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 09:58:33,354 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 09:58:33,362 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:33" (1/1) ... [2018-11-23 09:58:33,363 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:33" (1/1) ... [2018-11-23 09:58:33,365 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:33" (1/1) ... [2018-11-23 09:58:33,365 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:33" (1/1) ... [2018-11-23 09:58:33,377 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:33" (1/1) ... [2018-11-23 09:58:33,385 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:33" (1/1) ... [2018-11-23 09:58:33,387 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:33" (1/1) ... [2018-11-23 09:58:33,389 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 09:58:33,390 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 09:58:33,390 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 09:58:33,390 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 09:58:33,394 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 09:58:33,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 09:58:33,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 09:58:33,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 09:58:33,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 09:58:33,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 09:58:33,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 09:58:33,522 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 09:58:33,522 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 09:58:33,522 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 09:58:33,522 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 09:58:33,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 09:58:33,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 09:58:34,063 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 09:58:34,064 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 09:58:34,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:58:34 BoogieIcfgContainer [2018-11-23 09:58:34,064 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 09:58:34,065 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 09:58:34,065 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 09:58:34,069 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 09:58:34,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:58:32" (1/3) ... [2018-11-23 09:58:34,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a6bfb90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:58:34, skipping insertion in model container [2018-11-23 09:58:34,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:33" (2/3) ... [2018-11-23 09:58:34,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a6bfb90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:58:34, skipping insertion in model container [2018-11-23 09:58:34,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:58:34" (3/3) ... [2018-11-23 09:58:34,073 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_init3_false-unreach-call_ground.i [2018-11-23 09:58:34,084 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 09:58:34,093 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 09:58:34,111 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 09:58:34,146 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 09:58:34,147 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 09:58:34,147 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 09:58:34,148 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 09:58:34,148 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 09:58:34,148 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 09:58:34,148 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 09:58:34,149 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 09:58:34,149 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 09:58:34,167 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-11-23 09:58:34,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 09:58:34,174 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:34,175 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:34,178 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:34,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:34,185 INFO L82 PathProgramCache]: Analyzing trace with hash 578824766, now seen corresponding path program 1 times [2018-11-23 09:58:34,189 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:58:34,189 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:58:34,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:58:34,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:34,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:34,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:58:34,416 INFO L256 TraceCheckUtils]: 0: Hoare triple {30#true} call ULTIMATE.init(); {30#true} is VALID [2018-11-23 09:58:34,420 INFO L273 TraceCheckUtils]: 1: Hoare triple {30#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {30#true} is VALID [2018-11-23 09:58:34,420 INFO L273 TraceCheckUtils]: 2: Hoare triple {30#true} assume true; {30#true} is VALID [2018-11-23 09:58:34,421 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30#true} {30#true} #74#return; {30#true} is VALID [2018-11-23 09:58:34,421 INFO L256 TraceCheckUtils]: 4: Hoare triple {30#true} call #t~ret2 := main(); {30#true} is VALID [2018-11-23 09:58:34,421 INFO L273 TraceCheckUtils]: 5: Hoare triple {30#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {30#true} is VALID [2018-11-23 09:58:34,423 INFO L273 TraceCheckUtils]: 6: Hoare triple {30#true} assume !true; {31#false} is VALID [2018-11-23 09:58:34,423 INFO L273 TraceCheckUtils]: 7: Hoare triple {31#false} ~i~0 := 0bv32; {31#false} is VALID [2018-11-23 09:58:34,423 INFO L273 TraceCheckUtils]: 8: Hoare triple {31#false} assume !~bvslt32(~i~0, 100000bv32); {31#false} is VALID [2018-11-23 09:58:34,424 INFO L273 TraceCheckUtils]: 9: Hoare triple {31#false} ~i~0 := 0bv32; {31#false} is VALID [2018-11-23 09:58:34,424 INFO L273 TraceCheckUtils]: 10: Hoare triple {31#false} assume !~bvslt32(~i~0, 100000bv32); {31#false} is VALID [2018-11-23 09:58:34,424 INFO L273 TraceCheckUtils]: 11: Hoare triple {31#false} havoc ~x~0;~x~0 := 0bv32; {31#false} is VALID [2018-11-23 09:58:34,425 INFO L273 TraceCheckUtils]: 12: Hoare triple {31#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {31#false} is VALID [2018-11-23 09:58:34,425 INFO L256 TraceCheckUtils]: 13: Hoare triple {31#false} call __VERIFIER_assert((if 43bv32 == #t~mem1 then 1bv32 else 0bv32)); {31#false} is VALID [2018-11-23 09:58:34,425 INFO L273 TraceCheckUtils]: 14: Hoare triple {31#false} ~cond := #in~cond; {31#false} is VALID [2018-11-23 09:58:34,426 INFO L273 TraceCheckUtils]: 15: Hoare triple {31#false} assume 0bv32 == ~cond; {31#false} is VALID [2018-11-23 09:58:34,426 INFO L273 TraceCheckUtils]: 16: Hoare triple {31#false} assume !false; {31#false} is VALID [2018-11-23 09:58:34,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:58:34,430 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:58:34,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:58:34,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 09:58:34,446 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 09:58:34,450 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:58:34,456 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 09:58:34,663 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:34,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 09:58:34,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 09:58:34,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 09:58:34,678 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2018-11-23 09:58:34,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:34,867 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2018-11-23 09:58:34,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 09:58:34,868 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 09:58:34,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:34,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 09:58:34,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 62 transitions. [2018-11-23 09:58:34,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 09:58:34,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 62 transitions. [2018-11-23 09:58:34,886 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 62 transitions. [2018-11-23 09:58:35,186 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:35,197 INFO L225 Difference]: With dead ends: 47 [2018-11-23 09:58:35,197 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 09:58:35,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 09:58:35,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 09:58:35,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-23 09:58:35,264 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:58:35,264 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-23 09:58:35,265 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 09:58:35,265 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 09:58:35,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:35,269 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2018-11-23 09:58:35,269 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-11-23 09:58:35,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:35,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:35,270 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 09:58:35,271 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 09:58:35,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:35,275 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2018-11-23 09:58:35,275 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-11-23 09:58:35,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:35,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:35,276 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:58:35,276 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:58:35,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 09:58:35,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2018-11-23 09:58:35,281 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 17 [2018-11-23 09:58:35,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:35,282 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-11-23 09:58:35,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 09:58:35,282 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-11-23 09:58:35,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 09:58:35,283 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:35,283 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:35,283 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:35,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:35,284 INFO L82 PathProgramCache]: Analyzing trace with hash -823304390, now seen corresponding path program 1 times [2018-11-23 09:58:35,285 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:58:35,285 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:58:35,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:58:35,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:35,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:35,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:58:35,431 INFO L256 TraceCheckUtils]: 0: Hoare triple {220#true} call ULTIMATE.init(); {220#true} is VALID [2018-11-23 09:58:35,431 INFO L273 TraceCheckUtils]: 1: Hoare triple {220#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {220#true} is VALID [2018-11-23 09:58:35,432 INFO L273 TraceCheckUtils]: 2: Hoare triple {220#true} assume true; {220#true} is VALID [2018-11-23 09:58:35,432 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {220#true} {220#true} #74#return; {220#true} is VALID [2018-11-23 09:58:35,432 INFO L256 TraceCheckUtils]: 4: Hoare triple {220#true} call #t~ret2 := main(); {220#true} is VALID [2018-11-23 09:58:35,433 INFO L273 TraceCheckUtils]: 5: Hoare triple {220#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {240#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:58:35,434 INFO L273 TraceCheckUtils]: 6: Hoare triple {240#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {221#false} is VALID [2018-11-23 09:58:35,434 INFO L273 TraceCheckUtils]: 7: Hoare triple {221#false} ~i~0 := 0bv32; {221#false} is VALID [2018-11-23 09:58:35,435 INFO L273 TraceCheckUtils]: 8: Hoare triple {221#false} assume !~bvslt32(~i~0, 100000bv32); {221#false} is VALID [2018-11-23 09:58:35,435 INFO L273 TraceCheckUtils]: 9: Hoare triple {221#false} ~i~0 := 0bv32; {221#false} is VALID [2018-11-23 09:58:35,436 INFO L273 TraceCheckUtils]: 10: Hoare triple {221#false} assume !~bvslt32(~i~0, 100000bv32); {221#false} is VALID [2018-11-23 09:58:35,436 INFO L273 TraceCheckUtils]: 11: Hoare triple {221#false} havoc ~x~0;~x~0 := 0bv32; {221#false} is VALID [2018-11-23 09:58:35,437 INFO L273 TraceCheckUtils]: 12: Hoare triple {221#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {221#false} is VALID [2018-11-23 09:58:35,437 INFO L256 TraceCheckUtils]: 13: Hoare triple {221#false} call __VERIFIER_assert((if 43bv32 == #t~mem1 then 1bv32 else 0bv32)); {221#false} is VALID [2018-11-23 09:58:35,437 INFO L273 TraceCheckUtils]: 14: Hoare triple {221#false} ~cond := #in~cond; {221#false} is VALID [2018-11-23 09:58:35,438 INFO L273 TraceCheckUtils]: 15: Hoare triple {221#false} assume 0bv32 == ~cond; {221#false} is VALID [2018-11-23 09:58:35,438 INFO L273 TraceCheckUtils]: 16: Hoare triple {221#false} assume !false; {221#false} is VALID [2018-11-23 09:58:35,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:58:35,440 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:58:35,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:58:35,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:58:35,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 09:58:35,450 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:58:35,450 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 09:58:35,485 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:35,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:58:35,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:58:35,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:58:35,487 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 3 states. [2018-11-23 09:58:35,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:35,939 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2018-11-23 09:58:35,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:58:35,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 09:58:35,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:35,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 09:58:35,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2018-11-23 09:58:35,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 09:58:35,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2018-11-23 09:58:35,946 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 48 transitions. [2018-11-23 09:58:36,085 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:36,087 INFO L225 Difference]: With dead ends: 40 [2018-11-23 09:58:36,087 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 09:58:36,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:58:36,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 09:58:36,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-23 09:58:36,128 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:58:36,129 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2018-11-23 09:58:36,129 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 09:58:36,129 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 09:58:36,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:36,132 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-11-23 09:58:36,132 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 09:58:36,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:36,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:36,133 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 09:58:36,134 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 09:58:36,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:36,136 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-11-23 09:58:36,138 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 09:58:36,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:36,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:36,139 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:58:36,139 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:58:36,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 09:58:36,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-11-23 09:58:36,143 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 17 [2018-11-23 09:58:36,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:36,144 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-11-23 09:58:36,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:58:36,144 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 09:58:36,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 09:58:36,145 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:36,146 INFO L402 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-23 09:58:36,146 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:36,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:36,146 INFO L82 PathProgramCache]: Analyzing trace with hash 3753729, now seen corresponding path program 1 times [2018-11-23 09:58:36,147 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:58:36,147 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:58:36,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:58:36,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:36,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:36,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:58:36,291 INFO L256 TraceCheckUtils]: 0: Hoare triple {419#true} call ULTIMATE.init(); {419#true} is VALID [2018-11-23 09:58:36,291 INFO L273 TraceCheckUtils]: 1: Hoare triple {419#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {419#true} is VALID [2018-11-23 09:58:36,292 INFO L273 TraceCheckUtils]: 2: Hoare triple {419#true} assume true; {419#true} is VALID [2018-11-23 09:58:36,292 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {419#true} {419#true} #74#return; {419#true} is VALID [2018-11-23 09:58:36,293 INFO L256 TraceCheckUtils]: 4: Hoare triple {419#true} call #t~ret2 := main(); {419#true} is VALID [2018-11-23 09:58:36,293 INFO L273 TraceCheckUtils]: 5: Hoare triple {419#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {439#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:58:36,295 INFO L273 TraceCheckUtils]: 6: Hoare triple {439#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {443#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:36,296 INFO L273 TraceCheckUtils]: 7: Hoare triple {443#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {420#false} is VALID [2018-11-23 09:58:36,296 INFO L273 TraceCheckUtils]: 8: Hoare triple {420#false} ~i~0 := 0bv32; {420#false} is VALID [2018-11-23 09:58:36,296 INFO L273 TraceCheckUtils]: 9: Hoare triple {420#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {420#false} is VALID [2018-11-23 09:58:36,297 INFO L273 TraceCheckUtils]: 10: Hoare triple {420#false} assume !~bvslt32(~i~0, 100000bv32); {420#false} is VALID [2018-11-23 09:58:36,297 INFO L273 TraceCheckUtils]: 11: Hoare triple {420#false} ~i~0 := 0bv32; {420#false} is VALID [2018-11-23 09:58:36,297 INFO L273 TraceCheckUtils]: 12: Hoare triple {420#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {420#false} is VALID [2018-11-23 09:58:36,298 INFO L273 TraceCheckUtils]: 13: Hoare triple {420#false} assume !~bvslt32(~i~0, 100000bv32); {420#false} is VALID [2018-11-23 09:58:36,298 INFO L273 TraceCheckUtils]: 14: Hoare triple {420#false} havoc ~x~0;~x~0 := 0bv32; {420#false} is VALID [2018-11-23 09:58:36,299 INFO L273 TraceCheckUtils]: 15: Hoare triple {420#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {420#false} is VALID [2018-11-23 09:58:36,299 INFO L256 TraceCheckUtils]: 16: Hoare triple {420#false} call __VERIFIER_assert((if 43bv32 == #t~mem1 then 1bv32 else 0bv32)); {420#false} is VALID [2018-11-23 09:58:36,300 INFO L273 TraceCheckUtils]: 17: Hoare triple {420#false} ~cond := #in~cond; {420#false} is VALID [2018-11-23 09:58:36,300 INFO L273 TraceCheckUtils]: 18: Hoare triple {420#false} assume 0bv32 == ~cond; {420#false} is VALID [2018-11-23 09:58:36,300 INFO L273 TraceCheckUtils]: 19: Hoare triple {420#false} assume !false; {420#false} is VALID [2018-11-23 09:58:36,302 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 09:58:36,302 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:58:36,493 INFO L273 TraceCheckUtils]: 19: Hoare triple {420#false} assume !false; {420#false} is VALID [2018-11-23 09:58:36,494 INFO L273 TraceCheckUtils]: 18: Hoare triple {420#false} assume 0bv32 == ~cond; {420#false} is VALID [2018-11-23 09:58:36,494 INFO L273 TraceCheckUtils]: 17: Hoare triple {420#false} ~cond := #in~cond; {420#false} is VALID [2018-11-23 09:58:36,494 INFO L256 TraceCheckUtils]: 16: Hoare triple {420#false} call __VERIFIER_assert((if 43bv32 == #t~mem1 then 1bv32 else 0bv32)); {420#false} is VALID [2018-11-23 09:58:36,495 INFO L273 TraceCheckUtils]: 15: Hoare triple {420#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {420#false} is VALID [2018-11-23 09:58:36,495 INFO L273 TraceCheckUtils]: 14: Hoare triple {420#false} havoc ~x~0;~x~0 := 0bv32; {420#false} is VALID [2018-11-23 09:58:36,496 INFO L273 TraceCheckUtils]: 13: Hoare triple {420#false} assume !~bvslt32(~i~0, 100000bv32); {420#false} is VALID [2018-11-23 09:58:36,496 INFO L273 TraceCheckUtils]: 12: Hoare triple {420#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {420#false} is VALID [2018-11-23 09:58:36,496 INFO L273 TraceCheckUtils]: 11: Hoare triple {420#false} ~i~0 := 0bv32; {420#false} is VALID [2018-11-23 09:58:36,497 INFO L273 TraceCheckUtils]: 10: Hoare triple {420#false} assume !~bvslt32(~i~0, 100000bv32); {420#false} is VALID [2018-11-23 09:58:36,497 INFO L273 TraceCheckUtils]: 9: Hoare triple {420#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {420#false} is VALID [2018-11-23 09:58:36,498 INFO L273 TraceCheckUtils]: 8: Hoare triple {420#false} ~i~0 := 0bv32; {420#false} is VALID [2018-11-23 09:58:36,500 INFO L273 TraceCheckUtils]: 7: Hoare triple {519#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {420#false} is VALID [2018-11-23 09:58:36,501 INFO L273 TraceCheckUtils]: 6: Hoare triple {523#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {519#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 09:58:36,502 INFO L273 TraceCheckUtils]: 5: Hoare triple {419#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {523#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:36,502 INFO L256 TraceCheckUtils]: 4: Hoare triple {419#true} call #t~ret2 := main(); {419#true} is VALID [2018-11-23 09:58:36,502 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {419#true} {419#true} #74#return; {419#true} is VALID [2018-11-23 09:58:36,502 INFO L273 TraceCheckUtils]: 2: Hoare triple {419#true} assume true; {419#true} is VALID [2018-11-23 09:58:36,503 INFO L273 TraceCheckUtils]: 1: Hoare triple {419#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {419#true} is VALID [2018-11-23 09:58:36,503 INFO L256 TraceCheckUtils]: 0: Hoare triple {419#true} call ULTIMATE.init(); {419#true} is VALID [2018-11-23 09:58:36,505 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 09:58:36,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:58:36,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 09:58:36,509 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-23 09:58:36,509 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:58:36,510 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 09:58:36,642 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:36,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 09:58:36,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 09:58:36,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 09:58:36,643 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 6 states. [2018-11-23 09:58:37,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:37,183 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2018-11-23 09:58:37,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 09:58:37,183 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-23 09:58:37,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:37,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 09:58:37,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2018-11-23 09:58:37,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 09:58:37,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2018-11-23 09:58:37,190 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 63 transitions. [2018-11-23 09:58:37,326 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:37,328 INFO L225 Difference]: With dead ends: 51 [2018-11-23 09:58:37,328 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 09:58:37,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 09:58:37,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 09:58:37,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-23 09:58:37,351 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:58:37,351 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 34 states. [2018-11-23 09:58:37,351 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-23 09:58:37,351 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-23 09:58:37,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:37,355 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-23 09:58:37,355 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-23 09:58:37,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:37,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:37,356 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-23 09:58:37,356 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-23 09:58:37,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:37,359 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-23 09:58:37,359 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-23 09:58:37,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:37,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:37,360 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:58:37,360 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:58:37,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 09:58:37,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-11-23 09:58:37,363 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 20 [2018-11-23 09:58:37,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:37,363 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-11-23 09:58:37,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 09:58:37,364 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-23 09:58:37,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 09:58:37,365 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:37,365 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:37,365 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:37,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:37,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1002382458, now seen corresponding path program 2 times [2018-11-23 09:58:37,367 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:58:37,367 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:58:37,386 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 09:58:37,459 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 09:58:37,460 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:58:37,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:37,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:58:37,593 INFO L256 TraceCheckUtils]: 0: Hoare triple {750#true} call ULTIMATE.init(); {750#true} is VALID [2018-11-23 09:58:37,593 INFO L273 TraceCheckUtils]: 1: Hoare triple {750#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {750#true} is VALID [2018-11-23 09:58:37,594 INFO L273 TraceCheckUtils]: 2: Hoare triple {750#true} assume true; {750#true} is VALID [2018-11-23 09:58:37,594 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {750#true} {750#true} #74#return; {750#true} is VALID [2018-11-23 09:58:37,595 INFO L256 TraceCheckUtils]: 4: Hoare triple {750#true} call #t~ret2 := main(); {750#true} is VALID [2018-11-23 09:58:37,595 INFO L273 TraceCheckUtils]: 5: Hoare triple {750#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {750#true} is VALID [2018-11-23 09:58:37,595 INFO L273 TraceCheckUtils]: 6: Hoare triple {750#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {750#true} is VALID [2018-11-23 09:58:37,595 INFO L273 TraceCheckUtils]: 7: Hoare triple {750#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {750#true} is VALID [2018-11-23 09:58:37,596 INFO L273 TraceCheckUtils]: 8: Hoare triple {750#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {750#true} is VALID [2018-11-23 09:58:37,596 INFO L273 TraceCheckUtils]: 9: Hoare triple {750#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {750#true} is VALID [2018-11-23 09:58:37,596 INFO L273 TraceCheckUtils]: 10: Hoare triple {750#true} assume !~bvslt32(~i~0, 100000bv32); {750#true} is VALID [2018-11-23 09:58:37,596 INFO L273 TraceCheckUtils]: 11: Hoare triple {750#true} ~i~0 := 0bv32; {750#true} is VALID [2018-11-23 09:58:37,597 INFO L273 TraceCheckUtils]: 12: Hoare triple {750#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {750#true} is VALID [2018-11-23 09:58:37,597 INFO L273 TraceCheckUtils]: 13: Hoare triple {750#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {750#true} is VALID [2018-11-23 09:58:37,597 INFO L273 TraceCheckUtils]: 14: Hoare triple {750#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {750#true} is VALID [2018-11-23 09:58:37,598 INFO L273 TraceCheckUtils]: 15: Hoare triple {750#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {750#true} is VALID [2018-11-23 09:58:37,598 INFO L273 TraceCheckUtils]: 16: Hoare triple {750#true} assume !~bvslt32(~i~0, 100000bv32); {750#true} is VALID [2018-11-23 09:58:37,598 INFO L273 TraceCheckUtils]: 17: Hoare triple {750#true} ~i~0 := 0bv32; {806#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:58:37,599 INFO L273 TraceCheckUtils]: 18: Hoare triple {806#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {810#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:37,600 INFO L273 TraceCheckUtils]: 19: Hoare triple {810#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {814#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:37,601 INFO L273 TraceCheckUtils]: 20: Hoare triple {814#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {818#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:37,601 INFO L273 TraceCheckUtils]: 21: Hoare triple {818#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {822#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 09:58:37,602 INFO L273 TraceCheckUtils]: 22: Hoare triple {822#(= (_ bv4 32) main_~i~0)} assume !~bvslt32(~i~0, 100000bv32); {751#false} is VALID [2018-11-23 09:58:37,602 INFO L273 TraceCheckUtils]: 23: Hoare triple {751#false} havoc ~x~0;~x~0 := 0bv32; {751#false} is VALID [2018-11-23 09:58:37,602 INFO L273 TraceCheckUtils]: 24: Hoare triple {751#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {751#false} is VALID [2018-11-23 09:58:37,603 INFO L256 TraceCheckUtils]: 25: Hoare triple {751#false} call __VERIFIER_assert((if 43bv32 == #t~mem1 then 1bv32 else 0bv32)); {751#false} is VALID [2018-11-23 09:58:37,603 INFO L273 TraceCheckUtils]: 26: Hoare triple {751#false} ~cond := #in~cond; {751#false} is VALID [2018-11-23 09:58:37,603 INFO L273 TraceCheckUtils]: 27: Hoare triple {751#false} assume 0bv32 == ~cond; {751#false} is VALID [2018-11-23 09:58:37,603 INFO L273 TraceCheckUtils]: 28: Hoare triple {751#false} assume !false; {751#false} is VALID [2018-11-23 09:58:37,605 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-23 09:58:37,606 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:58:37,788 INFO L273 TraceCheckUtils]: 28: Hoare triple {751#false} assume !false; {751#false} is VALID [2018-11-23 09:58:37,788 INFO L273 TraceCheckUtils]: 27: Hoare triple {751#false} assume 0bv32 == ~cond; {751#false} is VALID [2018-11-23 09:58:37,789 INFO L273 TraceCheckUtils]: 26: Hoare triple {751#false} ~cond := #in~cond; {751#false} is VALID [2018-11-23 09:58:37,789 INFO L256 TraceCheckUtils]: 25: Hoare triple {751#false} call __VERIFIER_assert((if 43bv32 == #t~mem1 then 1bv32 else 0bv32)); {751#false} is VALID [2018-11-23 09:58:37,790 INFO L273 TraceCheckUtils]: 24: Hoare triple {751#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {751#false} is VALID [2018-11-23 09:58:37,790 INFO L273 TraceCheckUtils]: 23: Hoare triple {751#false} havoc ~x~0;~x~0 := 0bv32; {751#false} is VALID [2018-11-23 09:58:37,796 INFO L273 TraceCheckUtils]: 22: Hoare triple {862#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {751#false} is VALID [2018-11-23 09:58:37,797 INFO L273 TraceCheckUtils]: 21: Hoare triple {866#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {862#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 09:58:37,802 INFO L273 TraceCheckUtils]: 20: Hoare triple {870#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {866#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:37,807 INFO L273 TraceCheckUtils]: 19: Hoare triple {874#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {870#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:37,812 INFO L273 TraceCheckUtils]: 18: Hoare triple {878#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {874#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:37,814 INFO L273 TraceCheckUtils]: 17: Hoare triple {750#true} ~i~0 := 0bv32; {878#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:37,814 INFO L273 TraceCheckUtils]: 16: Hoare triple {750#true} assume !~bvslt32(~i~0, 100000bv32); {750#true} is VALID [2018-11-23 09:58:37,814 INFO L273 TraceCheckUtils]: 15: Hoare triple {750#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {750#true} is VALID [2018-11-23 09:58:37,814 INFO L273 TraceCheckUtils]: 14: Hoare triple {750#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {750#true} is VALID [2018-11-23 09:58:37,815 INFO L273 TraceCheckUtils]: 13: Hoare triple {750#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {750#true} is VALID [2018-11-23 09:58:37,815 INFO L273 TraceCheckUtils]: 12: Hoare triple {750#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {750#true} is VALID [2018-11-23 09:58:37,815 INFO L273 TraceCheckUtils]: 11: Hoare triple {750#true} ~i~0 := 0bv32; {750#true} is VALID [2018-11-23 09:58:37,815 INFO L273 TraceCheckUtils]: 10: Hoare triple {750#true} assume !~bvslt32(~i~0, 100000bv32); {750#true} is VALID [2018-11-23 09:58:37,815 INFO L273 TraceCheckUtils]: 9: Hoare triple {750#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {750#true} is VALID [2018-11-23 09:58:37,816 INFO L273 TraceCheckUtils]: 8: Hoare triple {750#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {750#true} is VALID [2018-11-23 09:58:37,816 INFO L273 TraceCheckUtils]: 7: Hoare triple {750#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {750#true} is VALID [2018-11-23 09:58:37,816 INFO L273 TraceCheckUtils]: 6: Hoare triple {750#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {750#true} is VALID [2018-11-23 09:58:37,817 INFO L273 TraceCheckUtils]: 5: Hoare triple {750#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {750#true} is VALID [2018-11-23 09:58:37,817 INFO L256 TraceCheckUtils]: 4: Hoare triple {750#true} call #t~ret2 := main(); {750#true} is VALID [2018-11-23 09:58:37,817 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {750#true} {750#true} #74#return; {750#true} is VALID [2018-11-23 09:58:37,818 INFO L273 TraceCheckUtils]: 2: Hoare triple {750#true} assume true; {750#true} is VALID [2018-11-23 09:58:37,818 INFO L273 TraceCheckUtils]: 1: Hoare triple {750#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {750#true} is VALID [2018-11-23 09:58:37,818 INFO L256 TraceCheckUtils]: 0: Hoare triple {750#true} call ULTIMATE.init(); {750#true} is VALID [2018-11-23 09:58:37,820 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-23 09:58:37,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:58:37,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 09:58:37,828 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-11-23 09:58:37,830 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:58:37,830 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 09:58:37,877 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:37,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 09:58:37,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 09:58:37,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-23 09:58:37,878 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 12 states. [2018-11-23 09:58:39,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:39,563 INFO L93 Difference]: Finished difference Result 75 states and 98 transitions. [2018-11-23 09:58:39,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 09:58:39,564 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-11-23 09:58:39,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:39,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 09:58:39,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 90 transitions. [2018-11-23 09:58:39,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 09:58:39,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 90 transitions. [2018-11-23 09:58:39,572 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 90 transitions. [2018-11-23 09:58:39,828 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:39,831 INFO L225 Difference]: With dead ends: 75 [2018-11-23 09:58:39,831 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 09:58:39,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-23 09:58:39,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 09:58:39,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-11-23 09:58:39,882 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:58:39,882 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 52 states. [2018-11-23 09:58:39,882 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2018-11-23 09:58:39,883 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2018-11-23 09:58:39,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:39,886 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2018-11-23 09:58:39,886 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-11-23 09:58:39,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:39,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:39,887 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2018-11-23 09:58:39,888 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2018-11-23 09:58:39,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:39,891 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2018-11-23 09:58:39,891 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-11-23 09:58:39,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:39,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:39,892 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:58:39,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:58:39,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 09:58:39,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-11-23 09:58:39,895 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 29 [2018-11-23 09:58:39,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:39,896 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-11-23 09:58:39,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 09:58:39,896 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-11-23 09:58:39,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 09:58:39,898 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:39,898 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:39,898 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:39,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:39,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1397676122, now seen corresponding path program 3 times [2018-11-23 09:58:39,899 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:58:39,900 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:58:39,921 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 09:58:40,747 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 09:58:40,747 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:58:40,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:40,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:58:41,088 INFO L256 TraceCheckUtils]: 0: Hoare triple {1271#true} call ULTIMATE.init(); {1271#true} is VALID [2018-11-23 09:58:41,088 INFO L273 TraceCheckUtils]: 1: Hoare triple {1271#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1271#true} is VALID [2018-11-23 09:58:41,089 INFO L273 TraceCheckUtils]: 2: Hoare triple {1271#true} assume true; {1271#true} is VALID [2018-11-23 09:58:41,089 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1271#true} {1271#true} #74#return; {1271#true} is VALID [2018-11-23 09:58:41,089 INFO L256 TraceCheckUtils]: 4: Hoare triple {1271#true} call #t~ret2 := main(); {1271#true} is VALID [2018-11-23 09:58:41,089 INFO L273 TraceCheckUtils]: 5: Hoare triple {1271#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {1271#true} is VALID [2018-11-23 09:58:41,089 INFO L273 TraceCheckUtils]: 6: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 09:58:41,090 INFO L273 TraceCheckUtils]: 7: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 09:58:41,090 INFO L273 TraceCheckUtils]: 8: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 09:58:41,090 INFO L273 TraceCheckUtils]: 9: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 09:58:41,090 INFO L273 TraceCheckUtils]: 10: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 09:58:41,090 INFO L273 TraceCheckUtils]: 11: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 09:58:41,091 INFO L273 TraceCheckUtils]: 12: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 09:58:41,091 INFO L273 TraceCheckUtils]: 13: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 09:58:41,091 INFO L273 TraceCheckUtils]: 14: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 09:58:41,091 INFO L273 TraceCheckUtils]: 15: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 09:58:41,091 INFO L273 TraceCheckUtils]: 16: Hoare triple {1271#true} assume !~bvslt32(~i~0, 100000bv32); {1271#true} is VALID [2018-11-23 09:58:41,092 INFO L273 TraceCheckUtils]: 17: Hoare triple {1271#true} ~i~0 := 0bv32; {1271#true} is VALID [2018-11-23 09:58:41,092 INFO L273 TraceCheckUtils]: 18: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 09:58:41,092 INFO L273 TraceCheckUtils]: 19: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 09:58:41,092 INFO L273 TraceCheckUtils]: 20: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 09:58:41,093 INFO L273 TraceCheckUtils]: 21: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 09:58:41,093 INFO L273 TraceCheckUtils]: 22: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 09:58:41,093 INFO L273 TraceCheckUtils]: 23: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 09:58:41,093 INFO L273 TraceCheckUtils]: 24: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 09:58:41,093 INFO L273 TraceCheckUtils]: 25: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 09:58:41,094 INFO L273 TraceCheckUtils]: 26: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 09:58:41,094 INFO L273 TraceCheckUtils]: 27: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 09:58:41,094 INFO L273 TraceCheckUtils]: 28: Hoare triple {1271#true} assume !~bvslt32(~i~0, 100000bv32); {1271#true} is VALID [2018-11-23 09:58:41,094 INFO L273 TraceCheckUtils]: 29: Hoare triple {1271#true} ~i~0 := 0bv32; {1363#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:58:41,095 INFO L273 TraceCheckUtils]: 30: Hoare triple {1363#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1367#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:41,096 INFO L273 TraceCheckUtils]: 31: Hoare triple {1367#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1371#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 09:58:41,097 INFO L273 TraceCheckUtils]: 32: Hoare triple {1371#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1375#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:41,097 INFO L273 TraceCheckUtils]: 33: Hoare triple {1375#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1379#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:41,098 INFO L273 TraceCheckUtils]: 34: Hoare triple {1379#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1383#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:41,099 INFO L273 TraceCheckUtils]: 35: Hoare triple {1383#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1387#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:41,100 INFO L273 TraceCheckUtils]: 36: Hoare triple {1387#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1391#(= (_ bv7 32) main_~i~0)} is VALID [2018-11-23 09:58:41,101 INFO L273 TraceCheckUtils]: 37: Hoare triple {1391#(= (_ bv7 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1395#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:41,102 INFO L273 TraceCheckUtils]: 38: Hoare triple {1395#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1399#(= (_ bv9 32) main_~i~0)} is VALID [2018-11-23 09:58:41,103 INFO L273 TraceCheckUtils]: 39: Hoare triple {1399#(= (_ bv9 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1403#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:41,104 INFO L273 TraceCheckUtils]: 40: Hoare triple {1403#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {1272#false} is VALID [2018-11-23 09:58:41,105 INFO L273 TraceCheckUtils]: 41: Hoare triple {1272#false} havoc ~x~0;~x~0 := 0bv32; {1272#false} is VALID [2018-11-23 09:58:41,105 INFO L273 TraceCheckUtils]: 42: Hoare triple {1272#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1272#false} is VALID [2018-11-23 09:58:41,105 INFO L256 TraceCheckUtils]: 43: Hoare triple {1272#false} call __VERIFIER_assert((if 43bv32 == #t~mem1 then 1bv32 else 0bv32)); {1272#false} is VALID [2018-11-23 09:58:41,106 INFO L273 TraceCheckUtils]: 44: Hoare triple {1272#false} ~cond := #in~cond; {1272#false} is VALID [2018-11-23 09:58:41,106 INFO L273 TraceCheckUtils]: 45: Hoare triple {1272#false} assume 0bv32 == ~cond; {1272#false} is VALID [2018-11-23 09:58:41,106 INFO L273 TraceCheckUtils]: 46: Hoare triple {1272#false} assume !false; {1272#false} is VALID [2018-11-23 09:58:41,111 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-11-23 09:58:41,111 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:58:41,658 INFO L273 TraceCheckUtils]: 46: Hoare triple {1272#false} assume !false; {1272#false} is VALID [2018-11-23 09:58:41,658 INFO L273 TraceCheckUtils]: 45: Hoare triple {1272#false} assume 0bv32 == ~cond; {1272#false} is VALID [2018-11-23 09:58:41,659 INFO L273 TraceCheckUtils]: 44: Hoare triple {1272#false} ~cond := #in~cond; {1272#false} is VALID [2018-11-23 09:58:41,659 INFO L256 TraceCheckUtils]: 43: Hoare triple {1272#false} call __VERIFIER_assert((if 43bv32 == #t~mem1 then 1bv32 else 0bv32)); {1272#false} is VALID [2018-11-23 09:58:41,659 INFO L273 TraceCheckUtils]: 42: Hoare triple {1272#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1272#false} is VALID [2018-11-23 09:58:41,660 INFO L273 TraceCheckUtils]: 41: Hoare triple {1272#false} havoc ~x~0;~x~0 := 0bv32; {1272#false} is VALID [2018-11-23 09:58:41,661 INFO L273 TraceCheckUtils]: 40: Hoare triple {1443#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {1272#false} is VALID [2018-11-23 09:58:41,661 INFO L273 TraceCheckUtils]: 39: Hoare triple {1447#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1443#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 09:58:41,667 INFO L273 TraceCheckUtils]: 38: Hoare triple {1451#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1447#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:41,673 INFO L273 TraceCheckUtils]: 37: Hoare triple {1455#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1451#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:41,679 INFO L273 TraceCheckUtils]: 36: Hoare triple {1459#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1455#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:41,686 INFO L273 TraceCheckUtils]: 35: Hoare triple {1463#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1459#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:41,691 INFO L273 TraceCheckUtils]: 34: Hoare triple {1467#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1463#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:41,699 INFO L273 TraceCheckUtils]: 33: Hoare triple {1471#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1467#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:41,703 INFO L273 TraceCheckUtils]: 32: Hoare triple {1475#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1471#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:41,707 INFO L273 TraceCheckUtils]: 31: Hoare triple {1479#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1475#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:41,713 INFO L273 TraceCheckUtils]: 30: Hoare triple {1483#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1479#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:41,713 INFO L273 TraceCheckUtils]: 29: Hoare triple {1271#true} ~i~0 := 0bv32; {1483#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:41,713 INFO L273 TraceCheckUtils]: 28: Hoare triple {1271#true} assume !~bvslt32(~i~0, 100000bv32); {1271#true} is VALID [2018-11-23 09:58:41,714 INFO L273 TraceCheckUtils]: 27: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 09:58:41,714 INFO L273 TraceCheckUtils]: 26: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 09:58:41,714 INFO L273 TraceCheckUtils]: 25: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 09:58:41,714 INFO L273 TraceCheckUtils]: 24: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 09:58:41,714 INFO L273 TraceCheckUtils]: 23: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 09:58:41,715 INFO L273 TraceCheckUtils]: 22: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 09:58:41,715 INFO L273 TraceCheckUtils]: 21: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 09:58:41,715 INFO L273 TraceCheckUtils]: 20: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 09:58:41,715 INFO L273 TraceCheckUtils]: 19: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 09:58:41,715 INFO L273 TraceCheckUtils]: 18: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 09:58:41,716 INFO L273 TraceCheckUtils]: 17: Hoare triple {1271#true} ~i~0 := 0bv32; {1271#true} is VALID [2018-11-23 09:58:41,716 INFO L273 TraceCheckUtils]: 16: Hoare triple {1271#true} assume !~bvslt32(~i~0, 100000bv32); {1271#true} is VALID [2018-11-23 09:58:41,716 INFO L273 TraceCheckUtils]: 15: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 09:58:41,716 INFO L273 TraceCheckUtils]: 14: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 09:58:41,717 INFO L273 TraceCheckUtils]: 13: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 09:58:41,717 INFO L273 TraceCheckUtils]: 12: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 09:58:41,717 INFO L273 TraceCheckUtils]: 11: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 09:58:41,717 INFO L273 TraceCheckUtils]: 10: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 09:58:41,718 INFO L273 TraceCheckUtils]: 9: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 09:58:41,718 INFO L273 TraceCheckUtils]: 8: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 09:58:41,718 INFO L273 TraceCheckUtils]: 7: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 09:58:41,718 INFO L273 TraceCheckUtils]: 6: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 09:58:41,719 INFO L273 TraceCheckUtils]: 5: Hoare triple {1271#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {1271#true} is VALID [2018-11-23 09:58:41,719 INFO L256 TraceCheckUtils]: 4: Hoare triple {1271#true} call #t~ret2 := main(); {1271#true} is VALID [2018-11-23 09:58:41,719 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1271#true} {1271#true} #74#return; {1271#true} is VALID [2018-11-23 09:58:41,719 INFO L273 TraceCheckUtils]: 2: Hoare triple {1271#true} assume true; {1271#true} is VALID [2018-11-23 09:58:41,720 INFO L273 TraceCheckUtils]: 1: Hoare triple {1271#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1271#true} is VALID [2018-11-23 09:58:41,720 INFO L256 TraceCheckUtils]: 0: Hoare triple {1271#true} call ULTIMATE.init(); {1271#true} is VALID [2018-11-23 09:58:41,722 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-11-23 09:58:41,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:58:41,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-23 09:58:41,726 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 47 [2018-11-23 09:58:41,726 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:58:41,726 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 09:58:41,802 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:41,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 09:58:41,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 09:58:41,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-23 09:58:41,803 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 24 states. [2018-11-23 09:58:48,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:48,132 INFO L93 Difference]: Finished difference Result 123 states and 164 transitions. [2018-11-23 09:58:48,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 09:58:48,132 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 47 [2018-11-23 09:58:48,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:48,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 09:58:48,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 144 transitions. [2018-11-23 09:58:48,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 09:58:48,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 144 transitions. [2018-11-23 09:58:48,140 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 144 transitions. [2018-11-23 09:58:48,568 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:48,571 INFO L225 Difference]: With dead ends: 123 [2018-11-23 09:58:48,571 INFO L226 Difference]: Without dead ends: 88 [2018-11-23 09:58:48,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 09:58:48,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-23 09:58:48,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-11-23 09:58:48,673 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:58:48,673 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 88 states. [2018-11-23 09:58:48,673 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 88 states. [2018-11-23 09:58:48,673 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 88 states. [2018-11-23 09:58:48,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:48,681 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2018-11-23 09:58:48,681 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 91 transitions. [2018-11-23 09:58:48,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:48,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:48,682 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 88 states. [2018-11-23 09:58:48,682 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 88 states. [2018-11-23 09:58:48,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:48,686 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2018-11-23 09:58:48,686 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 91 transitions. [2018-11-23 09:58:48,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:48,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:48,687 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:58:48,688 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:58:48,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-23 09:58:48,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 91 transitions. [2018-11-23 09:58:48,691 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 91 transitions. Word has length 47 [2018-11-23 09:58:48,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:48,691 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 91 transitions. [2018-11-23 09:58:48,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 09:58:48,692 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 91 transitions. [2018-11-23 09:58:48,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-23 09:58:48,694 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:48,694 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:48,695 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:48,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:48,695 INFO L82 PathProgramCache]: Analyzing trace with hash 473114, now seen corresponding path program 4 times [2018-11-23 09:58:48,696 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:58:48,696 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:58:48,725 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 09:58:48,942 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 09:58:48,942 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:58:48,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:49,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:58:49,746 INFO L256 TraceCheckUtils]: 0: Hoare triple {2170#true} call ULTIMATE.init(); {2170#true} is VALID [2018-11-23 09:58:49,747 INFO L273 TraceCheckUtils]: 1: Hoare triple {2170#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2170#true} is VALID [2018-11-23 09:58:49,747 INFO L273 TraceCheckUtils]: 2: Hoare triple {2170#true} assume true; {2170#true} is VALID [2018-11-23 09:58:49,747 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2170#true} {2170#true} #74#return; {2170#true} is VALID [2018-11-23 09:58:49,748 INFO L256 TraceCheckUtils]: 4: Hoare triple {2170#true} call #t~ret2 := main(); {2170#true} is VALID [2018-11-23 09:58:49,749 INFO L273 TraceCheckUtils]: 5: Hoare triple {2170#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {2190#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:58:49,749 INFO L273 TraceCheckUtils]: 6: Hoare triple {2190#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2194#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:49,750 INFO L273 TraceCheckUtils]: 7: Hoare triple {2194#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2198#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 09:58:49,750 INFO L273 TraceCheckUtils]: 8: Hoare triple {2198#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2202#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:49,751 INFO L273 TraceCheckUtils]: 9: Hoare triple {2202#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2206#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 09:58:49,753 INFO L273 TraceCheckUtils]: 10: Hoare triple {2206#(= (_ bv4 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2210#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:49,754 INFO L273 TraceCheckUtils]: 11: Hoare triple {2210#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2214#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:49,755 INFO L273 TraceCheckUtils]: 12: Hoare triple {2214#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2218#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:49,757 INFO L273 TraceCheckUtils]: 13: Hoare triple {2218#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2222#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 09:58:49,758 INFO L273 TraceCheckUtils]: 14: Hoare triple {2222#(= (_ bv8 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2226#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:49,758 INFO L273 TraceCheckUtils]: 15: Hoare triple {2226#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2230#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:49,759 INFO L273 TraceCheckUtils]: 16: Hoare triple {2230#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2234#(= (_ bv11 32) main_~i~0)} is VALID [2018-11-23 09:58:49,760 INFO L273 TraceCheckUtils]: 17: Hoare triple {2234#(= (_ bv11 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2238#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:49,761 INFO L273 TraceCheckUtils]: 18: Hoare triple {2238#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2242#(= (_ bv13 32) main_~i~0)} is VALID [2018-11-23 09:58:49,763 INFO L273 TraceCheckUtils]: 19: Hoare triple {2242#(= (_ bv13 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2246#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:49,764 INFO L273 TraceCheckUtils]: 20: Hoare triple {2246#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2250#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:49,765 INFO L273 TraceCheckUtils]: 21: Hoare triple {2250#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2254#(= (_ bv16 32) main_~i~0)} is VALID [2018-11-23 09:58:49,766 INFO L273 TraceCheckUtils]: 22: Hoare triple {2254#(= (_ bv16 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2258#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:49,767 INFO L273 TraceCheckUtils]: 23: Hoare triple {2258#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2262#(= (_ bv18 32) main_~i~0)} is VALID [2018-11-23 09:58:49,768 INFO L273 TraceCheckUtils]: 24: Hoare triple {2262#(= (_ bv18 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2266#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:49,770 INFO L273 TraceCheckUtils]: 25: Hoare triple {2266#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2270#(= (_ bv20 32) main_~i~0)} is VALID [2018-11-23 09:58:49,771 INFO L273 TraceCheckUtils]: 26: Hoare triple {2270#(= (_ bv20 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2274#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:49,773 INFO L273 TraceCheckUtils]: 27: Hoare triple {2274#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2278#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:49,777 INFO L273 TraceCheckUtils]: 28: Hoare triple {2278#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {2171#false} is VALID [2018-11-23 09:58:49,777 INFO L273 TraceCheckUtils]: 29: Hoare triple {2171#false} ~i~0 := 0bv32; {2171#false} is VALID [2018-11-23 09:58:49,777 INFO L273 TraceCheckUtils]: 30: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:49,778 INFO L273 TraceCheckUtils]: 31: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:49,778 INFO L273 TraceCheckUtils]: 32: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:49,778 INFO L273 TraceCheckUtils]: 33: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:49,778 INFO L273 TraceCheckUtils]: 34: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:49,778 INFO L273 TraceCheckUtils]: 35: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:49,779 INFO L273 TraceCheckUtils]: 36: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:49,779 INFO L273 TraceCheckUtils]: 37: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:49,779 INFO L273 TraceCheckUtils]: 38: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:49,779 INFO L273 TraceCheckUtils]: 39: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:49,780 INFO L273 TraceCheckUtils]: 40: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:49,780 INFO L273 TraceCheckUtils]: 41: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:49,780 INFO L273 TraceCheckUtils]: 42: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:49,780 INFO L273 TraceCheckUtils]: 43: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:49,781 INFO L273 TraceCheckUtils]: 44: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:49,781 INFO L273 TraceCheckUtils]: 45: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:49,781 INFO L273 TraceCheckUtils]: 46: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:49,781 INFO L273 TraceCheckUtils]: 47: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:49,781 INFO L273 TraceCheckUtils]: 48: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:49,782 INFO L273 TraceCheckUtils]: 49: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:49,782 INFO L273 TraceCheckUtils]: 50: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:49,782 INFO L273 TraceCheckUtils]: 51: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:49,782 INFO L273 TraceCheckUtils]: 52: Hoare triple {2171#false} assume !~bvslt32(~i~0, 100000bv32); {2171#false} is VALID [2018-11-23 09:58:49,782 INFO L273 TraceCheckUtils]: 53: Hoare triple {2171#false} ~i~0 := 0bv32; {2171#false} is VALID [2018-11-23 09:58:49,783 INFO L273 TraceCheckUtils]: 54: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:49,783 INFO L273 TraceCheckUtils]: 55: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:49,783 INFO L273 TraceCheckUtils]: 56: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:49,783 INFO L273 TraceCheckUtils]: 57: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:49,784 INFO L273 TraceCheckUtils]: 58: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:49,784 INFO L273 TraceCheckUtils]: 59: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:49,784 INFO L273 TraceCheckUtils]: 60: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:49,784 INFO L273 TraceCheckUtils]: 61: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:49,785 INFO L273 TraceCheckUtils]: 62: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:49,785 INFO L273 TraceCheckUtils]: 63: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:49,785 INFO L273 TraceCheckUtils]: 64: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:49,785 INFO L273 TraceCheckUtils]: 65: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:49,785 INFO L273 TraceCheckUtils]: 66: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:49,786 INFO L273 TraceCheckUtils]: 67: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:49,786 INFO L273 TraceCheckUtils]: 68: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:49,786 INFO L273 TraceCheckUtils]: 69: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:49,786 INFO L273 TraceCheckUtils]: 70: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:49,787 INFO L273 TraceCheckUtils]: 71: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:49,787 INFO L273 TraceCheckUtils]: 72: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:49,787 INFO L273 TraceCheckUtils]: 73: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:49,787 INFO L273 TraceCheckUtils]: 74: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:49,787 INFO L273 TraceCheckUtils]: 75: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:49,788 INFO L273 TraceCheckUtils]: 76: Hoare triple {2171#false} assume !~bvslt32(~i~0, 100000bv32); {2171#false} is VALID [2018-11-23 09:58:49,788 INFO L273 TraceCheckUtils]: 77: Hoare triple {2171#false} havoc ~x~0;~x~0 := 0bv32; {2171#false} is VALID [2018-11-23 09:58:49,788 INFO L273 TraceCheckUtils]: 78: Hoare triple {2171#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {2171#false} is VALID [2018-11-23 09:58:49,788 INFO L256 TraceCheckUtils]: 79: Hoare triple {2171#false} call __VERIFIER_assert((if 43bv32 == #t~mem1 then 1bv32 else 0bv32)); {2171#false} is VALID [2018-11-23 09:58:49,788 INFO L273 TraceCheckUtils]: 80: Hoare triple {2171#false} ~cond := #in~cond; {2171#false} is VALID [2018-11-23 09:58:49,789 INFO L273 TraceCheckUtils]: 81: Hoare triple {2171#false} assume 0bv32 == ~cond; {2171#false} is VALID [2018-11-23 09:58:49,789 INFO L273 TraceCheckUtils]: 82: Hoare triple {2171#false} assume !false; {2171#false} is VALID [2018-11-23 09:58:49,795 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2018-11-23 09:58:49,796 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:58:51,469 INFO L273 TraceCheckUtils]: 82: Hoare triple {2171#false} assume !false; {2171#false} is VALID [2018-11-23 09:58:51,469 INFO L273 TraceCheckUtils]: 81: Hoare triple {2171#false} assume 0bv32 == ~cond; {2171#false} is VALID [2018-11-23 09:58:51,469 INFO L273 TraceCheckUtils]: 80: Hoare triple {2171#false} ~cond := #in~cond; {2171#false} is VALID [2018-11-23 09:58:51,470 INFO L256 TraceCheckUtils]: 79: Hoare triple {2171#false} call __VERIFIER_assert((if 43bv32 == #t~mem1 then 1bv32 else 0bv32)); {2171#false} is VALID [2018-11-23 09:58:51,470 INFO L273 TraceCheckUtils]: 78: Hoare triple {2171#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {2171#false} is VALID [2018-11-23 09:58:51,470 INFO L273 TraceCheckUtils]: 77: Hoare triple {2171#false} havoc ~x~0;~x~0 := 0bv32; {2171#false} is VALID [2018-11-23 09:58:51,470 INFO L273 TraceCheckUtils]: 76: Hoare triple {2171#false} assume !~bvslt32(~i~0, 100000bv32); {2171#false} is VALID [2018-11-23 09:58:51,470 INFO L273 TraceCheckUtils]: 75: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:51,471 INFO L273 TraceCheckUtils]: 74: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:51,471 INFO L273 TraceCheckUtils]: 73: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:51,471 INFO L273 TraceCheckUtils]: 72: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:51,471 INFO L273 TraceCheckUtils]: 71: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:51,471 INFO L273 TraceCheckUtils]: 70: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:51,472 INFO L273 TraceCheckUtils]: 69: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:51,472 INFO L273 TraceCheckUtils]: 68: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:51,472 INFO L273 TraceCheckUtils]: 67: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:51,472 INFO L273 TraceCheckUtils]: 66: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:51,472 INFO L273 TraceCheckUtils]: 65: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:51,472 INFO L273 TraceCheckUtils]: 64: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:51,472 INFO L273 TraceCheckUtils]: 63: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:51,473 INFO L273 TraceCheckUtils]: 62: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:51,473 INFO L273 TraceCheckUtils]: 61: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:51,473 INFO L273 TraceCheckUtils]: 60: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:51,473 INFO L273 TraceCheckUtils]: 59: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:51,473 INFO L273 TraceCheckUtils]: 58: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:51,473 INFO L273 TraceCheckUtils]: 57: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:51,473 INFO L273 TraceCheckUtils]: 56: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:51,474 INFO L273 TraceCheckUtils]: 55: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:51,474 INFO L273 TraceCheckUtils]: 54: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:51,474 INFO L273 TraceCheckUtils]: 53: Hoare triple {2171#false} ~i~0 := 0bv32; {2171#false} is VALID [2018-11-23 09:58:51,474 INFO L273 TraceCheckUtils]: 52: Hoare triple {2171#false} assume !~bvslt32(~i~0, 100000bv32); {2171#false} is VALID [2018-11-23 09:58:51,474 INFO L273 TraceCheckUtils]: 51: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:51,474 INFO L273 TraceCheckUtils]: 50: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:51,474 INFO L273 TraceCheckUtils]: 49: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:51,475 INFO L273 TraceCheckUtils]: 48: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:51,475 INFO L273 TraceCheckUtils]: 47: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:51,475 INFO L273 TraceCheckUtils]: 46: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:51,475 INFO L273 TraceCheckUtils]: 45: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:51,475 INFO L273 TraceCheckUtils]: 44: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:51,475 INFO L273 TraceCheckUtils]: 43: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:51,476 INFO L273 TraceCheckUtils]: 42: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:51,476 INFO L273 TraceCheckUtils]: 41: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:51,476 INFO L273 TraceCheckUtils]: 40: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:51,476 INFO L273 TraceCheckUtils]: 39: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:51,477 INFO L273 TraceCheckUtils]: 38: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:51,477 INFO L273 TraceCheckUtils]: 37: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:51,477 INFO L273 TraceCheckUtils]: 36: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:51,477 INFO L273 TraceCheckUtils]: 35: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:51,477 INFO L273 TraceCheckUtils]: 34: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:51,478 INFO L273 TraceCheckUtils]: 33: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:51,478 INFO L273 TraceCheckUtils]: 32: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:51,478 INFO L273 TraceCheckUtils]: 31: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:51,478 INFO L273 TraceCheckUtils]: 30: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 09:58:51,478 INFO L273 TraceCheckUtils]: 29: Hoare triple {2171#false} ~i~0 := 0bv32; {2171#false} is VALID [2018-11-23 09:58:51,482 INFO L273 TraceCheckUtils]: 28: Hoare triple {2606#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {2171#false} is VALID [2018-11-23 09:58:51,483 INFO L273 TraceCheckUtils]: 27: Hoare triple {2610#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2606#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 09:58:51,489 INFO L273 TraceCheckUtils]: 26: Hoare triple {2614#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2610#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:51,492 INFO L273 TraceCheckUtils]: 25: Hoare triple {2618#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2614#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:51,497 INFO L273 TraceCheckUtils]: 24: Hoare triple {2622#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2618#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:51,502 INFO L273 TraceCheckUtils]: 23: Hoare triple {2626#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2622#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:51,508 INFO L273 TraceCheckUtils]: 22: Hoare triple {2630#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2626#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:51,514 INFO L273 TraceCheckUtils]: 21: Hoare triple {2634#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2630#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:51,520 INFO L273 TraceCheckUtils]: 20: Hoare triple {2638#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2634#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:51,523 INFO L273 TraceCheckUtils]: 19: Hoare triple {2642#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2638#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:51,530 INFO L273 TraceCheckUtils]: 18: Hoare triple {2646#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2642#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:51,536 INFO L273 TraceCheckUtils]: 17: Hoare triple {2650#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2646#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:51,540 INFO L273 TraceCheckUtils]: 16: Hoare triple {2654#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2650#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:51,546 INFO L273 TraceCheckUtils]: 15: Hoare triple {2658#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2654#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:51,552 INFO L273 TraceCheckUtils]: 14: Hoare triple {2662#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2658#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:51,558 INFO L273 TraceCheckUtils]: 13: Hoare triple {2666#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2662#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:51,566 INFO L273 TraceCheckUtils]: 12: Hoare triple {2670#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2666#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:51,570 INFO L273 TraceCheckUtils]: 11: Hoare triple {2674#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2670#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:51,575 INFO L273 TraceCheckUtils]: 10: Hoare triple {2678#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2674#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:51,580 INFO L273 TraceCheckUtils]: 9: Hoare triple {2682#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2678#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:51,591 INFO L273 TraceCheckUtils]: 8: Hoare triple {2686#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2682#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:51,598 INFO L273 TraceCheckUtils]: 7: Hoare triple {2690#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2686#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:51,602 INFO L273 TraceCheckUtils]: 6: Hoare triple {2694#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2690#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:51,604 INFO L273 TraceCheckUtils]: 5: Hoare triple {2170#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {2694#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:51,604 INFO L256 TraceCheckUtils]: 4: Hoare triple {2170#true} call #t~ret2 := main(); {2170#true} is VALID [2018-11-23 09:58:51,605 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2170#true} {2170#true} #74#return; {2170#true} is VALID [2018-11-23 09:58:51,605 INFO L273 TraceCheckUtils]: 2: Hoare triple {2170#true} assume true; {2170#true} is VALID [2018-11-23 09:58:51,605 INFO L273 TraceCheckUtils]: 1: Hoare triple {2170#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2170#true} is VALID [2018-11-23 09:58:51,605 INFO L256 TraceCheckUtils]: 0: Hoare triple {2170#true} call ULTIMATE.init(); {2170#true} is VALID [2018-11-23 09:58:51,610 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2018-11-23 09:58:51,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:58:51,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-23 09:58:51,615 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 83 [2018-11-23 09:58:51,616 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:58:51,616 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 09:58:51,744 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:51,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 09:58:51,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 09:58:51,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 09:58:51,746 INFO L87 Difference]: Start difference. First operand 88 states and 91 transitions. Second operand 48 states. [2018-11-23 09:58:55,419 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-23 09:58:55,886 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-23 09:58:56,442 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-23 09:58:56,994 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-23 09:58:57,570 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-23 09:58:58,171 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 7 [2018-11-23 09:58:58,741 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 7 [2018-11-23 09:58:59,343 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 7 [2018-11-23 09:59:19,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:59:19,797 INFO L93 Difference]: Finished difference Result 219 states and 296 transitions. [2018-11-23 09:59:19,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 09:59:19,797 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 83 [2018-11-23 09:59:19,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:59:19,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 09:59:19,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 252 transitions. [2018-11-23 09:59:19,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 09:59:19,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 252 transitions. [2018-11-23 09:59:19,808 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 252 transitions. [2018-11-23 09:59:20,510 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 252 edges. 252 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:59:20,514 INFO L225 Difference]: With dead ends: 219 [2018-11-23 09:59:20,514 INFO L226 Difference]: Without dead ends: 160 [2018-11-23 09:59:20,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2018-11-23 09:59:20,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-11-23 09:59:20,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-11-23 09:59:20,910 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:59:20,910 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand 160 states. [2018-11-23 09:59:20,910 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand 160 states. [2018-11-23 09:59:20,910 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 160 states. [2018-11-23 09:59:20,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:59:20,916 INFO L93 Difference]: Finished difference Result 160 states and 163 transitions. [2018-11-23 09:59:20,916 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 163 transitions. [2018-11-23 09:59:20,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:59:20,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:59:20,917 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand 160 states. [2018-11-23 09:59:20,917 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 160 states. [2018-11-23 09:59:20,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:59:20,922 INFO L93 Difference]: Finished difference Result 160 states and 163 transitions. [2018-11-23 09:59:20,923 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 163 transitions. [2018-11-23 09:59:20,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:59:20,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:59:20,923 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:59:20,924 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:59:20,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-11-23 09:59:20,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 163 transitions. [2018-11-23 09:59:20,929 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 163 transitions. Word has length 83 [2018-11-23 09:59:20,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:59:20,929 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 163 transitions. [2018-11-23 09:59:20,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 09:59:20,929 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 163 transitions. [2018-11-23 09:59:20,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-23 09:59:20,934 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:59:20,935 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:59:20,935 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:59:20,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:59:20,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1443637350, now seen corresponding path program 5 times [2018-11-23 09:59:20,936 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:59:20,937 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:59:20,955 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1