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_true-termination.c.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 16:44:31,462 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 16:44:31,465 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 16:44:31,480 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 16:44:31,481 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 16:44:31,483 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 16:44:31,486 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 16:44:31,488 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 16:44:31,491 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 16:44:31,493 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 16:44:31,494 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 16:44:31,494 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 16:44:31,497 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 16:44:31,499 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 16:44:31,506 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 16:44:31,507 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 16:44:31,510 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 16:44:31,512 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 16:44:31,515 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 16:44:31,519 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 16:44:31,520 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 16:44:31,523 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 16:44:31,526 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 16:44:31,526 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 16:44:31,526 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 16:44:31,529 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 16:44:31,531 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 16:44:31,533 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 16:44:31,534 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 16:44:31,537 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 16:44:31,537 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 16:44:31,538 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 16:44:31,539 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 16:44:31,539 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 16:44:31,540 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 16:44:31,540 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 16:44:31,541 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:44:31,567 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 16:44:31,567 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 16:44:31,568 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 16:44:31,568 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 16:44:31,569 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 16:44:31,569 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 16:44:31,569 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 16:44:31,569 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 16:44:31,569 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 16:44:31,570 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 16:44:31,570 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 16:44:31,570 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 16:44:31,571 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 16:44:31,571 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 16:44:31,571 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 16:44:31,571 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 16:44:31,571 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 16:44:31,572 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 16:44:31,572 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 16:44:31,572 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 16:44:31,572 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 16:44:31,572 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 16:44:31,572 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 16:44:31,573 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:44:31,573 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 16:44:31,573 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 16:44:31,573 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 16:44:31,573 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 16:44:31,574 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 16:44:31,574 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 16:44:31,574 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 16:44:31,574 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 16:44:31,628 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 16:44:31,643 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 16:44:31,647 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 16:44:31,649 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 16:44:31,649 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 16:44:31,650 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_true-termination.c.i [2018-11-14 16:44:31,731 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2815172d1/fc42a13937f5460da5fdab58d2a2244b/FLAGc013f71e4 [2018-11-14 16:44:32,133 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 16:44:32,134 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gsv2008_true-unreach-call_true-termination.c.i [2018-11-14 16:44:32,139 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2815172d1/fc42a13937f5460da5fdab58d2a2244b/FLAGc013f71e4 [2018-11-14 16:44:32,153 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2815172d1/fc42a13937f5460da5fdab58d2a2244b [2018-11-14 16:44:32,165 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 16:44:32,166 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 16:44:32,168 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 16:44:32,168 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 16:44:32,174 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 16:44:32,176 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:44:32" (1/1) ... [2018-11-14 16:44:32,179 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ad45c06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:44:32, skipping insertion in model container [2018-11-14 16:44:32,179 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:44:32" (1/1) ... [2018-11-14 16:44:32,190 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 16:44:32,218 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 16:44:32,498 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:44:32,505 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 16:44:32,532 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:44:32,553 INFO L195 MainTranslator]: Completed translation [2018-11-14 16:44:32,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:44:32 WrapperNode [2018-11-14 16:44:32,554 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 16:44:32,554 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 16:44:32,555 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 16:44:32,555 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 16:44:32,566 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:44:32" (1/1) ... [2018-11-14 16:44:32,566 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:44:32" (1/1) ... [2018-11-14 16:44:32,572 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:44:32" (1/1) ... [2018-11-14 16:44:32,572 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:44:32" (1/1) ... [2018-11-14 16:44:32,580 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:44:32" (1/1) ... [2018-11-14 16:44:32,586 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:44:32" (1/1) ... [2018-11-14 16:44:32,587 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:44:32" (1/1) ... [2018-11-14 16:44:32,589 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 16:44:32,589 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 16:44:32,590 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 16:44:32,590 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 16:44:32,591 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:44:32" (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:44:32,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 16:44:32,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 16:44:32,713 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 16:44:32,713 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 16:44:32,713 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 16:44:32,713 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-14 16:44:32,713 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 16:44:32,714 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 16:44:32,714 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 16:44:32,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 16:44:32,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 16:44:33,139 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 16:44:33,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:44:33 BoogieIcfgContainer [2018-11-14 16:44:33,140 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 16:44:33,141 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 16:44:33,141 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 16:44:33,145 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 16:44:33,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:44:32" (1/3) ... [2018-11-14 16:44:33,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bcf18c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:44:33, skipping insertion in model container [2018-11-14 16:44:33,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:44:32" (2/3) ... [2018-11-14 16:44:33,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bcf18c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:44:33, skipping insertion in model container [2018-11-14 16:44:33,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:44:33" (3/3) ... [2018-11-14 16:44:33,150 INFO L112 eAbstractionObserver]: Analyzing ICFG gsv2008_true-unreach-call_true-termination.c.i [2018-11-14 16:44:33,158 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 16:44:33,166 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 16:44:33,184 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 16:44:33,217 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 16:44:33,218 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 16:44:33,218 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 16:44:33,219 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 16:44:33,219 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 16:44:33,219 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 16:44:33,219 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 16:44:33,219 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 16:44:33,219 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 16:44:33,238 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-14 16:44:33,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-14 16:44:33,245 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:44:33,246 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:44:33,248 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:44:33,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:44:33,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1281911547, now seen corresponding path program 1 times [2018-11-14 16:44:33,258 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:44:33,259 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:44:33,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:44:33,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:33,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:33,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:44:33,401 INFO L256 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {23#true} is VALID [2018-11-14 16:44:33,404 INFO L273 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2018-11-14 16:44:33,405 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #37#return; {23#true} is VALID [2018-11-14 16:44:33,405 INFO L256 TraceCheckUtils]: 3: Hoare triple {23#true} call #t~ret3 := main(); {23#true} is VALID [2018-11-14 16:44:33,406 INFO L273 TraceCheckUtils]: 4: Hoare triple {23#true} havoc ~x~0;havoc ~y~0;~x~0 := 4294967246bv32;~y~0 := #t~nondet1;havoc #t~nondet1; {23#true} is VALID [2018-11-14 16:44:33,406 INFO L273 TraceCheckUtils]: 5: Hoare triple {23#true} assume !!(~bvslt32(4294966296bv32, ~y~0) && ~bvslt32(~y~0, 1000000bv32)); {23#true} is VALID [2018-11-14 16:44:33,416 INFO L273 TraceCheckUtils]: 6: Hoare triple {23#true} assume !true; {24#false} is VALID [2018-11-14 16:44:33,416 INFO L256 TraceCheckUtils]: 7: Hoare triple {24#false} call __VERIFIER_assert((if ~bvsgt32(~y~0, 0bv32) then 1bv32 else 0bv32)); {24#false} is VALID [2018-11-14 16:44:33,416 INFO L273 TraceCheckUtils]: 8: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2018-11-14 16:44:33,417 INFO L273 TraceCheckUtils]: 9: Hoare triple {24#false} assume ~cond == 0bv32; {24#false} is VALID [2018-11-14 16:44:33,417 INFO L273 TraceCheckUtils]: 10: Hoare triple {24#false} assume !false; {24#false} is VALID [2018-11-14 16:44:33,420 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:44:33,420 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:44:33,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:44:33,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 16:44:33,428 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-14 16:44:33,431 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:44:33,435 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 16:44:33,474 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:33,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 16:44:33,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 16:44:33,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:44:33,485 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2018-11-14 16:44:33,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:33,576 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-14 16:44:33,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 16:44:33,576 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-14 16:44:33,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:44:33,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:44:33,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 36 transitions. [2018-11-14 16:44:33,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:44:33,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 36 transitions. [2018-11-14 16:44:33,593 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 36 transitions. [2018-11-14 16:44:33,929 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:33,939 INFO L225 Difference]: With dead ends: 32 [2018-11-14 16:44:33,939 INFO L226 Difference]: Without dead ends: 13 [2018-11-14 16:44:33,943 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:44:33,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-14 16:44:34,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-14 16:44:34,001 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:44:34,002 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2018-11-14 16:44:34,002 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-14 16:44:34,003 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-14 16:44:34,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:34,006 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-14 16:44:34,006 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-14 16:44:34,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:34,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:34,007 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-14 16:44:34,007 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-14 16:44:34,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:34,010 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-14 16:44:34,011 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-14 16:44:34,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:34,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:34,011 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:44:34,012 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:44:34,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 16:44:34,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-14 16:44:34,016 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-11-14 16:44:34,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:44:34,016 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-11-14 16:44:34,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 16:44:34,016 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-14 16:44:34,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-14 16:44:34,017 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:44:34,017 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:44:34,018 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:44:34,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:44:34,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1335306055, now seen corresponding path program 1 times [2018-11-14 16:44:34,018 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:44:34,019 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:44:34,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:44:34,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:34,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:34,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:44:34,215 INFO L256 TraceCheckUtils]: 0: Hoare triple {144#true} call ULTIMATE.init(); {144#true} is VALID [2018-11-14 16:44:34,215 INFO L273 TraceCheckUtils]: 1: Hoare triple {144#true} assume true; {144#true} is VALID [2018-11-14 16:44:34,216 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {144#true} {144#true} #37#return; {144#true} is VALID [2018-11-14 16:44:34,216 INFO L256 TraceCheckUtils]: 3: Hoare triple {144#true} call #t~ret3 := main(); {144#true} is VALID [2018-11-14 16:44:34,220 INFO L273 TraceCheckUtils]: 4: Hoare triple {144#true} havoc ~x~0;havoc ~y~0;~x~0 := 4294967246bv32;~y~0 := #t~nondet1;havoc #t~nondet1; {161#(= (bvadd main_~x~0 (_ bv50 32)) (_ bv0 32))} is VALID [2018-11-14 16:44:34,221 INFO L273 TraceCheckUtils]: 5: Hoare triple {161#(= (bvadd main_~x~0 (_ bv50 32)) (_ bv0 32))} assume !!(~bvslt32(4294966296bv32, ~y~0) && ~bvslt32(~y~0, 1000000bv32)); {161#(= (bvadd main_~x~0 (_ bv50 32)) (_ bv0 32))} is VALID [2018-11-14 16:44:34,222 INFO L273 TraceCheckUtils]: 6: Hoare triple {161#(= (bvadd main_~x~0 (_ bv50 32)) (_ bv0 32))} assume true; {161#(= (bvadd main_~x~0 (_ bv50 32)) (_ bv0 32))} is VALID [2018-11-14 16:44:34,232 INFO L273 TraceCheckUtils]: 7: Hoare triple {161#(= (bvadd main_~x~0 (_ bv50 32)) (_ bv0 32))} assume !~bvslt32(~x~0, 0bv32); {145#false} is VALID [2018-11-14 16:44:34,232 INFO L256 TraceCheckUtils]: 8: Hoare triple {145#false} call __VERIFIER_assert((if ~bvsgt32(~y~0, 0bv32) then 1bv32 else 0bv32)); {145#false} is VALID [2018-11-14 16:44:34,233 INFO L273 TraceCheckUtils]: 9: Hoare triple {145#false} ~cond := #in~cond; {145#false} is VALID [2018-11-14 16:44:34,233 INFO L273 TraceCheckUtils]: 10: Hoare triple {145#false} assume ~cond == 0bv32; {145#false} is VALID [2018-11-14 16:44:34,233 INFO L273 TraceCheckUtils]: 11: Hoare triple {145#false} assume !false; {145#false} is VALID [2018-11-14 16:44:34,235 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:44:34,235 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:44:34,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:44:34,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:44:34,243 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-14 16:44:34,244 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:44:34,244 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:44:34,274 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:34,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:44:34,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:44:34,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:44:34,276 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 3 states. [2018-11-14 16:44:34,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:34,445 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-14 16:44:34,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:44:34,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-14 16:44:34,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:44:34,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:44:34,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2018-11-14 16:44:34,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:44:34,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2018-11-14 16:44:34,451 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 20 transitions. [2018-11-14 16:44:34,499 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:34,502 INFO L225 Difference]: With dead ends: 20 [2018-11-14 16:44:34,502 INFO L226 Difference]: Without dead ends: 15 [2018-11-14 16:44:34,503 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:44:34,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-14 16:44:34,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-14 16:44:34,523 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:44:34,523 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2018-11-14 16:44:34,523 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-14 16:44:34,524 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-14 16:44:34,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:34,526 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-14 16:44:34,526 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-14 16:44:34,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:34,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:34,527 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-14 16:44:34,527 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-14 16:44:34,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:34,529 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-14 16:44:34,529 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-14 16:44:34,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:34,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:34,530 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:44:34,530 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:44:34,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 16:44:34,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-14 16:44:34,532 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-11-14 16:44:34,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:44:34,533 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-14 16:44:34,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:44:34,533 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-14 16:44:34,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-14 16:44:34,534 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:44:34,534 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:44:34,534 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:44:34,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:44:34,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1931535679, now seen corresponding path program 1 times [2018-11-14 16:44:34,535 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:44:34,536 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:44:34,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:44:34,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:34,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:34,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:44:35,314 INFO L256 TraceCheckUtils]: 0: Hoare triple {265#true} call ULTIMATE.init(); {265#true} is VALID [2018-11-14 16:44:35,314 INFO L273 TraceCheckUtils]: 1: Hoare triple {265#true} assume true; {265#true} is VALID [2018-11-14 16:44:35,314 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {265#true} {265#true} #37#return; {265#true} is VALID [2018-11-14 16:44:35,315 INFO L256 TraceCheckUtils]: 3: Hoare triple {265#true} call #t~ret3 := main(); {265#true} is VALID [2018-11-14 16:44:35,315 INFO L273 TraceCheckUtils]: 4: Hoare triple {265#true} havoc ~x~0;havoc ~y~0;~x~0 := 4294967246bv32;~y~0 := #t~nondet1;havoc #t~nondet1; {282#(= (bvadd main_~x~0 (_ bv50 32)) (_ bv0 32))} is VALID [2018-11-14 16:44:35,316 INFO L273 TraceCheckUtils]: 5: Hoare triple {282#(= (bvadd main_~x~0 (_ bv50 32)) (_ bv0 32))} assume !!(~bvslt32(4294966296bv32, ~y~0) && ~bvslt32(~y~0, 1000000bv32)); {286#(and (bvslt main_~y~0 (_ bv1000000 32)) (bvslt (_ bv4294966296 32) main_~y~0) (= (bvadd main_~x~0 (_ bv50 32)) (_ bv0 32)))} is VALID [2018-11-14 16:44:35,318 INFO L273 TraceCheckUtils]: 6: Hoare triple {286#(and (bvslt main_~y~0 (_ bv1000000 32)) (bvslt (_ bv4294966296 32) main_~y~0) (= (bvadd main_~x~0 (_ bv50 32)) (_ bv0 32)))} assume true; {286#(and (bvslt main_~y~0 (_ bv1000000 32)) (bvslt (_ bv4294966296 32) main_~y~0) (= (bvadd main_~x~0 (_ bv50 32)) (_ bv0 32)))} is VALID [2018-11-14 16:44:35,366 INFO L273 TraceCheckUtils]: 7: Hoare triple {286#(and (bvslt main_~y~0 (_ bv1000000 32)) (bvslt (_ bv4294966296 32) main_~y~0) (= (bvadd main_~x~0 (_ bv50 32)) (_ bv0 32)))} assume !!~bvslt32(~x~0, 0bv32);~x~0 := ~bvadd32(~x~0, ~y~0);#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {293#(and (bvslt (_ bv4294966296 32) (bvadd main_~y~0 (_ bv4294967295 32))) (= (bvadd main_~x~0 (_ bv51 32)) main_~y~0) (bvslt (bvadd main_~y~0 (_ bv4294967295 32)) (_ bv1000000 32)))} is VALID [2018-11-14 16:44:35,376 INFO L273 TraceCheckUtils]: 8: Hoare triple {293#(and (bvslt (_ bv4294966296 32) (bvadd main_~y~0 (_ bv4294967295 32))) (= (bvadd main_~x~0 (_ bv51 32)) main_~y~0) (bvslt (bvadd main_~y~0 (_ bv4294967295 32)) (_ bv1000000 32)))} assume true; {293#(and (bvslt (_ bv4294966296 32) (bvadd main_~y~0 (_ bv4294967295 32))) (= (bvadd main_~x~0 (_ bv51 32)) main_~y~0) (bvslt (bvadd main_~y~0 (_ bv4294967295 32)) (_ bv1000000 32)))} is VALID [2018-11-14 16:44:35,393 INFO L273 TraceCheckUtils]: 9: Hoare triple {293#(and (bvslt (_ bv4294966296 32) (bvadd main_~y~0 (_ bv4294967295 32))) (= (bvadd main_~x~0 (_ bv51 32)) main_~y~0) (bvslt (bvadd main_~y~0 (_ bv4294967295 32)) (_ bv1000000 32)))} assume !~bvslt32(~x~0, 0bv32); {300#(and (bvslt (_ bv4294966296 32) (bvadd main_~y~0 (_ bv4294967295 32))) (not (bvslt (bvadd main_~y~0 (_ bv4294967245 32)) (_ bv0 32))) (bvslt (bvadd main_~y~0 (_ bv4294967295 32)) (_ bv1000000 32)))} is VALID [2018-11-14 16:44:35,396 INFO L256 TraceCheckUtils]: 10: Hoare triple {300#(and (bvslt (_ bv4294966296 32) (bvadd main_~y~0 (_ bv4294967295 32))) (not (bvslt (bvadd main_~y~0 (_ bv4294967245 32)) (_ bv0 32))) (bvslt (bvadd main_~y~0 (_ bv4294967295 32)) (_ bv1000000 32)))} call __VERIFIER_assert((if ~bvsgt32(~y~0, 0bv32) then 1bv32 else 0bv32)); {304#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:44:35,397 INFO L273 TraceCheckUtils]: 11: Hoare triple {304#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {308#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:44:35,398 INFO L273 TraceCheckUtils]: 12: Hoare triple {308#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume ~cond == 0bv32; {266#false} is VALID [2018-11-14 16:44:35,398 INFO L273 TraceCheckUtils]: 13: Hoare triple {266#false} assume !false; {266#false} is VALID [2018-11-14 16:44:35,407 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:44:35,407 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:44:36,032 INFO L273 TraceCheckUtils]: 13: Hoare triple {266#false} assume !false; {266#false} is VALID [2018-11-14 16:44:36,034 INFO L273 TraceCheckUtils]: 12: Hoare triple {318#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume ~cond == 0bv32; {266#false} is VALID [2018-11-14 16:44:36,036 INFO L273 TraceCheckUtils]: 11: Hoare triple {322#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {318#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-14 16:44:36,041 INFO L256 TraceCheckUtils]: 10: Hoare triple {326#(bvsgt main_~y~0 (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~y~0, 0bv32) then 1bv32 else 0bv32)); {322#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-14 16:44:36,043 INFO L273 TraceCheckUtils]: 9: Hoare triple {330#(or (bvslt main_~x~0 (_ bv0 32)) (bvsgt main_~y~0 (_ bv0 32)))} assume !~bvslt32(~x~0, 0bv32); {326#(bvsgt main_~y~0 (_ bv0 32))} is VALID [2018-11-14 16:44:36,043 INFO L273 TraceCheckUtils]: 8: Hoare triple {330#(or (bvslt main_~x~0 (_ bv0 32)) (bvsgt main_~y~0 (_ bv0 32)))} assume true; {330#(or (bvslt main_~x~0 (_ bv0 32)) (bvsgt main_~y~0 (_ bv0 32)))} is VALID [2018-11-14 16:44:36,045 INFO L273 TraceCheckUtils]: 7: Hoare triple {337#(or (bvsgt (bvadd main_~y~0 (_ bv1 32)) (_ bv0 32)) (bvslt (bvadd main_~y~0 main_~x~0) (_ bv0 32)))} assume !!~bvslt32(~x~0, 0bv32);~x~0 := ~bvadd32(~x~0, ~y~0);#t~post2 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {330#(or (bvslt main_~x~0 (_ bv0 32)) (bvsgt main_~y~0 (_ bv0 32)))} is VALID [2018-11-14 16:44:36,045 INFO L273 TraceCheckUtils]: 6: Hoare triple {337#(or (bvsgt (bvadd main_~y~0 (_ bv1 32)) (_ bv0 32)) (bvslt (bvadd main_~y~0 main_~x~0) (_ bv0 32)))} assume true; {337#(or (bvsgt (bvadd main_~y~0 (_ bv1 32)) (_ bv0 32)) (bvslt (bvadd main_~y~0 main_~x~0) (_ bv0 32)))} is VALID [2018-11-14 16:44:36,049 INFO L273 TraceCheckUtils]: 5: Hoare triple {344#(forall ((main_~y~0 (_ BitVec 32))) (or (not (bvslt main_~y~0 (_ bv1000000 32))) (not (bvslt (_ bv4294966296 32) main_~y~0)) (bvsgt (bvadd main_~y~0 (_ bv1 32)) (_ bv0 32)) (bvslt (bvadd main_~y~0 main_~x~0) (_ bv0 32))))} assume !!(~bvslt32(4294966296bv32, ~y~0) && ~bvslt32(~y~0, 1000000bv32)); {337#(or (bvsgt (bvadd main_~y~0 (_ bv1 32)) (_ bv0 32)) (bvslt (bvadd main_~y~0 main_~x~0) (_ bv0 32)))} is VALID [2018-11-14 16:44:36,053 INFO L273 TraceCheckUtils]: 4: Hoare triple {265#true} havoc ~x~0;havoc ~y~0;~x~0 := 4294967246bv32;~y~0 := #t~nondet1;havoc #t~nondet1; {344#(forall ((main_~y~0 (_ BitVec 32))) (or (not (bvslt main_~y~0 (_ bv1000000 32))) (not (bvslt (_ bv4294966296 32) main_~y~0)) (bvsgt (bvadd main_~y~0 (_ bv1 32)) (_ bv0 32)) (bvslt (bvadd main_~y~0 main_~x~0) (_ bv0 32))))} is VALID [2018-11-14 16:44:36,054 INFO L256 TraceCheckUtils]: 3: Hoare triple {265#true} call #t~ret3 := main(); {265#true} is VALID [2018-11-14 16:44:36,054 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {265#true} {265#true} #37#return; {265#true} is VALID [2018-11-14 16:44:36,055 INFO L273 TraceCheckUtils]: 1: Hoare triple {265#true} assume true; {265#true} is VALID [2018-11-14 16:44:36,055 INFO L256 TraceCheckUtils]: 0: Hoare triple {265#true} call ULTIMATE.init(); {265#true} is VALID [2018-11-14 16:44:36,058 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:44:36,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:44:36,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-14 16:44:36,061 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-11-14 16:44:36,062 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:44:36,062 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-14 16:44:36,189 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:36,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-14 16:44:36,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-14 16:44:36,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-11-14 16:44:36,190 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2018-11-14 16:44:36,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:36,892 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2018-11-14 16:44:36,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 16:44:36,892 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-11-14 16:44:36,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:44:36,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 16:44:36,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 30 transitions. [2018-11-14 16:44:36,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 16:44:36,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 30 transitions. [2018-11-14 16:44:36,898 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 30 transitions. [2018-11-14 16:44:37,021 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:37,023 INFO L225 Difference]: With dead ends: 28 [2018-11-14 16:44:37,023 INFO L226 Difference]: Without dead ends: 21 [2018-11-14 16:44:37,024 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2018-11-14 16:44:37,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-14 16:44:37,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-14 16:44:37,039 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:44:37,039 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2018-11-14 16:44:37,039 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-14 16:44:37,040 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-14 16:44:37,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:37,043 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-14 16:44:37,043 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-14 16:44:37,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:37,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:37,044 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-14 16:44:37,044 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-14 16:44:37,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:37,046 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-14 16:44:37,047 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-14 16:44:37,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:37,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:37,047 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:44:37,048 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:44:37,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 16:44:37,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-14 16:44:37,050 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 14 [2018-11-14 16:44:37,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:44:37,050 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-14 16:44:37,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-14 16:44:37,050 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-14 16:44:37,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 16:44:37,051 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:44:37,051 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:44:37,052 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:44:37,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:44:37,052 INFO L82 PathProgramCache]: Analyzing trace with hash 322720209, now seen corresponding path program 2 times [2018-11-14 16:44:37,053 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:44:37,053 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:44:37,074 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 16:44:37,113 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:44:37,113 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:44:37,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:37,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:44:37,462 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:44:37,463 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:44:37,468 INFO L168 Benchmark]: Toolchain (without parser) took 5302.25 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 747.1 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -562.4 MB). Peak memory consumption was 184.7 MB. Max. memory is 7.1 GB. [2018-11-14 16:44:37,470 INFO L168 Benchmark]: CDTParser took 0.21 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:44:37,471 INFO L168 Benchmark]: CACSL2BoogieTranslator took 386.00 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:44:37,472 INFO L168 Benchmark]: Boogie Preprocessor took 34.75 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:44:37,472 INFO L168 Benchmark]: RCFGBuilder took 550.73 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 747.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -795.1 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2018-11-14 16:44:37,473 INFO L168 Benchmark]: TraceAbstraction took 4325.54 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 222.0 MB). Peak memory consumption was 222.0 MB. Max. memory is 7.1 GB. [2018-11-14 16:44:37,478 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 386.00 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 34.75 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 550.73 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 747.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -795.1 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4325.54 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 222.0 MB). Peak memory consumption was 222.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...