java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/loop-acceleration/simple_true-unreach-call3_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:30:38,352 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:30:38,354 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:30:38,367 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:30:38,367 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:30:38,368 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:30:38,370 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:30:38,372 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:30:38,373 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:30:38,374 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:30:38,375 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:30:38,375 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:30:38,376 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:30:38,378 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:30:38,379 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:30:38,379 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:30:38,380 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:30:38,382 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:30:38,384 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:30:38,386 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:30:38,387 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:30:38,388 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:30:38,391 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:30:38,391 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:30:38,391 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:30:38,392 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:30:38,393 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:30:38,394 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:30:38,395 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:30:38,396 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:30:38,396 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:30:38,397 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:30:38,397 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:30:38,398 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:30:38,399 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:30:38,399 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:30:38,400 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 11:30:38,424 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:30:38,425 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:30:38,426 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:30:38,426 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:30:38,427 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:30:38,427 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:30:38,428 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:30:38,429 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:30:38,429 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:30:38,429 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:30:38,429 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:30:38,429 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:30:38,430 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:30:38,430 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:30:38,430 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:30:38,430 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:30:38,430 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:30:38,431 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:30:38,431 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:30:38,431 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:30:38,431 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:30:38,431 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:30:38,432 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:30:38,432 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:30:38,432 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:30:38,432 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:30:38,432 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:30:38,433 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:30:38,434 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:30:38,434 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:30:38,434 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:30:38,434 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:30:38,435 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:30:38,486 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:30:38,499 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:30:38,503 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:30:38,505 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:30:38,505 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:30:38,506 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/simple_true-unreach-call3_true-termination.i [2018-11-23 11:30:38,573 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4983a2d0/b68724d2fd104cacad93b8278943ee90/FLAGb31a2b340 [2018-11-23 11:30:38,999 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:30:39,000 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/simple_true-unreach-call3_true-termination.i [2018-11-23 11:30:39,006 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4983a2d0/b68724d2fd104cacad93b8278943ee90/FLAGb31a2b340 [2018-11-23 11:30:39,374 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4983a2d0/b68724d2fd104cacad93b8278943ee90 [2018-11-23 11:30:39,385 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:30:39,386 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:30:39,387 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:30:39,388 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:30:39,391 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:30:39,393 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:30:39" (1/1) ... [2018-11-23 11:30:39,396 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@680fc3de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:39, skipping insertion in model container [2018-11-23 11:30:39,397 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:30:39" (1/1) ... [2018-11-23 11:30:39,408 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:30:39,432 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:30:39,700 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:30:39,705 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:30:39,724 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:30:39,742 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:30:39,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:39 WrapperNode [2018-11-23 11:30:39,743 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:30:39,744 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:30:39,745 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:30:39,745 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:30:39,756 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:39" (1/1) ... [2018-11-23 11:30:39,764 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:39" (1/1) ... [2018-11-23 11:30:39,772 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:30:39,772 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:30:39,772 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:30:39,773 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:30:39,785 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:39" (1/1) ... [2018-11-23 11:30:39,785 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:39" (1/1) ... [2018-11-23 11:30:39,786 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:39" (1/1) ... [2018-11-23 11:30:39,786 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:39" (1/1) ... [2018-11-23 11:30:39,798 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:39" (1/1) ... [2018-11-23 11:30:39,804 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:39" (1/1) ... [2018-11-23 11:30:39,806 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:39" (1/1) ... [2018-11-23 11:30:39,809 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:30:39,809 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:30:39,809 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:30:39,810 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:30:39,811 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:30:39,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:30:39,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:30:39,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:30:39,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:30:39,989 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:30:39,989 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:30:39,989 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:30:39,990 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:30:40,416 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:30:40,417 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 11:30:40,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:30:40 BoogieIcfgContainer [2018-11-23 11:30:40,417 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:30:40,419 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:30:40,419 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:30:40,422 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:30:40,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:30:39" (1/3) ... [2018-11-23 11:30:40,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60d9c8cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:30:40, skipping insertion in model container [2018-11-23 11:30:40,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:39" (2/3) ... [2018-11-23 11:30:40,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60d9c8cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:30:40, skipping insertion in model container [2018-11-23 11:30:40,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:30:40" (3/3) ... [2018-11-23 11:30:40,427 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_true-unreach-call3_true-termination.i [2018-11-23 11:30:40,438 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:30:40,446 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:30:40,465 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:30:40,495 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:30:40,496 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:30:40,496 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:30:40,496 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:30:40,497 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:30:40,497 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:30:40,497 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:30:40,497 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:30:40,497 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:30:40,514 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-11-23 11:30:40,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 11:30:40,522 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:30:40,523 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:30:40,526 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:30:40,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:30:40,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1846144830, now seen corresponding path program 1 times [2018-11-23 11:30:40,535 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:30:40,536 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:30:40,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:30:40,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:30:40,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:30:40,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:30:40,824 INFO L256 TraceCheckUtils]: 0: Hoare triple {20#true} call ULTIMATE.init(); {20#true} is VALID [2018-11-23 11:30:40,827 INFO L273 TraceCheckUtils]: 1: Hoare triple {20#true} assume true; {20#true} is VALID [2018-11-23 11:30:40,828 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {20#true} {20#true} #31#return; {20#true} is VALID [2018-11-23 11:30:40,829 INFO L256 TraceCheckUtils]: 3: Hoare triple {20#true} call #t~ret1 := main(); {20#true} is VALID [2018-11-23 11:30:40,830 INFO L273 TraceCheckUtils]: 4: Hoare triple {20#true} ~x~0 := 0bv32;~N~0 := #t~nondet0[16:0];havoc #t~nondet0; {37#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:30:40,831 INFO L273 TraceCheckUtils]: 5: Hoare triple {37#(= main_~x~0 (_ bv0 32))} assume !~bvult32(~x~0, ~zero_extendFrom16To32(~N~0)); {37#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:30:40,832 INFO L256 TraceCheckUtils]: 6: Hoare triple {37#(= main_~x~0 (_ bv0 32))} call __VERIFIER_assert((if 0bv32 == ~bvurem32(~x~0, 2bv32) then 1bv32 else 0bv32)); {44#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:40,834 INFO L273 TraceCheckUtils]: 7: Hoare triple {44#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {48#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:40,835 INFO L273 TraceCheckUtils]: 8: Hoare triple {48#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {21#false} is VALID [2018-11-23 11:30:40,836 INFO L273 TraceCheckUtils]: 9: Hoare triple {21#false} assume !false; {21#false} is VALID [2018-11-23 11:30:40,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:30:40,839 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:30:40,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:30:40,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:30:40,850 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-11-23 11:30:40,859 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:30:40,863 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:30:40,902 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:30:40,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:30:40,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:30:40,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:30:40,913 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 5 states. [2018-11-23 11:30:41,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:41,481 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2018-11-23 11:30:41,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:30:41,481 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-11-23 11:30:41,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:30:41,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:30:41,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2018-11-23 11:30:41,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:30:41,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2018-11-23 11:30:41,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 43 transitions. [2018-11-23 11:30:41,676 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:30:41,687 INFO L225 Difference]: With dead ends: 36 [2018-11-23 11:30:41,687 INFO L226 Difference]: Without dead ends: 12 [2018-11-23 11:30:41,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:30:41,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-23 11:30:41,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-23 11:30:41,751 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:30:41,751 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2018-11-23 11:30:41,752 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 11:30:41,753 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 11:30:41,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:41,756 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-23 11:30:41,756 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 11:30:41,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:30:41,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:30:41,757 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 11:30:41,757 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 11:30:41,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:41,759 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-23 11:30:41,759 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 11:30:41,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:30:41,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:30:41,760 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:30:41,761 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:30:41,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:30:41,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-23 11:30:41,764 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-23 11:30:41,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:30:41,765 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-23 11:30:41,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:30:41,765 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 11:30:41,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 11:30:41,766 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:30:41,766 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:30:41,766 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:30:41,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:30:41,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1432376145, now seen corresponding path program 1 times [2018-11-23 11:30:41,767 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:30:41,768 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:30:41,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:30:41,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:30:41,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:30:41,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:30:41,923 INFO L256 TraceCheckUtils]: 0: Hoare triple {148#true} call ULTIMATE.init(); {148#true} is VALID [2018-11-23 11:30:41,924 INFO L273 TraceCheckUtils]: 1: Hoare triple {148#true} assume true; {148#true} is VALID [2018-11-23 11:30:41,924 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {148#true} {148#true} #31#return; {148#true} is VALID [2018-11-23 11:30:41,924 INFO L256 TraceCheckUtils]: 3: Hoare triple {148#true} call #t~ret1 := main(); {148#true} is VALID [2018-11-23 11:30:41,927 INFO L273 TraceCheckUtils]: 4: Hoare triple {148#true} ~x~0 := 0bv32;~N~0 := #t~nondet0[16:0];havoc #t~nondet0; {165#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:30:41,929 INFO L273 TraceCheckUtils]: 5: Hoare triple {165#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~x~0, ~zero_extendFrom16To32(~N~0));~x~0 := ~bvadd32(2bv32, ~x~0); {169#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:41,929 INFO L273 TraceCheckUtils]: 6: Hoare triple {169#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} assume !~bvult32(~x~0, ~zero_extendFrom16To32(~N~0)); {169#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:41,931 INFO L256 TraceCheckUtils]: 7: Hoare triple {169#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} call __VERIFIER_assert((if 0bv32 == ~bvurem32(~x~0, 2bv32) then 1bv32 else 0bv32)); {176#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:41,935 INFO L273 TraceCheckUtils]: 8: Hoare triple {176#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {180#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:41,936 INFO L273 TraceCheckUtils]: 9: Hoare triple {180#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {149#false} is VALID [2018-11-23 11:30:41,936 INFO L273 TraceCheckUtils]: 10: Hoare triple {149#false} assume !false; {149#false} is VALID [2018-11-23 11:30:41,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:30:41,938 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:30:42,558 INFO L273 TraceCheckUtils]: 10: Hoare triple {149#false} assume !false; {149#false} is VALID [2018-11-23 11:30:42,559 INFO L273 TraceCheckUtils]: 9: Hoare triple {190#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {149#false} is VALID [2018-11-23 11:30:42,569 INFO L273 TraceCheckUtils]: 8: Hoare triple {194#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {190#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:30:42,572 INFO L256 TraceCheckUtils]: 7: Hoare triple {198#(= (_ bv0 32) (bvurem main_~x~0 (_ bv2 32)))} call __VERIFIER_assert((if 0bv32 == ~bvurem32(~x~0, 2bv32) then 1bv32 else 0bv32)); {194#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:30:42,579 INFO L273 TraceCheckUtils]: 6: Hoare triple {198#(= (_ bv0 32) (bvurem main_~x~0 (_ bv2 32)))} assume !~bvult32(~x~0, ~zero_extendFrom16To32(~N~0)); {198#(= (_ bv0 32) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:30:42,586 INFO L273 TraceCheckUtils]: 5: Hoare triple {198#(= (_ bv0 32) (bvurem main_~x~0 (_ bv2 32)))} assume !!~bvult32(~x~0, ~zero_extendFrom16To32(~N~0));~x~0 := ~bvadd32(2bv32, ~x~0); {198#(= (_ bv0 32) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:30:42,591 INFO L273 TraceCheckUtils]: 4: Hoare triple {148#true} ~x~0 := 0bv32;~N~0 := #t~nondet0[16:0];havoc #t~nondet0; {198#(= (_ bv0 32) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-23 11:30:42,591 INFO L256 TraceCheckUtils]: 3: Hoare triple {148#true} call #t~ret1 := main(); {148#true} is VALID [2018-11-23 11:30:42,591 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {148#true} {148#true} #31#return; {148#true} is VALID [2018-11-23 11:30:42,592 INFO L273 TraceCheckUtils]: 1: Hoare triple {148#true} assume true; {148#true} is VALID [2018-11-23 11:30:42,592 INFO L256 TraceCheckUtils]: 0: Hoare triple {148#true} call ULTIMATE.init(); {148#true} is VALID [2018-11-23 11:30:42,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:30:42,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 11:30:42,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2018-11-23 11:30:42,598 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2018-11-23 11:30:42,598 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:30:42,599 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:30:42,645 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:30:42,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:30:42,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:30:42,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:30:42,646 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 9 states. [2018-11-23 11:30:43,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:43,030 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2018-11-23 11:30:43,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:30:43,030 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2018-11-23 11:30:43,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:30:43,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:30:43,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2018-11-23 11:30:43,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:30:43,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2018-11-23 11:30:43,035 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 15 transitions. [2018-11-23 11:30:43,080 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:30:43,081 INFO L225 Difference]: With dead ends: 14 [2018-11-23 11:30:43,081 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 11:30:43,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:30:43,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 11:30:43,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 11:30:43,083 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:30:43,083 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 11:30:43,083 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:30:43,083 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:30:43,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:43,084 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:30:43,084 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:30:43,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:30:43,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:30:43,084 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:30:43,084 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:30:43,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:43,085 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:30:43,085 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:30:43,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:30:43,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:30:43,085 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:30:43,085 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:30:43,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 11:30:43,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 11:30:43,086 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2018-11-23 11:30:43,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:30:43,086 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 11:30:43,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:30:43,086 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:30:43,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:30:43,091 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 11:30:43,397 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 5 [2018-11-23 11:30:43,415 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 11:30:43,416 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:30:43,416 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:30:43,416 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 11:30:43,416 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 11:30:43,416 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 11:30:43,417 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 9 16) the Hoare annotation is: true [2018-11-23 11:30:43,417 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 9 16) no Hoare annotation was computed. [2018-11-23 11:30:43,417 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 9 16) no Hoare annotation was computed. [2018-11-23 11:30:43,417 INFO L444 ceAbstractionStarter]: At program point L12-2(lines 12 14) the Hoare annotation is: (= (_ bv0 32) (bvurem main_~x~0 (_ bv2 32))) [2018-11-23 11:30:43,417 INFO L444 ceAbstractionStarter]: At program point L12-3(lines 12 14) the Hoare annotation is: (= (_ bv0 32) (bvurem main_~x~0 (_ bv2 32))) [2018-11-23 11:30:43,418 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-23 11:30:43,418 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-23 11:30:43,418 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-23 11:30:43,418 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-23 11:30:43,418 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-23 11:30:43,418 INFO L448 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-23 11:30:43,420 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:30:43,421 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:30:43,421 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:30:43,421 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:30:43,423 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:30:43,423 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:30:43,423 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:30:43,423 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:30:43,423 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 11:30:43,424 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 11:30:43,424 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-23 11:30:43,424 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:30:43,424 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 11:30:43,424 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 11:30:43,424 INFO L163 areAnnotationChecker]: CFG has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 11:30:43,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:30:43 BoogieIcfgContainer [2018-11-23 11:30:43,434 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 11:30:43,435 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:30:43,435 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:30:43,435 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:30:43,436 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:30:40" (3/4) ... [2018-11-23 11:30:43,440 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 11:30:43,448 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 11:30:43,448 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 11:30:43,448 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 11:30:43,453 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-23 11:30:43,453 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 11:30:43,453 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 11:30:43,497 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loop-acceleration/simple_true-unreach-call3_true-termination.i-witness.graphml [2018-11-23 11:30:43,497 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:30:43,499 INFO L168 Benchmark]: Toolchain (without parser) took 4112.98 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.4 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -631.3 MB). Peak memory consumption was 100.1 MB. Max. memory is 7.1 GB. [2018-11-23 11:30:43,500 INFO L168 Benchmark]: CDTParser took 0.23 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-23 11:30:43,500 INFO L168 Benchmark]: CACSL2BoogieTranslator took 356.46 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-23 11:30:43,501 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.49 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-23 11:30:43,502 INFO L168 Benchmark]: Boogie Preprocessor took 36.79 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-23 11:30:43,502 INFO L168 Benchmark]: RCFGBuilder took 608.42 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -780.8 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2018-11-23 11:30:43,503 INFO L168 Benchmark]: TraceAbstraction took 3015.83 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 125.4 MB). Peak memory consumption was 125.4 MB. Max. memory is 7.1 GB. [2018-11-23 11:30:43,504 INFO L168 Benchmark]: Witness Printer took 62.62 ms. Allocated memory is still 2.3 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:30:43,508 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.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 356.46 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 Procedure Inliner took 27.49 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. * Boogie Preprocessor took 36.79 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 608.42 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -780.8 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3015.83 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 125.4 MB). Peak memory consumption was 125.4 MB. Max. memory is 7.1 GB. * Witness Printer took 62.62 ms. Allocated memory is still 2.3 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: 0bv32 == ~bvurem32(x, 2bv32) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 17 locations, 1 error locations. SAFE Result, 2.9s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 19 SDtfs, 7 SDslu, 69 SDs, 0 SdLazy, 44 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 10 PreInvPairs, 15 NumberOfFragments, 15 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 18 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 29 ConstructedInterpolants, 0 QuantifiedInterpolants, 749 SizeOfPredicates, 4 NumberOfNonLiveVariables, 40 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 1/2 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...