java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector-Const.epf -i ../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call4.i.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:30:10,980 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:30:10,982 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:30:10,995 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:30:10,996 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:30:10,997 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:30:10,999 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:30:11,002 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:30:11,010 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:30:11,011 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:30:11,012 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:30:11,012 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:30:11,016 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:30:11,017 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:30:11,023 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:30:11,024 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:30:11,025 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:30:11,027 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:30:11,032 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:30:11,035 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:30:11,036 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:30:11,038 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:30:11,047 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:30:11,047 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:30:11,047 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:30:11,048 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:30:11,049 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:30:11,052 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:30:11,053 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:30:11,054 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:30:11,054 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:30:11,057 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:30:11,057 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:30:11,057 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:30:11,059 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:30:11,060 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:30:11,060 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector-Const.epf [2018-11-14 18:30:11,086 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:30:11,087 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:30:11,088 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:30:11,088 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:30:11,089 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:30:11,090 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:30:11,090 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:30:11,090 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:30:11,090 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:30:11,090 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:30:11,091 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:30:11,091 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:30:11,091 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:30:11,091 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:30:11,091 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 18:30:11,092 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 18:30:11,092 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:30:11,092 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:30:11,092 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:30:11,092 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:30:11,094 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:30:11,094 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:30:11,094 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:30:11,094 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:30:11,094 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:30:11,095 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:30:11,095 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:30:11,095 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:30:11,095 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 18:30:11,095 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:30:11,096 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 18:30:11,096 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 18:30:11,096 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:30:11,162 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:30:11,178 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:30:11,183 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:30:11,185 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:30:11,185 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:30:11,186 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call4.i.v+nlh-reducer.c [2018-11-14 18:30:11,255 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e656b41b/97a7aa6f16424ebb936677fe4e61864f/FLAG88e56e6c8 [2018-11-14 18:30:11,697 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:30:11,698 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call4.i.v+nlh-reducer.c [2018-11-14 18:30:11,707 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e656b41b/97a7aa6f16424ebb936677fe4e61864f/FLAG88e56e6c8 [2018-11-14 18:30:11,725 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e656b41b/97a7aa6f16424ebb936677fe4e61864f [2018-11-14 18:30:11,735 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:30:11,737 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:30:11,738 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:30:11,738 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:30:11,742 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:30:11,744 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:30:11" (1/1) ... [2018-11-14 18:30:11,747 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55907750 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:30:11, skipping insertion in model container [2018-11-14 18:30:11,748 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:30:11" (1/1) ... [2018-11-14 18:30:11,759 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:30:11,791 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:30:12,039 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:30:12,046 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:30:12,095 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:30:12,123 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:30:12,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:30:12 WrapperNode [2018-11-14 18:30:12,124 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:30:12,125 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:30:12,125 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:30:12,125 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:30:12,141 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:30:12" (1/1) ... [2018-11-14 18:30:12,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:30:12" (1/1) ... [2018-11-14 18:30:12,152 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:30:12" (1/1) ... [2018-11-14 18:30:12,153 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:30:12" (1/1) ... [2018-11-14 18:30:12,179 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:30:12" (1/1) ... [2018-11-14 18:30:12,184 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:30:12" (1/1) ... [2018-11-14 18:30:12,186 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:30:12" (1/1) ... [2018-11-14 18:30:12,189 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:30:12,191 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:30:12,191 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:30:12,192 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:30:12,193 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:30:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:30:12,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:30:12,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:30:12,333 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:30:12,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:30:12,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-14 18:30:12,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 18:30:12,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2018-11-14 18:30:12,334 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:30:12,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 18:30:12,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 18:30:12,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 18:30:12,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:30:12,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:30:12,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 18:30:12,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 18:30:13,073 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:30:13,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:30:13 BoogieIcfgContainer [2018-11-14 18:30:13,075 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:30:13,076 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:30:13,076 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:30:13,080 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:30:13,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:30:11" (1/3) ... [2018-11-14 18:30:13,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60458c6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:30:13, skipping insertion in model container [2018-11-14 18:30:13,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:30:12" (2/3) ... [2018-11-14 18:30:13,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60458c6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:30:13, skipping insertion in model container [2018-11-14 18:30:13,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:30:13" (3/3) ... [2018-11-14 18:30:13,084 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_true-unreach-call4.i.v+nlh-reducer.c [2018-11-14 18:30:13,092 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:30:13,100 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-14 18:30:13,113 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-14 18:30:13,150 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:30:13,151 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:30:13,151 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:30:13,151 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:30:13,151 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:30:13,152 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:30:13,152 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:30:13,152 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:30:13,152 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:30:13,172 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-11-14 18:30:13,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-14 18:30:13,179 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:30:13,180 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:30:13,182 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:30:13,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:30:13,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1395858257, now seen corresponding path program 1 times [2018-11-14 18:30:13,192 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:30:13,193 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-14 18:30:13,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:30:13,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:30:13,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:30:13,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:30:13,405 INFO L256 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {39#true} is VALID [2018-11-14 18:30:13,409 INFO L273 TraceCheckUtils]: 1: Hoare triple {39#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~__return_main~0 := 0bv32;~__tmp_155_0~0 := 0bv32;~__return_136~0 := 0bv32; {39#true} is VALID [2018-11-14 18:30:13,410 INFO L273 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2018-11-14 18:30:13,411 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #92#return; {39#true} is VALID [2018-11-14 18:30:13,411 INFO L256 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret7 := main(); {39#true} is VALID [2018-11-14 18:30:13,416 INFO L273 TraceCheckUtils]: 5: Hoare triple {39#true} call ~#main__array~0.base, ~#main__array~0.offset := #Ultimate.alloc(400000bv32);havoc ~main__index1~0;havoc ~main__index2~0;~main__loop_entered~0 := 0bv32;~main__index1~0 := #t~nondet1;havoc #t~nondet1; {59#(= main_~main__loop_entered~0 (_ bv0 32))} is VALID [2018-11-14 18:30:13,417 INFO L273 TraceCheckUtils]: 6: Hoare triple {59#(= main_~main__loop_entered~0 (_ bv0 32))} assume ~bvult32(~main__index1~0, 100000bv32);~main__index2~0 := #t~nondet2;havoc #t~nondet2; {59#(= main_~main__loop_entered~0 (_ bv0 32))} is VALID [2018-11-14 18:30:13,418 INFO L273 TraceCheckUtils]: 7: Hoare triple {59#(= main_~main__loop_entered~0 (_ bv0 32))} assume ~bvult32(~main__index2~0, 100000bv32); {59#(= main_~main__loop_entered~0 (_ bv0 32))} is VALID [2018-11-14 18:30:13,419 INFO L273 TraceCheckUtils]: 8: Hoare triple {59#(= main_~main__loop_entered~0 (_ bv0 32))} assume !~bvult32(~main__index1~0, ~main__index2~0); {59#(= main_~main__loop_entered~0 (_ bv0 32))} is VALID [2018-11-14 18:30:13,419 INFO L273 TraceCheckUtils]: 9: Hoare triple {59#(= main_~main__loop_entered~0 (_ bv0 32))} assume !(~main__loop_entered~0 == 0bv32); {40#false} is VALID [2018-11-14 18:30:13,420 INFO L273 TraceCheckUtils]: 10: Hoare triple {40#false} assume ~bvult32(~main__index2~0, ~main__index1~0);havoc ~__tmp_3~0;call #t~mem5 := read~intINTTYPE4(~#main__array~0.base, ~bvadd32(~#main__array~0.offset, ~bvmul32(4bv32, ~main__index1~0)), 4bv32);call #t~mem6 := read~intINTTYPE4(~#main__array~0.base, ~bvadd32(~#main__array~0.offset, ~bvmul32(4bv32, ~main__index2~0)), 4bv32);~__tmp_3~0 := (if #t~mem5 == #t~mem6 then 1bv32 else 0bv32);havoc #t~mem5;havoc #t~mem6;havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {40#false} is VALID [2018-11-14 18:30:13,420 INFO L273 TraceCheckUtils]: 11: Hoare triple {40#false} assume ~__VERIFIER_assert__cond~2 == 0bv32; {40#false} is VALID [2018-11-14 18:30:13,420 INFO L273 TraceCheckUtils]: 12: Hoare triple {40#false} assume !false; {40#false} is VALID [2018-11-14 18:30:13,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:30:13,424 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:30:13,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:30:13,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:30:13,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-14 18:30:13,443 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:30:13,449 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:30:13,642 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:30:13,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:30:13,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:30:13,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:30:13,658 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 3 states. [2018-11-14 18:30:13,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:30:13,991 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2018-11-14 18:30:13,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:30:13,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-14 18:30:13,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:30:13,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:30:14,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2018-11-14 18:30:14,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:30:14,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2018-11-14 18:30:14,013 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 67 transitions. [2018-11-14 18:30:14,253 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:30:14,267 INFO L225 Difference]: With dead ends: 51 [2018-11-14 18:30:14,267 INFO L226 Difference]: Without dead ends: 33 [2018-11-14 18:30:14,271 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:30:14,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-14 18:30:14,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-11-14 18:30:14,345 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:30:14,346 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 31 states. [2018-11-14 18:30:14,346 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 31 states. [2018-11-14 18:30:14,346 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 31 states. [2018-11-14 18:30:14,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:30:14,351 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2018-11-14 18:30:14,352 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2018-11-14 18:30:14,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:30:14,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:30:14,353 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 33 states. [2018-11-14 18:30:14,353 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 33 states. [2018-11-14 18:30:14,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:30:14,358 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2018-11-14 18:30:14,358 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2018-11-14 18:30:14,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:30:14,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:30:14,359 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:30:14,360 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:30:14,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 18:30:14,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2018-11-14 18:30:14,365 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 13 [2018-11-14 18:30:14,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:30:14,365 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2018-11-14 18:30:14,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:30:14,366 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-14 18:30:14,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-14 18:30:14,367 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:30:14,367 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:30:14,367 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:30:14,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:30:14,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1868760050, now seen corresponding path program 1 times [2018-11-14 18:30:14,368 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:30:14,368 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-14 18:30:14,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:30:14,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:30:14,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:30:14,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:30:14,776 INFO L256 TraceCheckUtils]: 0: Hoare triple {256#true} call ULTIMATE.init(); {256#true} is VALID [2018-11-14 18:30:14,777 INFO L273 TraceCheckUtils]: 1: Hoare triple {256#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~__return_main~0 := 0bv32;~__tmp_155_0~0 := 0bv32;~__return_136~0 := 0bv32; {256#true} is VALID [2018-11-14 18:30:14,777 INFO L273 TraceCheckUtils]: 2: Hoare triple {256#true} assume true; {256#true} is VALID [2018-11-14 18:30:14,778 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} #92#return; {256#true} is VALID [2018-11-14 18:30:14,778 INFO L256 TraceCheckUtils]: 4: Hoare triple {256#true} call #t~ret7 := main(); {256#true} is VALID [2018-11-14 18:30:14,779 INFO L273 TraceCheckUtils]: 5: Hoare triple {256#true} call ~#main__array~0.base, ~#main__array~0.offset := #Ultimate.alloc(400000bv32);havoc ~main__index1~0;havoc ~main__index2~0;~main__loop_entered~0 := 0bv32;~main__index1~0 := #t~nondet1;havoc #t~nondet1; {256#true} is VALID [2018-11-14 18:30:14,779 INFO L273 TraceCheckUtils]: 6: Hoare triple {256#true} assume ~bvult32(~main__index1~0, 100000bv32);~main__index2~0 := #t~nondet2;havoc #t~nondet2; {256#true} is VALID [2018-11-14 18:30:14,780 INFO L273 TraceCheckUtils]: 7: Hoare triple {256#true} assume ~bvult32(~main__index2~0, 100000bv32); {256#true} is VALID [2018-11-14 18:30:14,780 INFO L273 TraceCheckUtils]: 8: Hoare triple {256#true} assume ~bvult32(~main__index1~0, ~main__index2~0);havoc ~main____CPAchecker_TMP_0~0; {256#true} is VALID [2018-11-14 18:30:14,781 INFO L273 TraceCheckUtils]: 9: Hoare triple {256#true} assume ~bvult32(~main__index1~0, 100000bv32); {256#true} is VALID [2018-11-14 18:30:14,782 INFO L273 TraceCheckUtils]: 10: Hoare triple {256#true} assume ~bvult32(~main__index2~0, 100000bv32);~main____CPAchecker_TMP_0~0 := 1bv32; {291#(= (_ bv1 32) main_~main____CPAchecker_TMP_0~0)} is VALID [2018-11-14 18:30:14,784 INFO L273 TraceCheckUtils]: 11: Hoare triple {291#(= (_ bv1 32) main_~main____CPAchecker_TMP_0~0)} havoc ~__tmp_1~0;~__tmp_1~0 := ~main____CPAchecker_TMP_0~0;havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {295#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:14,784 INFO L273 TraceCheckUtils]: 12: Hoare triple {295#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~0 == 0bv32; {257#false} is VALID [2018-11-14 18:30:14,785 INFO L273 TraceCheckUtils]: 13: Hoare triple {257#false} assume !false; {257#false} is VALID [2018-11-14 18:30:14,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:30:14,787 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:30:14,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:30:14,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 18:30:14,795 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-14 18:30:14,796 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:30:14,796 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 18:30:14,907 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:30:14,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 18:30:14,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 18:30:14,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 18:30:14,908 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 4 states. [2018-11-14 18:30:15,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:30:15,269 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2018-11-14 18:30:15,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 18:30:15,269 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-14 18:30:15,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:30:15,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:30:15,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2018-11-14 18:30:15,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:30:15,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2018-11-14 18:30:15,281 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 59 transitions. [2018-11-14 18:30:15,479 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:30:15,482 INFO L225 Difference]: With dead ends: 51 [2018-11-14 18:30:15,482 INFO L226 Difference]: Without dead ends: 49 [2018-11-14 18:30:15,483 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:30:15,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-14 18:30:15,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 33. [2018-11-14 18:30:15,507 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:30:15,507 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 33 states. [2018-11-14 18:30:15,507 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 33 states. [2018-11-14 18:30:15,508 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 33 states. [2018-11-14 18:30:15,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:30:15,513 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2018-11-14 18:30:15,513 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2018-11-14 18:30:15,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:30:15,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:30:15,514 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 49 states. [2018-11-14 18:30:15,514 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 49 states. [2018-11-14 18:30:15,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:30:15,520 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2018-11-14 18:30:15,523 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2018-11-14 18:30:15,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:30:15,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:30:15,524 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:30:15,524 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:30:15,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 18:30:15,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2018-11-14 18:30:15,530 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 14 [2018-11-14 18:30:15,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:30:15,530 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2018-11-14 18:30:15,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 18:30:15,530 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2018-11-14 18:30:15,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-14 18:30:15,531 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:30:15,531 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:30:15,533 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:30:15,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:30:15,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1932482999, now seen corresponding path program 1 times [2018-11-14 18:30:15,533 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:30:15,534 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-14 18:30:15,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:30:15,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:30:15,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:30:15,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:30:15,640 INFO L256 TraceCheckUtils]: 0: Hoare triple {515#true} call ULTIMATE.init(); {515#true} is VALID [2018-11-14 18:30:15,640 INFO L273 TraceCheckUtils]: 1: Hoare triple {515#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~__return_main~0 := 0bv32;~__tmp_155_0~0 := 0bv32;~__return_136~0 := 0bv32; {515#true} is VALID [2018-11-14 18:30:15,641 INFO L273 TraceCheckUtils]: 2: Hoare triple {515#true} assume true; {515#true} is VALID [2018-11-14 18:30:15,641 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {515#true} {515#true} #92#return; {515#true} is VALID [2018-11-14 18:30:15,641 INFO L256 TraceCheckUtils]: 4: Hoare triple {515#true} call #t~ret7 := main(); {515#true} is VALID [2018-11-14 18:30:15,642 INFO L273 TraceCheckUtils]: 5: Hoare triple {515#true} call ~#main__array~0.base, ~#main__array~0.offset := #Ultimate.alloc(400000bv32);havoc ~main__index1~0;havoc ~main__index2~0;~main__loop_entered~0 := 0bv32;~main__index1~0 := #t~nondet1;havoc #t~nondet1; {515#true} is VALID [2018-11-14 18:30:15,643 INFO L273 TraceCheckUtils]: 6: Hoare triple {515#true} assume ~bvult32(~main__index1~0, 100000bv32);~main__index2~0 := #t~nondet2;havoc #t~nondet2; {538#(bvult main_~main__index1~0 (_ bv100000 32))} is VALID [2018-11-14 18:30:15,645 INFO L273 TraceCheckUtils]: 7: Hoare triple {538#(bvult main_~main__index1~0 (_ bv100000 32))} assume ~bvult32(~main__index2~0, 100000bv32); {538#(bvult main_~main__index1~0 (_ bv100000 32))} is VALID [2018-11-14 18:30:15,646 INFO L273 TraceCheckUtils]: 8: Hoare triple {538#(bvult main_~main__index1~0 (_ bv100000 32))} assume ~bvult32(~main__index1~0, ~main__index2~0);havoc ~main____CPAchecker_TMP_0~0; {538#(bvult main_~main__index1~0 (_ bv100000 32))} is VALID [2018-11-14 18:30:15,657 INFO L273 TraceCheckUtils]: 9: Hoare triple {538#(bvult main_~main__index1~0 (_ bv100000 32))} assume !~bvult32(~main__index1~0, 100000bv32); {516#false} is VALID [2018-11-14 18:30:15,658 INFO L273 TraceCheckUtils]: 10: Hoare triple {516#false} ~main____CPAchecker_TMP_0~0 := 0bv32; {516#false} is VALID [2018-11-14 18:30:15,658 INFO L273 TraceCheckUtils]: 11: Hoare triple {516#false} havoc ~__tmp_1~0;~__tmp_1~0 := ~main____CPAchecker_TMP_0~0;havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {516#false} is VALID [2018-11-14 18:30:15,658 INFO L273 TraceCheckUtils]: 12: Hoare triple {516#false} assume ~__VERIFIER_assert__cond~0 == 0bv32; {516#false} is VALID [2018-11-14 18:30:15,658 INFO L273 TraceCheckUtils]: 13: Hoare triple {516#false} assume !false; {516#false} is VALID [2018-11-14 18:30:15,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:30:15,659 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:30:15,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:30:15,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:30:15,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-14 18:30:15,669 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:30:15,669 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:30:15,750 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:30:15,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:30:15,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:30:15,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:30:15,751 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 3 states. [2018-11-14 18:30:15,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:30:15,990 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2018-11-14 18:30:15,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:30:15,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-14 18:30:15,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:30:15,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:30:15,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2018-11-14 18:30:15,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:30:15,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2018-11-14 18:30:15,996 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 66 transitions. [2018-11-14 18:30:16,183 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:30:16,185 INFO L225 Difference]: With dead ends: 60 [2018-11-14 18:30:16,185 INFO L226 Difference]: Without dead ends: 40 [2018-11-14 18:30:16,185 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:30:16,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-14 18:30:16,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2018-11-14 18:30:16,213 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:30:16,213 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 33 states. [2018-11-14 18:30:16,214 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 33 states. [2018-11-14 18:30:16,214 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 33 states. [2018-11-14 18:30:16,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:30:16,217 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-14 18:30:16,218 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-14 18:30:16,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:30:16,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:30:16,219 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 40 states. [2018-11-14 18:30:16,219 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 40 states. [2018-11-14 18:30:16,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:30:16,222 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-14 18:30:16,222 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-14 18:30:16,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:30:16,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:30:16,223 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:30:16,224 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:30:16,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 18:30:16,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-14 18:30:16,226 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 14 [2018-11-14 18:30:16,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:30:16,226 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-14 18:30:16,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:30:16,227 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-14 18:30:16,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 18:30:16,227 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:30:16,227 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:30:16,228 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:30:16,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:30:16,228 INFO L82 PathProgramCache]: Analyzing trace with hash -2140784762, now seen corresponding path program 1 times [2018-11-14 18:30:16,229 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:30:16,229 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-14 18:30:16,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:30:16,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:30:16,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:30:16,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:30:16,353 INFO L256 TraceCheckUtils]: 0: Hoare triple {766#true} call ULTIMATE.init(); {766#true} is VALID [2018-11-14 18:30:16,353 INFO L273 TraceCheckUtils]: 1: Hoare triple {766#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~__return_main~0 := 0bv32;~__tmp_155_0~0 := 0bv32;~__return_136~0 := 0bv32; {766#true} is VALID [2018-11-14 18:30:16,353 INFO L273 TraceCheckUtils]: 2: Hoare triple {766#true} assume true; {766#true} is VALID [2018-11-14 18:30:16,354 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {766#true} {766#true} #92#return; {766#true} is VALID [2018-11-14 18:30:16,354 INFO L256 TraceCheckUtils]: 4: Hoare triple {766#true} call #t~ret7 := main(); {766#true} is VALID [2018-11-14 18:30:16,354 INFO L273 TraceCheckUtils]: 5: Hoare triple {766#true} call ~#main__array~0.base, ~#main__array~0.offset := #Ultimate.alloc(400000bv32);havoc ~main__index1~0;havoc ~main__index2~0;~main__loop_entered~0 := 0bv32;~main__index1~0 := #t~nondet1;havoc #t~nondet1; {766#true} is VALID [2018-11-14 18:30:16,354 INFO L273 TraceCheckUtils]: 6: Hoare triple {766#true} assume ~bvult32(~main__index1~0, 100000bv32);~main__index2~0 := #t~nondet2;havoc #t~nondet2; {766#true} is VALID [2018-11-14 18:30:16,355 INFO L273 TraceCheckUtils]: 7: Hoare triple {766#true} assume ~bvult32(~main__index2~0, 100000bv32); {792#(bvult main_~main__index2~0 (_ bv100000 32))} is VALID [2018-11-14 18:30:16,359 INFO L273 TraceCheckUtils]: 8: Hoare triple {792#(bvult main_~main__index2~0 (_ bv100000 32))} assume ~bvult32(~main__index1~0, ~main__index2~0);havoc ~main____CPAchecker_TMP_0~0; {792#(bvult main_~main__index2~0 (_ bv100000 32))} is VALID [2018-11-14 18:30:16,359 INFO L273 TraceCheckUtils]: 9: Hoare triple {792#(bvult main_~main__index2~0 (_ bv100000 32))} assume ~bvult32(~main__index1~0, 100000bv32); {792#(bvult main_~main__index2~0 (_ bv100000 32))} is VALID [2018-11-14 18:30:16,363 INFO L273 TraceCheckUtils]: 10: Hoare triple {792#(bvult main_~main__index2~0 (_ bv100000 32))} assume !~bvult32(~main__index2~0, 100000bv32); {767#false} is VALID [2018-11-14 18:30:16,364 INFO L273 TraceCheckUtils]: 11: Hoare triple {767#false} ~main____CPAchecker_TMP_0~0 := 0bv32; {767#false} is VALID [2018-11-14 18:30:16,364 INFO L273 TraceCheckUtils]: 12: Hoare triple {767#false} havoc ~__tmp_1~0;~__tmp_1~0 := ~main____CPAchecker_TMP_0~0;havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {767#false} is VALID [2018-11-14 18:30:16,364 INFO L273 TraceCheckUtils]: 13: Hoare triple {767#false} assume ~__VERIFIER_assert__cond~0 == 0bv32; {767#false} is VALID [2018-11-14 18:30:16,364 INFO L273 TraceCheckUtils]: 14: Hoare triple {767#false} assume !false; {767#false} is VALID [2018-11-14 18:30:16,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:30:16,365 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:30:16,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:30:16,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:30:16,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-14 18:30:16,368 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:30:16,368 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:30:16,416 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:30:16,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:30:16,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:30:16,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:30:16,417 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 3 states. [2018-11-14 18:30:16,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:30:16,575 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-11-14 18:30:16,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:30:16,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-14 18:30:16,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:30:16,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:30:16,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2018-11-14 18:30:16,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:30:16,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2018-11-14 18:30:16,580 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2018-11-14 18:30:16,684 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:30:16,685 INFO L225 Difference]: With dead ends: 54 [2018-11-14 18:30:16,686 INFO L226 Difference]: Without dead ends: 34 [2018-11-14 18:30:16,686 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:30:16,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-14 18:30:16,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2018-11-14 18:30:16,722 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:30:16,723 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 28 states. [2018-11-14 18:30:16,723 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 28 states. [2018-11-14 18:30:16,723 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 28 states. [2018-11-14 18:30:16,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:30:16,725 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-14 18:30:16,725 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-14 18:30:16,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:30:16,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:30:16,726 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 34 states. [2018-11-14 18:30:16,726 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 34 states. [2018-11-14 18:30:16,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:30:16,732 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-14 18:30:16,732 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-14 18:30:16,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:30:16,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:30:16,734 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:30:16,734 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:30:16,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 18:30:16,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-11-14 18:30:16,736 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 15 [2018-11-14 18:30:16,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:30:16,736 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-11-14 18:30:16,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:30:16,737 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-14 18:30:16,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 18:30:16,737 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:30:16,738 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:30:16,738 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:30:16,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:30:16,738 INFO L82 PathProgramCache]: Analyzing trace with hash 341027121, now seen corresponding path program 1 times [2018-11-14 18:30:16,740 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:30:16,740 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-14 18:30:16,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:30:16,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:30:18,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2018-11-14 18:30:18,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:30:20,188 INFO L256 TraceCheckUtils]: 0: Hoare triple {992#true} call ULTIMATE.init(); {992#true} is VALID [2018-11-14 18:30:20,188 INFO L273 TraceCheckUtils]: 1: Hoare triple {992#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~__return_main~0 := 0bv32;~__tmp_155_0~0 := 0bv32;~__return_136~0 := 0bv32; {992#true} is VALID [2018-11-14 18:30:20,188 INFO L273 TraceCheckUtils]: 2: Hoare triple {992#true} assume true; {992#true} is VALID [2018-11-14 18:30:20,189 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {992#true} {992#true} #92#return; {992#true} is VALID [2018-11-14 18:30:20,189 INFO L256 TraceCheckUtils]: 4: Hoare triple {992#true} call #t~ret7 := main(); {992#true} is VALID [2018-11-14 18:30:20,190 INFO L273 TraceCheckUtils]: 5: Hoare triple {992#true} call ~#main__array~0.base, ~#main__array~0.offset := #Ultimate.alloc(400000bv32);havoc ~main__index1~0;havoc ~main__index2~0;~main__loop_entered~0 := 0bv32;~main__index1~0 := #t~nondet1;havoc #t~nondet1; {992#true} is VALID [2018-11-14 18:30:20,194 INFO L273 TraceCheckUtils]: 6: Hoare triple {992#true} assume ~bvult32(~main__index1~0, 100000bv32);~main__index2~0 := #t~nondet2;havoc #t~nondet2; {1015#(bvult main_~main__index1~0 (_ bv100000 32))} is VALID [2018-11-14 18:30:20,196 INFO L273 TraceCheckUtils]: 7: Hoare triple {1015#(bvult main_~main__index1~0 (_ bv100000 32))} assume ~bvult32(~main__index2~0, 100000bv32); {1019#(and (bvult main_~main__index1~0 (_ bv100000 32)) (bvult main_~main__index2~0 (_ bv100000 32)))} is VALID [2018-11-14 18:30:20,197 INFO L273 TraceCheckUtils]: 8: Hoare triple {1019#(and (bvult main_~main__index1~0 (_ bv100000 32)) (bvult main_~main__index2~0 (_ bv100000 32)))} assume ~bvult32(~main__index1~0, ~main__index2~0);havoc ~main____CPAchecker_TMP_0~0; {1023#(and (bvult main_~main__index1~0 main_~main__index2~0) (bvult main_~main__index2~0 (_ bv100000 32)))} is VALID [2018-11-14 18:30:20,198 INFO L273 TraceCheckUtils]: 9: Hoare triple {1023#(and (bvult main_~main__index1~0 main_~main__index2~0) (bvult main_~main__index2~0 (_ bv100000 32)))} assume ~bvult32(~main__index1~0, 100000bv32); {1023#(and (bvult main_~main__index1~0 main_~main__index2~0) (bvult main_~main__index2~0 (_ bv100000 32)))} is VALID [2018-11-14 18:30:20,199 INFO L273 TraceCheckUtils]: 10: Hoare triple {1023#(and (bvult main_~main__index1~0 main_~main__index2~0) (bvult main_~main__index2~0 (_ bv100000 32)))} assume ~bvult32(~main__index2~0, 100000bv32);~main____CPAchecker_TMP_0~0 := 1bv32; {1030#(and (bvult main_~main__index1~0 main_~main__index2~0) (= (_ bv1 32) main_~main____CPAchecker_TMP_0~0) (bvult main_~main__index2~0 (_ bv100000 32)))} is VALID [2018-11-14 18:30:20,204 INFO L273 TraceCheckUtils]: 11: Hoare triple {1030#(and (bvult main_~main__index1~0 main_~main__index2~0) (= (_ bv1 32) main_~main____CPAchecker_TMP_0~0) (bvult main_~main__index2~0 (_ bv100000 32)))} havoc ~__tmp_1~0;~__tmp_1~0 := ~main____CPAchecker_TMP_0~0;havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1023#(and (bvult main_~main__index1~0 main_~main__index2~0) (bvult main_~main__index2~0 (_ bv100000 32)))} is VALID [2018-11-14 18:30:20,205 INFO L273 TraceCheckUtils]: 12: Hoare triple {1023#(and (bvult main_~main__index1~0 main_~main__index2~0) (bvult main_~main__index2~0 (_ bv100000 32)))} assume !(~__VERIFIER_assert__cond~0 == 0bv32);~__tmp_155_0~0 := ~main____CPAchecker_TMP_0~0; {1023#(and (bvult main_~main__index1~0 main_~main__index2~0) (bvult main_~main__index2~0 (_ bv100000 32)))} is VALID [2018-11-14 18:30:20,206 INFO L273 TraceCheckUtils]: 13: Hoare triple {1023#(and (bvult main_~main__index1~0 main_~main__index2~0) (bvult main_~main__index2~0 (_ bv100000 32)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_155_0~0;call #t~mem3 := read~intINTTYPE4(~#main__array~0.base, ~bvadd32(~#main__array~0.offset, ~bvmul32(4bv32, ~main__index1~0)), 4bv32);call #t~mem4 := read~intINTTYPE4(~#main__array~0.base, ~bvadd32(~#main__array~0.offset, ~bvmul32(4bv32, ~main__index2~0)), 4bv32); {1040#(and (bvult main_~main__index1~0 main_~main__index2~0) (= (select (select |#memory_int| |main_~#main__array~0.base|) (bvadd |main_~#main__array~0.offset| (bvmul (_ bv4 32) main_~main__index1~0))) |main_#t~mem3|) (= (select (select |#memory_int| |main_~#main__array~0.base|) (bvadd |main_~#main__array~0.offset| (bvmul (_ bv4 32) main_~main__index2~0))) |main_#t~mem4|) (bvult main_~main__index2~0 (_ bv100000 32)))} is VALID [2018-11-14 18:30:22,210 INFO L273 TraceCheckUtils]: 14: Hoare triple {1040#(and (bvult main_~main__index1~0 main_~main__index2~0) (= (select (select |#memory_int| |main_~#main__array~0.base|) (bvadd |main_~#main__array~0.offset| (bvmul (_ bv4 32) main_~main__index1~0))) |main_#t~mem3|) (= (select (select |#memory_int| |main_~#main__array~0.base|) (bvadd |main_~#main__array~0.offset| (bvmul (_ bv4 32) main_~main__index2~0))) |main_#t~mem4|) (bvult main_~main__index2~0 (_ bv100000 32)))} assume #t~mem3 == #t~mem4;havoc #t~mem3;havoc #t~mem4;~main____CPAchecker_TMP_1~0 := ~main__index1~0;~main__index1~0 := ~bvadd32(1bv32, ~main__index1~0);~main____CPAchecker_TMP_2~0 := ~main__index2~0;~main__index2~0 := ~bvsub32(~main__index2~0, 1bv32);~main__loop_entered~0 := 1bv32; {1044#(and (= (select (select |#memory_int| |main_~#main__array~0.base|) (bvadd |main_~#main__array~0.offset| (bvmul (_ bv4 32) main_~main__index2~0) (_ bv4 32))) (select (select |#memory_int| |main_~#main__array~0.base|) (bvadd |main_~#main__array~0.offset| (bvmul (_ bv4 32) main_~main__index1~0) (_ bv4294967292 32)))) (bvult (bvadd main_~main__index2~0 (_ bv1 32)) (_ bv100000 32)) (bvult (bvadd main_~main__index1~0 (_ bv4294967295 32)) (bvadd main_~main__index2~0 (_ bv1 32))))} is UNKNOWN [2018-11-14 18:30:22,213 INFO L273 TraceCheckUtils]: 15: Hoare triple {1044#(and (= (select (select |#memory_int| |main_~#main__array~0.base|) (bvadd |main_~#main__array~0.offset| (bvmul (_ bv4 32) main_~main__index2~0) (_ bv4 32))) (select (select |#memory_int| |main_~#main__array~0.base|) (bvadd |main_~#main__array~0.offset| (bvmul (_ bv4 32) main_~main__index1~0) (_ bv4294967292 32)))) (bvult (bvadd main_~main__index2~0 (_ bv1 32)) (_ bv100000 32)) (bvult (bvadd main_~main__index1~0 (_ bv4294967295 32)) (bvadd main_~main__index2~0 (_ bv1 32))))} assume !~bvult32(~main__index1~0, ~main__index2~0); {1048#(and (= (select (select |#memory_int| |main_~#main__array~0.base|) (bvadd |main_~#main__array~0.offset| (bvmul (_ bv4 32) main_~main__index2~0) (_ bv4 32))) (select (select |#memory_int| |main_~#main__array~0.base|) (bvadd |main_~#main__array~0.offset| (bvmul (_ bv4 32) main_~main__index1~0) (_ bv4294967292 32)))) (bvult (bvadd main_~main__index2~0 (_ bv1 32)) (_ bv100000 32)) (not (bvult main_~main__index1~0 main_~main__index2~0)) (bvult (bvadd main_~main__index1~0 (_ bv4294967295 32)) (bvadd main_~main__index2~0 (_ bv1 32))))} is VALID [2018-11-14 18:30:22,214 INFO L273 TraceCheckUtils]: 16: Hoare triple {1048#(and (= (select (select |#memory_int| |main_~#main__array~0.base|) (bvadd |main_~#main__array~0.offset| (bvmul (_ bv4 32) main_~main__index2~0) (_ bv4 32))) (select (select |#memory_int| |main_~#main__array~0.base|) (bvadd |main_~#main__array~0.offset| (bvmul (_ bv4 32) main_~main__index1~0) (_ bv4294967292 32)))) (bvult (bvadd main_~main__index2~0 (_ bv1 32)) (_ bv100000 32)) (not (bvult main_~main__index1~0 main_~main__index2~0)) (bvult (bvadd main_~main__index1~0 (_ bv4294967295 32)) (bvadd main_~main__index2~0 (_ bv1 32))))} assume !(~main__loop_entered~0 == 0bv32); {1048#(and (= (select (select |#memory_int| |main_~#main__array~0.base|) (bvadd |main_~#main__array~0.offset| (bvmul (_ bv4 32) main_~main__index2~0) (_ bv4 32))) (select (select |#memory_int| |main_~#main__array~0.base|) (bvadd |main_~#main__array~0.offset| (bvmul (_ bv4 32) main_~main__index1~0) (_ bv4294967292 32)))) (bvult (bvadd main_~main__index2~0 (_ bv1 32)) (_ bv100000 32)) (not (bvult main_~main__index1~0 main_~main__index2~0)) (bvult (bvadd main_~main__index1~0 (_ bv4294967295 32)) (bvadd main_~main__index2~0 (_ bv1 32))))} is VALID [2018-11-14 18:30:24,220 INFO L273 TraceCheckUtils]: 17: Hoare triple {1048#(and (= (select (select |#memory_int| |main_~#main__array~0.base|) (bvadd |main_~#main__array~0.offset| (bvmul (_ bv4 32) main_~main__index2~0) (_ bv4 32))) (select (select |#memory_int| |main_~#main__array~0.base|) (bvadd |main_~#main__array~0.offset| (bvmul (_ bv4 32) main_~main__index1~0) (_ bv4294967292 32)))) (bvult (bvadd main_~main__index2~0 (_ bv1 32)) (_ bv100000 32)) (not (bvult main_~main__index1~0 main_~main__index2~0)) (bvult (bvadd main_~main__index1~0 (_ bv4294967295 32)) (bvadd main_~main__index2~0 (_ bv1 32))))} assume ~bvult32(~main__index2~0, ~main__index1~0);havoc ~__tmp_3~0;call #t~mem5 := read~intINTTYPE4(~#main__array~0.base, ~bvadd32(~#main__array~0.offset, ~bvmul32(4bv32, ~main__index1~0)), 4bv32);call #t~mem6 := read~intINTTYPE4(~#main__array~0.base, ~bvadd32(~#main__array~0.offset, ~bvmul32(4bv32, ~main__index2~0)), 4bv32);~__tmp_3~0 := (if #t~mem5 == #t~mem6 then 1bv32 else 0bv32);havoc #t~mem5;havoc #t~mem6;havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {1055#(= (bvadd main_~__VERIFIER_assert__cond~2 (_ bv4294967295 32)) (_ bv0 32))} is UNKNOWN [2018-11-14 18:30:24,221 INFO L273 TraceCheckUtils]: 18: Hoare triple {1055#(= (bvadd main_~__VERIFIER_assert__cond~2 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~2 == 0bv32; {993#false} is VALID [2018-11-14 18:30:24,221 INFO L273 TraceCheckUtils]: 19: Hoare triple {993#false} assume !false; {993#false} is VALID [2018-11-14 18:30:24,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:30:24,225 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:30:24,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:30:24,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-14 18:30:24,231 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-11-14 18:30:24,231 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:30:24,232 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 18:30:28,379 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 18 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2018-11-14 18:30:28,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 18:30:28,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 18:30:28,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-14 18:30:28,381 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 10 states. [2018-11-14 18:30:30,342 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2018-11-14 18:30:30,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:30:30,529 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2018-11-14 18:30:30,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-14 18:30:30,530 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-11-14 18:30:30,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:30:30,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 18:30:30,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 50 transitions. [2018-11-14 18:30:30,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 18:30:30,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 50 transitions. [2018-11-14 18:30:30,534 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 50 transitions. [2018-11-14 18:30:36,264 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 48 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2018-11-14 18:30:36,266 INFO L225 Difference]: With dead ends: 43 [2018-11-14 18:30:36,266 INFO L226 Difference]: Without dead ends: 24 [2018-11-14 18:30:36,267 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-11-14 18:30:36,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-14 18:30:36,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2018-11-14 18:30:36,293 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:30:36,293 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 22 states. [2018-11-14 18:30:36,293 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 22 states. [2018-11-14 18:30:36,294 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 22 states. [2018-11-14 18:30:36,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:30:36,295 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-14 18:30:36,295 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-14 18:30:36,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:30:36,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:30:36,296 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 24 states. [2018-11-14 18:30:36,296 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 24 states. [2018-11-14 18:30:36,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:30:36,298 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-14 18:30:36,298 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-14 18:30:36,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:30:36,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:30:36,298 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:30:36,299 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:30:36,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 18:30:36,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-11-14 18:30:36,300 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-11-14 18:30:36,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:30:36,300 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-11-14 18:30:36,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 18:30:36,301 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-14 18:30:36,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 18:30:36,301 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:30:36,302 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:30:36,302 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:30:36,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:30:36,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1330084180, now seen corresponding path program 1 times [2018-11-14 18:30:36,303 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:30:36,303 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-14 18:30:36,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:30:36,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:30:36,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:30:36,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:30:36,457 INFO L256 TraceCheckUtils]: 0: Hoare triple {1205#true} call ULTIMATE.init(); {1205#true} is VALID [2018-11-14 18:30:36,457 INFO L273 TraceCheckUtils]: 1: Hoare triple {1205#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~__return_main~0 := 0bv32;~__tmp_155_0~0 := 0bv32;~__return_136~0 := 0bv32; {1205#true} is VALID [2018-11-14 18:30:36,457 INFO L273 TraceCheckUtils]: 2: Hoare triple {1205#true} assume true; {1205#true} is VALID [2018-11-14 18:30:36,458 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1205#true} {1205#true} #92#return; {1205#true} is VALID [2018-11-14 18:30:36,458 INFO L256 TraceCheckUtils]: 4: Hoare triple {1205#true} call #t~ret7 := main(); {1205#true} is VALID [2018-11-14 18:30:36,458 INFO L273 TraceCheckUtils]: 5: Hoare triple {1205#true} call ~#main__array~0.base, ~#main__array~0.offset := #Ultimate.alloc(400000bv32);havoc ~main__index1~0;havoc ~main__index2~0;~main__loop_entered~0 := 0bv32;~main__index1~0 := #t~nondet1;havoc #t~nondet1; {1205#true} is VALID [2018-11-14 18:30:36,458 INFO L273 TraceCheckUtils]: 6: Hoare triple {1205#true} assume ~bvult32(~main__index1~0, 100000bv32);~main__index2~0 := #t~nondet2;havoc #t~nondet2; {1205#true} is VALID [2018-11-14 18:30:36,459 INFO L273 TraceCheckUtils]: 7: Hoare triple {1205#true} assume ~bvult32(~main__index2~0, 100000bv32); {1205#true} is VALID [2018-11-14 18:30:36,459 INFO L273 TraceCheckUtils]: 8: Hoare triple {1205#true} assume ~bvult32(~main__index1~0, ~main__index2~0);havoc ~main____CPAchecker_TMP_0~0; {1205#true} is VALID [2018-11-14 18:30:36,459 INFO L273 TraceCheckUtils]: 9: Hoare triple {1205#true} assume ~bvult32(~main__index1~0, 100000bv32); {1205#true} is VALID [2018-11-14 18:30:36,461 INFO L273 TraceCheckUtils]: 10: Hoare triple {1205#true} assume ~bvult32(~main__index2~0, 100000bv32);~main____CPAchecker_TMP_0~0 := 1bv32; {1240#(= (_ bv1 32) main_~main____CPAchecker_TMP_0~0)} is VALID [2018-11-14 18:30:36,461 INFO L273 TraceCheckUtils]: 11: Hoare triple {1240#(= (_ bv1 32) main_~main____CPAchecker_TMP_0~0)} havoc ~__tmp_1~0;~__tmp_1~0 := ~main____CPAchecker_TMP_0~0;havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1205#true} is VALID [2018-11-14 18:30:36,461 INFO L273 TraceCheckUtils]: 12: Hoare triple {1205#true} assume !(~__VERIFIER_assert__cond~0 == 0bv32);~__tmp_155_0~0 := ~main____CPAchecker_TMP_0~0; {1205#true} is VALID [2018-11-14 18:30:36,462 INFO L273 TraceCheckUtils]: 13: Hoare triple {1205#true} ~main____CPAchecker_TMP_0~0 := ~__tmp_155_0~0;call #t~mem3 := read~intINTTYPE4(~#main__array~0.base, ~bvadd32(~#main__array~0.offset, ~bvmul32(4bv32, ~main__index1~0)), 4bv32);call #t~mem4 := read~intINTTYPE4(~#main__array~0.base, ~bvadd32(~#main__array~0.offset, ~bvmul32(4bv32, ~main__index2~0)), 4bv32); {1205#true} is VALID [2018-11-14 18:30:36,462 INFO L273 TraceCheckUtils]: 14: Hoare triple {1205#true} assume #t~mem3 == #t~mem4;havoc #t~mem3;havoc #t~mem4;~main____CPAchecker_TMP_1~0 := ~main__index1~0;~main__index1~0 := ~bvadd32(1bv32, ~main__index1~0);~main____CPAchecker_TMP_2~0 := ~main__index2~0;~main__index2~0 := ~bvsub32(~main__index2~0, 1bv32);~main__loop_entered~0 := 1bv32; {1205#true} is VALID [2018-11-14 18:30:36,462 INFO L273 TraceCheckUtils]: 15: Hoare triple {1205#true} assume ~bvult32(~main__index1~0, ~main__index2~0);havoc ~main____CPAchecker_TMP_0~1; {1205#true} is VALID [2018-11-14 18:30:36,462 INFO L273 TraceCheckUtils]: 16: Hoare triple {1205#true} assume ~bvult32(~main__index1~0, 100000bv32); {1205#true} is VALID [2018-11-14 18:30:36,463 INFO L273 TraceCheckUtils]: 17: Hoare triple {1205#true} assume ~bvult32(~main__index2~0, 100000bv32);~main____CPAchecker_TMP_0~1 := 1bv32; {1262#(= (_ bv1 32) main_~main____CPAchecker_TMP_0~1)} is VALID [2018-11-14 18:30:36,464 INFO L273 TraceCheckUtils]: 18: Hoare triple {1262#(= (_ bv1 32) main_~main____CPAchecker_TMP_0~1)} havoc ~__tmp_2~0;~__tmp_2~0 := ~main____CPAchecker_TMP_0~1;havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {1266#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:36,465 INFO L273 TraceCheckUtils]: 19: Hoare triple {1266#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~1 == 0bv32; {1206#false} is VALID [2018-11-14 18:30:36,465 INFO L273 TraceCheckUtils]: 20: Hoare triple {1206#false} assume !false; {1206#false} is VALID [2018-11-14 18:30:36,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:30:36,467 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:30:36,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:30:36,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 18:30:36,471 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-11-14 18:30:36,472 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:30:36,472 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 18:30:36,513 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:30:36,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 18:30:36,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 18:30:36,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:30:36,514 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 5 states. [2018-11-14 18:30:36,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:30:36,832 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-11-14 18:30:36,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 18:30:36,832 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-11-14 18:30:36,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:30:36,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:30:36,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2018-11-14 18:30:36,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:30:36,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2018-11-14 18:30:36,835 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 28 transitions. [2018-11-14 18:30:36,909 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:30:36,909 INFO L225 Difference]: With dead ends: 28 [2018-11-14 18:30:36,909 INFO L226 Difference]: Without dead ends: 0 [2018-11-14 18:30:36,910 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:30:36,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-14 18:30:36,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-14 18:30:36,911 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:30:36,911 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-14 18:30:36,911 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 18:30:36,912 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 18:30:36,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:30:36,912 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 18:30:36,913 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 18:30:36,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:30:36,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:30:36,913 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 18:30:36,913 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 18:30:36,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:30:36,913 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 18:30:36,914 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 18:30:36,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:30:36,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:30:36,914 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:30:36,914 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:30:36,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-14 18:30:36,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-14 18:30:36,915 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2018-11-14 18:30:36,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:30:36,915 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-14 18:30:36,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 18:30:36,915 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 18:30:36,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:30:36,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-14 18:30:37,330 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-11-14 18:30:37,691 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-11-14 18:30:37,709 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-14 18:30:37,709 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-14 18:30:37,709 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-14 18:30:37,709 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-14 18:30:37,709 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-14 18:30:37,709 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-14 18:30:37,709 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-14 18:30:37,709 INFO L428 ceAbstractionStarter]: At program point L126(lines 93 127) the Hoare annotation is: true [2018-11-14 18:30:37,710 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 9 163) no Hoare annotation was computed. [2018-11-14 18:30:37,710 INFO L421 ceAbstractionStarter]: At program point L151(lines 21 152) the Hoare annotation is: (or (let ((.cse1 (bvadd main_~main__index2~0 (_ bv1 32)))) (and (let ((.cse0 (select |#memory_int| |main_~#main__array~0.base|))) (= (select .cse0 (bvadd |main_~#main__array~0.offset| (bvmul (_ bv4 32) main_~main__index2~0) (_ bv4 32))) (select .cse0 (bvadd |main_~#main__array~0.offset| (bvmul (_ bv4 32) main_~main__index1~0) (_ bv4294967292 32))))) (bvult .cse1 (_ bv100000 32)) (not (bvult main_~main__index1~0 main_~main__index2~0)) (bvult (bvadd main_~main__index1~0 (_ bv4294967295 32)) .cse1))) (= main_~main__loop_entered~0 (_ bv0 32))) [2018-11-14 18:30:37,710 INFO L425 ceAbstractionStarter]: For program point L52(lines 52 128) no Hoare annotation was computed. [2018-11-14 18:30:37,710 INFO L425 ceAbstractionStarter]: For program point L19(lines 19 157) no Hoare annotation was computed. [2018-11-14 18:30:37,710 INFO L421 ceAbstractionStarter]: At program point L114(lines 94 123) the Hoare annotation is: (let ((.cse0 (bvult main_~main__index1~0 main_~main__index2~0))) (or (and .cse0 (= (bvadd main_~__VERIFIER_assert__cond~2 (_ bv4294967295 32)) (_ bv0 32)) (bvult main_~main__index2~0 (_ bv100000 32))) (let ((.cse2 (bvadd main_~main__index2~0 (_ bv1 32)))) (and (let ((.cse1 (select |#memory_int| |main_~#main__array~0.base|))) (= (select .cse1 (bvadd |main_~#main__array~0.offset| (bvmul (_ bv4 32) main_~main__index2~0) (_ bv4 32))) (select .cse1 (bvadd |main_~#main__array~0.offset| (bvmul (_ bv4 32) main_~main__index1~0) (_ bv4294967292 32))))) (bvult .cse2 (_ bv100000 32)) (not .cse0) (bvult (bvadd main_~main__index1~0 (_ bv4294967295 32)) .cse2))))) [2018-11-14 18:30:37,710 INFO L425 ceAbstractionStarter]: For program point L57(lines 57 83) no Hoare annotation was computed. [2018-11-14 18:30:37,710 INFO L425 ceAbstractionStarter]: For program point L24(lines 24 147) no Hoare annotation was computed. [2018-11-14 18:30:37,710 INFO L425 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2018-11-14 18:30:37,711 INFO L421 ceAbstractionStarter]: At program point L82(lines 57 83) the Hoare annotation is: (let ((.cse1 (bvadd main_~main__index2~0 (_ bv1 32)))) (and (let ((.cse0 (select |#memory_int| |main_~#main__array~0.base|))) (= (select .cse0 (bvadd |main_~#main__array~0.offset| (bvmul (_ bv4 32) main_~main__index2~0) (_ bv4 32))) (select .cse0 (bvadd |main_~#main__array~0.offset| (bvmul (_ bv4 32) main_~main__index1~0) (_ bv4294967292 32))))) (bvult main_~main__index1~0 main_~main__index2~0) (bvult .cse1 (_ bv100000 32)) (bvult (bvadd main_~main__index1~0 (_ bv4294967295 32)) .cse1) (= (_ bv1 32) main_~main____CPAchecker_TMP_0~1))) [2018-11-14 18:30:37,711 INFO L425 ceAbstractionStarter]: For program point L16(lines 16 162) no Hoare annotation was computed. [2018-11-14 18:30:37,711 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 37) no Hoare annotation was computed. [2018-11-14 18:30:37,711 INFO L425 ceAbstractionStarter]: For program point L45(lines 45 133) no Hoare annotation was computed. [2018-11-14 18:30:37,711 INFO L421 ceAbstractionStarter]: At program point L74(lines 41 134) the Hoare annotation is: (let ((.cse1 (= (_ bv1 32) main_~main____CPAchecker_TMP_0~0))) (let ((.cse0 (let ((.cse3 (bvult main_~main__index1~0 main_~main__index2~0))) (or (let ((.cse4 (bvadd main_~main__index2~0 (_ bv1 32)))) (and (let ((.cse2 (select |#memory_int| |main_~#main__array~0.base|))) (= (select .cse2 (bvadd |main_~#main__array~0.offset| (bvmul (_ bv4 32) main_~main__index2~0) (_ bv4 32))) (select .cse2 (bvadd |main_~#main__array~0.offset| (bvmul (_ bv4 32) main_~main__index1~0) (_ bv4294967292 32))))) .cse3 (bvult .cse4 (_ bv100000 32)) (bvult (bvadd main_~main__index1~0 (_ bv4294967295 32)) .cse4))) (and .cse3 .cse1 (bvult main_~main__index2~0 (_ bv100000 32))))))) (or (and .cse0 (= (_ bv1 32) main_~main____CPAchecker_TMP_0~1) (= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))) (and .cse1 .cse0)))) [2018-11-14 18:30:37,711 INFO L425 ceAbstractionStarter]: For program point L103(lines 103 115) no Hoare annotation was computed. [2018-11-14 18:30:37,712 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-11-14 18:30:37,712 INFO L425 ceAbstractionStarter]: For program point L66(lines 66 75) no Hoare annotation was computed. [2018-11-14 18:30:37,712 INFO L421 ceAbstractionStarter]: At program point L87(lines 55 88) the Hoare annotation is: false [2018-11-14 18:30:37,712 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 152) no Hoare annotation was computed. [2018-11-14 18:30:37,712 INFO L425 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2018-11-14 18:30:37,712 INFO L421 ceAbstractionStarter]: At program point L141(lines 26 142) the Hoare annotation is: (and (bvult main_~main__index1~0 main_~main__index2~0) (= (_ bv1 32) main_~main____CPAchecker_TMP_0~0) (= main_~main__loop_entered~0 (_ bv0 32)) (bvult main_~main__index2~0 (_ bv100000 32))) [2018-11-14 18:30:37,712 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 9 163) no Hoare annotation was computed. [2018-11-14 18:30:37,712 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 9 163) the Hoare annotation is: true [2018-11-14 18:30:37,713 INFO L425 ceAbstractionStarter]: For program point L26(lines 26 142) no Hoare annotation was computed. [2018-11-14 18:30:37,713 INFO L425 ceAbstractionStarter]: For program point L55(lines 55 88) no Hoare annotation was computed. [2018-11-14 18:30:37,713 INFO L421 ceAbstractionStarter]: At program point L146(lines 24 147) the Hoare annotation is: false [2018-11-14 18:30:37,713 INFO L425 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2018-11-14 18:30:37,713 INFO L425 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2018-11-14 18:30:37,713 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 134) no Hoare annotation was computed. [2018-11-14 18:30:37,714 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 18:30:37,715 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2018-11-14 18:30:37,715 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 18:30:37,715 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 18:30:37,715 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2018-11-14 18:30:37,715 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2018-11-14 18:30:37,715 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 18:30:37,715 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 18:30:37,715 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2018-11-14 18:30:37,715 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2018-11-14 18:30:37,715 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 18:30:37,715 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-14 18:30:37,716 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-14 18:30:37,716 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 18:30:37,716 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2018-11-14 18:30:37,716 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2018-11-14 18:30:37,717 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2018-11-14 18:30:37,717 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2018-11-14 18:30:37,717 WARN L170 areAnnotationChecker]: L103 has no Hoare annotation [2018-11-14 18:30:37,717 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 18:30:37,717 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-14 18:30:37,717 WARN L170 areAnnotationChecker]: L103 has no Hoare annotation [2018-11-14 18:30:37,717 WARN L170 areAnnotationChecker]: L103 has no Hoare annotation [2018-11-14 18:30:37,718 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-14 18:30:37,718 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-14 18:30:37,718 WARN L170 areAnnotationChecker]: L105 has no Hoare annotation [2018-11-14 18:30:37,718 WARN L170 areAnnotationChecker]: L105 has no Hoare annotation [2018-11-14 18:30:37,718 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2018-11-14 18:30:37,718 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2018-11-14 18:30:37,718 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2018-11-14 18:30:37,718 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2018-11-14 18:30:37,718 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2018-11-14 18:30:37,718 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2018-11-14 18:30:37,718 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2018-11-14 18:30:37,718 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2018-11-14 18:30:37,718 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2018-11-14 18:30:37,718 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2018-11-14 18:30:37,719 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2018-11-14 18:30:37,719 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2018-11-14 18:30:37,719 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2018-11-14 18:30:37,719 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2018-11-14 18:30:37,719 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2018-11-14 18:30:37,719 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2018-11-14 18:30:37,719 INFO L163 areAnnotationChecker]: CFG has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-14 18:30:37,725 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 18:30:37,726 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 18:30:37,729 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 18:30:37,729 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 18:30:37,731 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 18:30:37,731 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 18:30:37,732 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 18:30:37,732 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 18:30:37,733 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 18:30:37,734 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 18:30:37,735 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 18:30:37,735 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 18:30:37,737 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 18:30:37,737 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 18:30:37,737 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 18:30:37,737 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 18:30:37,739 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 18:30:37,740 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 18:30:37,740 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 18:30:37,740 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 18:30:37,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 06:30:37 BoogieIcfgContainer [2018-11-14 18:30:37,743 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 18:30:37,744 INFO L168 Benchmark]: Toolchain (without parser) took 26007.75 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 683.7 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -217.1 MB). Peak memory consumption was 466.5 MB. Max. memory is 7.1 GB. [2018-11-14 18:30:37,745 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 18:30:37,746 INFO L168 Benchmark]: CACSL2BoogieTranslator took 386.31 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-14 18:30:37,746 INFO L168 Benchmark]: Boogie Preprocessor took 66.01 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 18:30:37,747 INFO L168 Benchmark]: RCFGBuilder took 884.02 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 683.7 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -701.7 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. [2018-11-14 18:30:37,748 INFO L168 Benchmark]: TraceAbstraction took 24666.74 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 474.0 MB). Peak memory consumption was 474.0 MB. Max. memory is 7.1 GB. [2018-11-14 18:30:37,752 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 386.31 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 66.01 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 884.02 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 683.7 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -701.7 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 24666.74 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 474.0 MB). Peak memory consumption was 474.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 68]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 37]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 105]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant [2018-11-14 18:30:37,761 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 18:30:37,761 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 18:30:37,762 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 18:30:37,762 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((unknown-#memory_int-unknown[main__array][~bvadd64(main__array, ~bvmul32(4bv32, main__index2), 4bv32)] == unknown-#memory_int-unknown[main__array][~bvadd64(main__array, ~bvmul32(4bv32, main__index1), 4294967292bv32)] && ~bvult32(~bvadd64(main__index2, 1bv32), 100000bv32)) && !~bvult32(main__index1, main__index2)) && ~bvult32(~bvadd64(main__index1, 4294967295bv32), ~bvadd64(main__index2, 1bv32))) || main__loop_entered == 0bv32 - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 94]: Loop Invariant [2018-11-14 18:30:37,763 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 18:30:37,763 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 18:30:37,764 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 18:30:37,764 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((~bvult32(main__index1, main__index2) && ~bvadd64(__VERIFIER_assert__cond, 4294967295bv32) == 0bv32) && ~bvult32(main__index2, 100000bv32)) || (((unknown-#memory_int-unknown[main__array][~bvadd64(main__array, ~bvmul32(4bv32, main__index2), 4bv32)] == unknown-#memory_int-unknown[main__array][~bvadd64(main__array, ~bvmul32(4bv32, main__index1), 4294967292bv32)] && ~bvult32(~bvadd64(main__index2, 1bv32), 100000bv32)) && !~bvult32(main__index1, main__index2)) && ~bvult32(~bvadd64(main__index1, 4294967295bv32), ~bvadd64(main__index2, 1bv32))) - InvariantResult [Line: 57]: Loop Invariant [2018-11-14 18:30:37,765 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 18:30:37,765 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 18:30:37,765 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 18:30:37,766 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((unknown-#memory_int-unknown[main__array][~bvadd64(main__array, ~bvmul32(4bv32, main__index2), 4bv32)] == unknown-#memory_int-unknown[main__array][~bvadd64(main__array, ~bvmul32(4bv32, main__index1), 4294967292bv32)] && ~bvult32(main__index1, main__index2)) && ~bvult32(~bvadd64(main__index2, 1bv32), 100000bv32)) && ~bvult32(~bvadd64(main__index1, 4294967295bv32), ~bvadd64(main__index2, 1bv32))) && 1bv32 == main____CPAchecker_TMP_0 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: ((~bvult32(main__index1, main__index2) && 1bv32 == main____CPAchecker_TMP_0) && main__loop_entered == 0bv32) && ~bvult32(main__index2, 100000bv32) - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 41]: Loop Invariant [2018-11-14 18:30:37,767 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 18:30:37,767 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 18:30:37,768 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 18:30:37,768 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 18:30:37,769 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 18:30:37,769 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 18:30:37,769 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 18:30:37,769 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((((unknown-#memory_int-unknown[main__array][~bvadd64(main__array, ~bvmul32(4bv32, main__index2), 4bv32)] == unknown-#memory_int-unknown[main__array][~bvadd64(main__array, ~bvmul32(4bv32, main__index1), 4294967292bv32)] && ~bvult32(main__index1, main__index2)) && ~bvult32(~bvadd64(main__index2, 1bv32), 100000bv32)) && ~bvult32(~bvadd64(main__index1, 4294967295bv32), ~bvadd64(main__index2, 1bv32))) || ((~bvult32(main__index1, main__index2) && 1bv32 == main____CPAchecker_TMP_0) && ~bvult32(main__index2, 100000bv32))) && 1bv32 == main____CPAchecker_TMP_0) && ~bvadd64(__VERIFIER_assert__cond, 4294967295bv32) == 0bv32) || (1bv32 == main____CPAchecker_TMP_0 && ((((unknown-#memory_int-unknown[main__array][~bvadd64(main__array, ~bvmul32(4bv32, main__index2), 4bv32)] == unknown-#memory_int-unknown[main__array][~bvadd64(main__array, ~bvmul32(4bv32, main__index1), 4294967292bv32)] && ~bvult32(main__index1, main__index2)) && ~bvult32(~bvadd64(main__index2, 1bv32), 100000bv32)) && ~bvult32(~bvadd64(main__index1, 4294967295bv32), ~bvadd64(main__index2, 1bv32))) || ((~bvult32(main__index1, main__index2) && 1bv32 == main____CPAchecker_TMP_0) && ~bvult32(main__index2, 100000bv32)))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 36 locations, 3 error locations. SAFE Result, 24.5s OverallTime, 6 OverallIterations, 1 TraceHistogramMax, 10.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 172 SDtfs, 104 SDslu, 214 SDs, 0 SdLazy, 137 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 33 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 12 PreInvPairs, 23 NumberOfFragments, 263 HoareAnnotationTreeSize, 12 FomulaSimplifications, 46 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 3 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 8.2s InterpolantComputationTime, 97 NumberOfCodeBlocks, 97 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 91 ConstructedInterpolants, 0 QuantifiedInterpolants, 5355 SizeOfPredicates, 19 NumberOfNonLiveVariables, 319 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...