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_copy5_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:02:29,976 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:02:29,978 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:02:29,990 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:02:29,991 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:02:29,992 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:02:29,993 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:02:29,995 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:02:29,997 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:02:29,998 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:02:29,999 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:02:29,999 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:02:30,000 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:02:30,001 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:02:30,003 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:02:30,003 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:02:30,005 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:02:30,007 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:02:30,009 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:02:30,011 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:02:30,012 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:02:30,013 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:02:30,019 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:02:30,019 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:02:30,020 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:02:30,021 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:02:30,022 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:02:30,022 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:02:30,023 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:02:30,024 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:02:30,025 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:02:30,025 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:02:30,026 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:02:30,026 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:02:30,027 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:02:30,028 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:02:30,028 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 10:02:30,056 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:02:30,056 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:02:30,057 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:02:30,057 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:02:30,058 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:02:30,058 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:02:30,058 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:02:30,059 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:02:30,059 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:02:30,059 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:02:30,060 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:02:30,060 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:02:30,060 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:02:30,060 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:02:30,060 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:02:30,061 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:02:30,061 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:02:30,061 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:02:30,061 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:02:30,061 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:02:30,062 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:02:30,063 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:02:30,063 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:02:30,063 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:02:30,063 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:02:30,064 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:02:30,064 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:02:30,064 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:02:30,064 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:02:30,065 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:02:30,065 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:02:30,065 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:02:30,065 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:02:30,135 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:02:30,151 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:02:30,156 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:02:30,158 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:02:30,159 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:02:30,160 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy5_true-unreach-call_ground.i [2018-11-23 10:02:30,232 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f82c77007/b8a0754c68b84d05abca33c7f38df315/FLAG705d8bd69 [2018-11-23 10:02:30,696 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:02:30,697 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy5_true-unreach-call_ground.i [2018-11-23 10:02:30,704 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f82c77007/b8a0754c68b84d05abca33c7f38df315/FLAG705d8bd69 [2018-11-23 10:02:31,065 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f82c77007/b8a0754c68b84d05abca33c7f38df315 [2018-11-23 10:02:31,076 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:02:31,077 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:02:31,078 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:02:31,078 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:02:31,082 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:02:31,084 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:02:31" (1/1) ... [2018-11-23 10:02:31,087 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d62dc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:31, skipping insertion in model container [2018-11-23 10:02:31,088 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:02:31" (1/1) ... [2018-11-23 10:02:31,098 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:02:31,128 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:02:31,404 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:02:31,411 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:02:31,469 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:02:31,499 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:02:31,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:31 WrapperNode [2018-11-23 10:02:31,500 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:02:31,500 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:02:31,501 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:02:31,501 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:02:31,510 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:31" (1/1) ... [2018-11-23 10:02:31,523 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:31" (1/1) ... [2018-11-23 10:02:31,533 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:02:31,534 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:02:31,534 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:02:31,534 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:02:31,545 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:31" (1/1) ... [2018-11-23 10:02:31,545 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:31" (1/1) ... [2018-11-23 10:02:31,548 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:31" (1/1) ... [2018-11-23 10:02:31,549 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:31" (1/1) ... [2018-11-23 10:02:31,573 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:31" (1/1) ... [2018-11-23 10:02:31,592 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:31" (1/1) ... [2018-11-23 10:02:31,594 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:31" (1/1) ... [2018-11-23 10:02:31,597 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:02:31,598 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:02:31,598 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:02:31,598 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:02:31,602 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:31" (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 10:02:31,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:02:31,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:02:31,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 10:02:31,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 10:02:31,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:02:31,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:02:31,755 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:02:31,755 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:02:31,755 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 10:02:31,755 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 10:02:31,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 10:02:31,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 10:02:32,642 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:02:32,643 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-23 10:02:32,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:02:32 BoogieIcfgContainer [2018-11-23 10:02:32,643 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:02:32,644 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:02:32,644 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:02:32,648 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:02:32,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:02:31" (1/3) ... [2018-11-23 10:02:32,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@782c31ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:02:32, skipping insertion in model container [2018-11-23 10:02:32,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:31" (2/3) ... [2018-11-23 10:02:32,650 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@782c31ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:02:32, skipping insertion in model container [2018-11-23 10:02:32,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:02:32" (3/3) ... [2018-11-23 10:02:32,652 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_copy5_true-unreach-call_ground.i [2018-11-23 10:02:32,663 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:02:32,672 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:02:32,691 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:02:32,725 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:02:32,725 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:02:32,725 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:02:32,726 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:02:32,726 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:02:32,726 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:02:32,726 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:02:32,726 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:02:32,726 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:02:32,744 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2018-11-23 10:02:32,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 10:02:32,751 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:32,751 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, 1, 1, 1] [2018-11-23 10:02:32,754 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:32,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:32,760 INFO L82 PathProgramCache]: Analyzing trace with hash -2095174276, now seen corresponding path program 1 times [2018-11-23 10:02:32,764 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:32,765 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 10:02:32,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:02:32,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:32,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:32,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:33,032 INFO L256 TraceCheckUtils]: 0: Hoare triple {42#true} call ULTIMATE.init(); {42#true} is VALID [2018-11-23 10:02:33,036 INFO L273 TraceCheckUtils]: 1: Hoare triple {42#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {42#true} is VALID [2018-11-23 10:02:33,036 INFO L273 TraceCheckUtils]: 2: Hoare triple {42#true} assume true; {42#true} is VALID [2018-11-23 10:02:33,037 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} #119#return; {42#true} is VALID [2018-11-23 10:02:33,037 INFO L256 TraceCheckUtils]: 4: Hoare triple {42#true} call #t~ret15 := main(); {42#true} is VALID [2018-11-23 10:02:33,037 INFO L273 TraceCheckUtils]: 5: Hoare triple {42#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {42#true} is VALID [2018-11-23 10:02:33,038 INFO L273 TraceCheckUtils]: 6: Hoare triple {42#true} assume !true; {43#false} is VALID [2018-11-23 10:02:33,038 INFO L273 TraceCheckUtils]: 7: Hoare triple {43#false} havoc ~i~0;~i~0 := 0bv32; {43#false} is VALID [2018-11-23 10:02:33,039 INFO L273 TraceCheckUtils]: 8: Hoare triple {43#false} assume !~bvslt32(~i~0, 100000bv32); {43#false} is VALID [2018-11-23 10:02:33,039 INFO L273 TraceCheckUtils]: 9: Hoare triple {43#false} ~i~0 := 0bv32; {43#false} is VALID [2018-11-23 10:02:33,040 INFO L273 TraceCheckUtils]: 10: Hoare triple {43#false} assume !~bvslt32(~i~0, 100000bv32); {43#false} is VALID [2018-11-23 10:02:33,040 INFO L273 TraceCheckUtils]: 11: Hoare triple {43#false} ~i~0 := 0bv32; {43#false} is VALID [2018-11-23 10:02:33,040 INFO L273 TraceCheckUtils]: 12: Hoare triple {43#false} assume !~bvslt32(~i~0, 100000bv32); {43#false} is VALID [2018-11-23 10:02:33,041 INFO L273 TraceCheckUtils]: 13: Hoare triple {43#false} ~i~0 := 0bv32; {43#false} is VALID [2018-11-23 10:02:33,041 INFO L273 TraceCheckUtils]: 14: Hoare triple {43#false} assume !~bvslt32(~i~0, 100000bv32); {43#false} is VALID [2018-11-23 10:02:33,041 INFO L273 TraceCheckUtils]: 15: Hoare triple {43#false} ~i~0 := 0bv32; {43#false} is VALID [2018-11-23 10:02:33,042 INFO L273 TraceCheckUtils]: 16: Hoare triple {43#false} assume !~bvslt32(~i~0, 100000bv32); {43#false} is VALID [2018-11-23 10:02:33,042 INFO L273 TraceCheckUtils]: 17: Hoare triple {43#false} havoc ~x~0;~x~0 := 0bv32; {43#false} is VALID [2018-11-23 10:02:33,042 INFO L273 TraceCheckUtils]: 18: Hoare triple {43#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem13 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem14 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {43#false} is VALID [2018-11-23 10:02:33,043 INFO L256 TraceCheckUtils]: 19: Hoare triple {43#false} call __VERIFIER_assert((if #t~mem13 == #t~mem14 then 1bv32 else 0bv32)); {43#false} is VALID [2018-11-23 10:02:33,043 INFO L273 TraceCheckUtils]: 20: Hoare triple {43#false} ~cond := #in~cond; {43#false} is VALID [2018-11-23 10:02:33,044 INFO L273 TraceCheckUtils]: 21: Hoare triple {43#false} assume 0bv32 == ~cond; {43#false} is VALID [2018-11-23 10:02:33,044 INFO L273 TraceCheckUtils]: 22: Hoare triple {43#false} assume !false; {43#false} is VALID [2018-11-23 10:02:33,048 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 10:02:33,049 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:02:33,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:02:33,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 10:02:33,071 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2018-11-23 10:02:33,075 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:33,080 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 10:02:33,155 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 10:02:33,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 10:02:33,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 10:02:33,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:02:33,167 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 2 states. [2018-11-23 10:02:33,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:33,412 INFO L93 Difference]: Finished difference Result 70 states and 97 transitions. [2018-11-23 10:02:33,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 10:02:33,412 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2018-11-23 10:02:33,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:33,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:02:33,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 97 transitions. [2018-11-23 10:02:33,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:02:33,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 97 transitions. [2018-11-23 10:02:33,435 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 97 transitions. [2018-11-23 10:02:34,020 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:34,048 INFO L225 Difference]: With dead ends: 70 [2018-11-23 10:02:34,048 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 10:02:34,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 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 10:02:34,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 10:02:34,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-23 10:02:34,267 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:34,268 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 34 states. [2018-11-23 10:02:34,269 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-23 10:02:34,269 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-23 10:02:34,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:34,274 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2018-11-23 10:02:34,274 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2018-11-23 10:02:34,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:34,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:34,275 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-23 10:02:34,276 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-23 10:02:34,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:34,281 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2018-11-23 10:02:34,281 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2018-11-23 10:02:34,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:34,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:34,283 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:34,283 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:34,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 10:02:34,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2018-11-23 10:02:34,289 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 23 [2018-11-23 10:02:34,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:34,289 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2018-11-23 10:02:34,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 10:02:34,290 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2018-11-23 10:02:34,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 10:02:34,291 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:34,291 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, 1, 1, 1] [2018-11-23 10:02:34,292 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:34,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:34,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1625097866, now seen corresponding path program 1 times [2018-11-23 10:02:34,293 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:34,293 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 10:02:34,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:02:34,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:34,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:34,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:34,460 INFO L256 TraceCheckUtils]: 0: Hoare triple {318#true} call ULTIMATE.init(); {318#true} is VALID [2018-11-23 10:02:34,461 INFO L273 TraceCheckUtils]: 1: Hoare triple {318#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {318#true} is VALID [2018-11-23 10:02:34,461 INFO L273 TraceCheckUtils]: 2: Hoare triple {318#true} assume true; {318#true} is VALID [2018-11-23 10:02:34,462 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {318#true} {318#true} #119#return; {318#true} is VALID [2018-11-23 10:02:34,463 INFO L256 TraceCheckUtils]: 4: Hoare triple {318#true} call #t~ret15 := main(); {318#true} is VALID [2018-11-23 10:02:34,469 INFO L273 TraceCheckUtils]: 5: Hoare triple {318#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {338#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:02:34,470 INFO L273 TraceCheckUtils]: 6: Hoare triple {338#(= main_~a~0 (_ bv0 32))} assume !~bvslt32(~a~0, 100000bv32); {319#false} is VALID [2018-11-23 10:02:34,471 INFO L273 TraceCheckUtils]: 7: Hoare triple {319#false} havoc ~i~0;~i~0 := 0bv32; {319#false} is VALID [2018-11-23 10:02:34,471 INFO L273 TraceCheckUtils]: 8: Hoare triple {319#false} assume !~bvslt32(~i~0, 100000bv32); {319#false} is VALID [2018-11-23 10:02:34,471 INFO L273 TraceCheckUtils]: 9: Hoare triple {319#false} ~i~0 := 0bv32; {319#false} is VALID [2018-11-23 10:02:34,471 INFO L273 TraceCheckUtils]: 10: Hoare triple {319#false} assume !~bvslt32(~i~0, 100000bv32); {319#false} is VALID [2018-11-23 10:02:34,472 INFO L273 TraceCheckUtils]: 11: Hoare triple {319#false} ~i~0 := 0bv32; {319#false} is VALID [2018-11-23 10:02:34,472 INFO L273 TraceCheckUtils]: 12: Hoare triple {319#false} assume !~bvslt32(~i~0, 100000bv32); {319#false} is VALID [2018-11-23 10:02:34,472 INFO L273 TraceCheckUtils]: 13: Hoare triple {319#false} ~i~0 := 0bv32; {319#false} is VALID [2018-11-23 10:02:34,473 INFO L273 TraceCheckUtils]: 14: Hoare triple {319#false} assume !~bvslt32(~i~0, 100000bv32); {319#false} is VALID [2018-11-23 10:02:34,473 INFO L273 TraceCheckUtils]: 15: Hoare triple {319#false} ~i~0 := 0bv32; {319#false} is VALID [2018-11-23 10:02:34,473 INFO L273 TraceCheckUtils]: 16: Hoare triple {319#false} assume !~bvslt32(~i~0, 100000bv32); {319#false} is VALID [2018-11-23 10:02:34,474 INFO L273 TraceCheckUtils]: 17: Hoare triple {319#false} havoc ~x~0;~x~0 := 0bv32; {319#false} is VALID [2018-11-23 10:02:34,474 INFO L273 TraceCheckUtils]: 18: Hoare triple {319#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem13 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem14 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {319#false} is VALID [2018-11-23 10:02:34,474 INFO L256 TraceCheckUtils]: 19: Hoare triple {319#false} call __VERIFIER_assert((if #t~mem13 == #t~mem14 then 1bv32 else 0bv32)); {319#false} is VALID [2018-11-23 10:02:34,475 INFO L273 TraceCheckUtils]: 20: Hoare triple {319#false} ~cond := #in~cond; {319#false} is VALID [2018-11-23 10:02:34,475 INFO L273 TraceCheckUtils]: 21: Hoare triple {319#false} assume 0bv32 == ~cond; {319#false} is VALID [2018-11-23 10:02:34,475 INFO L273 TraceCheckUtils]: 22: Hoare triple {319#false} assume !false; {319#false} is VALID [2018-11-23 10:02:34,477 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 10:02:34,478 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (3)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 10:02:34,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:02:34,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:02:34,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 10:02:34,487 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:34,487 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:02:34,583 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 10:02:34,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:02:34,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:02:34,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:02:34,584 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 3 states. [2018-11-23 10:02:34,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:34,969 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2018-11-23 10:02:34,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:02:34,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 10:02:34,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:34,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:02:34,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2018-11-23 10:02:34,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:02:34,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2018-11-23 10:02:34,977 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 74 transitions. [2018-11-23 10:02:35,156 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:35,158 INFO L225 Difference]: With dead ends: 62 [2018-11-23 10:02:35,159 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 10:02:35,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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 10:02:35,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 10:02:35,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-11-23 10:02:35,212 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:35,212 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 35 states. [2018-11-23 10:02:35,212 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 35 states. [2018-11-23 10:02:35,213 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 35 states. [2018-11-23 10:02:35,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:35,217 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2018-11-23 10:02:35,217 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2018-11-23 10:02:35,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:35,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:35,218 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 36 states. [2018-11-23 10:02:35,218 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 36 states. [2018-11-23 10:02:35,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:35,222 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2018-11-23 10:02:35,222 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2018-11-23 10:02:35,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:35,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:35,223 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:35,223 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:35,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 10:02:35,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2018-11-23 10:02:35,226 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 23 [2018-11-23 10:02:35,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:35,227 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2018-11-23 10:02:35,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:02:35,227 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2018-11-23 10:02:35,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 10:02:35,228 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:35,228 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, 1, 1, 1, 1, 1] [2018-11-23 10:02:35,229 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:35,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:35,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1623092332, now seen corresponding path program 1 times [2018-11-23 10:02:35,230 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:35,230 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 10:02:35,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:02:35,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:35,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:35,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:35,398 INFO L256 TraceCheckUtils]: 0: Hoare triple {594#true} call ULTIMATE.init(); {594#true} is VALID [2018-11-23 10:02:35,398 INFO L273 TraceCheckUtils]: 1: Hoare triple {594#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {594#true} is VALID [2018-11-23 10:02:35,399 INFO L273 TraceCheckUtils]: 2: Hoare triple {594#true} assume true; {594#true} is VALID [2018-11-23 10:02:35,399 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {594#true} {594#true} #119#return; {594#true} is VALID [2018-11-23 10:02:35,400 INFO L256 TraceCheckUtils]: 4: Hoare triple {594#true} call #t~ret15 := main(); {594#true} is VALID [2018-11-23 10:02:35,403 INFO L273 TraceCheckUtils]: 5: Hoare triple {594#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {614#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:02:35,404 INFO L273 TraceCheckUtils]: 6: Hoare triple {614#(= main_~a~0 (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {614#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:02:35,408 INFO L273 TraceCheckUtils]: 7: Hoare triple {614#(= main_~a~0 (_ bv0 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {621#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 10:02:35,408 INFO L273 TraceCheckUtils]: 8: Hoare triple {621#(= (_ bv1 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {595#false} is VALID [2018-11-23 10:02:35,408 INFO L273 TraceCheckUtils]: 9: Hoare triple {595#false} havoc ~i~0;~i~0 := 0bv32; {595#false} is VALID [2018-11-23 10:02:35,409 INFO L273 TraceCheckUtils]: 10: Hoare triple {595#false} assume !~bvslt32(~i~0, 100000bv32); {595#false} is VALID [2018-11-23 10:02:35,409 INFO L273 TraceCheckUtils]: 11: Hoare triple {595#false} ~i~0 := 0bv32; {595#false} is VALID [2018-11-23 10:02:35,409 INFO L273 TraceCheckUtils]: 12: Hoare triple {595#false} assume !~bvslt32(~i~0, 100000bv32); {595#false} is VALID [2018-11-23 10:02:35,409 INFO L273 TraceCheckUtils]: 13: Hoare triple {595#false} ~i~0 := 0bv32; {595#false} is VALID [2018-11-23 10:02:35,410 INFO L273 TraceCheckUtils]: 14: Hoare triple {595#false} assume !~bvslt32(~i~0, 100000bv32); {595#false} is VALID [2018-11-23 10:02:35,410 INFO L273 TraceCheckUtils]: 15: Hoare triple {595#false} ~i~0 := 0bv32; {595#false} is VALID [2018-11-23 10:02:35,410 INFO L273 TraceCheckUtils]: 16: Hoare triple {595#false} assume !~bvslt32(~i~0, 100000bv32); {595#false} is VALID [2018-11-23 10:02:35,410 INFO L273 TraceCheckUtils]: 17: Hoare triple {595#false} ~i~0 := 0bv32; {595#false} is VALID [2018-11-23 10:02:35,411 INFO L273 TraceCheckUtils]: 18: Hoare triple {595#false} assume !~bvslt32(~i~0, 100000bv32); {595#false} is VALID [2018-11-23 10:02:35,411 INFO L273 TraceCheckUtils]: 19: Hoare triple {595#false} havoc ~x~0;~x~0 := 0bv32; {595#false} is VALID [2018-11-23 10:02:35,411 INFO L273 TraceCheckUtils]: 20: Hoare triple {595#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem13 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem14 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {595#false} is VALID [2018-11-23 10:02:35,412 INFO L256 TraceCheckUtils]: 21: Hoare triple {595#false} call __VERIFIER_assert((if #t~mem13 == #t~mem14 then 1bv32 else 0bv32)); {595#false} is VALID [2018-11-23 10:02:35,412 INFO L273 TraceCheckUtils]: 22: Hoare triple {595#false} ~cond := #in~cond; {595#false} is VALID [2018-11-23 10:02:35,412 INFO L273 TraceCheckUtils]: 23: Hoare triple {595#false} assume 0bv32 == ~cond; {595#false} is VALID [2018-11-23 10:02:35,413 INFO L273 TraceCheckUtils]: 24: Hoare triple {595#false} assume !false; {595#false} is VALID [2018-11-23 10:02:35,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:02:35,414 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:02:35,549 INFO L273 TraceCheckUtils]: 24: Hoare triple {595#false} assume !false; {595#false} is VALID [2018-11-23 10:02:35,550 INFO L273 TraceCheckUtils]: 23: Hoare triple {595#false} assume 0bv32 == ~cond; {595#false} is VALID [2018-11-23 10:02:35,550 INFO L273 TraceCheckUtils]: 22: Hoare triple {595#false} ~cond := #in~cond; {595#false} is VALID [2018-11-23 10:02:35,550 INFO L256 TraceCheckUtils]: 21: Hoare triple {595#false} call __VERIFIER_assert((if #t~mem13 == #t~mem14 then 1bv32 else 0bv32)); {595#false} is VALID [2018-11-23 10:02:35,551 INFO L273 TraceCheckUtils]: 20: Hoare triple {595#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem13 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem14 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {595#false} is VALID [2018-11-23 10:02:35,551 INFO L273 TraceCheckUtils]: 19: Hoare triple {595#false} havoc ~x~0;~x~0 := 0bv32; {595#false} is VALID [2018-11-23 10:02:35,551 INFO L273 TraceCheckUtils]: 18: Hoare triple {595#false} assume !~bvslt32(~i~0, 100000bv32); {595#false} is VALID [2018-11-23 10:02:35,552 INFO L273 TraceCheckUtils]: 17: Hoare triple {595#false} ~i~0 := 0bv32; {595#false} is VALID [2018-11-23 10:02:35,552 INFO L273 TraceCheckUtils]: 16: Hoare triple {595#false} assume !~bvslt32(~i~0, 100000bv32); {595#false} is VALID [2018-11-23 10:02:35,552 INFO L273 TraceCheckUtils]: 15: Hoare triple {595#false} ~i~0 := 0bv32; {595#false} is VALID [2018-11-23 10:02:35,552 INFO L273 TraceCheckUtils]: 14: Hoare triple {595#false} assume !~bvslt32(~i~0, 100000bv32); {595#false} is VALID [2018-11-23 10:02:35,553 INFO L273 TraceCheckUtils]: 13: Hoare triple {595#false} ~i~0 := 0bv32; {595#false} is VALID [2018-11-23 10:02:35,553 INFO L273 TraceCheckUtils]: 12: Hoare triple {595#false} assume !~bvslt32(~i~0, 100000bv32); {595#false} is VALID [2018-11-23 10:02:35,553 INFO L273 TraceCheckUtils]: 11: Hoare triple {595#false} ~i~0 := 0bv32; {595#false} is VALID [2018-11-23 10:02:35,553 INFO L273 TraceCheckUtils]: 10: Hoare triple {595#false} assume !~bvslt32(~i~0, 100000bv32); {595#false} is VALID [2018-11-23 10:02:35,554 INFO L273 TraceCheckUtils]: 9: Hoare triple {595#false} havoc ~i~0;~i~0 := 0bv32; {595#false} is VALID [2018-11-23 10:02:35,555 INFO L273 TraceCheckUtils]: 8: Hoare triple {721#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {595#false} is VALID [2018-11-23 10:02:35,556 INFO L273 TraceCheckUtils]: 7: Hoare triple {725#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {721#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-23 10:02:35,557 INFO L273 TraceCheckUtils]: 6: Hoare triple {725#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {725#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:35,559 INFO L273 TraceCheckUtils]: 5: Hoare triple {594#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {725#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:35,560 INFO L256 TraceCheckUtils]: 4: Hoare triple {594#true} call #t~ret15 := main(); {594#true} is VALID [2018-11-23 10:02:35,560 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {594#true} {594#true} #119#return; {594#true} is VALID [2018-11-23 10:02:35,561 INFO L273 TraceCheckUtils]: 2: Hoare triple {594#true} assume true; {594#true} is VALID [2018-11-23 10:02:35,561 INFO L273 TraceCheckUtils]: 1: Hoare triple {594#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {594#true} is VALID [2018-11-23 10:02:35,561 INFO L256 TraceCheckUtils]: 0: Hoare triple {594#true} call ULTIMATE.init(); {594#true} is VALID [2018-11-23 10:02:35,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:02:35,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:02:35,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 10:02:35,565 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-11-23 10:02:35,566 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:35,566 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 10:02:35,730 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 10:02:35,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 10:02:35,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 10:02:35,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 10:02:35,731 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 6 states. [2018-11-23 10:02:36,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:36,085 INFO L93 Difference]: Finished difference Result 67 states and 81 transitions. [2018-11-23 10:02:36,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 10:02:36,085 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-11-23 10:02:36,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:36,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:02:36,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2018-11-23 10:02:36,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:02:36,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2018-11-23 10:02:36,092 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 81 transitions. [2018-11-23 10:02:36,226 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:36,229 INFO L225 Difference]: With dead ends: 67 [2018-11-23 10:02:36,230 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 10:02:36,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 10:02:36,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 10:02:36,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-23 10:02:36,251 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:36,251 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 41 states. [2018-11-23 10:02:36,252 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2018-11-23 10:02:36,252 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2018-11-23 10:02:36,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:36,254 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2018-11-23 10:02:36,255 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-11-23 10:02:36,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:36,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:36,256 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2018-11-23 10:02:36,256 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2018-11-23 10:02:36,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:36,259 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2018-11-23 10:02:36,259 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-11-23 10:02:36,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:36,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:36,260 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:36,260 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:36,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 10:02:36,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2018-11-23 10:02:36,263 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 25 [2018-11-23 10:02:36,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:36,263 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-11-23 10:02:36,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 10:02:36,264 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-11-23 10:02:36,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 10:02:36,265 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:36,265 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:36,265 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:36,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:36,266 INFO L82 PathProgramCache]: Analyzing trace with hash -213351186, now seen corresponding path program 2 times [2018-11-23 10:02:36,266 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:36,266 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 10:02:36,284 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:02:36,321 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 10:02:36,322 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:02:36,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:36,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:36,458 INFO L256 TraceCheckUtils]: 0: Hoare triple {983#true} call ULTIMATE.init(); {983#true} is VALID [2018-11-23 10:02:36,459 INFO L273 TraceCheckUtils]: 1: Hoare triple {983#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {983#true} is VALID [2018-11-23 10:02:36,459 INFO L273 TraceCheckUtils]: 2: Hoare triple {983#true} assume true; {983#true} is VALID [2018-11-23 10:02:36,459 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {983#true} {983#true} #119#return; {983#true} is VALID [2018-11-23 10:02:36,460 INFO L256 TraceCheckUtils]: 4: Hoare triple {983#true} call #t~ret15 := main(); {983#true} is VALID [2018-11-23 10:02:36,460 INFO L273 TraceCheckUtils]: 5: Hoare triple {983#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {983#true} is VALID [2018-11-23 10:02:36,460 INFO L273 TraceCheckUtils]: 6: Hoare triple {983#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {983#true} is VALID [2018-11-23 10:02:36,460 INFO L273 TraceCheckUtils]: 7: Hoare triple {983#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {983#true} is VALID [2018-11-23 10:02:36,461 INFO L273 TraceCheckUtils]: 8: Hoare triple {983#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {983#true} is VALID [2018-11-23 10:02:36,461 INFO L273 TraceCheckUtils]: 9: Hoare triple {983#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {983#true} is VALID [2018-11-23 10:02:36,461 INFO L273 TraceCheckUtils]: 10: Hoare triple {983#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {983#true} is VALID [2018-11-23 10:02:36,462 INFO L273 TraceCheckUtils]: 11: Hoare triple {983#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {983#true} is VALID [2018-11-23 10:02:36,462 INFO L273 TraceCheckUtils]: 12: Hoare triple {983#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {983#true} is VALID [2018-11-23 10:02:36,462 INFO L273 TraceCheckUtils]: 13: Hoare triple {983#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {983#true} is VALID [2018-11-23 10:02:36,462 INFO L273 TraceCheckUtils]: 14: Hoare triple {983#true} assume !~bvslt32(~a~0, 100000bv32); {983#true} is VALID [2018-11-23 10:02:36,471 INFO L273 TraceCheckUtils]: 15: Hoare triple {983#true} havoc ~i~0;~i~0 := 0bv32; {1033#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:02:36,472 INFO L273 TraceCheckUtils]: 16: Hoare triple {1033#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {984#false} is VALID [2018-11-23 10:02:36,472 INFO L273 TraceCheckUtils]: 17: Hoare triple {984#false} ~i~0 := 0bv32; {984#false} is VALID [2018-11-23 10:02:36,472 INFO L273 TraceCheckUtils]: 18: Hoare triple {984#false} assume !~bvslt32(~i~0, 100000bv32); {984#false} is VALID [2018-11-23 10:02:36,472 INFO L273 TraceCheckUtils]: 19: Hoare triple {984#false} ~i~0 := 0bv32; {984#false} is VALID [2018-11-23 10:02:36,472 INFO L273 TraceCheckUtils]: 20: Hoare triple {984#false} assume !~bvslt32(~i~0, 100000bv32); {984#false} is VALID [2018-11-23 10:02:36,473 INFO L273 TraceCheckUtils]: 21: Hoare triple {984#false} ~i~0 := 0bv32; {984#false} is VALID [2018-11-23 10:02:36,473 INFO L273 TraceCheckUtils]: 22: Hoare triple {984#false} assume !~bvslt32(~i~0, 100000bv32); {984#false} is VALID [2018-11-23 10:02:36,473 INFO L273 TraceCheckUtils]: 23: Hoare triple {984#false} ~i~0 := 0bv32; {984#false} is VALID [2018-11-23 10:02:36,473 INFO L273 TraceCheckUtils]: 24: Hoare triple {984#false} assume !~bvslt32(~i~0, 100000bv32); {984#false} is VALID [2018-11-23 10:02:36,474 INFO L273 TraceCheckUtils]: 25: Hoare triple {984#false} havoc ~x~0;~x~0 := 0bv32; {984#false} is VALID [2018-11-23 10:02:36,474 INFO L273 TraceCheckUtils]: 26: Hoare triple {984#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem13 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem14 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {984#false} is VALID [2018-11-23 10:02:36,474 INFO L256 TraceCheckUtils]: 27: Hoare triple {984#false} call __VERIFIER_assert((if #t~mem13 == #t~mem14 then 1bv32 else 0bv32)); {984#false} is VALID [2018-11-23 10:02:36,474 INFO L273 TraceCheckUtils]: 28: Hoare triple {984#false} ~cond := #in~cond; {984#false} is VALID [2018-11-23 10:02:36,475 INFO L273 TraceCheckUtils]: 29: Hoare triple {984#false} assume 0bv32 == ~cond; {984#false} is VALID [2018-11-23 10:02:36,475 INFO L273 TraceCheckUtils]: 30: Hoare triple {984#false} assume !false; {984#false} is VALID [2018-11-23 10:02:36,477 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 10:02:36,477 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:02:36,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:02:36,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:02:36,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 10:02:36,484 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:36,484 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:02:36,531 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:36,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:02:36,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:02:36,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:02:36,533 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 3 states. [2018-11-23 10:02:36,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:36,760 INFO L93 Difference]: Finished difference Result 74 states and 89 transitions. [2018-11-23 10:02:36,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:02:36,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 10:02:36,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:36,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:02:36,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2018-11-23 10:02:36,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:02:36,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2018-11-23 10:02:36,767 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 82 transitions. [2018-11-23 10:02:37,043 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:37,045 INFO L225 Difference]: With dead ends: 74 [2018-11-23 10:02:37,045 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 10:02:37,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 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 10:02:37,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 10:02:37,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2018-11-23 10:02:37,155 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:37,156 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 46 states. [2018-11-23 10:02:37,156 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 46 states. [2018-11-23 10:02:37,156 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 46 states. [2018-11-23 10:02:37,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:37,158 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2018-11-23 10:02:37,158 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-11-23 10:02:37,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:37,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:37,160 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 51 states. [2018-11-23 10:02:37,160 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 51 states. [2018-11-23 10:02:37,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:37,163 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2018-11-23 10:02:37,163 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-11-23 10:02:37,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:37,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:37,164 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:37,164 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:37,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 10:02:37,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-11-23 10:02:37,167 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 31 [2018-11-23 10:02:37,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:37,167 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-11-23 10:02:37,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:02:37,167 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-11-23 10:02:37,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 10:02:37,169 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:37,169 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:37,169 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:37,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:37,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1237359932, now seen corresponding path program 1 times [2018-11-23 10:02:37,170 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:37,170 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 10:02:37,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 10:02:37,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:37,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:37,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:37,414 INFO L256 TraceCheckUtils]: 0: Hoare triple {1351#true} call ULTIMATE.init(); {1351#true} is VALID [2018-11-23 10:02:37,415 INFO L273 TraceCheckUtils]: 1: Hoare triple {1351#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1351#true} is VALID [2018-11-23 10:02:37,415 INFO L273 TraceCheckUtils]: 2: Hoare triple {1351#true} assume true; {1351#true} is VALID [2018-11-23 10:02:37,416 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1351#true} {1351#true} #119#return; {1351#true} is VALID [2018-11-23 10:02:37,416 INFO L256 TraceCheckUtils]: 4: Hoare triple {1351#true} call #t~ret15 := main(); {1351#true} is VALID [2018-11-23 10:02:37,418 INFO L273 TraceCheckUtils]: 5: Hoare triple {1351#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {1371#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:02:37,419 INFO L273 TraceCheckUtils]: 6: Hoare triple {1371#(= main_~a~0 (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1371#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:02:37,420 INFO L273 TraceCheckUtils]: 7: Hoare triple {1371#(= main_~a~0 (_ bv0 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1378#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 10:02:37,420 INFO L273 TraceCheckUtils]: 8: Hoare triple {1378#(= (_ bv1 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1378#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 10:02:37,421 INFO L273 TraceCheckUtils]: 9: Hoare triple {1378#(= (_ bv1 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1385#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 10:02:37,421 INFO L273 TraceCheckUtils]: 10: Hoare triple {1385#(= (_ bv2 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1385#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 10:02:37,422 INFO L273 TraceCheckUtils]: 11: Hoare triple {1385#(= (_ bv2 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1392#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 10:02:37,423 INFO L273 TraceCheckUtils]: 12: Hoare triple {1392#(= (_ bv3 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1392#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 10:02:37,424 INFO L273 TraceCheckUtils]: 13: Hoare triple {1392#(= (_ bv3 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1399#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-23 10:02:37,424 INFO L273 TraceCheckUtils]: 14: Hoare triple {1399#(= (_ bv4 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {1352#false} is VALID [2018-11-23 10:02:37,425 INFO L273 TraceCheckUtils]: 15: Hoare triple {1352#false} havoc ~i~0;~i~0 := 0bv32; {1352#false} is VALID [2018-11-23 10:02:37,425 INFO L273 TraceCheckUtils]: 16: Hoare triple {1352#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1352#false} is VALID [2018-11-23 10:02:37,425 INFO L273 TraceCheckUtils]: 17: Hoare triple {1352#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1352#false} is VALID [2018-11-23 10:02:37,426 INFO L273 TraceCheckUtils]: 18: Hoare triple {1352#false} assume !~bvslt32(~i~0, 100000bv32); {1352#false} is VALID [2018-11-23 10:02:37,426 INFO L273 TraceCheckUtils]: 19: Hoare triple {1352#false} ~i~0 := 0bv32; {1352#false} is VALID [2018-11-23 10:02:37,426 INFO L273 TraceCheckUtils]: 20: Hoare triple {1352#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {1352#false} is VALID [2018-11-23 10:02:37,427 INFO L273 TraceCheckUtils]: 21: Hoare triple {1352#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1352#false} is VALID [2018-11-23 10:02:37,428 INFO L273 TraceCheckUtils]: 22: Hoare triple {1352#false} assume !~bvslt32(~i~0, 100000bv32); {1352#false} is VALID [2018-11-23 10:02:37,428 INFO L273 TraceCheckUtils]: 23: Hoare triple {1352#false} ~i~0 := 0bv32; {1352#false} is VALID [2018-11-23 10:02:37,428 INFO L273 TraceCheckUtils]: 24: Hoare triple {1352#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {1352#false} is VALID [2018-11-23 10:02:37,428 INFO L273 TraceCheckUtils]: 25: Hoare triple {1352#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {1352#false} is VALID [2018-11-23 10:02:37,429 INFO L273 TraceCheckUtils]: 26: Hoare triple {1352#false} assume !~bvslt32(~i~0, 100000bv32); {1352#false} is VALID [2018-11-23 10:02:37,429 INFO L273 TraceCheckUtils]: 27: Hoare triple {1352#false} ~i~0 := 0bv32; {1352#false} is VALID [2018-11-23 10:02:37,429 INFO L273 TraceCheckUtils]: 28: Hoare triple {1352#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {1352#false} is VALID [2018-11-23 10:02:37,429 INFO L273 TraceCheckUtils]: 29: Hoare triple {1352#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {1352#false} is VALID [2018-11-23 10:02:37,429 INFO L273 TraceCheckUtils]: 30: Hoare triple {1352#false} assume !~bvslt32(~i~0, 100000bv32); {1352#false} is VALID [2018-11-23 10:02:37,430 INFO L273 TraceCheckUtils]: 31: Hoare triple {1352#false} ~i~0 := 0bv32; {1352#false} is VALID [2018-11-23 10:02:37,430 INFO L273 TraceCheckUtils]: 32: Hoare triple {1352#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem11, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem11; {1352#false} is VALID [2018-11-23 10:02:37,430 INFO L273 TraceCheckUtils]: 33: Hoare triple {1352#false} #t~post10 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {1352#false} is VALID [2018-11-23 10:02:37,430 INFO L273 TraceCheckUtils]: 34: Hoare triple {1352#false} assume !~bvslt32(~i~0, 100000bv32); {1352#false} is VALID [2018-11-23 10:02:37,431 INFO L273 TraceCheckUtils]: 35: Hoare triple {1352#false} havoc ~x~0;~x~0 := 0bv32; {1352#false} is VALID [2018-11-23 10:02:37,431 INFO L273 TraceCheckUtils]: 36: Hoare triple {1352#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem13 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem14 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1352#false} is VALID [2018-11-23 10:02:37,431 INFO L256 TraceCheckUtils]: 37: Hoare triple {1352#false} call __VERIFIER_assert((if #t~mem13 == #t~mem14 then 1bv32 else 0bv32)); {1352#false} is VALID [2018-11-23 10:02:37,431 INFO L273 TraceCheckUtils]: 38: Hoare triple {1352#false} ~cond := #in~cond; {1352#false} is VALID [2018-11-23 10:02:37,431 INFO L273 TraceCheckUtils]: 39: Hoare triple {1352#false} assume 0bv32 == ~cond; {1352#false} is VALID [2018-11-23 10:02:37,432 INFO L273 TraceCheckUtils]: 40: Hoare triple {1352#false} assume !false; {1352#false} is VALID [2018-11-23 10:02:37,434 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 10:02:37,434 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:02:37,681 INFO L273 TraceCheckUtils]: 40: Hoare triple {1352#false} assume !false; {1352#false} is VALID [2018-11-23 10:02:37,682 INFO L273 TraceCheckUtils]: 39: Hoare triple {1352#false} assume 0bv32 == ~cond; {1352#false} is VALID [2018-11-23 10:02:37,682 INFO L273 TraceCheckUtils]: 38: Hoare triple {1352#false} ~cond := #in~cond; {1352#false} is VALID [2018-11-23 10:02:37,682 INFO L256 TraceCheckUtils]: 37: Hoare triple {1352#false} call __VERIFIER_assert((if #t~mem13 == #t~mem14 then 1bv32 else 0bv32)); {1352#false} is VALID [2018-11-23 10:02:37,683 INFO L273 TraceCheckUtils]: 36: Hoare triple {1352#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem13 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem14 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1352#false} is VALID [2018-11-23 10:02:37,683 INFO L273 TraceCheckUtils]: 35: Hoare triple {1352#false} havoc ~x~0;~x~0 := 0bv32; {1352#false} is VALID [2018-11-23 10:02:37,683 INFO L273 TraceCheckUtils]: 34: Hoare triple {1352#false} assume !~bvslt32(~i~0, 100000bv32); {1352#false} is VALID [2018-11-23 10:02:37,684 INFO L273 TraceCheckUtils]: 33: Hoare triple {1352#false} #t~post10 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {1352#false} is VALID [2018-11-23 10:02:37,684 INFO L273 TraceCheckUtils]: 32: Hoare triple {1352#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem11, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem11; {1352#false} is VALID [2018-11-23 10:02:37,684 INFO L273 TraceCheckUtils]: 31: Hoare triple {1352#false} ~i~0 := 0bv32; {1352#false} is VALID [2018-11-23 10:02:37,685 INFO L273 TraceCheckUtils]: 30: Hoare triple {1352#false} assume !~bvslt32(~i~0, 100000bv32); {1352#false} is VALID [2018-11-23 10:02:37,685 INFO L273 TraceCheckUtils]: 29: Hoare triple {1352#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {1352#false} is VALID [2018-11-23 10:02:37,685 INFO L273 TraceCheckUtils]: 28: Hoare triple {1352#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {1352#false} is VALID [2018-11-23 10:02:37,685 INFO L273 TraceCheckUtils]: 27: Hoare triple {1352#false} ~i~0 := 0bv32; {1352#false} is VALID [2018-11-23 10:02:37,685 INFO L273 TraceCheckUtils]: 26: Hoare triple {1352#false} assume !~bvslt32(~i~0, 100000bv32); {1352#false} is VALID [2018-11-23 10:02:37,686 INFO L273 TraceCheckUtils]: 25: Hoare triple {1352#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {1352#false} is VALID [2018-11-23 10:02:37,686 INFO L273 TraceCheckUtils]: 24: Hoare triple {1352#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {1352#false} is VALID [2018-11-23 10:02:37,686 INFO L273 TraceCheckUtils]: 23: Hoare triple {1352#false} ~i~0 := 0bv32; {1352#false} is VALID [2018-11-23 10:02:37,686 INFO L273 TraceCheckUtils]: 22: Hoare triple {1352#false} assume !~bvslt32(~i~0, 100000bv32); {1352#false} is VALID [2018-11-23 10:02:37,686 INFO L273 TraceCheckUtils]: 21: Hoare triple {1352#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1352#false} is VALID [2018-11-23 10:02:37,687 INFO L273 TraceCheckUtils]: 20: Hoare triple {1352#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {1352#false} is VALID [2018-11-23 10:02:37,687 INFO L273 TraceCheckUtils]: 19: Hoare triple {1352#false} ~i~0 := 0bv32; {1352#false} is VALID [2018-11-23 10:02:37,687 INFO L273 TraceCheckUtils]: 18: Hoare triple {1352#false} assume !~bvslt32(~i~0, 100000bv32); {1352#false} is VALID [2018-11-23 10:02:37,688 INFO L273 TraceCheckUtils]: 17: Hoare triple {1352#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1352#false} is VALID [2018-11-23 10:02:37,688 INFO L273 TraceCheckUtils]: 16: Hoare triple {1352#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1352#false} is VALID [2018-11-23 10:02:37,688 INFO L273 TraceCheckUtils]: 15: Hoare triple {1352#false} havoc ~i~0;~i~0 := 0bv32; {1352#false} is VALID [2018-11-23 10:02:37,689 INFO L273 TraceCheckUtils]: 14: Hoare triple {1559#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {1352#false} is VALID [2018-11-23 10:02:37,690 INFO L273 TraceCheckUtils]: 13: Hoare triple {1563#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1559#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-23 10:02:37,690 INFO L273 TraceCheckUtils]: 12: Hoare triple {1563#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1563#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,694 INFO L273 TraceCheckUtils]: 11: Hoare triple {1570#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1563#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,695 INFO L273 TraceCheckUtils]: 10: Hoare triple {1570#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1570#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,700 INFO L273 TraceCheckUtils]: 9: Hoare triple {1577#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1570#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,700 INFO L273 TraceCheckUtils]: 8: Hoare triple {1577#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1577#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,704 INFO L273 TraceCheckUtils]: 7: Hoare triple {1584#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1577#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,705 INFO L273 TraceCheckUtils]: 6: Hoare triple {1584#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1584#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,723 INFO L273 TraceCheckUtils]: 5: Hoare triple {1351#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {1584#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,723 INFO L256 TraceCheckUtils]: 4: Hoare triple {1351#true} call #t~ret15 := main(); {1351#true} is VALID [2018-11-23 10:02:37,724 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1351#true} {1351#true} #119#return; {1351#true} is VALID [2018-11-23 10:02:37,724 INFO L273 TraceCheckUtils]: 2: Hoare triple {1351#true} assume true; {1351#true} is VALID [2018-11-23 10:02:37,724 INFO L273 TraceCheckUtils]: 1: Hoare triple {1351#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1351#true} is VALID [2018-11-23 10:02:37,725 INFO L256 TraceCheckUtils]: 0: Hoare triple {1351#true} call ULTIMATE.init(); {1351#true} is VALID [2018-11-23 10:02:37,728 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 10:02:37,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:02:37,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 10:02:37,731 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-11-23 10:02:37,731 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:37,733 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 10:02:37,854 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:37,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 10:02:37,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 10:02:37,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-23 10:02:37,855 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 12 states. [2018-11-23 10:02:38,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:38,882 INFO L93 Difference]: Finished difference Result 89 states and 106 transitions. [2018-11-23 10:02:38,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 10:02:38,882 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-11-23 10:02:38,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:38,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:02:38,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 96 transitions. [2018-11-23 10:02:38,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:02:38,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 96 transitions. [2018-11-23 10:02:38,889 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 96 transitions. [2018-11-23 10:02:39,040 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:39,042 INFO L225 Difference]: With dead ends: 89 [2018-11-23 10:02:39,043 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 10:02:39,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-23 10:02:39,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 10:02:39,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-11-23 10:02:39,087 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:39,087 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 58 states. [2018-11-23 10:02:39,087 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-23 10:02:39,087 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-23 10:02:39,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:39,090 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2018-11-23 10:02:39,090 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2018-11-23 10:02:39,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:39,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:39,091 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-23 10:02:39,091 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-23 10:02:39,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:39,094 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2018-11-23 10:02:39,094 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2018-11-23 10:02:39,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:39,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:39,095 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:39,096 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:39,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 10:02:39,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2018-11-23 10:02:39,099 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 41 [2018-11-23 10:02:39,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:39,099 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2018-11-23 10:02:39,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 10:02:39,100 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2018-11-23 10:02:39,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 10:02:39,101 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:39,101 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:39,102 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:39,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:39,102 INFO L82 PathProgramCache]: Analyzing trace with hash 909668856, now seen corresponding path program 2 times [2018-11-23 10:02:39,103 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:39,103 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 10:02:39,131 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:02:39,250 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 10:02:39,250 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:02:39,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:39,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:39,570 INFO L256 TraceCheckUtils]: 0: Hoare triple {1948#true} call ULTIMATE.init(); {1948#true} is VALID [2018-11-23 10:02:39,571 INFO L273 TraceCheckUtils]: 1: Hoare triple {1948#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1948#true} is VALID [2018-11-23 10:02:39,571 INFO L273 TraceCheckUtils]: 2: Hoare triple {1948#true} assume true; {1948#true} is VALID [2018-11-23 10:02:39,571 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1948#true} {1948#true} #119#return; {1948#true} is VALID [2018-11-23 10:02:39,571 INFO L256 TraceCheckUtils]: 4: Hoare triple {1948#true} call #t~ret15 := main(); {1948#true} is VALID [2018-11-23 10:02:39,587 INFO L273 TraceCheckUtils]: 5: Hoare triple {1948#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {1968#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:02:39,596 INFO L273 TraceCheckUtils]: 6: Hoare triple {1968#(= main_~a~0 (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1968#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:02:39,610 INFO L273 TraceCheckUtils]: 7: Hoare triple {1968#(= main_~a~0 (_ bv0 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1975#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 10:02:39,611 INFO L273 TraceCheckUtils]: 8: Hoare triple {1975#(= (_ bv1 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1975#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 10:02:39,612 INFO L273 TraceCheckUtils]: 9: Hoare triple {1975#(= (_ bv1 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1982#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 10:02:39,613 INFO L273 TraceCheckUtils]: 10: Hoare triple {1982#(= (_ bv2 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1982#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 10:02:39,613 INFO L273 TraceCheckUtils]: 11: Hoare triple {1982#(= (_ bv2 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1989#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 10:02:39,614 INFO L273 TraceCheckUtils]: 12: Hoare triple {1989#(= (_ bv3 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1989#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 10:02:39,614 INFO L273 TraceCheckUtils]: 13: Hoare triple {1989#(= (_ bv3 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1996#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-23 10:02:39,615 INFO L273 TraceCheckUtils]: 14: Hoare triple {1996#(= (_ bv4 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1996#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-23 10:02:39,616 INFO L273 TraceCheckUtils]: 15: Hoare triple {1996#(= (_ bv4 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2003#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-23 10:02:39,620 INFO L273 TraceCheckUtils]: 16: Hoare triple {2003#(= (_ bv5 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2003#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-23 10:02:39,620 INFO L273 TraceCheckUtils]: 17: Hoare triple {2003#(= (_ bv5 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2010#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-23 10:02:39,621 INFO L273 TraceCheckUtils]: 18: Hoare triple {2010#(= (_ bv6 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2010#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-23 10:02:39,621 INFO L273 TraceCheckUtils]: 19: Hoare triple {2010#(= (_ bv6 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2017#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-23 10:02:39,622 INFO L273 TraceCheckUtils]: 20: Hoare triple {2017#(= (_ bv7 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2017#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-23 10:02:39,622 INFO L273 TraceCheckUtils]: 21: Hoare triple {2017#(= (_ bv7 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2024#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-23 10:02:39,623 INFO L273 TraceCheckUtils]: 22: Hoare triple {2024#(= (_ bv8 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2024#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-23 10:02:39,624 INFO L273 TraceCheckUtils]: 23: Hoare triple {2024#(= (_ bv8 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2031#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-23 10:02:39,626 INFO L273 TraceCheckUtils]: 24: Hoare triple {2031#(= (_ bv9 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2031#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-23 10:02:39,627 INFO L273 TraceCheckUtils]: 25: Hoare triple {2031#(= (_ bv9 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2038#(= (_ bv10 32) main_~a~0)} is VALID [2018-11-23 10:02:39,627 INFO L273 TraceCheckUtils]: 26: Hoare triple {2038#(= (_ bv10 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {1949#false} is VALID [2018-11-23 10:02:39,628 INFO L273 TraceCheckUtils]: 27: Hoare triple {1949#false} havoc ~i~0;~i~0 := 0bv32; {1949#false} is VALID [2018-11-23 10:02:39,628 INFO L273 TraceCheckUtils]: 28: Hoare triple {1949#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1949#false} is VALID [2018-11-23 10:02:39,628 INFO L273 TraceCheckUtils]: 29: Hoare triple {1949#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1949#false} is VALID [2018-11-23 10:02:39,628 INFO L273 TraceCheckUtils]: 30: Hoare triple {1949#false} assume !~bvslt32(~i~0, 100000bv32); {1949#false} is VALID [2018-11-23 10:02:39,628 INFO L273 TraceCheckUtils]: 31: Hoare triple {1949#false} ~i~0 := 0bv32; {1949#false} is VALID [2018-11-23 10:02:39,629 INFO L273 TraceCheckUtils]: 32: Hoare triple {1949#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {1949#false} is VALID [2018-11-23 10:02:39,629 INFO L273 TraceCheckUtils]: 33: Hoare triple {1949#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1949#false} is VALID [2018-11-23 10:02:39,629 INFO L273 TraceCheckUtils]: 34: Hoare triple {1949#false} assume !~bvslt32(~i~0, 100000bv32); {1949#false} is VALID [2018-11-23 10:02:39,629 INFO L273 TraceCheckUtils]: 35: Hoare triple {1949#false} ~i~0 := 0bv32; {1949#false} is VALID [2018-11-23 10:02:39,629 INFO L273 TraceCheckUtils]: 36: Hoare triple {1949#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {1949#false} is VALID [2018-11-23 10:02:39,629 INFO L273 TraceCheckUtils]: 37: Hoare triple {1949#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {1949#false} is VALID [2018-11-23 10:02:39,630 INFO L273 TraceCheckUtils]: 38: Hoare triple {1949#false} assume !~bvslt32(~i~0, 100000bv32); {1949#false} is VALID [2018-11-23 10:02:39,630 INFO L273 TraceCheckUtils]: 39: Hoare triple {1949#false} ~i~0 := 0bv32; {1949#false} is VALID [2018-11-23 10:02:39,630 INFO L273 TraceCheckUtils]: 40: Hoare triple {1949#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {1949#false} is VALID [2018-11-23 10:02:39,630 INFO L273 TraceCheckUtils]: 41: Hoare triple {1949#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {1949#false} is VALID [2018-11-23 10:02:39,631 INFO L273 TraceCheckUtils]: 42: Hoare triple {1949#false} assume !~bvslt32(~i~0, 100000bv32); {1949#false} is VALID [2018-11-23 10:02:39,631 INFO L273 TraceCheckUtils]: 43: Hoare triple {1949#false} ~i~0 := 0bv32; {1949#false} is VALID [2018-11-23 10:02:39,631 INFO L273 TraceCheckUtils]: 44: Hoare triple {1949#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem11, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem11; {1949#false} is VALID [2018-11-23 10:02:39,631 INFO L273 TraceCheckUtils]: 45: Hoare triple {1949#false} #t~post10 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {1949#false} is VALID [2018-11-23 10:02:39,632 INFO L273 TraceCheckUtils]: 46: Hoare triple {1949#false} assume !~bvslt32(~i~0, 100000bv32); {1949#false} is VALID [2018-11-23 10:02:39,632 INFO L273 TraceCheckUtils]: 47: Hoare triple {1949#false} havoc ~x~0;~x~0 := 0bv32; {1949#false} is VALID [2018-11-23 10:02:39,632 INFO L273 TraceCheckUtils]: 48: Hoare triple {1949#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem13 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem14 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1949#false} is VALID [2018-11-23 10:02:39,633 INFO L256 TraceCheckUtils]: 49: Hoare triple {1949#false} call __VERIFIER_assert((if #t~mem13 == #t~mem14 then 1bv32 else 0bv32)); {1949#false} is VALID [2018-11-23 10:02:39,633 INFO L273 TraceCheckUtils]: 50: Hoare triple {1949#false} ~cond := #in~cond; {1949#false} is VALID [2018-11-23 10:02:39,633 INFO L273 TraceCheckUtils]: 51: Hoare triple {1949#false} assume 0bv32 == ~cond; {1949#false} is VALID [2018-11-23 10:02:39,633 INFO L273 TraceCheckUtils]: 52: Hoare triple {1949#false} assume !false; {1949#false} is VALID [2018-11-23 10:02:39,638 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 10:02:39,638 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:02:40,332 INFO L273 TraceCheckUtils]: 52: Hoare triple {1949#false} assume !false; {1949#false} is VALID [2018-11-23 10:02:40,332 INFO L273 TraceCheckUtils]: 51: Hoare triple {1949#false} assume 0bv32 == ~cond; {1949#false} is VALID [2018-11-23 10:02:40,333 INFO L273 TraceCheckUtils]: 50: Hoare triple {1949#false} ~cond := #in~cond; {1949#false} is VALID [2018-11-23 10:02:40,333 INFO L256 TraceCheckUtils]: 49: Hoare triple {1949#false} call __VERIFIER_assert((if #t~mem13 == #t~mem14 then 1bv32 else 0bv32)); {1949#false} is VALID [2018-11-23 10:02:40,333 INFO L273 TraceCheckUtils]: 48: Hoare triple {1949#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem13 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem14 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1949#false} is VALID [2018-11-23 10:02:40,334 INFO L273 TraceCheckUtils]: 47: Hoare triple {1949#false} havoc ~x~0;~x~0 := 0bv32; {1949#false} is VALID [2018-11-23 10:02:40,334 INFO L273 TraceCheckUtils]: 46: Hoare triple {1949#false} assume !~bvslt32(~i~0, 100000bv32); {1949#false} is VALID [2018-11-23 10:02:40,334 INFO L273 TraceCheckUtils]: 45: Hoare triple {1949#false} #t~post10 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {1949#false} is VALID [2018-11-23 10:02:40,334 INFO L273 TraceCheckUtils]: 44: Hoare triple {1949#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem11, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem11; {1949#false} is VALID [2018-11-23 10:02:40,334 INFO L273 TraceCheckUtils]: 43: Hoare triple {1949#false} ~i~0 := 0bv32; {1949#false} is VALID [2018-11-23 10:02:40,335 INFO L273 TraceCheckUtils]: 42: Hoare triple {1949#false} assume !~bvslt32(~i~0, 100000bv32); {1949#false} is VALID [2018-11-23 10:02:40,335 INFO L273 TraceCheckUtils]: 41: Hoare triple {1949#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {1949#false} is VALID [2018-11-23 10:02:40,335 INFO L273 TraceCheckUtils]: 40: Hoare triple {1949#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {1949#false} is VALID [2018-11-23 10:02:40,335 INFO L273 TraceCheckUtils]: 39: Hoare triple {1949#false} ~i~0 := 0bv32; {1949#false} is VALID [2018-11-23 10:02:40,335 INFO L273 TraceCheckUtils]: 38: Hoare triple {1949#false} assume !~bvslt32(~i~0, 100000bv32); {1949#false} is VALID [2018-11-23 10:02:40,336 INFO L273 TraceCheckUtils]: 37: Hoare triple {1949#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {1949#false} is VALID [2018-11-23 10:02:40,336 INFO L273 TraceCheckUtils]: 36: Hoare triple {1949#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {1949#false} is VALID [2018-11-23 10:02:40,336 INFO L273 TraceCheckUtils]: 35: Hoare triple {1949#false} ~i~0 := 0bv32; {1949#false} is VALID [2018-11-23 10:02:40,336 INFO L273 TraceCheckUtils]: 34: Hoare triple {1949#false} assume !~bvslt32(~i~0, 100000bv32); {1949#false} is VALID [2018-11-23 10:02:40,336 INFO L273 TraceCheckUtils]: 33: Hoare triple {1949#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1949#false} is VALID [2018-11-23 10:02:40,336 INFO L273 TraceCheckUtils]: 32: Hoare triple {1949#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {1949#false} is VALID [2018-11-23 10:02:40,337 INFO L273 TraceCheckUtils]: 31: Hoare triple {1949#false} ~i~0 := 0bv32; {1949#false} is VALID [2018-11-23 10:02:40,337 INFO L273 TraceCheckUtils]: 30: Hoare triple {1949#false} assume !~bvslt32(~i~0, 100000bv32); {1949#false} is VALID [2018-11-23 10:02:40,337 INFO L273 TraceCheckUtils]: 29: Hoare triple {1949#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1949#false} is VALID [2018-11-23 10:02:40,337 INFO L273 TraceCheckUtils]: 28: Hoare triple {1949#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1949#false} is VALID [2018-11-23 10:02:40,337 INFO L273 TraceCheckUtils]: 27: Hoare triple {1949#false} havoc ~i~0;~i~0 := 0bv32; {1949#false} is VALID [2018-11-23 10:02:40,338 INFO L273 TraceCheckUtils]: 26: Hoare triple {2198#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {1949#false} is VALID [2018-11-23 10:02:40,340 INFO L273 TraceCheckUtils]: 25: Hoare triple {2202#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2198#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-23 10:02:40,341 INFO L273 TraceCheckUtils]: 24: Hoare triple {2202#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2202#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,345 INFO L273 TraceCheckUtils]: 23: Hoare triple {2209#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2202#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,346 INFO L273 TraceCheckUtils]: 22: Hoare triple {2209#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2209#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,350 INFO L273 TraceCheckUtils]: 21: Hoare triple {2216#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2209#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,350 INFO L273 TraceCheckUtils]: 20: Hoare triple {2216#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2216#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,355 INFO L273 TraceCheckUtils]: 19: Hoare triple {2223#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2216#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,355 INFO L273 TraceCheckUtils]: 18: Hoare triple {2223#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2223#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,362 INFO L273 TraceCheckUtils]: 17: Hoare triple {2230#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2223#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,363 INFO L273 TraceCheckUtils]: 16: Hoare triple {2230#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2230#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,369 INFO L273 TraceCheckUtils]: 15: Hoare triple {2237#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2230#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,370 INFO L273 TraceCheckUtils]: 14: Hoare triple {2237#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2237#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,376 INFO L273 TraceCheckUtils]: 13: Hoare triple {2244#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2237#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,376 INFO L273 TraceCheckUtils]: 12: Hoare triple {2244#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2244#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,382 INFO L273 TraceCheckUtils]: 11: Hoare triple {2251#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2244#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,382 INFO L273 TraceCheckUtils]: 10: Hoare triple {2251#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2251#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,387 INFO L273 TraceCheckUtils]: 9: Hoare triple {2258#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2251#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,387 INFO L273 TraceCheckUtils]: 8: Hoare triple {2258#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2258#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,395 INFO L273 TraceCheckUtils]: 7: Hoare triple {2265#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2258#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,396 INFO L273 TraceCheckUtils]: 6: Hoare triple {2265#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2265#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,397 INFO L273 TraceCheckUtils]: 5: Hoare triple {1948#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {2265#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,397 INFO L256 TraceCheckUtils]: 4: Hoare triple {1948#true} call #t~ret15 := main(); {1948#true} is VALID [2018-11-23 10:02:40,397 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1948#true} {1948#true} #119#return; {1948#true} is VALID [2018-11-23 10:02:40,398 INFO L273 TraceCheckUtils]: 2: Hoare triple {1948#true} assume true; {1948#true} is VALID [2018-11-23 10:02:40,398 INFO L273 TraceCheckUtils]: 1: Hoare triple {1948#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1948#true} is VALID [2018-11-23 10:02:40,398 INFO L256 TraceCheckUtils]: 0: Hoare triple {1948#true} call ULTIMATE.init(); {1948#true} is VALID [2018-11-23 10:02:40,402 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 10:02:40,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:02:40,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-23 10:02:40,405 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 53 [2018-11-23 10:02:40,407 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:40,407 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 10:02:40,631 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:40,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 10:02:40,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 10:02:40,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-23 10:02:40,632 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand 24 states. [2018-11-23 10:02:44,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:44,463 INFO L93 Difference]: Finished difference Result 113 states and 136 transitions. [2018-11-23 10:02:44,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 10:02:44,463 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 53 [2018-11-23 10:02:44,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:44,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:02:44,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 126 transitions. [2018-11-23 10:02:44,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:02:44,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 126 transitions. [2018-11-23 10:02:44,470 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 126 transitions. [2018-11-23 10:02:44,747 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:44,749 INFO L225 Difference]: With dead ends: 113 [2018-11-23 10:02:44,750 INFO L226 Difference]: Without dead ends: 82 [2018-11-23 10:02:44,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 10:02:44,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-23 10:02:44,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-11-23 10:02:44,782 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:44,783 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand 82 states. [2018-11-23 10:02:44,783 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 82 states. [2018-11-23 10:02:44,783 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 82 states. [2018-11-23 10:02:44,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:44,787 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2018-11-23 10:02:44,787 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2018-11-23 10:02:44,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:44,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:44,788 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 82 states. [2018-11-23 10:02:44,788 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 82 states. [2018-11-23 10:02:44,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:44,791 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2018-11-23 10:02:44,791 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2018-11-23 10:02:44,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:44,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:44,792 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:44,792 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:44,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-23 10:02:44,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2018-11-23 10:02:44,795 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 53 [2018-11-23 10:02:44,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:44,796 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2018-11-23 10:02:44,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 10:02:44,796 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2018-11-23 10:02:44,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-23 10:02:44,798 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:44,798 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:44,798 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:44,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:44,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1141111200, now seen corresponding path program 3 times [2018-11-23 10:02:44,799 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:44,800 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 10:02:44,819 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 10:02:44,918 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 10:02:44,918 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:02:44,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:44,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:45,153 INFO L256 TraceCheckUtils]: 0: Hoare triple {2761#true} call ULTIMATE.init(); {2761#true} is VALID [2018-11-23 10:02:45,153 INFO L273 TraceCheckUtils]: 1: Hoare triple {2761#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2761#true} is VALID [2018-11-23 10:02:45,154 INFO L273 TraceCheckUtils]: 2: Hoare triple {2761#true} assume true; {2761#true} is VALID [2018-11-23 10:02:45,154 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2761#true} {2761#true} #119#return; {2761#true} is VALID [2018-11-23 10:02:45,154 INFO L256 TraceCheckUtils]: 4: Hoare triple {2761#true} call #t~ret15 := main(); {2761#true} is VALID [2018-11-23 10:02:45,154 INFO L273 TraceCheckUtils]: 5: Hoare triple {2761#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {2761#true} is VALID [2018-11-23 10:02:45,154 INFO L273 TraceCheckUtils]: 6: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2761#true} is VALID [2018-11-23 10:02:45,154 INFO L273 TraceCheckUtils]: 7: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 10:02:45,155 INFO L273 TraceCheckUtils]: 8: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2761#true} is VALID [2018-11-23 10:02:45,155 INFO L273 TraceCheckUtils]: 9: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 10:02:45,155 INFO L273 TraceCheckUtils]: 10: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2761#true} is VALID [2018-11-23 10:02:45,155 INFO L273 TraceCheckUtils]: 11: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 10:02:45,155 INFO L273 TraceCheckUtils]: 12: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2761#true} is VALID [2018-11-23 10:02:45,156 INFO L273 TraceCheckUtils]: 13: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 10:02:45,156 INFO L273 TraceCheckUtils]: 14: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2761#true} is VALID [2018-11-23 10:02:45,156 INFO L273 TraceCheckUtils]: 15: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 10:02:45,156 INFO L273 TraceCheckUtils]: 16: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2761#true} is VALID [2018-11-23 10:02:45,156 INFO L273 TraceCheckUtils]: 17: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 10:02:45,156 INFO L273 TraceCheckUtils]: 18: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2761#true} is VALID [2018-11-23 10:02:45,157 INFO L273 TraceCheckUtils]: 19: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 10:02:45,157 INFO L273 TraceCheckUtils]: 20: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2761#true} is VALID [2018-11-23 10:02:45,157 INFO L273 TraceCheckUtils]: 21: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 10:02:45,157 INFO L273 TraceCheckUtils]: 22: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2761#true} is VALID [2018-11-23 10:02:45,157 INFO L273 TraceCheckUtils]: 23: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 10:02:45,157 INFO L273 TraceCheckUtils]: 24: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2761#true} is VALID [2018-11-23 10:02:45,157 INFO L273 TraceCheckUtils]: 25: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 10:02:45,158 INFO L273 TraceCheckUtils]: 26: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2761#true} is VALID [2018-11-23 10:02:45,158 INFO L273 TraceCheckUtils]: 27: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 10:02:45,158 INFO L273 TraceCheckUtils]: 28: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2761#true} is VALID [2018-11-23 10:02:45,158 INFO L273 TraceCheckUtils]: 29: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 10:02:45,158 INFO L273 TraceCheckUtils]: 30: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2761#true} is VALID [2018-11-23 10:02:45,158 INFO L273 TraceCheckUtils]: 31: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 10:02:45,158 INFO L273 TraceCheckUtils]: 32: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2761#true} is VALID [2018-11-23 10:02:45,159 INFO L273 TraceCheckUtils]: 33: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 10:02:45,159 INFO L273 TraceCheckUtils]: 34: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2761#true} is VALID [2018-11-23 10:02:45,159 INFO L273 TraceCheckUtils]: 35: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 10:02:45,159 INFO L273 TraceCheckUtils]: 36: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2761#true} is VALID [2018-11-23 10:02:45,159 INFO L273 TraceCheckUtils]: 37: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 10:02:45,160 INFO L273 TraceCheckUtils]: 38: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2761#true} is VALID [2018-11-23 10:02:45,160 INFO L273 TraceCheckUtils]: 39: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 10:02:45,160 INFO L273 TraceCheckUtils]: 40: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2761#true} is VALID [2018-11-23 10:02:45,160 INFO L273 TraceCheckUtils]: 41: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 10:02:45,160 INFO L273 TraceCheckUtils]: 42: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2761#true} is VALID [2018-11-23 10:02:45,161 INFO L273 TraceCheckUtils]: 43: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 10:02:45,161 INFO L273 TraceCheckUtils]: 44: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2761#true} is VALID [2018-11-23 10:02:45,161 INFO L273 TraceCheckUtils]: 45: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 10:02:45,161 INFO L273 TraceCheckUtils]: 46: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2761#true} is VALID [2018-11-23 10:02:45,162 INFO L273 TraceCheckUtils]: 47: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 10:02:45,162 INFO L273 TraceCheckUtils]: 48: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2761#true} is VALID [2018-11-23 10:02:45,162 INFO L273 TraceCheckUtils]: 49: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 10:02:45,162 INFO L273 TraceCheckUtils]: 50: Hoare triple {2761#true} assume !~bvslt32(~a~0, 100000bv32); {2761#true} is VALID [2018-11-23 10:02:45,162 INFO L273 TraceCheckUtils]: 51: Hoare triple {2761#true} havoc ~i~0;~i~0 := 0bv32; {2761#true} is VALID [2018-11-23 10:02:45,163 INFO L273 TraceCheckUtils]: 52: Hoare triple {2761#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2761#true} is VALID [2018-11-23 10:02:45,163 INFO L273 TraceCheckUtils]: 53: Hoare triple {2761#true} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2761#true} is VALID [2018-11-23 10:02:45,163 INFO L273 TraceCheckUtils]: 54: Hoare triple {2761#true} assume !~bvslt32(~i~0, 100000bv32); {2761#true} is VALID [2018-11-23 10:02:45,163 INFO L273 TraceCheckUtils]: 55: Hoare triple {2761#true} ~i~0 := 0bv32; {2761#true} is VALID [2018-11-23 10:02:45,163 INFO L273 TraceCheckUtils]: 56: Hoare triple {2761#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {2761#true} is VALID [2018-11-23 10:02:45,164 INFO L273 TraceCheckUtils]: 57: Hoare triple {2761#true} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2761#true} is VALID [2018-11-23 10:02:45,164 INFO L273 TraceCheckUtils]: 58: Hoare triple {2761#true} assume !~bvslt32(~i~0, 100000bv32); {2761#true} is VALID [2018-11-23 10:02:45,164 INFO L273 TraceCheckUtils]: 59: Hoare triple {2761#true} ~i~0 := 0bv32; {2761#true} is VALID [2018-11-23 10:02:45,164 INFO L273 TraceCheckUtils]: 60: Hoare triple {2761#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {2761#true} is VALID [2018-11-23 10:02:45,164 INFO L273 TraceCheckUtils]: 61: Hoare triple {2761#true} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {2761#true} is VALID [2018-11-23 10:02:45,165 INFO L273 TraceCheckUtils]: 62: Hoare triple {2761#true} assume !~bvslt32(~i~0, 100000bv32); {2761#true} is VALID [2018-11-23 10:02:45,166 INFO L273 TraceCheckUtils]: 63: Hoare triple {2761#true} ~i~0 := 0bv32; {2955#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:02:45,166 INFO L273 TraceCheckUtils]: 64: Hoare triple {2955#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {2955#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:02:45,168 INFO L273 TraceCheckUtils]: 65: Hoare triple {2955#(= main_~i~0 (_ bv0 32))} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {2962#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:45,168 INFO L273 TraceCheckUtils]: 66: Hoare triple {2962#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {2762#false} is VALID [2018-11-23 10:02:45,168 INFO L273 TraceCheckUtils]: 67: Hoare triple {2762#false} ~i~0 := 0bv32; {2762#false} is VALID [2018-11-23 10:02:45,168 INFO L273 TraceCheckUtils]: 68: Hoare triple {2762#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem11, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem11; {2762#false} is VALID [2018-11-23 10:02:45,169 INFO L273 TraceCheckUtils]: 69: Hoare triple {2762#false} #t~post10 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {2762#false} is VALID [2018-11-23 10:02:45,169 INFO L273 TraceCheckUtils]: 70: Hoare triple {2762#false} assume !~bvslt32(~i~0, 100000bv32); {2762#false} is VALID [2018-11-23 10:02:45,169 INFO L273 TraceCheckUtils]: 71: Hoare triple {2762#false} havoc ~x~0;~x~0 := 0bv32; {2762#false} is VALID [2018-11-23 10:02:45,170 INFO L273 TraceCheckUtils]: 72: Hoare triple {2762#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem13 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem14 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {2762#false} is VALID [2018-11-23 10:02:45,170 INFO L256 TraceCheckUtils]: 73: Hoare triple {2762#false} call __VERIFIER_assert((if #t~mem13 == #t~mem14 then 1bv32 else 0bv32)); {2762#false} is VALID [2018-11-23 10:02:45,170 INFO L273 TraceCheckUtils]: 74: Hoare triple {2762#false} ~cond := #in~cond; {2762#false} is VALID [2018-11-23 10:02:45,171 INFO L273 TraceCheckUtils]: 75: Hoare triple {2762#false} assume 0bv32 == ~cond; {2762#false} is VALID [2018-11-23 10:02:45,171 INFO L273 TraceCheckUtils]: 76: Hoare triple {2762#false} assume !false; {2762#false} is VALID [2018-11-23 10:02:45,174 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2018-11-23 10:02:45,175 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:02:45,307 INFO L273 TraceCheckUtils]: 76: Hoare triple {2762#false} assume !false; {2762#false} is VALID [2018-11-23 10:02:45,307 INFO L273 TraceCheckUtils]: 75: Hoare triple {2762#false} assume 0bv32 == ~cond; {2762#false} is VALID [2018-11-23 10:02:45,307 INFO L273 TraceCheckUtils]: 74: Hoare triple {2762#false} ~cond := #in~cond; {2762#false} is VALID [2018-11-23 10:02:45,307 INFO L256 TraceCheckUtils]: 73: Hoare triple {2762#false} call __VERIFIER_assert((if #t~mem13 == #t~mem14 then 1bv32 else 0bv32)); {2762#false} is VALID [2018-11-23 10:02:45,307 INFO L273 TraceCheckUtils]: 72: Hoare triple {2762#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem13 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem14 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {2762#false} is VALID [2018-11-23 10:02:45,308 INFO L273 TraceCheckUtils]: 71: Hoare triple {2762#false} havoc ~x~0;~x~0 := 0bv32; {2762#false} is VALID [2018-11-23 10:02:45,308 INFO L273 TraceCheckUtils]: 70: Hoare triple {2762#false} assume !~bvslt32(~i~0, 100000bv32); {2762#false} is VALID [2018-11-23 10:02:45,308 INFO L273 TraceCheckUtils]: 69: Hoare triple {2762#false} #t~post10 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {2762#false} is VALID [2018-11-23 10:02:45,308 INFO L273 TraceCheckUtils]: 68: Hoare triple {2762#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem11, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem11; {2762#false} is VALID [2018-11-23 10:02:45,308 INFO L273 TraceCheckUtils]: 67: Hoare triple {2762#false} ~i~0 := 0bv32; {2762#false} is VALID [2018-11-23 10:02:45,308 INFO L273 TraceCheckUtils]: 66: Hoare triple {3026#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {2762#false} is VALID [2018-11-23 10:02:45,309 INFO L273 TraceCheckUtils]: 65: Hoare triple {3030#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {3026#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:02:45,309 INFO L273 TraceCheckUtils]: 64: Hoare triple {3030#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {3030#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,310 INFO L273 TraceCheckUtils]: 63: Hoare triple {2761#true} ~i~0 := 0bv32; {3030#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,310 INFO L273 TraceCheckUtils]: 62: Hoare triple {2761#true} assume !~bvslt32(~i~0, 100000bv32); {2761#true} is VALID [2018-11-23 10:02:45,310 INFO L273 TraceCheckUtils]: 61: Hoare triple {2761#true} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {2761#true} is VALID [2018-11-23 10:02:45,310 INFO L273 TraceCheckUtils]: 60: Hoare triple {2761#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {2761#true} is VALID [2018-11-23 10:02:45,310 INFO L273 TraceCheckUtils]: 59: Hoare triple {2761#true} ~i~0 := 0bv32; {2761#true} is VALID [2018-11-23 10:02:45,310 INFO L273 TraceCheckUtils]: 58: Hoare triple {2761#true} assume !~bvslt32(~i~0, 100000bv32); {2761#true} is VALID [2018-11-23 10:02:45,311 INFO L273 TraceCheckUtils]: 57: Hoare triple {2761#true} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2761#true} is VALID [2018-11-23 10:02:45,311 INFO L273 TraceCheckUtils]: 56: Hoare triple {2761#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {2761#true} is VALID [2018-11-23 10:02:45,311 INFO L273 TraceCheckUtils]: 55: Hoare triple {2761#true} ~i~0 := 0bv32; {2761#true} is VALID [2018-11-23 10:02:45,311 INFO L273 TraceCheckUtils]: 54: Hoare triple {2761#true} assume !~bvslt32(~i~0, 100000bv32); {2761#true} is VALID [2018-11-23 10:02:45,311 INFO L273 TraceCheckUtils]: 53: Hoare triple {2761#true} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2761#true} is VALID [2018-11-23 10:02:45,311 INFO L273 TraceCheckUtils]: 52: Hoare triple {2761#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2761#true} is VALID [2018-11-23 10:02:45,312 INFO L273 TraceCheckUtils]: 51: Hoare triple {2761#true} havoc ~i~0;~i~0 := 0bv32; {2761#true} is VALID [2018-11-23 10:02:45,312 INFO L273 TraceCheckUtils]: 50: Hoare triple {2761#true} assume !~bvslt32(~a~0, 100000bv32); {2761#true} is VALID [2018-11-23 10:02:45,312 INFO L273 TraceCheckUtils]: 49: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 10:02:45,312 INFO L273 TraceCheckUtils]: 48: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2761#true} is VALID [2018-11-23 10:02:45,313 INFO L273 TraceCheckUtils]: 47: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 10:02:45,313 INFO L273 TraceCheckUtils]: 46: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2761#true} is VALID [2018-11-23 10:02:45,313 INFO L273 TraceCheckUtils]: 45: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 10:02:45,313 INFO L273 TraceCheckUtils]: 44: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2761#true} is VALID [2018-11-23 10:02:45,314 INFO L273 TraceCheckUtils]: 43: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 10:02:45,314 INFO L273 TraceCheckUtils]: 42: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2761#true} is VALID [2018-11-23 10:02:45,314 INFO L273 TraceCheckUtils]: 41: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 10:02:45,314 INFO L273 TraceCheckUtils]: 40: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2761#true} is VALID [2018-11-23 10:02:45,314 INFO L273 TraceCheckUtils]: 39: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 10:02:45,314 INFO L273 TraceCheckUtils]: 38: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2761#true} is VALID [2018-11-23 10:02:45,315 INFO L273 TraceCheckUtils]: 37: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 10:02:45,315 INFO L273 TraceCheckUtils]: 36: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2761#true} is VALID [2018-11-23 10:02:45,315 INFO L273 TraceCheckUtils]: 35: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 10:02:45,315 INFO L273 TraceCheckUtils]: 34: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2761#true} is VALID [2018-11-23 10:02:45,315 INFO L273 TraceCheckUtils]: 33: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 10:02:45,315 INFO L273 TraceCheckUtils]: 32: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2761#true} is VALID [2018-11-23 10:02:45,316 INFO L273 TraceCheckUtils]: 31: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 10:02:45,316 INFO L273 TraceCheckUtils]: 30: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2761#true} is VALID [2018-11-23 10:02:45,316 INFO L273 TraceCheckUtils]: 29: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 10:02:45,316 INFO L273 TraceCheckUtils]: 28: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2761#true} is VALID [2018-11-23 10:02:45,316 INFO L273 TraceCheckUtils]: 27: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 10:02:45,316 INFO L273 TraceCheckUtils]: 26: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2761#true} is VALID [2018-11-23 10:02:45,316 INFO L273 TraceCheckUtils]: 25: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 10:02:45,316 INFO L273 TraceCheckUtils]: 24: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2761#true} is VALID [2018-11-23 10:02:45,317 INFO L273 TraceCheckUtils]: 23: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 10:02:45,317 INFO L273 TraceCheckUtils]: 22: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2761#true} is VALID [2018-11-23 10:02:45,317 INFO L273 TraceCheckUtils]: 21: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 10:02:45,317 INFO L273 TraceCheckUtils]: 20: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2761#true} is VALID [2018-11-23 10:02:45,317 INFO L273 TraceCheckUtils]: 19: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 10:02:45,317 INFO L273 TraceCheckUtils]: 18: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2761#true} is VALID [2018-11-23 10:02:45,317 INFO L273 TraceCheckUtils]: 17: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 10:02:45,318 INFO L273 TraceCheckUtils]: 16: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2761#true} is VALID [2018-11-23 10:02:45,318 INFO L273 TraceCheckUtils]: 15: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 10:02:45,318 INFO L273 TraceCheckUtils]: 14: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2761#true} is VALID [2018-11-23 10:02:45,318 INFO L273 TraceCheckUtils]: 13: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 10:02:45,318 INFO L273 TraceCheckUtils]: 12: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2761#true} is VALID [2018-11-23 10:02:45,318 INFO L273 TraceCheckUtils]: 11: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 10:02:45,318 INFO L273 TraceCheckUtils]: 10: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2761#true} is VALID [2018-11-23 10:02:45,319 INFO L273 TraceCheckUtils]: 9: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 10:02:45,319 INFO L273 TraceCheckUtils]: 8: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2761#true} is VALID [2018-11-23 10:02:45,319 INFO L273 TraceCheckUtils]: 7: Hoare triple {2761#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2761#true} is VALID [2018-11-23 10:02:45,319 INFO L273 TraceCheckUtils]: 6: Hoare triple {2761#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2761#true} is VALID [2018-11-23 10:02:45,319 INFO L273 TraceCheckUtils]: 5: Hoare triple {2761#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {2761#true} is VALID [2018-11-23 10:02:45,319 INFO L256 TraceCheckUtils]: 4: Hoare triple {2761#true} call #t~ret15 := main(); {2761#true} is VALID [2018-11-23 10:02:45,319 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2761#true} {2761#true} #119#return; {2761#true} is VALID [2018-11-23 10:02:45,320 INFO L273 TraceCheckUtils]: 2: Hoare triple {2761#true} assume true; {2761#true} is VALID [2018-11-23 10:02:45,320 INFO L273 TraceCheckUtils]: 1: Hoare triple {2761#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2761#true} is VALID [2018-11-23 10:02:45,320 INFO L256 TraceCheckUtils]: 0: Hoare triple {2761#true} call ULTIMATE.init(); {2761#true} is VALID [2018-11-23 10:02:45,322 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2018-11-23 10:02:45,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:02:45,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 10:02:45,325 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2018-11-23 10:02:45,325 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:45,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 10:02:45,379 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:45,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 10:02:45,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 10:02:45,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 10:02:45,380 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand 6 states. [2018-11-23 10:02:45,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:45,957 INFO L93 Difference]: Finished difference Result 139 states and 164 transitions. [2018-11-23 10:02:45,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 10:02:45,957 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2018-11-23 10:02:45,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:45,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:02:45,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2018-11-23 10:02:45,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:02:45,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2018-11-23 10:02:45,963 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 117 transitions. [2018-11-23 10:02:46,202 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:46,206 INFO L225 Difference]: With dead ends: 139 [2018-11-23 10:02:46,206 INFO L226 Difference]: Without dead ends: 112 [2018-11-23 10:02:46,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 10:02:46,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-23 10:02:46,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-11-23 10:02:46,275 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:46,275 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand 112 states. [2018-11-23 10:02:46,276 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 112 states. [2018-11-23 10:02:46,276 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 112 states. [2018-11-23 10:02:46,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:46,279 INFO L93 Difference]: Finished difference Result 112 states and 118 transitions. [2018-11-23 10:02:46,279 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 118 transitions. [2018-11-23 10:02:46,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:46,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:46,280 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 112 states. [2018-11-23 10:02:46,280 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 112 states. [2018-11-23 10:02:46,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:46,284 INFO L93 Difference]: Finished difference Result 112 states and 118 transitions. [2018-11-23 10:02:46,284 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 118 transitions. [2018-11-23 10:02:46,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:46,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:46,284 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:46,285 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:46,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-23 10:02:46,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 118 transitions. [2018-11-23 10:02:46,288 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 118 transitions. Word has length 77 [2018-11-23 10:02:46,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:46,288 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 118 transitions. [2018-11-23 10:02:46,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 10:02:46,289 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 118 transitions. [2018-11-23 10:02:46,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-23 10:02:46,290 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:46,290 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:46,290 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:46,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:46,291 INFO L82 PathProgramCache]: Analyzing trace with hash 16544226, now seen corresponding path program 4 times [2018-11-23 10:02:46,291 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:46,291 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 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 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:02:46,308 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 10:02:46,452 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 10:02:46,453 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:02:46,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:46,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:47,031 INFO L256 TraceCheckUtils]: 0: Hoare triple {3827#true} call ULTIMATE.init(); {3827#true} is VALID [2018-11-23 10:02:47,032 INFO L273 TraceCheckUtils]: 1: Hoare triple {3827#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3827#true} is VALID [2018-11-23 10:02:47,032 INFO L273 TraceCheckUtils]: 2: Hoare triple {3827#true} assume true; {3827#true} is VALID [2018-11-23 10:02:47,032 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3827#true} {3827#true} #119#return; {3827#true} is VALID [2018-11-23 10:02:47,033 INFO L256 TraceCheckUtils]: 4: Hoare triple {3827#true} call #t~ret15 := main(); {3827#true} is VALID [2018-11-23 10:02:47,033 INFO L273 TraceCheckUtils]: 5: Hoare triple {3827#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {3847#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:02:47,034 INFO L273 TraceCheckUtils]: 6: Hoare triple {3847#(= main_~a~0 (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3847#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:02:47,040 INFO L273 TraceCheckUtils]: 7: Hoare triple {3847#(= main_~a~0 (_ bv0 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3854#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 10:02:47,041 INFO L273 TraceCheckUtils]: 8: Hoare triple {3854#(= (_ bv1 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3854#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 10:02:47,041 INFO L273 TraceCheckUtils]: 9: Hoare triple {3854#(= (_ bv1 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3861#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 10:02:47,042 INFO L273 TraceCheckUtils]: 10: Hoare triple {3861#(= (_ bv2 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3861#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 10:02:47,042 INFO L273 TraceCheckUtils]: 11: Hoare triple {3861#(= (_ bv2 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3868#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 10:02:47,042 INFO L273 TraceCheckUtils]: 12: Hoare triple {3868#(= (_ bv3 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3868#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 10:02:47,043 INFO L273 TraceCheckUtils]: 13: Hoare triple {3868#(= (_ bv3 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3875#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-23 10:02:47,043 INFO L273 TraceCheckUtils]: 14: Hoare triple {3875#(= (_ bv4 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3875#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-23 10:02:47,043 INFO L273 TraceCheckUtils]: 15: Hoare triple {3875#(= (_ bv4 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3882#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-23 10:02:47,044 INFO L273 TraceCheckUtils]: 16: Hoare triple {3882#(= (_ bv5 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3882#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-23 10:02:47,044 INFO L273 TraceCheckUtils]: 17: Hoare triple {3882#(= (_ bv5 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3889#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-23 10:02:47,045 INFO L273 TraceCheckUtils]: 18: Hoare triple {3889#(= (_ bv6 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3889#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-23 10:02:47,046 INFO L273 TraceCheckUtils]: 19: Hoare triple {3889#(= (_ bv6 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3896#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-23 10:02:47,046 INFO L273 TraceCheckUtils]: 20: Hoare triple {3896#(= (_ bv7 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3896#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-23 10:02:47,047 INFO L273 TraceCheckUtils]: 21: Hoare triple {3896#(= (_ bv7 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3903#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-23 10:02:47,051 INFO L273 TraceCheckUtils]: 22: Hoare triple {3903#(= (_ bv8 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3903#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-23 10:02:47,053 INFO L273 TraceCheckUtils]: 23: Hoare triple {3903#(= (_ bv8 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3910#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-23 10:02:47,054 INFO L273 TraceCheckUtils]: 24: Hoare triple {3910#(= (_ bv9 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3910#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-23 10:02:47,054 INFO L273 TraceCheckUtils]: 25: Hoare triple {3910#(= (_ bv9 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3917#(= (_ bv10 32) main_~a~0)} is VALID [2018-11-23 10:02:47,055 INFO L273 TraceCheckUtils]: 26: Hoare triple {3917#(= (_ bv10 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3917#(= (_ bv10 32) main_~a~0)} is VALID [2018-11-23 10:02:47,055 INFO L273 TraceCheckUtils]: 27: Hoare triple {3917#(= (_ bv10 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3924#(= (_ bv11 32) main_~a~0)} is VALID [2018-11-23 10:02:47,055 INFO L273 TraceCheckUtils]: 28: Hoare triple {3924#(= (_ bv11 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3924#(= (_ bv11 32) main_~a~0)} is VALID [2018-11-23 10:02:47,056 INFO L273 TraceCheckUtils]: 29: Hoare triple {3924#(= (_ bv11 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3931#(= (_ bv12 32) main_~a~0)} is VALID [2018-11-23 10:02:47,056 INFO L273 TraceCheckUtils]: 30: Hoare triple {3931#(= (_ bv12 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3931#(= (_ bv12 32) main_~a~0)} is VALID [2018-11-23 10:02:47,057 INFO L273 TraceCheckUtils]: 31: Hoare triple {3931#(= (_ bv12 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3938#(= (_ bv13 32) main_~a~0)} is VALID [2018-11-23 10:02:47,057 INFO L273 TraceCheckUtils]: 32: Hoare triple {3938#(= (_ bv13 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3938#(= (_ bv13 32) main_~a~0)} is VALID [2018-11-23 10:02:47,062 INFO L273 TraceCheckUtils]: 33: Hoare triple {3938#(= (_ bv13 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3945#(= (_ bv14 32) main_~a~0)} is VALID [2018-11-23 10:02:47,063 INFO L273 TraceCheckUtils]: 34: Hoare triple {3945#(= (_ bv14 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3945#(= (_ bv14 32) main_~a~0)} is VALID [2018-11-23 10:02:47,063 INFO L273 TraceCheckUtils]: 35: Hoare triple {3945#(= (_ bv14 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3952#(= (_ bv15 32) main_~a~0)} is VALID [2018-11-23 10:02:47,063 INFO L273 TraceCheckUtils]: 36: Hoare triple {3952#(= (_ bv15 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3952#(= (_ bv15 32) main_~a~0)} is VALID [2018-11-23 10:02:47,067 INFO L273 TraceCheckUtils]: 37: Hoare triple {3952#(= (_ bv15 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3959#(= (_ bv16 32) main_~a~0)} is VALID [2018-11-23 10:02:47,067 INFO L273 TraceCheckUtils]: 38: Hoare triple {3959#(= (_ bv16 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3959#(= (_ bv16 32) main_~a~0)} is VALID [2018-11-23 10:02:47,068 INFO L273 TraceCheckUtils]: 39: Hoare triple {3959#(= (_ bv16 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3966#(= (_ bv17 32) main_~a~0)} is VALID [2018-11-23 10:02:47,072 INFO L273 TraceCheckUtils]: 40: Hoare triple {3966#(= (_ bv17 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3966#(= (_ bv17 32) main_~a~0)} is VALID [2018-11-23 10:02:47,072 INFO L273 TraceCheckUtils]: 41: Hoare triple {3966#(= (_ bv17 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3973#(= (_ bv18 32) main_~a~0)} is VALID [2018-11-23 10:02:47,077 INFO L273 TraceCheckUtils]: 42: Hoare triple {3973#(= (_ bv18 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3973#(= (_ bv18 32) main_~a~0)} is VALID [2018-11-23 10:02:47,092 INFO L273 TraceCheckUtils]: 43: Hoare triple {3973#(= (_ bv18 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3980#(= (_ bv19 32) main_~a~0)} is VALID [2018-11-23 10:02:47,093 INFO L273 TraceCheckUtils]: 44: Hoare triple {3980#(= (_ bv19 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3980#(= (_ bv19 32) main_~a~0)} is VALID [2018-11-23 10:02:47,093 INFO L273 TraceCheckUtils]: 45: Hoare triple {3980#(= (_ bv19 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3987#(= (_ bv20 32) main_~a~0)} is VALID [2018-11-23 10:02:47,093 INFO L273 TraceCheckUtils]: 46: Hoare triple {3987#(= (_ bv20 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3987#(= (_ bv20 32) main_~a~0)} is VALID [2018-11-23 10:02:47,094 INFO L273 TraceCheckUtils]: 47: Hoare triple {3987#(= (_ bv20 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3994#(= (_ bv21 32) main_~a~0)} is VALID [2018-11-23 10:02:47,094 INFO L273 TraceCheckUtils]: 48: Hoare triple {3994#(= (_ bv21 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3994#(= (_ bv21 32) main_~a~0)} is VALID [2018-11-23 10:02:47,095 INFO L273 TraceCheckUtils]: 49: Hoare triple {3994#(= (_ bv21 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4001#(= (_ bv22 32) main_~a~0)} is VALID [2018-11-23 10:02:47,095 INFO L273 TraceCheckUtils]: 50: Hoare triple {4001#(= (_ bv22 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {3828#false} is VALID [2018-11-23 10:02:47,095 INFO L273 TraceCheckUtils]: 51: Hoare triple {3828#false} havoc ~i~0;~i~0 := 0bv32; {3828#false} is VALID [2018-11-23 10:02:47,095 INFO L273 TraceCheckUtils]: 52: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3828#false} is VALID [2018-11-23 10:02:47,095 INFO L273 TraceCheckUtils]: 53: Hoare triple {3828#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3828#false} is VALID [2018-11-23 10:02:47,096 INFO L273 TraceCheckUtils]: 54: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3828#false} is VALID [2018-11-23 10:02:47,096 INFO L273 TraceCheckUtils]: 55: Hoare triple {3828#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3828#false} is VALID [2018-11-23 10:02:47,096 INFO L273 TraceCheckUtils]: 56: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3828#false} is VALID [2018-11-23 10:02:47,096 INFO L273 TraceCheckUtils]: 57: Hoare triple {3828#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3828#false} is VALID [2018-11-23 10:02:47,096 INFO L273 TraceCheckUtils]: 58: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3828#false} is VALID [2018-11-23 10:02:47,097 INFO L273 TraceCheckUtils]: 59: Hoare triple {3828#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3828#false} is VALID [2018-11-23 10:02:47,097 INFO L273 TraceCheckUtils]: 60: Hoare triple {3828#false} assume !~bvslt32(~i~0, 100000bv32); {3828#false} is VALID [2018-11-23 10:02:47,097 INFO L273 TraceCheckUtils]: 61: Hoare triple {3828#false} ~i~0 := 0bv32; {3828#false} is VALID [2018-11-23 10:02:47,097 INFO L273 TraceCheckUtils]: 62: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {3828#false} is VALID [2018-11-23 10:02:47,097 INFO L273 TraceCheckUtils]: 63: Hoare triple {3828#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {3828#false} is VALID [2018-11-23 10:02:47,098 INFO L273 TraceCheckUtils]: 64: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {3828#false} is VALID [2018-11-23 10:02:47,098 INFO L273 TraceCheckUtils]: 65: Hoare triple {3828#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {3828#false} is VALID [2018-11-23 10:02:47,098 INFO L273 TraceCheckUtils]: 66: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {3828#false} is VALID [2018-11-23 10:02:47,098 INFO L273 TraceCheckUtils]: 67: Hoare triple {3828#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {3828#false} is VALID [2018-11-23 10:02:47,098 INFO L273 TraceCheckUtils]: 68: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {3828#false} is VALID [2018-11-23 10:02:47,098 INFO L273 TraceCheckUtils]: 69: Hoare triple {3828#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {3828#false} is VALID [2018-11-23 10:02:47,098 INFO L273 TraceCheckUtils]: 70: Hoare triple {3828#false} assume !~bvslt32(~i~0, 100000bv32); {3828#false} is VALID [2018-11-23 10:02:47,098 INFO L273 TraceCheckUtils]: 71: Hoare triple {3828#false} ~i~0 := 0bv32; {3828#false} is VALID [2018-11-23 10:02:47,099 INFO L273 TraceCheckUtils]: 72: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {3828#false} is VALID [2018-11-23 10:02:47,099 INFO L273 TraceCheckUtils]: 73: Hoare triple {3828#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {3828#false} is VALID [2018-11-23 10:02:47,099 INFO L273 TraceCheckUtils]: 74: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {3828#false} is VALID [2018-11-23 10:02:47,099 INFO L273 TraceCheckUtils]: 75: Hoare triple {3828#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {3828#false} is VALID [2018-11-23 10:02:47,099 INFO L273 TraceCheckUtils]: 76: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {3828#false} is VALID [2018-11-23 10:02:47,099 INFO L273 TraceCheckUtils]: 77: Hoare triple {3828#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {3828#false} is VALID [2018-11-23 10:02:47,099 INFO L273 TraceCheckUtils]: 78: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {3828#false} is VALID [2018-11-23 10:02:47,099 INFO L273 TraceCheckUtils]: 79: Hoare triple {3828#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {3828#false} is VALID [2018-11-23 10:02:47,100 INFO L273 TraceCheckUtils]: 80: Hoare triple {3828#false} assume !~bvslt32(~i~0, 100000bv32); {3828#false} is VALID [2018-11-23 10:02:47,100 INFO L273 TraceCheckUtils]: 81: Hoare triple {3828#false} ~i~0 := 0bv32; {3828#false} is VALID [2018-11-23 10:02:47,100 INFO L273 TraceCheckUtils]: 82: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {3828#false} is VALID [2018-11-23 10:02:47,100 INFO L273 TraceCheckUtils]: 83: Hoare triple {3828#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {3828#false} is VALID [2018-11-23 10:02:47,100 INFO L273 TraceCheckUtils]: 84: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {3828#false} is VALID [2018-11-23 10:02:47,100 INFO L273 TraceCheckUtils]: 85: Hoare triple {3828#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {3828#false} is VALID [2018-11-23 10:02:47,100 INFO L273 TraceCheckUtils]: 86: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {3828#false} is VALID [2018-11-23 10:02:47,100 INFO L273 TraceCheckUtils]: 87: Hoare triple {3828#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {3828#false} is VALID [2018-11-23 10:02:47,101 INFO L273 TraceCheckUtils]: 88: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {3828#false} is VALID [2018-11-23 10:02:47,101 INFO L273 TraceCheckUtils]: 89: Hoare triple {3828#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {3828#false} is VALID [2018-11-23 10:02:47,101 INFO L273 TraceCheckUtils]: 90: Hoare triple {3828#false} assume !~bvslt32(~i~0, 100000bv32); {3828#false} is VALID [2018-11-23 10:02:47,101 INFO L273 TraceCheckUtils]: 91: Hoare triple {3828#false} ~i~0 := 0bv32; {3828#false} is VALID [2018-11-23 10:02:47,101 INFO L273 TraceCheckUtils]: 92: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem11, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem11; {3828#false} is VALID [2018-11-23 10:02:47,101 INFO L273 TraceCheckUtils]: 93: Hoare triple {3828#false} #t~post10 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {3828#false} is VALID [2018-11-23 10:02:47,101 INFO L273 TraceCheckUtils]: 94: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem11, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem11; {3828#false} is VALID [2018-11-23 10:02:47,102 INFO L273 TraceCheckUtils]: 95: Hoare triple {3828#false} #t~post10 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {3828#false} is VALID [2018-11-23 10:02:47,102 INFO L273 TraceCheckUtils]: 96: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem11, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem11; {3828#false} is VALID [2018-11-23 10:02:47,102 INFO L273 TraceCheckUtils]: 97: Hoare triple {3828#false} #t~post10 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {3828#false} is VALID [2018-11-23 10:02:47,102 INFO L273 TraceCheckUtils]: 98: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem11, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem11; {3828#false} is VALID [2018-11-23 10:02:47,102 INFO L273 TraceCheckUtils]: 99: Hoare triple {3828#false} #t~post10 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {3828#false} is VALID [2018-11-23 10:02:47,103 INFO L273 TraceCheckUtils]: 100: Hoare triple {3828#false} assume !~bvslt32(~i~0, 100000bv32); {3828#false} is VALID [2018-11-23 10:02:47,103 INFO L273 TraceCheckUtils]: 101: Hoare triple {3828#false} havoc ~x~0;~x~0 := 0bv32; {3828#false} is VALID [2018-11-23 10:02:47,103 INFO L273 TraceCheckUtils]: 102: Hoare triple {3828#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem13 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem14 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {3828#false} is VALID [2018-11-23 10:02:47,103 INFO L256 TraceCheckUtils]: 103: Hoare triple {3828#false} call __VERIFIER_assert((if #t~mem13 == #t~mem14 then 1bv32 else 0bv32)); {3828#false} is VALID [2018-11-23 10:02:47,103 INFO L273 TraceCheckUtils]: 104: Hoare triple {3828#false} ~cond := #in~cond; {3828#false} is VALID [2018-11-23 10:02:47,103 INFO L273 TraceCheckUtils]: 105: Hoare triple {3828#false} assume 0bv32 == ~cond; {3828#false} is VALID [2018-11-23 10:02:47,104 INFO L273 TraceCheckUtils]: 106: Hoare triple {3828#false} assume !false; {3828#false} is VALID [2018-11-23 10:02:47,111 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-23 10:02:47,112 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:02:49,256 INFO L273 TraceCheckUtils]: 106: Hoare triple {3828#false} assume !false; {3828#false} is VALID [2018-11-23 10:02:49,257 INFO L273 TraceCheckUtils]: 105: Hoare triple {3828#false} assume 0bv32 == ~cond; {3828#false} is VALID [2018-11-23 10:02:49,257 INFO L273 TraceCheckUtils]: 104: Hoare triple {3828#false} ~cond := #in~cond; {3828#false} is VALID [2018-11-23 10:02:49,257 INFO L256 TraceCheckUtils]: 103: Hoare triple {3828#false} call __VERIFIER_assert((if #t~mem13 == #t~mem14 then 1bv32 else 0bv32)); {3828#false} is VALID [2018-11-23 10:02:49,257 INFO L273 TraceCheckUtils]: 102: Hoare triple {3828#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem13 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem14 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {3828#false} is VALID [2018-11-23 10:02:49,258 INFO L273 TraceCheckUtils]: 101: Hoare triple {3828#false} havoc ~x~0;~x~0 := 0bv32; {3828#false} is VALID [2018-11-23 10:02:49,258 INFO L273 TraceCheckUtils]: 100: Hoare triple {3828#false} assume !~bvslt32(~i~0, 100000bv32); {3828#false} is VALID [2018-11-23 10:02:49,258 INFO L273 TraceCheckUtils]: 99: Hoare triple {3828#false} #t~post10 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {3828#false} is VALID [2018-11-23 10:02:49,258 INFO L273 TraceCheckUtils]: 98: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem11, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem11; {3828#false} is VALID [2018-11-23 10:02:49,259 INFO L273 TraceCheckUtils]: 97: Hoare triple {3828#false} #t~post10 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {3828#false} is VALID [2018-11-23 10:02:49,259 INFO L273 TraceCheckUtils]: 96: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem11, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem11; {3828#false} is VALID [2018-11-23 10:02:49,259 INFO L273 TraceCheckUtils]: 95: Hoare triple {3828#false} #t~post10 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {3828#false} is VALID [2018-11-23 10:02:49,260 INFO L273 TraceCheckUtils]: 94: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem11, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem11; {3828#false} is VALID [2018-11-23 10:02:49,260 INFO L273 TraceCheckUtils]: 93: Hoare triple {3828#false} #t~post10 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {3828#false} is VALID [2018-11-23 10:02:49,260 INFO L273 TraceCheckUtils]: 92: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem11, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem11; {3828#false} is VALID [2018-11-23 10:02:49,260 INFO L273 TraceCheckUtils]: 91: Hoare triple {3828#false} ~i~0 := 0bv32; {3828#false} is VALID [2018-11-23 10:02:49,261 INFO L273 TraceCheckUtils]: 90: Hoare triple {3828#false} assume !~bvslt32(~i~0, 100000bv32); {3828#false} is VALID [2018-11-23 10:02:49,261 INFO L273 TraceCheckUtils]: 89: Hoare triple {3828#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {3828#false} is VALID [2018-11-23 10:02:49,261 INFO L273 TraceCheckUtils]: 88: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {3828#false} is VALID [2018-11-23 10:02:49,261 INFO L273 TraceCheckUtils]: 87: Hoare triple {3828#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {3828#false} is VALID [2018-11-23 10:02:49,261 INFO L273 TraceCheckUtils]: 86: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {3828#false} is VALID [2018-11-23 10:02:49,261 INFO L273 TraceCheckUtils]: 85: Hoare triple {3828#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {3828#false} is VALID [2018-11-23 10:02:49,261 INFO L273 TraceCheckUtils]: 84: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {3828#false} is VALID [2018-11-23 10:02:49,262 INFO L273 TraceCheckUtils]: 83: Hoare triple {3828#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {3828#false} is VALID [2018-11-23 10:02:49,262 INFO L273 TraceCheckUtils]: 82: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {3828#false} is VALID [2018-11-23 10:02:49,262 INFO L273 TraceCheckUtils]: 81: Hoare triple {3828#false} ~i~0 := 0bv32; {3828#false} is VALID [2018-11-23 10:02:49,262 INFO L273 TraceCheckUtils]: 80: Hoare triple {3828#false} assume !~bvslt32(~i~0, 100000bv32); {3828#false} is VALID [2018-11-23 10:02:49,262 INFO L273 TraceCheckUtils]: 79: Hoare triple {3828#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {3828#false} is VALID [2018-11-23 10:02:49,262 INFO L273 TraceCheckUtils]: 78: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {3828#false} is VALID [2018-11-23 10:02:49,263 INFO L273 TraceCheckUtils]: 77: Hoare triple {3828#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {3828#false} is VALID [2018-11-23 10:02:49,263 INFO L273 TraceCheckUtils]: 76: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {3828#false} is VALID [2018-11-23 10:02:49,263 INFO L273 TraceCheckUtils]: 75: Hoare triple {3828#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {3828#false} is VALID [2018-11-23 10:02:49,263 INFO L273 TraceCheckUtils]: 74: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {3828#false} is VALID [2018-11-23 10:02:49,263 INFO L273 TraceCheckUtils]: 73: Hoare triple {3828#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {3828#false} is VALID [2018-11-23 10:02:49,263 INFO L273 TraceCheckUtils]: 72: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {3828#false} is VALID [2018-11-23 10:02:49,263 INFO L273 TraceCheckUtils]: 71: Hoare triple {3828#false} ~i~0 := 0bv32; {3828#false} is VALID [2018-11-23 10:02:49,264 INFO L273 TraceCheckUtils]: 70: Hoare triple {3828#false} assume !~bvslt32(~i~0, 100000bv32); {3828#false} is VALID [2018-11-23 10:02:49,264 INFO L273 TraceCheckUtils]: 69: Hoare triple {3828#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {3828#false} is VALID [2018-11-23 10:02:49,264 INFO L273 TraceCheckUtils]: 68: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {3828#false} is VALID [2018-11-23 10:02:49,264 INFO L273 TraceCheckUtils]: 67: Hoare triple {3828#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {3828#false} is VALID [2018-11-23 10:02:49,264 INFO L273 TraceCheckUtils]: 66: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {3828#false} is VALID [2018-11-23 10:02:49,264 INFO L273 TraceCheckUtils]: 65: Hoare triple {3828#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {3828#false} is VALID [2018-11-23 10:02:49,265 INFO L273 TraceCheckUtils]: 64: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {3828#false} is VALID [2018-11-23 10:02:49,265 INFO L273 TraceCheckUtils]: 63: Hoare triple {3828#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {3828#false} is VALID [2018-11-23 10:02:49,265 INFO L273 TraceCheckUtils]: 62: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {3828#false} is VALID [2018-11-23 10:02:49,265 INFO L273 TraceCheckUtils]: 61: Hoare triple {3828#false} ~i~0 := 0bv32; {3828#false} is VALID [2018-11-23 10:02:49,265 INFO L273 TraceCheckUtils]: 60: Hoare triple {3828#false} assume !~bvslt32(~i~0, 100000bv32); {3828#false} is VALID [2018-11-23 10:02:49,265 INFO L273 TraceCheckUtils]: 59: Hoare triple {3828#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3828#false} is VALID [2018-11-23 10:02:49,266 INFO L273 TraceCheckUtils]: 58: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3828#false} is VALID [2018-11-23 10:02:49,266 INFO L273 TraceCheckUtils]: 57: Hoare triple {3828#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3828#false} is VALID [2018-11-23 10:02:49,266 INFO L273 TraceCheckUtils]: 56: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3828#false} is VALID [2018-11-23 10:02:49,266 INFO L273 TraceCheckUtils]: 55: Hoare triple {3828#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3828#false} is VALID [2018-11-23 10:02:49,266 INFO L273 TraceCheckUtils]: 54: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3828#false} is VALID [2018-11-23 10:02:49,266 INFO L273 TraceCheckUtils]: 53: Hoare triple {3828#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3828#false} is VALID [2018-11-23 10:02:49,266 INFO L273 TraceCheckUtils]: 52: Hoare triple {3828#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3828#false} is VALID [2018-11-23 10:02:49,267 INFO L273 TraceCheckUtils]: 51: Hoare triple {3828#false} havoc ~i~0;~i~0 := 0bv32; {3828#false} is VALID [2018-11-23 10:02:49,267 INFO L273 TraceCheckUtils]: 50: Hoare triple {4341#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {3828#false} is VALID [2018-11-23 10:02:49,268 INFO L273 TraceCheckUtils]: 49: Hoare triple {4345#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4341#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-23 10:02:49,269 INFO L273 TraceCheckUtils]: 48: Hoare triple {4345#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4345#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,275 INFO L273 TraceCheckUtils]: 47: Hoare triple {4352#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4345#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,275 INFO L273 TraceCheckUtils]: 46: Hoare triple {4352#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4352#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,280 INFO L273 TraceCheckUtils]: 45: Hoare triple {4359#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4352#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,280 INFO L273 TraceCheckUtils]: 44: Hoare triple {4359#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4359#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,285 INFO L273 TraceCheckUtils]: 43: Hoare triple {4366#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4359#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,285 INFO L273 TraceCheckUtils]: 42: Hoare triple {4366#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4366#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,293 INFO L273 TraceCheckUtils]: 41: Hoare triple {4373#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4366#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,294 INFO L273 TraceCheckUtils]: 40: Hoare triple {4373#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4373#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,299 INFO L273 TraceCheckUtils]: 39: Hoare triple {4380#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4373#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,300 INFO L273 TraceCheckUtils]: 38: Hoare triple {4380#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4380#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,307 INFO L273 TraceCheckUtils]: 37: Hoare triple {4387#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4380#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,308 INFO L273 TraceCheckUtils]: 36: Hoare triple {4387#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4387#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,314 INFO L273 TraceCheckUtils]: 35: Hoare triple {4394#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4387#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,314 INFO L273 TraceCheckUtils]: 34: Hoare triple {4394#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4394#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,319 INFO L273 TraceCheckUtils]: 33: Hoare triple {4401#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4394#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,321 INFO L273 TraceCheckUtils]: 32: Hoare triple {4401#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4401#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,326 INFO L273 TraceCheckUtils]: 31: Hoare triple {4408#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4401#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,327 INFO L273 TraceCheckUtils]: 30: Hoare triple {4408#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4408#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,333 INFO L273 TraceCheckUtils]: 29: Hoare triple {4415#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4408#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,333 INFO L273 TraceCheckUtils]: 28: Hoare triple {4415#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4415#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,340 INFO L273 TraceCheckUtils]: 27: Hoare triple {4422#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4415#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,340 INFO L273 TraceCheckUtils]: 26: Hoare triple {4422#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4422#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,346 INFO L273 TraceCheckUtils]: 25: Hoare triple {4429#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4422#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,347 INFO L273 TraceCheckUtils]: 24: Hoare triple {4429#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4429#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,356 INFO L273 TraceCheckUtils]: 23: Hoare triple {4436#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4429#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,368 INFO L273 TraceCheckUtils]: 22: Hoare triple {4436#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4436#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,379 INFO L273 TraceCheckUtils]: 21: Hoare triple {4443#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4436#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,388 INFO L273 TraceCheckUtils]: 20: Hoare triple {4443#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4443#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,401 INFO L273 TraceCheckUtils]: 19: Hoare triple {4450#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4443#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,419 INFO L273 TraceCheckUtils]: 18: Hoare triple {4450#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4450#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,428 INFO L273 TraceCheckUtils]: 17: Hoare triple {4457#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4450#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,440 INFO L273 TraceCheckUtils]: 16: Hoare triple {4457#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4457#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,453 INFO L273 TraceCheckUtils]: 15: Hoare triple {4464#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4457#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,466 INFO L273 TraceCheckUtils]: 14: Hoare triple {4464#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4464#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,473 INFO L273 TraceCheckUtils]: 13: Hoare triple {4471#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4464#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,477 INFO L273 TraceCheckUtils]: 12: Hoare triple {4471#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4471#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,484 INFO L273 TraceCheckUtils]: 11: Hoare triple {4478#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4471#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,484 INFO L273 TraceCheckUtils]: 10: Hoare triple {4478#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4478#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,492 INFO L273 TraceCheckUtils]: 9: Hoare triple {4485#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4478#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,492 INFO L273 TraceCheckUtils]: 8: Hoare triple {4485#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4485#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,497 INFO L273 TraceCheckUtils]: 7: Hoare triple {4492#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4485#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,503 INFO L273 TraceCheckUtils]: 6: Hoare triple {4492#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4492#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,504 INFO L273 TraceCheckUtils]: 5: Hoare triple {3827#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {4492#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:49,504 INFO L256 TraceCheckUtils]: 4: Hoare triple {3827#true} call #t~ret15 := main(); {3827#true} is VALID [2018-11-23 10:02:49,504 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3827#true} {3827#true} #119#return; {3827#true} is VALID [2018-11-23 10:02:49,504 INFO L273 TraceCheckUtils]: 2: Hoare triple {3827#true} assume true; {3827#true} is VALID [2018-11-23 10:02:49,505 INFO L273 TraceCheckUtils]: 1: Hoare triple {3827#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3827#true} is VALID [2018-11-23 10:02:49,505 INFO L256 TraceCheckUtils]: 0: Hoare triple {3827#true} call ULTIMATE.init(); {3827#true} is VALID [2018-11-23 10:02:49,521 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-23 10:02:49,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:02:49,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-23 10:02:49,527 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 107 [2018-11-23 10:02:49,527 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:49,528 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 10:02:49,874 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:49,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 10:02:49,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 10:02:49,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 10:02:49,876 INFO L87 Difference]: Start difference. First operand 112 states and 118 transitions. Second operand 48 states. [2018-11-23 10:02:54,687 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-23 10:02:55,168 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-23 10:02:55,664 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-23 10:02:56,178 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-23 10:02:56,729 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-23 10:02:57,306 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 7 [2018-11-23 10:03:06,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:03:06,594 INFO L93 Difference]: Finished difference Result 221 states and 256 transitions. [2018-11-23 10:03:06,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 10:03:06,594 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 107 [2018-11-23 10:03:06,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:03:06,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 10:03:06,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 186 transitions. [2018-11-23 10:03:06,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 10:03:06,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 186 transitions. [2018-11-23 10:03:06,602 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 186 transitions. [2018-11-23 10:03:06,955 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:03:06,960 INFO L225 Difference]: With dead ends: 221 [2018-11-23 10:03:06,960 INFO L226 Difference]: Without dead ends: 160 [2018-11-23 10:03:06,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2018-11-23 10:03:06,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-11-23 10:03:07,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-11-23 10:03:07,031 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:03:07,031 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand 160 states. [2018-11-23 10:03:07,032 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand 160 states. [2018-11-23 10:03:07,032 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 160 states. [2018-11-23 10:03:07,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:03:07,038 INFO L93 Difference]: Finished difference Result 160 states and 166 transitions. [2018-11-23 10:03:07,038 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 166 transitions. [2018-11-23 10:03:07,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:03:07,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:03:07,039 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand 160 states. [2018-11-23 10:03:07,039 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 160 states. [2018-11-23 10:03:07,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:03:07,044 INFO L93 Difference]: Finished difference Result 160 states and 166 transitions. [2018-11-23 10:03:07,045 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 166 transitions. [2018-11-23 10:03:07,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:03:07,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:03:07,045 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:03:07,045 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:03:07,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-11-23 10:03:07,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 166 transitions. [2018-11-23 10:03:07,051 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 166 transitions. Word has length 107 [2018-11-23 10:03:07,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:03:07,051 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 166 transitions. [2018-11-23 10:03:07,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 10:03:07,051 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 166 transitions. [2018-11-23 10:03:07,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-23 10:03:07,053 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:03:07,054 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:03:07,054 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:03:07,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:03:07,054 INFO L82 PathProgramCache]: Analyzing trace with hash -369613134, now seen corresponding path program 5 times [2018-11-23 10:03:07,056 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:03:07,056 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 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 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:03:07,087 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1