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.epf -i ../../../trunk/examples/svcomp/loop-lit/gsv2008_true-unreach-call.c.i.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 16:45:10,515 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 16:45:10,517 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 16:45:10,532 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 16:45:10,533 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 16:45:10,534 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 16:45:10,535 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 16:45:10,537 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 16:45:10,538 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 16:45:10,539 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 16:45:10,540 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 16:45:10,540 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 16:45:10,541 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 16:45:10,542 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 16:45:10,543 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 16:45:10,544 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 16:45:10,545 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 16:45:10,548 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 16:45:10,550 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 16:45:10,552 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 16:45:10,556 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 16:45:10,557 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 16:45:10,564 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 16:45:10,565 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 16:45:10,565 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 16:45:10,565 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 16:45:10,569 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 16:45:10,569 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 16:45:10,570 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 16:45:10,574 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 16:45:10,574 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 16:45:10,575 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 16:45:10,575 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 16:45:10,575 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 16:45:10,577 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 16:45:10,577 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 16:45:10,578 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-14 16:45:10,600 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 16:45:10,600 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 16:45:10,601 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 16:45:10,601 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 16:45:10,602 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 16:45:10,602 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 16:45:10,602 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 16:45:10,603 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 16:45:10,603 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 16:45:10,603 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 16:45:10,603 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 16:45:10,603 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 16:45:10,603 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 16:45:10,604 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 16:45:10,604 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 16:45:10,604 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 16:45:10,604 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 16:45:10,604 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 16:45:10,605 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 16:45:10,605 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 16:45:10,605 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 16:45:10,605 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 16:45:10,605 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 16:45:10,606 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:45:10,606 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 16:45:10,606 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 16:45:10,606 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 16:45:10,607 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 16:45:10,607 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 16:45:10,607 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 16:45:10,607 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 16:45:10,607 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 16:45:10,655 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 16:45:10,679 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 16:45:10,684 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 16:45:10,686 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 16:45:10,686 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 16:45:10,687 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gsv2008_true-unreach-call.c.i.v+lhb-reducer.c [2018-11-14 16:45:10,749 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cda5272f5/518db8abe54843e48f1a7254e68f6334/FLAG4917cec48 [2018-11-14 16:45:11,168 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 16:45:11,168 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gsv2008_true-unreach-call.c.i.v+lhb-reducer.c [2018-11-14 16:45:11,175 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cda5272f5/518db8abe54843e48f1a7254e68f6334/FLAG4917cec48 [2018-11-14 16:45:11,189 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cda5272f5/518db8abe54843e48f1a7254e68f6334 [2018-11-14 16:45:11,199 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 16:45:11,200 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 16:45:11,202 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 16:45:11,202 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 16:45:11,207 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 16:45:11,208 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:45:11" (1/1) ... [2018-11-14 16:45:11,212 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ea13490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:45:11, skipping insertion in model container [2018-11-14 16:45:11,212 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:45:11" (1/1) ... [2018-11-14 16:45:11,223 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 16:45:11,253 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 16:45:11,515 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:45:11,522 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 16:45:11,545 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:45:11,561 INFO L195 MainTranslator]: Completed translation [2018-11-14 16:45:11,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:45:11 WrapperNode [2018-11-14 16:45:11,562 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 16:45:11,562 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 16:45:11,562 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 16:45:11,563 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 16:45:11,573 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:45:11" (1/1) ... [2018-11-14 16:45:11,574 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:45:11" (1/1) ... [2018-11-14 16:45:11,580 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:45:11" (1/1) ... [2018-11-14 16:45:11,580 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:45:11" (1/1) ... [2018-11-14 16:45:11,588 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:45:11" (1/1) ... [2018-11-14 16:45:11,592 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:45:11" (1/1) ... [2018-11-14 16:45:11,593 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:45:11" (1/1) ... [2018-11-14 16:45:11,600 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 16:45:11,601 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 16:45:11,601 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 16:45:11,601 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 16:45:11,602 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:45:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:45:11,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 16:45:11,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 16:45:11,727 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 16:45:11,727 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 16:45:11,728 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-14 16:45:11,728 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 16:45:11,728 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 16:45:11,728 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 16:45:11,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 16:45:11,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 16:45:12,164 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 16:45:12,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:45:12 BoogieIcfgContainer [2018-11-14 16:45:12,165 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 16:45:12,166 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 16:45:12,166 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 16:45:12,170 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 16:45:12,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:45:11" (1/3) ... [2018-11-14 16:45:12,171 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17136551 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:45:12, skipping insertion in model container [2018-11-14 16:45:12,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:45:11" (2/3) ... [2018-11-14 16:45:12,172 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17136551 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:45:12, skipping insertion in model container [2018-11-14 16:45:12,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:45:12" (3/3) ... [2018-11-14 16:45:12,174 INFO L112 eAbstractionObserver]: Analyzing ICFG gsv2008_true-unreach-call.c.i.v+lhb-reducer.c [2018-11-14 16:45:12,184 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 16:45:12,192 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 16:45:12,207 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 16:45:12,239 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 16:45:12,239 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 16:45:12,240 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 16:45:12,240 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 16:45:12,240 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 16:45:12,240 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 16:45:12,240 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 16:45:12,240 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 16:45:12,240 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 16:45:12,262 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-11-14 16:45:12,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-14 16:45:12,270 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:45:12,271 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:45:12,273 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:45:12,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:45:12,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1883805102, now seen corresponding path program 1 times [2018-11-14 16:45:12,285 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:45:12,286 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 16:45:12,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:45:12,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:45:12,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:45:12,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:45:13,040 INFO L256 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {21#true} is VALID [2018-11-14 16:45:13,044 INFO L273 TraceCheckUtils]: 1: Hoare triple {21#true} ~__return_main~0 := 0bv32;~__tmp_55_0~0 := 0bv32;~__return_65~0 := 0bv32; {21#true} is VALID [2018-11-14 16:45:13,044 INFO L273 TraceCheckUtils]: 2: Hoare triple {21#true} assume true; {21#true} is VALID [2018-11-14 16:45:13,044 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} #33#return; {21#true} is VALID [2018-11-14 16:45:13,045 INFO L256 TraceCheckUtils]: 4: Hoare triple {21#true} call #t~ret2 := main(); {21#true} is VALID [2018-11-14 16:45:13,046 INFO L273 TraceCheckUtils]: 5: Hoare triple {21#true} havoc ~main__x~0;havoc ~main__y~0;~main__x~0 := 4294967246bv32;~main__y~0 := #t~nondet1;havoc #t~nondet1; {41#(= (bvadd main_~main__x~0 (_ bv50 32)) (_ bv0 32))} is VALID [2018-11-14 16:45:13,047 INFO L273 TraceCheckUtils]: 6: Hoare triple {41#(= (bvadd main_~main__x~0 (_ bv50 32)) (_ bv0 32))} assume !!~bvslt32(4294966296bv32, ~main__y~0); {45#(and (= (bvadd main_~main__x~0 (_ bv50 32)) (_ bv0 32)) (bvslt (_ bv4294966296 32) main_~main__y~0))} is VALID [2018-11-14 16:45:13,048 INFO L273 TraceCheckUtils]: 7: Hoare triple {45#(and (= (bvadd main_~main__x~0 (_ bv50 32)) (_ bv0 32)) (bvslt (_ bv4294966296 32) main_~main__y~0))} assume !!~bvslt32(~main__y~0, 1000000bv32); {49#(and (= (bvadd main_~main__x~0 (_ bv50 32)) (_ bv0 32)) (bvslt (_ bv4294966296 32) main_~main__y~0) (bvslt main_~main__y~0 (_ bv1000000 32)))} is VALID [2018-11-14 16:45:13,094 INFO L273 TraceCheckUtils]: 8: Hoare triple {49#(and (= (bvadd main_~main__x~0 (_ bv50 32)) (_ bv0 32)) (bvslt (_ bv4294966296 32) main_~main__y~0) (bvslt main_~main__y~0 (_ bv1000000 32)))} assume ~bvslt32(~main__x~0, 0bv32);~main__x~0 := ~bvadd32(~main__x~0, ~main__y~0);~main____CPAchecker_TMP_0~0 := ~main__y~0;~main__y~0 := ~bvadd32(1bv32, ~main__y~0);~__tmp_55_0~0 := ~main____CPAchecker_TMP_0~0; {53#(and (bvslt (_ bv4294966296 32) (bvadd main_~main__y~0 (_ bv4294967295 32))) (bvslt (bvadd main_~main__y~0 (_ bv4294967295 32)) (_ bv1000000 32)) (= (bvadd main_~main__y~0 (_ bv4294967245 32)) main_~main__x~0))} is VALID [2018-11-14 16:45:13,095 INFO L273 TraceCheckUtils]: 9: Hoare triple {53#(and (bvslt (_ bv4294966296 32) (bvadd main_~main__y~0 (_ bv4294967295 32))) (bvslt (bvadd main_~main__y~0 (_ bv4294967295 32)) (_ bv1000000 32)) (= (bvadd main_~main__y~0 (_ bv4294967245 32)) main_~main__x~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_55_0~0; {53#(and (bvslt (_ bv4294966296 32) (bvadd main_~main__y~0 (_ bv4294967295 32))) (bvslt (bvadd main_~main__y~0 (_ bv4294967295 32)) (_ bv1000000 32)) (= (bvadd main_~main__y~0 (_ bv4294967245 32)) main_~main__x~0))} is VALID [2018-11-14 16:45:13,099 INFO L273 TraceCheckUtils]: 10: Hoare triple {53#(and (bvslt (_ bv4294966296 32) (bvadd main_~main__y~0 (_ bv4294967295 32))) (bvslt (bvadd main_~main__y~0 (_ bv4294967295 32)) (_ bv1000000 32)) (= (bvadd main_~main__y~0 (_ bv4294967245 32)) main_~main__x~0))} assume !~bvslt32(~main__x~0, 0bv32);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsgt32(~main__y~0, 0bv32) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {60#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:45:13,100 INFO L273 TraceCheckUtils]: 11: Hoare triple {60#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~0 == 0bv32; {22#false} is VALID [2018-11-14 16:45:13,101 INFO L273 TraceCheckUtils]: 12: Hoare triple {22#false} assume !false; {22#false} is VALID [2018-11-14 16:45:13,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:45:13,106 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:45:13,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:45:13,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-14 16:45:13,114 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-11-14 16:45:13,117 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:45:13,121 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 16:45:13,234 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 16:45:13,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 16:45:13,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 16:45:13,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:45:13,248 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 7 states. [2018-11-14 16:45:14,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:45:14,214 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2018-11-14 16:45:14,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 16:45:14,214 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-11-14 16:45:14,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:45:14,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:45:14,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2018-11-14 16:45:14,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:45:14,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2018-11-14 16:45:14,235 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 38 transitions. [2018-11-14 16:45:14,578 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:45:14,591 INFO L225 Difference]: With dead ends: 33 [2018-11-14 16:45:14,591 INFO L226 Difference]: Without dead ends: 16 [2018-11-14 16:45:14,595 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-14 16:45:14,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-14 16:45:14,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-14 16:45:14,681 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:45:14,681 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2018-11-14 16:45:14,682 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-14 16:45:14,682 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-14 16:45:14,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:45:14,685 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-14 16:45:14,685 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-14 16:45:14,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:45:14,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:45:14,686 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-14 16:45:14,687 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-14 16:45:14,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:45:14,690 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-14 16:45:14,690 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-14 16:45:14,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:45:14,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:45:14,691 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:45:14,691 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:45:14,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 16:45:14,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-11-14 16:45:14,695 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2018-11-14 16:45:14,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:45:14,696 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-11-14 16:45:14,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 16:45:14,696 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-14 16:45:14,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 16:45:14,697 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:45:14,697 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:45:14,698 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:45:14,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:45:14,698 INFO L82 PathProgramCache]: Analyzing trace with hash -2141584271, now seen corresponding path program 1 times [2018-11-14 16:45:14,699 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:45:14,699 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 16:45:14,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:45:14,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:45:14,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:45:14,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:45:15,234 INFO L256 TraceCheckUtils]: 0: Hoare triple {161#true} call ULTIMATE.init(); {161#true} is VALID [2018-11-14 16:45:15,235 INFO L273 TraceCheckUtils]: 1: Hoare triple {161#true} ~__return_main~0 := 0bv32;~__tmp_55_0~0 := 0bv32;~__return_65~0 := 0bv32; {161#true} is VALID [2018-11-14 16:45:15,235 INFO L273 TraceCheckUtils]: 2: Hoare triple {161#true} assume true; {161#true} is VALID [2018-11-14 16:45:15,235 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {161#true} {161#true} #33#return; {161#true} is VALID [2018-11-14 16:45:15,236 INFO L256 TraceCheckUtils]: 4: Hoare triple {161#true} call #t~ret2 := main(); {161#true} is VALID [2018-11-14 16:45:15,243 INFO L273 TraceCheckUtils]: 5: Hoare triple {161#true} havoc ~main__x~0;havoc ~main__y~0;~main__x~0 := 4294967246bv32;~main__y~0 := #t~nondet1;havoc #t~nondet1; {181#(= (bvadd main_~main__x~0 (_ bv50 32)) (_ bv0 32))} is VALID [2018-11-14 16:45:15,244 INFO L273 TraceCheckUtils]: 6: Hoare triple {181#(= (bvadd main_~main__x~0 (_ bv50 32)) (_ bv0 32))} assume !!~bvslt32(4294966296bv32, ~main__y~0); {185#(and (= (bvadd main_~main__x~0 (_ bv50 32)) (_ bv0 32)) (bvslt (_ bv4294966296 32) main_~main__y~0))} is VALID [2018-11-14 16:45:15,245 INFO L273 TraceCheckUtils]: 7: Hoare triple {185#(and (= (bvadd main_~main__x~0 (_ bv50 32)) (_ bv0 32)) (bvslt (_ bv4294966296 32) main_~main__y~0))} assume !!~bvslt32(~main__y~0, 1000000bv32); {189#(and (= (bvadd main_~main__x~0 (_ bv50 32)) (_ bv0 32)) (bvslt (_ bv4294966296 32) main_~main__y~0) (bvslt main_~main__y~0 (_ bv1000000 32)))} is VALID [2018-11-14 16:45:15,302 INFO L273 TraceCheckUtils]: 8: Hoare triple {189#(and (= (bvadd main_~main__x~0 (_ bv50 32)) (_ bv0 32)) (bvslt (_ bv4294966296 32) main_~main__y~0) (bvslt main_~main__y~0 (_ bv1000000 32)))} assume ~bvslt32(~main__x~0, 0bv32);~main__x~0 := ~bvadd32(~main__x~0, ~main__y~0);~main____CPAchecker_TMP_0~0 := ~main__y~0;~main__y~0 := ~bvadd32(1bv32, ~main__y~0);~__tmp_55_0~0 := ~main____CPAchecker_TMP_0~0; {193#(and (bvslt (_ bv4294966296 32) (bvadd main_~main__y~0 (_ bv4294967295 32))) (bvslt (bvadd main_~main__y~0 (_ bv4294967295 32)) (_ bv1000000 32)) (= (bvadd main_~main__y~0 (_ bv4294967245 32)) main_~main__x~0))} is VALID [2018-11-14 16:45:15,303 INFO L273 TraceCheckUtils]: 9: Hoare triple {193#(and (bvslt (_ bv4294966296 32) (bvadd main_~main__y~0 (_ bv4294967295 32))) (bvslt (bvadd main_~main__y~0 (_ bv4294967295 32)) (_ bv1000000 32)) (= (bvadd main_~main__y~0 (_ bv4294967245 32)) main_~main__x~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_55_0~0; {193#(and (bvslt (_ bv4294966296 32) (bvadd main_~main__y~0 (_ bv4294967295 32))) (bvslt (bvadd main_~main__y~0 (_ bv4294967295 32)) (_ bv1000000 32)) (= (bvadd main_~main__y~0 (_ bv4294967245 32)) main_~main__x~0))} is VALID [2018-11-14 16:45:15,374 INFO L273 TraceCheckUtils]: 10: Hoare triple {193#(and (bvslt (_ bv4294966296 32) (bvadd main_~main__y~0 (_ bv4294967295 32))) (bvslt (bvadd main_~main__y~0 (_ bv4294967295 32)) (_ bv1000000 32)) (= (bvadd main_~main__y~0 (_ bv4294967245 32)) main_~main__x~0))} assume ~bvslt32(~main__x~0, 0bv32);~main__x~0 := ~bvadd32(~main__x~0, ~main__y~0);~main____CPAchecker_TMP_0~1 := ~main__y~0;~main__y~0 := ~bvadd32(1bv32, ~main__y~0);~__tmp_55_0~0 := ~main____CPAchecker_TMP_0~1; {200#(and (bvslt (_ bv4294966296 32) (bvadd main_~main__y~0 (_ bv4294967294 32))) (= (bvadd (bvmul (_ bv2 32) main_~main__y~0) (_ bv4294967243 32)) main_~main__x~0) (bvslt (bvadd main_~main__y~0 (_ bv4294967244 32)) (_ bv0 32)))} is VALID [2018-11-14 16:45:15,377 INFO L273 TraceCheckUtils]: 11: Hoare triple {200#(and (bvslt (_ bv4294966296 32) (bvadd main_~main__y~0 (_ bv4294967294 32))) (= (bvadd (bvmul (_ bv2 32) main_~main__y~0) (_ bv4294967243 32)) main_~main__x~0) (bvslt (bvadd main_~main__y~0 (_ bv4294967244 32)) (_ bv0 32)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_55_0~0; {200#(and (bvslt (_ bv4294966296 32) (bvadd main_~main__y~0 (_ bv4294967294 32))) (= (bvadd (bvmul (_ bv2 32) main_~main__y~0) (_ bv4294967243 32)) main_~main__x~0) (bvslt (bvadd main_~main__y~0 (_ bv4294967244 32)) (_ bv0 32)))} is VALID [2018-11-14 16:45:15,382 INFO L273 TraceCheckUtils]: 12: Hoare triple {200#(and (bvslt (_ bv4294966296 32) (bvadd main_~main__y~0 (_ bv4294967294 32))) (= (bvadd (bvmul (_ bv2 32) main_~main__y~0) (_ bv4294967243 32)) main_~main__x~0) (bvslt (bvadd main_~main__y~0 (_ bv4294967244 32)) (_ bv0 32)))} assume !~bvslt32(~main__x~0, 0bv32);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsgt32(~main__y~0, 0bv32) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {207#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:45:15,384 INFO L273 TraceCheckUtils]: 13: Hoare triple {207#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~0 == 0bv32; {162#false} is VALID [2018-11-14 16:45:15,384 INFO L273 TraceCheckUtils]: 14: Hoare triple {162#false} assume !false; {162#false} is VALID [2018-11-14 16:45:15,386 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:45:15,386 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:45:16,333 INFO L273 TraceCheckUtils]: 14: Hoare triple {162#false} assume !false; {162#false} is VALID [2018-11-14 16:45:16,335 INFO L273 TraceCheckUtils]: 13: Hoare triple {217#(not (= main_~__VERIFIER_assert__cond~0 (_ bv0 32)))} assume ~__VERIFIER_assert__cond~0 == 0bv32; {162#false} is VALID [2018-11-14 16:45:16,336 INFO L273 TraceCheckUtils]: 12: Hoare triple {221#(or (bvsgt main_~main__y~0 (_ bv0 32)) (bvslt main_~main__x~0 (_ bv0 32)))} assume !~bvslt32(~main__x~0, 0bv32);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsgt32(~main__y~0, 0bv32) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {217#(not (= main_~__VERIFIER_assert__cond~0 (_ bv0 32)))} is VALID [2018-11-14 16:45:16,337 INFO L273 TraceCheckUtils]: 11: Hoare triple {221#(or (bvsgt main_~main__y~0 (_ bv0 32)) (bvslt main_~main__x~0 (_ bv0 32)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_55_0~0; {221#(or (bvsgt main_~main__y~0 (_ bv0 32)) (bvslt main_~main__x~0 (_ bv0 32)))} is VALID [2018-11-14 16:45:16,339 INFO L273 TraceCheckUtils]: 10: Hoare triple {228#(or (not (bvslt main_~main__x~0 (_ bv0 32))) (bvslt (bvadd main_~main__y~0 main_~main__x~0) (_ bv0 32)) (bvsgt (bvadd main_~main__y~0 (_ bv1 32)) (_ bv0 32)))} assume ~bvslt32(~main__x~0, 0bv32);~main__x~0 := ~bvadd32(~main__x~0, ~main__y~0);~main____CPAchecker_TMP_0~1 := ~main__y~0;~main__y~0 := ~bvadd32(1bv32, ~main__y~0);~__tmp_55_0~0 := ~main____CPAchecker_TMP_0~1; {221#(or (bvsgt main_~main__y~0 (_ bv0 32)) (bvslt main_~main__x~0 (_ bv0 32)))} is VALID [2018-11-14 16:45:16,340 INFO L273 TraceCheckUtils]: 9: Hoare triple {228#(or (not (bvslt main_~main__x~0 (_ bv0 32))) (bvslt (bvadd main_~main__y~0 main_~main__x~0) (_ bv0 32)) (bvsgt (bvadd main_~main__y~0 (_ bv1 32)) (_ bv0 32)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_55_0~0; {228#(or (not (bvslt main_~main__x~0 (_ bv0 32))) (bvslt (bvadd main_~main__y~0 main_~main__x~0) (_ bv0 32)) (bvsgt (bvadd main_~main__y~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-14 16:45:16,513 INFO L273 TraceCheckUtils]: 8: Hoare triple {235#(or (bvsgt (bvadd main_~main__y~0 (_ bv2 32)) (_ bv0 32)) (not (bvslt (bvadd main_~main__y~0 main_~main__x~0) (_ bv0 32))) (bvslt (bvadd (bvmul (_ bv2 32) main_~main__y~0) main_~main__x~0 (_ bv1 32)) (_ bv0 32)))} assume ~bvslt32(~main__x~0, 0bv32);~main__x~0 := ~bvadd32(~main__x~0, ~main__y~0);~main____CPAchecker_TMP_0~0 := ~main__y~0;~main__y~0 := ~bvadd32(1bv32, ~main__y~0);~__tmp_55_0~0 := ~main____CPAchecker_TMP_0~0; {228#(or (not (bvslt main_~main__x~0 (_ bv0 32))) (bvslt (bvadd main_~main__y~0 main_~main__x~0) (_ bv0 32)) (bvsgt (bvadd main_~main__y~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-14 16:45:16,514 INFO L273 TraceCheckUtils]: 7: Hoare triple {239#(or (bvsgt (bvadd main_~main__y~0 (_ bv2 32)) (_ bv0 32)) (not (bvslt (bvadd main_~main__y~0 main_~main__x~0) (_ bv0 32))) (bvslt (bvadd (bvmul (_ bv2 32) main_~main__y~0) main_~main__x~0 (_ bv1 32)) (_ bv0 32)) (not (bvslt main_~main__y~0 (_ bv1000000 32))))} assume !!~bvslt32(~main__y~0, 1000000bv32); {235#(or (bvsgt (bvadd main_~main__y~0 (_ bv2 32)) (_ bv0 32)) (not (bvslt (bvadd main_~main__y~0 main_~main__x~0) (_ bv0 32))) (bvslt (bvadd (bvmul (_ bv2 32) main_~main__y~0) main_~main__x~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-14 16:45:16,517 INFO L273 TraceCheckUtils]: 6: Hoare triple {243#(forall ((main_~main__y~0 (_ BitVec 32))) (or (bvsgt (bvadd main_~main__y~0 (_ bv2 32)) (_ bv0 32)) (not (bvslt (_ bv4294966296 32) main_~main__y~0)) (not (bvslt (bvadd main_~main__y~0 main_~main__x~0) (_ bv0 32))) (bvslt (bvadd (bvmul (_ bv2 32) main_~main__y~0) main_~main__x~0 (_ bv1 32)) (_ bv0 32)) (not (bvslt main_~main__y~0 (_ bv1000000 32)))))} assume !!~bvslt32(4294966296bv32, ~main__y~0); {239#(or (bvsgt (bvadd main_~main__y~0 (_ bv2 32)) (_ bv0 32)) (not (bvslt (bvadd main_~main__y~0 main_~main__x~0) (_ bv0 32))) (bvslt (bvadd (bvmul (_ bv2 32) main_~main__y~0) main_~main__x~0 (_ bv1 32)) (_ bv0 32)) (not (bvslt main_~main__y~0 (_ bv1000000 32))))} is VALID [2018-11-14 16:45:16,536 INFO L273 TraceCheckUtils]: 5: Hoare triple {161#true} havoc ~main__x~0;havoc ~main__y~0;~main__x~0 := 4294967246bv32;~main__y~0 := #t~nondet1;havoc #t~nondet1; {243#(forall ((main_~main__y~0 (_ BitVec 32))) (or (bvsgt (bvadd main_~main__y~0 (_ bv2 32)) (_ bv0 32)) (not (bvslt (_ bv4294966296 32) main_~main__y~0)) (not (bvslt (bvadd main_~main__y~0 main_~main__x~0) (_ bv0 32))) (bvslt (bvadd (bvmul (_ bv2 32) main_~main__y~0) main_~main__x~0 (_ bv1 32)) (_ bv0 32)) (not (bvslt main_~main__y~0 (_ bv1000000 32)))))} is VALID [2018-11-14 16:45:16,537 INFO L256 TraceCheckUtils]: 4: Hoare triple {161#true} call #t~ret2 := main(); {161#true} is VALID [2018-11-14 16:45:16,537 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {161#true} {161#true} #33#return; {161#true} is VALID [2018-11-14 16:45:16,538 INFO L273 TraceCheckUtils]: 2: Hoare triple {161#true} assume true; {161#true} is VALID [2018-11-14 16:45:16,538 INFO L273 TraceCheckUtils]: 1: Hoare triple {161#true} ~__return_main~0 := 0bv32;~__tmp_55_0~0 := 0bv32;~__return_65~0 := 0bv32; {161#true} is VALID [2018-11-14 16:45:16,538 INFO L256 TraceCheckUtils]: 0: Hoare triple {161#true} call ULTIMATE.init(); {161#true} is VALID [2018-11-14 16:45:16,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:45:16,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:45:16,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-14 16:45:16,548 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 15 [2018-11-14 16:45:16,548 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:45:16,548 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-14 16:45:16,907 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:45:16,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-14 16:45:16,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-14 16:45:16,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-11-14 16:45:16,909 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 14 states. [2018-11-14 16:45:17,980 WARN L179 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 30 [2018-11-14 16:45:19,050 WARN L179 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 34 [2018-11-14 16:45:19,458 WARN L179 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 34 [2018-11-14 16:45:19,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:45:19,746 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-14 16:45:19,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-14 16:45:19,746 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 15 [2018-11-14 16:45:19,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:45:19,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 16:45:19,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 32 transitions. [2018-11-14 16:45:19,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 16:45:19,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 32 transitions. [2018-11-14 16:45:19,752 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 32 transitions. [2018-11-14 16:45:20,139 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:45:20,141 INFO L225 Difference]: With dead ends: 29 [2018-11-14 16:45:20,142 INFO L226 Difference]: Without dead ends: 24 [2018-11-14 16:45:20,143 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2018-11-14 16:45:20,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-14 16:45:20,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-14 16:45:20,156 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:45:20,156 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-14 16:45:20,156 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-14 16:45:20,157 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-14 16:45:20,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:45:20,159 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-14 16:45:20,159 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-14 16:45:20,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:45:20,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:45:20,160 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-14 16:45:20,160 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-14 16:45:20,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:45:20,162 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-14 16:45:20,162 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-14 16:45:20,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:45:20,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:45:20,163 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:45:20,163 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:45:20,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 16:45:20,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-11-14 16:45:20,166 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 15 [2018-11-14 16:45:20,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:45:20,166 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-11-14 16:45:20,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-14 16:45:20,166 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-14 16:45:20,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 16:45:20,167 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:45:20,167 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:45:20,168 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:45:20,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:45:20,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1992609795, now seen corresponding path program 2 times [2018-11-14 16:45:20,169 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:45:20,169 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 16:45:20,189 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 16:45:20,261 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:45:20,261 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:45:20,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:45:20,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:45:21,333 INFO L256 TraceCheckUtils]: 0: Hoare triple {397#true} call ULTIMATE.init(); {397#true} is VALID [2018-11-14 16:45:21,333 INFO L273 TraceCheckUtils]: 1: Hoare triple {397#true} ~__return_main~0 := 0bv32;~__tmp_55_0~0 := 0bv32;~__return_65~0 := 0bv32; {397#true} is VALID [2018-11-14 16:45:21,333 INFO L273 TraceCheckUtils]: 2: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 16:45:21,334 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {397#true} {397#true} #33#return; {397#true} is VALID [2018-11-14 16:45:21,334 INFO L256 TraceCheckUtils]: 4: Hoare triple {397#true} call #t~ret2 := main(); {397#true} is VALID [2018-11-14 16:45:21,341 INFO L273 TraceCheckUtils]: 5: Hoare triple {397#true} havoc ~main__x~0;havoc ~main__y~0;~main__x~0 := 4294967246bv32;~main__y~0 := #t~nondet1;havoc #t~nondet1; {417#(= (bvadd main_~main__x~0 (_ bv50 32)) (_ bv0 32))} is VALID [2018-11-14 16:45:21,342 INFO L273 TraceCheckUtils]: 6: Hoare triple {417#(= (bvadd main_~main__x~0 (_ bv50 32)) (_ bv0 32))} assume !!~bvslt32(4294966296bv32, ~main__y~0); {421#(and (= (bvadd main_~main__x~0 (_ bv50 32)) (_ bv0 32)) (bvslt (_ bv4294966296 32) main_~main__y~0))} is VALID [2018-11-14 16:45:21,343 INFO L273 TraceCheckUtils]: 7: Hoare triple {421#(and (= (bvadd main_~main__x~0 (_ bv50 32)) (_ bv0 32)) (bvslt (_ bv4294966296 32) main_~main__y~0))} assume !!~bvslt32(~main__y~0, 1000000bv32); {425#(and (= (bvadd main_~main__x~0 (_ bv50 32)) (_ bv0 32)) (bvslt (_ bv4294966296 32) main_~main__y~0) (bvslt main_~main__y~0 (_ bv1000000 32)))} is VALID [2018-11-14 16:45:21,389 INFO L273 TraceCheckUtils]: 8: Hoare triple {425#(and (= (bvadd main_~main__x~0 (_ bv50 32)) (_ bv0 32)) (bvslt (_ bv4294966296 32) main_~main__y~0) (bvslt main_~main__y~0 (_ bv1000000 32)))} assume ~bvslt32(~main__x~0, 0bv32);~main__x~0 := ~bvadd32(~main__x~0, ~main__y~0);~main____CPAchecker_TMP_0~0 := ~main__y~0;~main__y~0 := ~bvadd32(1bv32, ~main__y~0);~__tmp_55_0~0 := ~main____CPAchecker_TMP_0~0; {429#(and (bvslt (_ bv4294966296 32) (bvadd main_~main__y~0 (_ bv4294967295 32))) (bvslt (bvadd main_~main__y~0 (_ bv4294967295 32)) (_ bv1000000 32)) (= (bvadd main_~main__y~0 (_ bv4294967245 32)) main_~main__x~0))} is VALID [2018-11-14 16:45:21,390 INFO L273 TraceCheckUtils]: 9: Hoare triple {429#(and (bvslt (_ bv4294966296 32) (bvadd main_~main__y~0 (_ bv4294967295 32))) (bvslt (bvadd main_~main__y~0 (_ bv4294967295 32)) (_ bv1000000 32)) (= (bvadd main_~main__y~0 (_ bv4294967245 32)) main_~main__x~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_55_0~0; {429#(and (bvslt (_ bv4294966296 32) (bvadd main_~main__y~0 (_ bv4294967295 32))) (bvslt (bvadd main_~main__y~0 (_ bv4294967295 32)) (_ bv1000000 32)) (= (bvadd main_~main__y~0 (_ bv4294967245 32)) main_~main__x~0))} is VALID [2018-11-14 16:45:21,456 INFO L273 TraceCheckUtils]: 10: Hoare triple {429#(and (bvslt (_ bv4294966296 32) (bvadd main_~main__y~0 (_ bv4294967295 32))) (bvslt (bvadd main_~main__y~0 (_ bv4294967295 32)) (_ bv1000000 32)) (= (bvadd main_~main__y~0 (_ bv4294967245 32)) main_~main__x~0))} assume ~bvslt32(~main__x~0, 0bv32);~main__x~0 := ~bvadd32(~main__x~0, ~main__y~0);~main____CPAchecker_TMP_0~1 := ~main__y~0;~main__y~0 := ~bvadd32(1bv32, ~main__y~0);~__tmp_55_0~0 := ~main____CPAchecker_TMP_0~1; {436#(and (bvslt (bvadd main_~main__y~0 (_ bv4294967294 32)) (_ bv1000000 32)) (bvslt (_ bv4294966296 32) (bvadd main_~main__y~0 (_ bv4294967294 32))) (= (bvadd (bvmul (_ bv2 32) main_~main__y~0) (_ bv4294967243 32)) main_~main__x~0))} is VALID [2018-11-14 16:45:21,457 INFO L273 TraceCheckUtils]: 11: Hoare triple {436#(and (bvslt (bvadd main_~main__y~0 (_ bv4294967294 32)) (_ bv1000000 32)) (bvslt (_ bv4294966296 32) (bvadd main_~main__y~0 (_ bv4294967294 32))) (= (bvadd (bvmul (_ bv2 32) main_~main__y~0) (_ bv4294967243 32)) main_~main__x~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_55_0~0; {436#(and (bvslt (bvadd main_~main__y~0 (_ bv4294967294 32)) (_ bv1000000 32)) (bvslt (_ bv4294966296 32) (bvadd main_~main__y~0 (_ bv4294967294 32))) (= (bvadd (bvmul (_ bv2 32) main_~main__y~0) (_ bv4294967243 32)) main_~main__x~0))} is VALID [2018-11-14 16:45:21,570 INFO L273 TraceCheckUtils]: 12: Hoare triple {436#(and (bvslt (bvadd main_~main__y~0 (_ bv4294967294 32)) (_ bv1000000 32)) (bvslt (_ bv4294966296 32) (bvadd main_~main__y~0 (_ bv4294967294 32))) (= (bvadd (bvmul (_ bv2 32) main_~main__y~0) (_ bv4294967243 32)) main_~main__x~0))} assume ~bvslt32(~main__x~0, 0bv32);~main__x~0 := ~bvadd32(~main__x~0, ~main__y~0);~main____CPAchecker_TMP_0~1 := ~main__y~0;~main__y~0 := ~bvadd32(1bv32, ~main__y~0);~__tmp_55_0~0 := ~main____CPAchecker_TMP_0~1; {443#(and (bvslt (bvadd (bvmul (_ bv2 32) main_~main__y~0) (_ bv4294967241 32)) (_ bv0 32)) (= (bvadd (bvmul (_ bv3 32) main_~main__y~0) (_ bv4294967240 32)) main_~main__x~0) (bvslt (bvadd main_~main__y~0 (_ bv4294967293 32)) (_ bv1000000 32)) (bvslt (_ bv4294966296 32) (bvadd main_~main__y~0 (_ bv4294967293 32))))} is VALID [2018-11-14 16:45:21,572 INFO L273 TraceCheckUtils]: 13: Hoare triple {443#(and (bvslt (bvadd (bvmul (_ bv2 32) main_~main__y~0) (_ bv4294967241 32)) (_ bv0 32)) (= (bvadd (bvmul (_ bv3 32) main_~main__y~0) (_ bv4294967240 32)) main_~main__x~0) (bvslt (bvadd main_~main__y~0 (_ bv4294967293 32)) (_ bv1000000 32)) (bvslt (_ bv4294966296 32) (bvadd main_~main__y~0 (_ bv4294967293 32))))} ~main____CPAchecker_TMP_0~0 := ~__tmp_55_0~0; {443#(and (bvslt (bvadd (bvmul (_ bv2 32) main_~main__y~0) (_ bv4294967241 32)) (_ bv0 32)) (= (bvadd (bvmul (_ bv3 32) main_~main__y~0) (_ bv4294967240 32)) main_~main__x~0) (bvslt (bvadd main_~main__y~0 (_ bv4294967293 32)) (_ bv1000000 32)) (bvslt (_ bv4294966296 32) (bvadd main_~main__y~0 (_ bv4294967293 32))))} is VALID [2018-11-14 16:45:21,752 INFO L273 TraceCheckUtils]: 14: Hoare triple {443#(and (bvslt (bvadd (bvmul (_ bv2 32) main_~main__y~0) (_ bv4294967241 32)) (_ bv0 32)) (= (bvadd (bvmul (_ bv3 32) main_~main__y~0) (_ bv4294967240 32)) main_~main__x~0) (bvslt (bvadd main_~main__y~0 (_ bv4294967293 32)) (_ bv1000000 32)) (bvslt (_ bv4294966296 32) (bvadd main_~main__y~0 (_ bv4294967293 32))))} assume ~bvslt32(~main__x~0, 0bv32);~main__x~0 := ~bvadd32(~main__x~0, ~main__y~0);~main____CPAchecker_TMP_0~1 := ~main__y~0;~main__y~0 := ~bvadd32(1bv32, ~main__y~0);~__tmp_55_0~0 := ~main____CPAchecker_TMP_0~1; {450#(and (bvslt (_ bv4294966296 32) (bvadd main_~main__y~0 (_ bv4294967292 32))) (bvslt (bvadd (bvmul (_ bv3 32) main_~main__y~0) (_ bv4294967237 32)) (_ bv0 32)) (bvslt (bvadd main_~main__y~0 (_ bv4294967292 32)) (_ bv1000000 32)) (= (bvadd (bvmul (_ bv4 32) main_~main__y~0) (_ bv4294967236 32)) main_~main__x~0))} is VALID [2018-11-14 16:45:21,753 INFO L273 TraceCheckUtils]: 15: Hoare triple {450#(and (bvslt (_ bv4294966296 32) (bvadd main_~main__y~0 (_ bv4294967292 32))) (bvslt (bvadd (bvmul (_ bv3 32) main_~main__y~0) (_ bv4294967237 32)) (_ bv0 32)) (bvslt (bvadd main_~main__y~0 (_ bv4294967292 32)) (_ bv1000000 32)) (= (bvadd (bvmul (_ bv4 32) main_~main__y~0) (_ bv4294967236 32)) main_~main__x~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_55_0~0; {450#(and (bvslt (_ bv4294966296 32) (bvadd main_~main__y~0 (_ bv4294967292 32))) (bvslt (bvadd (bvmul (_ bv3 32) main_~main__y~0) (_ bv4294967237 32)) (_ bv0 32)) (bvslt (bvadd main_~main__y~0 (_ bv4294967292 32)) (_ bv1000000 32)) (= (bvadd (bvmul (_ bv4 32) main_~main__y~0) (_ bv4294967236 32)) main_~main__x~0))} is VALID [2018-11-14 16:45:21,945 INFO L273 TraceCheckUtils]: 16: Hoare triple {450#(and (bvslt (_ bv4294966296 32) (bvadd main_~main__y~0 (_ bv4294967292 32))) (bvslt (bvadd (bvmul (_ bv3 32) main_~main__y~0) (_ bv4294967237 32)) (_ bv0 32)) (bvslt (bvadd main_~main__y~0 (_ bv4294967292 32)) (_ bv1000000 32)) (= (bvadd (bvmul (_ bv4 32) main_~main__y~0) (_ bv4294967236 32)) main_~main__x~0))} assume ~bvslt32(~main__x~0, 0bv32);~main__x~0 := ~bvadd32(~main__x~0, ~main__y~0);~main____CPAchecker_TMP_0~1 := ~main__y~0;~main__y~0 := ~bvadd32(1bv32, ~main__y~0);~__tmp_55_0~0 := ~main____CPAchecker_TMP_0~1; {457#(and (bvslt (bvadd main_~main__y~0 (_ bv4294967291 32)) (_ bv1000000 32)) (= (bvadd (bvmul (_ bv5 32) main_~main__y~0) (_ bv4294967231 32)) main_~main__x~0) (bvslt (_ bv4294966296 32) (bvadd main_~main__y~0 (_ bv4294967291 32))) (bvslt (bvadd (bvmul (_ bv4 32) main_~main__y~0) (_ bv4294967232 32)) (_ bv0 32)))} is VALID [2018-11-14 16:45:21,946 INFO L273 TraceCheckUtils]: 17: Hoare triple {457#(and (bvslt (bvadd main_~main__y~0 (_ bv4294967291 32)) (_ bv1000000 32)) (= (bvadd (bvmul (_ bv5 32) main_~main__y~0) (_ bv4294967231 32)) main_~main__x~0) (bvslt (_ bv4294966296 32) (bvadd main_~main__y~0 (_ bv4294967291 32))) (bvslt (bvadd (bvmul (_ bv4 32) main_~main__y~0) (_ bv4294967232 32)) (_ bv0 32)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_55_0~0; {457#(and (bvslt (bvadd main_~main__y~0 (_ bv4294967291 32)) (_ bv1000000 32)) (= (bvadd (bvmul (_ bv5 32) main_~main__y~0) (_ bv4294967231 32)) main_~main__x~0) (bvslt (_ bv4294966296 32) (bvadd main_~main__y~0 (_ bv4294967291 32))) (bvslt (bvadd (bvmul (_ bv4 32) main_~main__y~0) (_ bv4294967232 32)) (_ bv0 32)))} is VALID [2018-11-14 16:45:22,147 INFO L273 TraceCheckUtils]: 18: Hoare triple {457#(and (bvslt (bvadd main_~main__y~0 (_ bv4294967291 32)) (_ bv1000000 32)) (= (bvadd (bvmul (_ bv5 32) main_~main__y~0) (_ bv4294967231 32)) main_~main__x~0) (bvslt (_ bv4294966296 32) (bvadd main_~main__y~0 (_ bv4294967291 32))) (bvslt (bvadd (bvmul (_ bv4 32) main_~main__y~0) (_ bv4294967232 32)) (_ bv0 32)))} assume ~bvslt32(~main__x~0, 0bv32);~main__x~0 := ~bvadd32(~main__x~0, ~main__y~0);~main____CPAchecker_TMP_0~1 := ~main__y~0;~main__y~0 := ~bvadd32(1bv32, ~main__y~0);~__tmp_55_0~0 := ~main____CPAchecker_TMP_0~1; {464#(and (= (bvadd (bvmul (_ bv6 32) main_~main__y~0) (_ bv4294967225 32)) main_~main__x~0) (bvslt (bvadd main_~main__y~0 (_ bv4294967290 32)) (_ bv1000000 32)) (bvslt (bvadd (bvmul (_ bv5 32) main_~main__y~0) (_ bv4294967226 32)) (_ bv0 32)) (bvslt (_ bv4294966296 32) (bvadd main_~main__y~0 (_ bv4294967290 32))))} is VALID [2018-11-14 16:45:22,150 INFO L273 TraceCheckUtils]: 19: Hoare triple {464#(and (= (bvadd (bvmul (_ bv6 32) main_~main__y~0) (_ bv4294967225 32)) main_~main__x~0) (bvslt (bvadd main_~main__y~0 (_ bv4294967290 32)) (_ bv1000000 32)) (bvslt (bvadd (bvmul (_ bv5 32) main_~main__y~0) (_ bv4294967226 32)) (_ bv0 32)) (bvslt (_ bv4294966296 32) (bvadd main_~main__y~0 (_ bv4294967290 32))))} ~main____CPAchecker_TMP_0~0 := ~__tmp_55_0~0; {464#(and (= (bvadd (bvmul (_ bv6 32) main_~main__y~0) (_ bv4294967225 32)) main_~main__x~0) (bvslt (bvadd main_~main__y~0 (_ bv4294967290 32)) (_ bv1000000 32)) (bvslt (bvadd (bvmul (_ bv5 32) main_~main__y~0) (_ bv4294967226 32)) (_ bv0 32)) (bvslt (_ bv4294966296 32) (bvadd main_~main__y~0 (_ bv4294967290 32))))} is VALID [2018-11-14 16:45:22,155 INFO L273 TraceCheckUtils]: 20: Hoare triple {464#(and (= (bvadd (bvmul (_ bv6 32) main_~main__y~0) (_ bv4294967225 32)) main_~main__x~0) (bvslt (bvadd main_~main__y~0 (_ bv4294967290 32)) (_ bv1000000 32)) (bvslt (bvadd (bvmul (_ bv5 32) main_~main__y~0) (_ bv4294967226 32)) (_ bv0 32)) (bvslt (_ bv4294966296 32) (bvadd main_~main__y~0 (_ bv4294967290 32))))} assume !~bvslt32(~main__x~0, 0bv32);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsgt32(~main__y~0, 0bv32) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {471#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:45:22,156 INFO L273 TraceCheckUtils]: 21: Hoare triple {471#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~0 == 0bv32; {398#false} is VALID [2018-11-14 16:45:22,156 INFO L273 TraceCheckUtils]: 22: Hoare triple {398#false} assume !false; {398#false} is VALID [2018-11-14 16:45:22,160 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:45:22,160 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:45:29,316 INFO L273 TraceCheckUtils]: 22: Hoare triple {398#false} assume !false; {398#false} is VALID [2018-11-14 16:45:29,317 INFO L273 TraceCheckUtils]: 21: Hoare triple {481#(not (= main_~__VERIFIER_assert__cond~0 (_ bv0 32)))} assume ~__VERIFIER_assert__cond~0 == 0bv32; {398#false} is VALID [2018-11-14 16:45:29,318 INFO L273 TraceCheckUtils]: 20: Hoare triple {485#(or (bvsgt main_~main__y~0 (_ bv0 32)) (bvslt main_~main__x~0 (_ bv0 32)))} assume !~bvslt32(~main__x~0, 0bv32);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsgt32(~main__y~0, 0bv32) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {481#(not (= main_~__VERIFIER_assert__cond~0 (_ bv0 32)))} is VALID [2018-11-14 16:45:29,319 INFO L273 TraceCheckUtils]: 19: Hoare triple {485#(or (bvsgt main_~main__y~0 (_ bv0 32)) (bvslt main_~main__x~0 (_ bv0 32)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_55_0~0; {485#(or (bvsgt main_~main__y~0 (_ bv0 32)) (bvslt main_~main__x~0 (_ bv0 32)))} is VALID [2018-11-14 16:45:29,322 INFO L273 TraceCheckUtils]: 18: Hoare triple {492#(or (not (bvslt main_~main__x~0 (_ bv0 32))) (bvslt (bvadd main_~main__y~0 main_~main__x~0) (_ bv0 32)) (bvsgt (bvadd main_~main__y~0 (_ bv1 32)) (_ bv0 32)))} assume ~bvslt32(~main__x~0, 0bv32);~main__x~0 := ~bvadd32(~main__x~0, ~main__y~0);~main____CPAchecker_TMP_0~1 := ~main__y~0;~main__y~0 := ~bvadd32(1bv32, ~main__y~0);~__tmp_55_0~0 := ~main____CPAchecker_TMP_0~1; {485#(or (bvsgt main_~main__y~0 (_ bv0 32)) (bvslt main_~main__x~0 (_ bv0 32)))} is VALID [2018-11-14 16:45:29,323 INFO L273 TraceCheckUtils]: 17: Hoare triple {492#(or (not (bvslt main_~main__x~0 (_ bv0 32))) (bvslt (bvadd main_~main__y~0 main_~main__x~0) (_ bv0 32)) (bvsgt (bvadd main_~main__y~0 (_ bv1 32)) (_ bv0 32)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_55_0~0; {492#(or (not (bvslt main_~main__x~0 (_ bv0 32))) (bvslt (bvadd main_~main__y~0 main_~main__x~0) (_ bv0 32)) (bvsgt (bvadd main_~main__y~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-14 16:45:29,464 INFO L273 TraceCheckUtils]: 16: Hoare triple {499#(or (not (bvslt main_~main__x~0 (_ bv0 32))) (bvsgt (bvadd main_~main__y~0 (_ bv2 32)) (_ bv0 32)) (not (bvslt (bvadd main_~main__y~0 main_~main__x~0) (_ bv0 32))) (bvslt (bvadd (bvmul (_ bv2 32) main_~main__y~0) main_~main__x~0 (_ bv1 32)) (_ bv0 32)))} assume ~bvslt32(~main__x~0, 0bv32);~main__x~0 := ~bvadd32(~main__x~0, ~main__y~0);~main____CPAchecker_TMP_0~1 := ~main__y~0;~main__y~0 := ~bvadd32(1bv32, ~main__y~0);~__tmp_55_0~0 := ~main____CPAchecker_TMP_0~1; {492#(or (not (bvslt main_~main__x~0 (_ bv0 32))) (bvslt (bvadd main_~main__y~0 main_~main__x~0) (_ bv0 32)) (bvsgt (bvadd main_~main__y~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-14 16:45:29,465 INFO L273 TraceCheckUtils]: 15: Hoare triple {499#(or (not (bvslt main_~main__x~0 (_ bv0 32))) (bvsgt (bvadd main_~main__y~0 (_ bv2 32)) (_ bv0 32)) (not (bvslt (bvadd main_~main__y~0 main_~main__x~0) (_ bv0 32))) (bvslt (bvadd (bvmul (_ bv2 32) main_~main__y~0) main_~main__x~0 (_ bv1 32)) (_ bv0 32)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_55_0~0; {499#(or (not (bvslt main_~main__x~0 (_ bv0 32))) (bvsgt (bvadd main_~main__y~0 (_ bv2 32)) (_ bv0 32)) (not (bvslt (bvadd main_~main__y~0 main_~main__x~0) (_ bv0 32))) (bvslt (bvadd (bvmul (_ bv2 32) main_~main__y~0) main_~main__x~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-14 16:45:31,473 INFO L273 TraceCheckUtils]: 14: Hoare triple {506#(or (not (bvslt main_~main__x~0 (_ bv0 32))) (not (bvslt (bvadd (bvmul (_ bv2 32) main_~main__y~0) main_~main__x~0 (_ bv1 32)) (_ bv0 32))) (bvslt (bvadd (bvmul (_ bv3 32) main_~main__y~0) main_~main__x~0 (_ bv3 32)) (_ bv0 32)) (bvsgt (bvadd main_~main__y~0 (_ bv3 32)) (_ bv0 32)) (not (bvslt (bvadd main_~main__y~0 main_~main__x~0) (_ bv0 32))))} assume ~bvslt32(~main__x~0, 0bv32);~main__x~0 := ~bvadd32(~main__x~0, ~main__y~0);~main____CPAchecker_TMP_0~1 := ~main__y~0;~main__y~0 := ~bvadd32(1bv32, ~main__y~0);~__tmp_55_0~0 := ~main____CPAchecker_TMP_0~1; {499#(or (not (bvslt main_~main__x~0 (_ bv0 32))) (bvsgt (bvadd main_~main__y~0 (_ bv2 32)) (_ bv0 32)) (not (bvslt (bvadd main_~main__y~0 main_~main__x~0) (_ bv0 32))) (bvslt (bvadd (bvmul (_ bv2 32) main_~main__y~0) main_~main__x~0 (_ bv1 32)) (_ bv0 32)))} is UNKNOWN [2018-11-14 16:45:31,474 INFO L273 TraceCheckUtils]: 13: Hoare triple {506#(or (not (bvslt main_~main__x~0 (_ bv0 32))) (not (bvslt (bvadd (bvmul (_ bv2 32) main_~main__y~0) main_~main__x~0 (_ bv1 32)) (_ bv0 32))) (bvslt (bvadd (bvmul (_ bv3 32) main_~main__y~0) main_~main__x~0 (_ bv3 32)) (_ bv0 32)) (bvsgt (bvadd main_~main__y~0 (_ bv3 32)) (_ bv0 32)) (not (bvslt (bvadd main_~main__y~0 main_~main__x~0) (_ bv0 32))))} ~main____CPAchecker_TMP_0~0 := ~__tmp_55_0~0; {506#(or (not (bvslt main_~main__x~0 (_ bv0 32))) (not (bvslt (bvadd (bvmul (_ bv2 32) main_~main__y~0) main_~main__x~0 (_ bv1 32)) (_ bv0 32))) (bvslt (bvadd (bvmul (_ bv3 32) main_~main__y~0) main_~main__x~0 (_ bv3 32)) (_ bv0 32)) (bvsgt (bvadd main_~main__y~0 (_ bv3 32)) (_ bv0 32)) (not (bvslt (bvadd main_~main__y~0 main_~main__x~0) (_ bv0 32))))} is VALID [2018-11-14 16:45:33,496 INFO L273 TraceCheckUtils]: 12: Hoare triple {513#(or (not (bvslt main_~main__x~0 (_ bv0 32))) (not (bvslt (bvadd (bvmul (_ bv3 32) main_~main__y~0) main_~main__x~0 (_ bv3 32)) (_ bv0 32))) (not (bvslt (bvadd (bvmul (_ bv2 32) main_~main__y~0) main_~main__x~0 (_ bv1 32)) (_ bv0 32))) (bvsgt (bvadd main_~main__y~0 (_ bv4 32)) (_ bv0 32)) (bvslt (bvadd (bvmul (_ bv4 32) main_~main__y~0) main_~main__x~0 (_ bv6 32)) (_ bv0 32)) (not (bvslt (bvadd main_~main__y~0 main_~main__x~0) (_ bv0 32))))} assume ~bvslt32(~main__x~0, 0bv32);~main__x~0 := ~bvadd32(~main__x~0, ~main__y~0);~main____CPAchecker_TMP_0~1 := ~main__y~0;~main__y~0 := ~bvadd32(1bv32, ~main__y~0);~__tmp_55_0~0 := ~main____CPAchecker_TMP_0~1; {506#(or (not (bvslt main_~main__x~0 (_ bv0 32))) (not (bvslt (bvadd (bvmul (_ bv2 32) main_~main__y~0) main_~main__x~0 (_ bv1 32)) (_ bv0 32))) (bvslt (bvadd (bvmul (_ bv3 32) main_~main__y~0) main_~main__x~0 (_ bv3 32)) (_ bv0 32)) (bvsgt (bvadd main_~main__y~0 (_ bv3 32)) (_ bv0 32)) (not (bvslt (bvadd main_~main__y~0 main_~main__x~0) (_ bv0 32))))} is UNKNOWN [2018-11-14 16:45:33,501 INFO L273 TraceCheckUtils]: 11: Hoare triple {513#(or (not (bvslt main_~main__x~0 (_ bv0 32))) (not (bvslt (bvadd (bvmul (_ bv3 32) main_~main__y~0) main_~main__x~0 (_ bv3 32)) (_ bv0 32))) (not (bvslt (bvadd (bvmul (_ bv2 32) main_~main__y~0) main_~main__x~0 (_ bv1 32)) (_ bv0 32))) (bvsgt (bvadd main_~main__y~0 (_ bv4 32)) (_ bv0 32)) (bvslt (bvadd (bvmul (_ bv4 32) main_~main__y~0) main_~main__x~0 (_ bv6 32)) (_ bv0 32)) (not (bvslt (bvadd main_~main__y~0 main_~main__x~0) (_ bv0 32))))} ~main____CPAchecker_TMP_0~0 := ~__tmp_55_0~0; {513#(or (not (bvslt main_~main__x~0 (_ bv0 32))) (not (bvslt (bvadd (bvmul (_ bv3 32) main_~main__y~0) main_~main__x~0 (_ bv3 32)) (_ bv0 32))) (not (bvslt (bvadd (bvmul (_ bv2 32) main_~main__y~0) main_~main__x~0 (_ bv1 32)) (_ bv0 32))) (bvsgt (bvadd main_~main__y~0 (_ bv4 32)) (_ bv0 32)) (bvslt (bvadd (bvmul (_ bv4 32) main_~main__y~0) main_~main__x~0 (_ bv6 32)) (_ bv0 32)) (not (bvslt (bvadd main_~main__y~0 main_~main__x~0) (_ bv0 32))))} is VALID [2018-11-14 16:45:35,506 INFO L273 TraceCheckUtils]: 10: Hoare triple {520#(or (not (bvslt (bvadd (bvmul (_ bv3 32) main_~main__y~0) main_~main__x~0 (_ bv3 32)) (_ bv0 32))) (not (bvslt (bvadd (bvmul (_ bv2 32) main_~main__y~0) main_~main__x~0 (_ bv1 32)) (_ bv0 32))) (bvsgt (bvadd main_~main__y~0 (_ bv5 32)) (_ bv0 32)) (not (bvslt (bvadd main_~main__y~0 main_~main__x~0) (_ bv0 32))) (not (bvslt (bvadd (bvmul (_ bv4 32) main_~main__y~0) main_~main__x~0 (_ bv6 32)) (_ bv0 32))) (bvslt (bvadd (bvmul (_ bv5 32) main_~main__y~0) main_~main__x~0 (_ bv10 32)) (_ bv0 32)))} assume ~bvslt32(~main__x~0, 0bv32);~main__x~0 := ~bvadd32(~main__x~0, ~main__y~0);~main____CPAchecker_TMP_0~1 := ~main__y~0;~main__y~0 := ~bvadd32(1bv32, ~main__y~0);~__tmp_55_0~0 := ~main____CPAchecker_TMP_0~1; {513#(or (not (bvslt main_~main__x~0 (_ bv0 32))) (not (bvslt (bvadd (bvmul (_ bv3 32) main_~main__y~0) main_~main__x~0 (_ bv3 32)) (_ bv0 32))) (not (bvslt (bvadd (bvmul (_ bv2 32) main_~main__y~0) main_~main__x~0 (_ bv1 32)) (_ bv0 32))) (bvsgt (bvadd main_~main__y~0 (_ bv4 32)) (_ bv0 32)) (bvslt (bvadd (bvmul (_ bv4 32) main_~main__y~0) main_~main__x~0 (_ bv6 32)) (_ bv0 32)) (not (bvslt (bvadd main_~main__y~0 main_~main__x~0) (_ bv0 32))))} is UNKNOWN [2018-11-14 16:45:35,507 INFO L273 TraceCheckUtils]: 9: Hoare triple {520#(or (not (bvslt (bvadd (bvmul (_ bv3 32) main_~main__y~0) main_~main__x~0 (_ bv3 32)) (_ bv0 32))) (not (bvslt (bvadd (bvmul (_ bv2 32) main_~main__y~0) main_~main__x~0 (_ bv1 32)) (_ bv0 32))) (bvsgt (bvadd main_~main__y~0 (_ bv5 32)) (_ bv0 32)) (not (bvslt (bvadd main_~main__y~0 main_~main__x~0) (_ bv0 32))) (not (bvslt (bvadd (bvmul (_ bv4 32) main_~main__y~0) main_~main__x~0 (_ bv6 32)) (_ bv0 32))) (bvslt (bvadd (bvmul (_ bv5 32) main_~main__y~0) main_~main__x~0 (_ bv10 32)) (_ bv0 32)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_55_0~0; {520#(or (not (bvslt (bvadd (bvmul (_ bv3 32) main_~main__y~0) main_~main__x~0 (_ bv3 32)) (_ bv0 32))) (not (bvslt (bvadd (bvmul (_ bv2 32) main_~main__y~0) main_~main__x~0 (_ bv1 32)) (_ bv0 32))) (bvsgt (bvadd main_~main__y~0 (_ bv5 32)) (_ bv0 32)) (not (bvslt (bvadd main_~main__y~0 main_~main__x~0) (_ bv0 32))) (not (bvslt (bvadd (bvmul (_ bv4 32) main_~main__y~0) main_~main__x~0 (_ bv6 32)) (_ bv0 32))) (bvslt (bvadd (bvmul (_ bv5 32) main_~main__y~0) main_~main__x~0 (_ bv10 32)) (_ bv0 32)))} is VALID [2018-11-14 16:45:37,513 INFO L273 TraceCheckUtils]: 8: Hoare triple {527#(or (bvslt (bvadd (bvmul (_ bv6 32) main_~main__y~0) main_~main__x~0 (_ bv15 32)) (_ bv0 32)) (not (bvslt (bvadd (bvmul (_ bv3 32) main_~main__y~0) main_~main__x~0 (_ bv3 32)) (_ bv0 32))) (bvsgt (bvadd main_~main__y~0 (_ bv6 32)) (_ bv0 32)) (not (bvslt (bvadd (bvmul (_ bv2 32) main_~main__y~0) main_~main__x~0 (_ bv1 32)) (_ bv0 32))) (not (bvslt (bvadd (bvmul (_ bv5 32) main_~main__y~0) main_~main__x~0 (_ bv10 32)) (_ bv0 32))) (not (bvslt (bvadd (bvmul (_ bv4 32) main_~main__y~0) main_~main__x~0 (_ bv6 32)) (_ bv0 32))))} assume ~bvslt32(~main__x~0, 0bv32);~main__x~0 := ~bvadd32(~main__x~0, ~main__y~0);~main____CPAchecker_TMP_0~0 := ~main__y~0;~main__y~0 := ~bvadd32(1bv32, ~main__y~0);~__tmp_55_0~0 := ~main____CPAchecker_TMP_0~0; {520#(or (not (bvslt (bvadd (bvmul (_ bv3 32) main_~main__y~0) main_~main__x~0 (_ bv3 32)) (_ bv0 32))) (not (bvslt (bvadd (bvmul (_ bv2 32) main_~main__y~0) main_~main__x~0 (_ bv1 32)) (_ bv0 32))) (bvsgt (bvadd main_~main__y~0 (_ bv5 32)) (_ bv0 32)) (not (bvslt (bvadd main_~main__y~0 main_~main__x~0) (_ bv0 32))) (not (bvslt (bvadd (bvmul (_ bv4 32) main_~main__y~0) main_~main__x~0 (_ bv6 32)) (_ bv0 32))) (bvslt (bvadd (bvmul (_ bv5 32) main_~main__y~0) main_~main__x~0 (_ bv10 32)) (_ bv0 32)))} is UNKNOWN [2018-11-14 16:45:37,513 INFO L273 TraceCheckUtils]: 7: Hoare triple {527#(or (bvslt (bvadd (bvmul (_ bv6 32) main_~main__y~0) main_~main__x~0 (_ bv15 32)) (_ bv0 32)) (not (bvslt (bvadd (bvmul (_ bv3 32) main_~main__y~0) main_~main__x~0 (_ bv3 32)) (_ bv0 32))) (bvsgt (bvadd main_~main__y~0 (_ bv6 32)) (_ bv0 32)) (not (bvslt (bvadd (bvmul (_ bv2 32) main_~main__y~0) main_~main__x~0 (_ bv1 32)) (_ bv0 32))) (not (bvslt (bvadd (bvmul (_ bv5 32) main_~main__y~0) main_~main__x~0 (_ bv10 32)) (_ bv0 32))) (not (bvslt (bvadd (bvmul (_ bv4 32) main_~main__y~0) main_~main__x~0 (_ bv6 32)) (_ bv0 32))))} assume !!~bvslt32(~main__y~0, 1000000bv32); {527#(or (bvslt (bvadd (bvmul (_ bv6 32) main_~main__y~0) main_~main__x~0 (_ bv15 32)) (_ bv0 32)) (not (bvslt (bvadd (bvmul (_ bv3 32) main_~main__y~0) main_~main__x~0 (_ bv3 32)) (_ bv0 32))) (bvsgt (bvadd main_~main__y~0 (_ bv6 32)) (_ bv0 32)) (not (bvslt (bvadd (bvmul (_ bv2 32) main_~main__y~0) main_~main__x~0 (_ bv1 32)) (_ bv0 32))) (not (bvslt (bvadd (bvmul (_ bv5 32) main_~main__y~0) main_~main__x~0 (_ bv10 32)) (_ bv0 32))) (not (bvslt (bvadd (bvmul (_ bv4 32) main_~main__y~0) main_~main__x~0 (_ bv6 32)) (_ bv0 32))))} is VALID [2018-11-14 16:45:37,520 INFO L273 TraceCheckUtils]: 6: Hoare triple {534#(forall ((main_~main__y~0 (_ BitVec 32))) (or (bvslt (bvadd (bvmul (_ bv6 32) main_~main__y~0) main_~main__x~0 (_ bv15 32)) (_ bv0 32)) (not (bvslt (bvadd (bvmul (_ bv3 32) main_~main__y~0) main_~main__x~0 (_ bv3 32)) (_ bv0 32))) (bvsgt (bvadd main_~main__y~0 (_ bv6 32)) (_ bv0 32)) (not (bvslt (bvadd (bvmul (_ bv2 32) main_~main__y~0) main_~main__x~0 (_ bv1 32)) (_ bv0 32))) (not (bvslt (bvadd (bvmul (_ bv5 32) main_~main__y~0) main_~main__x~0 (_ bv10 32)) (_ bv0 32))) (not (bvslt (_ bv4294966296 32) main_~main__y~0)) (not (bvslt (bvadd (bvmul (_ bv4 32) main_~main__y~0) main_~main__x~0 (_ bv6 32)) (_ bv0 32)))))} assume !!~bvslt32(4294966296bv32, ~main__y~0); {527#(or (bvslt (bvadd (bvmul (_ bv6 32) main_~main__y~0) main_~main__x~0 (_ bv15 32)) (_ bv0 32)) (not (bvslt (bvadd (bvmul (_ bv3 32) main_~main__y~0) main_~main__x~0 (_ bv3 32)) (_ bv0 32))) (bvsgt (bvadd main_~main__y~0 (_ bv6 32)) (_ bv0 32)) (not (bvslt (bvadd (bvmul (_ bv2 32) main_~main__y~0) main_~main__x~0 (_ bv1 32)) (_ bv0 32))) (not (bvslt (bvadd (bvmul (_ bv5 32) main_~main__y~0) main_~main__x~0 (_ bv10 32)) (_ bv0 32))) (not (bvslt (bvadd (bvmul (_ bv4 32) main_~main__y~0) main_~main__x~0 (_ bv6 32)) (_ bv0 32))))} is VALID [2018-11-14 16:45:37,526 INFO L273 TraceCheckUtils]: 5: Hoare triple {397#true} havoc ~main__x~0;havoc ~main__y~0;~main__x~0 := 4294967246bv32;~main__y~0 := #t~nondet1;havoc #t~nondet1; {534#(forall ((main_~main__y~0 (_ BitVec 32))) (or (bvslt (bvadd (bvmul (_ bv6 32) main_~main__y~0) main_~main__x~0 (_ bv15 32)) (_ bv0 32)) (not (bvslt (bvadd (bvmul (_ bv3 32) main_~main__y~0) main_~main__x~0 (_ bv3 32)) (_ bv0 32))) (bvsgt (bvadd main_~main__y~0 (_ bv6 32)) (_ bv0 32)) (not (bvslt (bvadd (bvmul (_ bv2 32) main_~main__y~0) main_~main__x~0 (_ bv1 32)) (_ bv0 32))) (not (bvslt (bvadd (bvmul (_ bv5 32) main_~main__y~0) main_~main__x~0 (_ bv10 32)) (_ bv0 32))) (not (bvslt (_ bv4294966296 32) main_~main__y~0)) (not (bvslt (bvadd (bvmul (_ bv4 32) main_~main__y~0) main_~main__x~0 (_ bv6 32)) (_ bv0 32)))))} is VALID [2018-11-14 16:45:37,526 INFO L256 TraceCheckUtils]: 4: Hoare triple {397#true} call #t~ret2 := main(); {397#true} is VALID [2018-11-14 16:45:37,527 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {397#true} {397#true} #33#return; {397#true} is VALID [2018-11-14 16:45:37,527 INFO L273 TraceCheckUtils]: 2: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 16:45:37,527 INFO L273 TraceCheckUtils]: 1: Hoare triple {397#true} ~__return_main~0 := 0bv32;~__tmp_55_0~0 := 0bv32;~__return_65~0 := 0bv32; {397#true} is VALID [2018-11-14 16:45:37,527 INFO L256 TraceCheckUtils]: 0: Hoare triple {397#true} call ULTIMATE.init(); {397#true} is VALID [2018-11-14 16:45:37,533 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:45:37,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:45:37,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2018-11-14 16:45:37,537 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 23 [2018-11-14 16:45:37,537 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:45:37,538 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-14 16:45:46,579 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 36 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2018-11-14 16:45:46,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-14 16:45:46,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-14 16:45:46,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2018-11-14 16:45:46,580 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 21 states. [2018-11-14 16:45:52,395 WARN L179 SmtUtils]: Spent 1.71 s on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2018-11-14 16:45:57,713 WARN L179 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 39 [2018-11-14 16:45:59,885 WARN L179 SmtUtils]: Spent 1.81 s on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2018-11-14 16:46:00,504 WARN L179 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2018-11-14 16:46:03,170 WARN L179 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2018-11-14 16:46:03,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:46:03,465 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2018-11-14 16:46:03,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-14 16:46:03,465 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 23 [2018-11-14 16:46:03,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:46:03,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 16:46:03,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 48 transitions. [2018-11-14 16:46:03,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 16:46:03,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 48 transitions. [2018-11-14 16:46:03,480 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 48 transitions. [2018-11-14 16:46:11,096 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 45 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2018-11-14 16:46:11,098 INFO L225 Difference]: With dead ends: 42 [2018-11-14 16:46:11,098 INFO L226 Difference]: Without dead ends: 38 [2018-11-14 16:46:11,099 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=238, Invalid=574, Unknown=0, NotChecked=0, Total=812 [2018-11-14 16:46:11,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-14 16:46:11,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-14 16:46:11,193 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:46:11,193 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 38 states. [2018-11-14 16:46:11,193 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-14 16:46:11,193 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-14 16:46:11,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:46:11,197 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-11-14 16:46:11,197 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-11-14 16:46:11,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:46:11,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:46:11,198 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-14 16:46:11,198 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-14 16:46:11,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:46:11,201 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-11-14 16:46:11,201 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-11-14 16:46:11,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:46:11,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:46:11,202 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:46:11,202 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:46:11,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 16:46:11,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-11-14 16:46:11,205 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 23 [2018-11-14 16:46:11,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:46:11,205 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-11-14 16:46:11,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-14 16:46:11,206 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-11-14 16:46:11,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-14 16:46:11,207 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:46:11,207 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:46:11,208 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:46:11,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:46:11,208 INFO L82 PathProgramCache]: Analyzing trace with hash -498299566, now seen corresponding path program 3 times [2018-11-14 16:46:11,209 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:46:11,209 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 16:46:11,235 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-14 16:46:11,942 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-11-14 16:46:11,942 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:46:12,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:46:12,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:46:12,282 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:46:12,283 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (bvneg (_ BitVec 32)) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:321) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.term(WrapperScript.java:192) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.BitvectorUtils$BitvectorOperation.notSimplified(BitvectorUtils.java:263) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.BitvectorUtils$BitvectorOperation.simplify_NonConstantCase(BitvectorUtils.java:259) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.BitvectorUtils$BitvectorOperation.simplifiedResult(BitvectorUtils.java:254) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.BitvectorUtils.termWithLocalSimplification(BitvectorUtils.java:180) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.neg(SmtUtils.java:560) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.linearterms.AffineRelation.product(AffineRelation.java:350) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.linearterms.AffineRelation.onLeftHandSideOnly(AffineRelation.java:300) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.pqe.EqualityInformation.getEqinfo(EqualityInformation.java:145) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.pqe.EqualityInformation.getEqinfo(EqualityInformation.java:131) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.pqe.XnfDer.derSimple(XnfDer.java:118) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.pqe.XnfDer.tryToEliminate(XnfDer.java:97) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.linearterms.QuantifierPusher.applyEliminationTechniques(QuantifierPusher.java:302) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:215) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPush(QuantifierPusher.java:134) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:107) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:253) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.TermDomainOperationProvider.constructQuantifiedFormula(TermDomainOperationProvider.java:115) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:103) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:136) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-14 16:46:12,287 INFO L168 Benchmark]: Toolchain (without parser) took 61087.76 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 868.7 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -860.0 MB). Peak memory consumption was 8.7 MB. Max. memory is 7.1 GB. [2018-11-14 16:46:12,288 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 16:46:12,289 INFO L168 Benchmark]: CACSL2BoogieTranslator took 360.41 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 16:46:12,290 INFO L168 Benchmark]: Boogie Preprocessor took 38.25 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 16:46:12,290 INFO L168 Benchmark]: RCFGBuilder took 564.24 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 757.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -807.4 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2018-11-14 16:46:12,291 INFO L168 Benchmark]: TraceAbstraction took 60119.97 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 111.1 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -63.1 MB). Peak memory consumption was 48.0 MB. Max. memory is 7.1 GB. [2018-11-14 16:46:12,296 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.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 360.41 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 38.25 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 564.24 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 757.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -807.4 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 60119.97 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 111.1 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -63.1 MB). Peak memory consumption was 48.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Undeclared function symbol (bvneg (_ BitVec 32)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Undeclared function symbol (bvneg (_ BitVec 32)): de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:321) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...