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_Default.epf -i ../../../trunk/examples/svcomp/loop-acceleration/underapprox_true-unreach-call2_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:08:35,368 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:08:35,371 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:08:35,384 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:08:35,384 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:08:35,385 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:08:35,387 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:08:35,389 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:08:35,394 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:08:35,395 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:08:35,398 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:08:35,399 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:08:35,400 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:08:35,401 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:08:35,402 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:08:35,403 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:08:35,404 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:08:35,406 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:08:35,411 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:08:35,414 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:08:35,416 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:08:35,417 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:08:35,420 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:08:35,424 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:08:35,425 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:08:35,426 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:08:35,427 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:08:35,427 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:08:35,431 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:08:35,432 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:08:35,432 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:08:35,434 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:08:35,434 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:08:35,435 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:08:35,436 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:08:35,436 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:08:35,437 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:08:35,464 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:08:35,465 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:08:35,466 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:08:35,466 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:08:35,466 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:08:35,467 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:08:35,467 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:08:35,467 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:08:35,467 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:08:35,467 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:08:35,468 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:08:35,468 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:08:35,468 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:08:35,468 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:08:35,468 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:08:35,469 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:08:35,469 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:08:35,469 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:08:35,469 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:08:35,469 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:08:35,470 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:08:35,470 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:08:35,470 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:08:35,470 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:08:35,470 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:08:35,472 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:08:35,472 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:08:35,472 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:08:35,472 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:08:35,473 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:08:35,473 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:08:35,526 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:08:35,545 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:08:35,551 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:08:35,553 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:08:35,553 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:08:35,554 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/underapprox_true-unreach-call2_true-termination.i [2018-11-23 13:08:35,635 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/515cfdbee/e566e462b7b34980ac4c380f381e5c63/FLAGdc4012e57 [2018-11-23 13:08:36,035 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:08:36,036 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/underapprox_true-unreach-call2_true-termination.i [2018-11-23 13:08:36,041 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/515cfdbee/e566e462b7b34980ac4c380f381e5c63/FLAGdc4012e57 [2018-11-23 13:08:36,442 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/515cfdbee/e566e462b7b34980ac4c380f381e5c63 [2018-11-23 13:08:36,451 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:08:36,453 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:08:36,454 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:08:36,454 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:08:36,458 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:08:36,459 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:08:36" (1/1) ... [2018-11-23 13:08:36,462 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70e19249 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:36, skipping insertion in model container [2018-11-23 13:08:36,463 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:08:36" (1/1) ... [2018-11-23 13:08:36,473 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:08:36,499 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:08:36,749 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:08:36,756 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:08:36,778 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:08:36,796 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:08:36,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:36 WrapperNode [2018-11-23 13:08:36,797 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:08:36,798 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:08:36,799 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:08:36,799 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:08:36,808 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:36" (1/1) ... [2018-11-23 13:08:36,814 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:36" (1/1) ... [2018-11-23 13:08:36,821 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:08:36,822 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:08:36,822 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:08:36,822 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:08:36,833 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:36" (1/1) ... [2018-11-23 13:08:36,833 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:36" (1/1) ... [2018-11-23 13:08:36,833 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:36" (1/1) ... [2018-11-23 13:08:36,834 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:36" (1/1) ... [2018-11-23 13:08:36,839 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:36" (1/1) ... [2018-11-23 13:08:36,844 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:36" (1/1) ... [2018-11-23 13:08:36,845 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:36" (1/1) ... [2018-11-23 13:08:36,847 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:08:36,847 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:08:36,848 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:08:36,848 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:08:36,849 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:36" (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 13:08:36,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:08:36,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:08:36,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:08:36,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:08:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:08:36,974 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:08:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:08:36,974 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:08:37,367 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:08:37,368 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:08:37,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:08:37 BoogieIcfgContainer [2018-11-23 13:08:37,369 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:08:37,369 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:08:37,370 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:08:37,372 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:08:37,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:08:36" (1/3) ... [2018-11-23 13:08:37,373 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40295aad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:08:37, skipping insertion in model container [2018-11-23 13:08:37,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:36" (2/3) ... [2018-11-23 13:08:37,374 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40295aad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:08:37, skipping insertion in model container [2018-11-23 13:08:37,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:08:37" (3/3) ... [2018-11-23 13:08:37,376 INFO L112 eAbstractionObserver]: Analyzing ICFG underapprox_true-unreach-call2_true-termination.i [2018-11-23 13:08:37,387 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:08:37,395 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:08:37,414 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:08:37,448 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:08:37,449 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:08:37,449 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:08:37,449 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:08:37,449 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:08:37,450 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:08:37,450 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:08:37,450 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:08:37,450 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:08:37,470 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-11-23 13:08:37,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 13:08:37,476 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:37,477 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:37,479 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:37,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:37,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1846144830, now seen corresponding path program 1 times [2018-11-23 13:08:37,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:37,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:37,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:37,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:08:37,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:37,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:37,824 INFO L256 TraceCheckUtils]: 0: Hoare triple {20#true} call ULTIMATE.init(); {20#true} is VALID [2018-11-23 13:08:37,828 INFO L273 TraceCheckUtils]: 1: Hoare triple {20#true} assume true; {20#true} is VALID [2018-11-23 13:08:37,829 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {20#true} {20#true} #31#return; {20#true} is VALID [2018-11-23 13:08:37,829 INFO L256 TraceCheckUtils]: 3: Hoare triple {20#true} call #t~ret1 := main(); {20#true} is VALID [2018-11-23 13:08:37,834 INFO L273 TraceCheckUtils]: 4: Hoare triple {20#true} ~x~0 := 0;~y~0 := 1; {22#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:37,835 INFO L273 TraceCheckUtils]: 5: Hoare triple {22#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(~x~0 % 4294967296 < 6); {21#false} is VALID [2018-11-23 13:08:37,836 INFO L256 TraceCheckUtils]: 6: Hoare triple {21#false} call __VERIFIER_assert((if 6 == ~x~0 % 4294967296 then 1 else 0)); {21#false} is VALID [2018-11-23 13:08:37,836 INFO L273 TraceCheckUtils]: 7: Hoare triple {21#false} ~cond := #in~cond; {21#false} is VALID [2018-11-23 13:08:37,837 INFO L273 TraceCheckUtils]: 8: Hoare triple {21#false} assume 0 == ~cond; {21#false} is VALID [2018-11-23 13:08:37,837 INFO L273 TraceCheckUtils]: 9: Hoare triple {21#false} assume !false; {21#false} is VALID [2018-11-23 13:08:37,840 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 13:08:37,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:08:37,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:08:37,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 13:08:37,852 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:37,855 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:08:37,909 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 13:08:37,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:08:37,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:08:37,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:08:37,922 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2018-11-23 13:08:38,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:38,354 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-11-23 13:08:38,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:08:38,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 13:08:38,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:38,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:08:38,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2018-11-23 13:08:38,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:08:38,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2018-11-23 13:08:38,371 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 34 transitions. [2018-11-23 13:08:38,599 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:38,609 INFO L225 Difference]: With dead ends: 29 [2018-11-23 13:08:38,609 INFO L226 Difference]: Without dead ends: 12 [2018-11-23 13:08:38,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:08:38,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-23 13:08:38,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-23 13:08:38,701 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:38,701 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2018-11-23 13:08:38,702 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 13:08:38,702 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 13:08:38,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:38,705 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-23 13:08:38,706 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 13:08:38,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:38,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:38,707 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 13:08:38,707 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 13:08:38,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:38,709 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-23 13:08:38,710 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 13:08:38,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:38,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:38,710 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:38,711 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:38,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:08:38,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-23 13:08:38,714 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-23 13:08:38,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:38,715 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-23 13:08:38,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:08:38,715 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 13:08:38,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 13:08:38,715 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:38,716 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:38,716 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:38,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:38,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1432376145, now seen corresponding path program 1 times [2018-11-23 13:08:38,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:38,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:38,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:38,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:08:38,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:38,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:38,988 INFO L256 TraceCheckUtils]: 0: Hoare triple {108#true} call ULTIMATE.init(); {108#true} is VALID [2018-11-23 13:08:38,989 INFO L273 TraceCheckUtils]: 1: Hoare triple {108#true} assume true; {108#true} is VALID [2018-11-23 13:08:38,989 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {108#true} {108#true} #31#return; {108#true} is VALID [2018-11-23 13:08:38,989 INFO L256 TraceCheckUtils]: 3: Hoare triple {108#true} call #t~ret1 := main(); {108#true} is VALID [2018-11-23 13:08:38,990 INFO L273 TraceCheckUtils]: 4: Hoare triple {108#true} ~x~0 := 0;~y~0 := 1; {110#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:38,992 INFO L273 TraceCheckUtils]: 5: Hoare triple {110#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; {111#(and (<= main_~x~0 1) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:08:38,993 INFO L273 TraceCheckUtils]: 6: Hoare triple {111#(and (<= main_~x~0 1) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 6); {109#false} is VALID [2018-11-23 13:08:38,993 INFO L256 TraceCheckUtils]: 7: Hoare triple {109#false} call __VERIFIER_assert((if 6 == ~x~0 % 4294967296 then 1 else 0)); {109#false} is VALID [2018-11-23 13:08:38,993 INFO L273 TraceCheckUtils]: 8: Hoare triple {109#false} ~cond := #in~cond; {109#false} is VALID [2018-11-23 13:08:38,994 INFO L273 TraceCheckUtils]: 9: Hoare triple {109#false} assume 0 == ~cond; {109#false} is VALID [2018-11-23 13:08:38,994 INFO L273 TraceCheckUtils]: 10: Hoare triple {109#false} assume !false; {109#false} is VALID [2018-11-23 13:08:38,996 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 13:08:38,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:08:38,997 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:08:39,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:08:39,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:39,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:39,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:08:39,121 INFO L256 TraceCheckUtils]: 0: Hoare triple {108#true} call ULTIMATE.init(); {108#true} is VALID [2018-11-23 13:08:39,122 INFO L273 TraceCheckUtils]: 1: Hoare triple {108#true} assume true; {108#true} is VALID [2018-11-23 13:08:39,122 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {108#true} {108#true} #31#return; {108#true} is VALID [2018-11-23 13:08:39,123 INFO L256 TraceCheckUtils]: 3: Hoare triple {108#true} call #t~ret1 := main(); {108#true} is VALID [2018-11-23 13:08:39,125 INFO L273 TraceCheckUtils]: 4: Hoare triple {108#true} ~x~0 := 0;~y~0 := 1; {110#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:39,127 INFO L273 TraceCheckUtils]: 5: Hoare triple {110#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; {130#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:08:39,128 INFO L273 TraceCheckUtils]: 6: Hoare triple {130#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !(~x~0 % 4294967296 < 6); {109#false} is VALID [2018-11-23 13:08:39,128 INFO L256 TraceCheckUtils]: 7: Hoare triple {109#false} call __VERIFIER_assert((if 6 == ~x~0 % 4294967296 then 1 else 0)); {109#false} is VALID [2018-11-23 13:08:39,128 INFO L273 TraceCheckUtils]: 8: Hoare triple {109#false} ~cond := #in~cond; {109#false} is VALID [2018-11-23 13:08:39,129 INFO L273 TraceCheckUtils]: 9: Hoare triple {109#false} assume 0 == ~cond; {109#false} is VALID [2018-11-23 13:08:39,129 INFO L273 TraceCheckUtils]: 10: Hoare triple {109#false} assume !false; {109#false} is VALID [2018-11-23 13:08:39,130 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 13:08:39,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:08:39,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 13:08:39,152 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-23 13:08:39,152 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:39,152 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:08:39,181 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:39,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:08:39,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:08:39,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:08:39,182 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 5 states. [2018-11-23 13:08:39,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:39,449 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-23 13:08:39,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:08:39,449 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-23 13:08:39,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:39,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:08:39,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-23 13:08:39,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:08:39,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-23 13:08:39,455 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 18 transitions. [2018-11-23 13:08:39,684 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:39,685 INFO L225 Difference]: With dead ends: 18 [2018-11-23 13:08:39,686 INFO L226 Difference]: Without dead ends: 13 [2018-11-23 13:08:39,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:08:39,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-23 13:08:39,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-23 13:08:39,712 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:39,713 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2018-11-23 13:08:39,713 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-23 13:08:39,713 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-23 13:08:39,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:39,715 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-23 13:08:39,715 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 13:08:39,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:39,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:39,716 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-23 13:08:39,716 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-23 13:08:39,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:39,718 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-23 13:08:39,718 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 13:08:39,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:39,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:39,719 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:39,719 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:39,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:08:39,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-23 13:08:39,720 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-11-23 13:08:39,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:39,721 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-11-23 13:08:39,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:08:39,721 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 13:08:39,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 13:08:39,721 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:39,722 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:39,722 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:39,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:39,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1490448798, now seen corresponding path program 2 times [2018-11-23 13:08:39,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:39,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:39,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:39,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:08:39,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:39,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:40,021 INFO L256 TraceCheckUtils]: 0: Hoare triple {222#true} call ULTIMATE.init(); {222#true} is VALID [2018-11-23 13:08:40,021 INFO L273 TraceCheckUtils]: 1: Hoare triple {222#true} assume true; {222#true} is VALID [2018-11-23 13:08:40,021 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {222#true} {222#true} #31#return; {222#true} is VALID [2018-11-23 13:08:40,022 INFO L256 TraceCheckUtils]: 3: Hoare triple {222#true} call #t~ret1 := main(); {222#true} is VALID [2018-11-23 13:08:40,022 INFO L273 TraceCheckUtils]: 4: Hoare triple {222#true} ~x~0 := 0;~y~0 := 1; {224#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:40,023 INFO L273 TraceCheckUtils]: 5: Hoare triple {224#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; {225#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:08:40,024 INFO L273 TraceCheckUtils]: 6: Hoare triple {225#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; {226#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:08:40,026 INFO L273 TraceCheckUtils]: 7: Hoare triple {226#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 6); {223#false} is VALID [2018-11-23 13:08:40,026 INFO L256 TraceCheckUtils]: 8: Hoare triple {223#false} call __VERIFIER_assert((if 6 == ~x~0 % 4294967296 then 1 else 0)); {223#false} is VALID [2018-11-23 13:08:40,027 INFO L273 TraceCheckUtils]: 9: Hoare triple {223#false} ~cond := #in~cond; {223#false} is VALID [2018-11-23 13:08:40,027 INFO L273 TraceCheckUtils]: 10: Hoare triple {223#false} assume 0 == ~cond; {223#false} is VALID [2018-11-23 13:08:40,028 INFO L273 TraceCheckUtils]: 11: Hoare triple {223#false} assume !false; {223#false} is VALID [2018-11-23 13:08:40,029 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:40,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:08:40,029 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:08:40,039 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:08:40,048 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:08:40,049 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:08:40,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:40,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:08:40,173 INFO L256 TraceCheckUtils]: 0: Hoare triple {222#true} call ULTIMATE.init(); {222#true} is VALID [2018-11-23 13:08:40,174 INFO L273 TraceCheckUtils]: 1: Hoare triple {222#true} assume true; {222#true} is VALID [2018-11-23 13:08:40,174 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {222#true} {222#true} #31#return; {222#true} is VALID [2018-11-23 13:08:40,175 INFO L256 TraceCheckUtils]: 3: Hoare triple {222#true} call #t~ret1 := main(); {222#true} is VALID [2018-11-23 13:08:40,176 INFO L273 TraceCheckUtils]: 4: Hoare triple {222#true} ~x~0 := 0;~y~0 := 1; {224#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:40,177 INFO L273 TraceCheckUtils]: 5: Hoare triple {224#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; {225#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:08:40,178 INFO L273 TraceCheckUtils]: 6: Hoare triple {225#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; {248#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:08:40,182 INFO L273 TraceCheckUtils]: 7: Hoare triple {248#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 6); {223#false} is VALID [2018-11-23 13:08:40,183 INFO L256 TraceCheckUtils]: 8: Hoare triple {223#false} call __VERIFIER_assert((if 6 == ~x~0 % 4294967296 then 1 else 0)); {223#false} is VALID [2018-11-23 13:08:40,183 INFO L273 TraceCheckUtils]: 9: Hoare triple {223#false} ~cond := #in~cond; {223#false} is VALID [2018-11-23 13:08:40,183 INFO L273 TraceCheckUtils]: 10: Hoare triple {223#false} assume 0 == ~cond; {223#false} is VALID [2018-11-23 13:08:40,184 INFO L273 TraceCheckUtils]: 11: Hoare triple {223#false} assume !false; {223#false} is VALID [2018-11-23 13:08:40,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:40,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:08:40,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 13:08:40,204 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-23 13:08:40,204 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:40,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:08:40,220 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:40,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:08:40,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:08:40,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:08:40,221 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 6 states. [2018-11-23 13:08:40,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:40,373 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-23 13:08:40,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:08:40,374 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-23 13:08:40,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:40,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:08:40,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-11-23 13:08:40,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:08:40,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-11-23 13:08:40,379 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 19 transitions. [2018-11-23 13:08:40,421 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:40,422 INFO L225 Difference]: With dead ends: 19 [2018-11-23 13:08:40,422 INFO L226 Difference]: Without dead ends: 14 [2018-11-23 13:08:40,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:08:40,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-23 13:08:40,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-23 13:08:40,449 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:40,449 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-23 13:08:40,449 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 13:08:40,449 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 13:08:40,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:40,450 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-23 13:08:40,451 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 13:08:40,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:40,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:40,451 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 13:08:40,451 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 13:08:40,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:40,453 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-23 13:08:40,453 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 13:08:40,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:40,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:40,454 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:40,454 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:40,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:08:40,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-23 13:08:40,456 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-11-23 13:08:40,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:40,456 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-23 13:08:40,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:08:40,456 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 13:08:40,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 13:08:40,457 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:40,457 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:40,457 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:40,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:40,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1004266255, now seen corresponding path program 3 times [2018-11-23 13:08:40,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:40,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:40,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:40,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:08:40,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:40,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:40,699 INFO L256 TraceCheckUtils]: 0: Hoare triple {346#true} call ULTIMATE.init(); {346#true} is VALID [2018-11-23 13:08:40,699 INFO L273 TraceCheckUtils]: 1: Hoare triple {346#true} assume true; {346#true} is VALID [2018-11-23 13:08:40,699 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {346#true} {346#true} #31#return; {346#true} is VALID [2018-11-23 13:08:40,700 INFO L256 TraceCheckUtils]: 3: Hoare triple {346#true} call #t~ret1 := main(); {346#true} is VALID [2018-11-23 13:08:40,700 INFO L273 TraceCheckUtils]: 4: Hoare triple {346#true} ~x~0 := 0;~y~0 := 1; {348#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:40,701 INFO L273 TraceCheckUtils]: 5: Hoare triple {348#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; {349#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:08:40,705 INFO L273 TraceCheckUtils]: 6: Hoare triple {349#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; {350#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:08:40,706 INFO L273 TraceCheckUtils]: 7: Hoare triple {350#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; {351#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:08:40,707 INFO L273 TraceCheckUtils]: 8: Hoare triple {351#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 6); {347#false} is VALID [2018-11-23 13:08:40,707 INFO L256 TraceCheckUtils]: 9: Hoare triple {347#false} call __VERIFIER_assert((if 6 == ~x~0 % 4294967296 then 1 else 0)); {347#false} is VALID [2018-11-23 13:08:40,708 INFO L273 TraceCheckUtils]: 10: Hoare triple {347#false} ~cond := #in~cond; {347#false} is VALID [2018-11-23 13:08:40,708 INFO L273 TraceCheckUtils]: 11: Hoare triple {347#false} assume 0 == ~cond; {347#false} is VALID [2018-11-23 13:08:40,708 INFO L273 TraceCheckUtils]: 12: Hoare triple {347#false} assume !false; {347#false} is VALID [2018-11-23 13:08:40,709 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:40,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:08:40,709 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:08:40,719 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:08:40,728 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 13:08:40,728 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:08:40,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:40,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:08:40,907 INFO L256 TraceCheckUtils]: 0: Hoare triple {346#true} call ULTIMATE.init(); {346#true} is VALID [2018-11-23 13:08:40,907 INFO L273 TraceCheckUtils]: 1: Hoare triple {346#true} assume true; {346#true} is VALID [2018-11-23 13:08:40,908 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {346#true} {346#true} #31#return; {346#true} is VALID [2018-11-23 13:08:40,908 INFO L256 TraceCheckUtils]: 3: Hoare triple {346#true} call #t~ret1 := main(); {346#true} is VALID [2018-11-23 13:08:40,908 INFO L273 TraceCheckUtils]: 4: Hoare triple {346#true} ~x~0 := 0;~y~0 := 1; {346#true} is VALID [2018-11-23 13:08:40,908 INFO L273 TraceCheckUtils]: 5: Hoare triple {346#true} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; {346#true} is VALID [2018-11-23 13:08:40,909 INFO L273 TraceCheckUtils]: 6: Hoare triple {346#true} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; {346#true} is VALID [2018-11-23 13:08:40,910 INFO L273 TraceCheckUtils]: 7: Hoare triple {346#true} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0;~y~0 := 2 * ~y~0; {376#(< (mod (+ main_~x~0 4294967295) 4294967296) 6)} is VALID [2018-11-23 13:08:40,910 INFO L273 TraceCheckUtils]: 8: Hoare triple {376#(< (mod (+ main_~x~0 4294967295) 4294967296) 6)} assume !(~x~0 % 4294967296 < 6); {380#(and (< (mod (+ main_~x~0 4294967295) 4294967296) 6) (<= 6 (mod main_~x~0 4294967296)))} is VALID [2018-11-23 13:08:40,912 INFO L256 TraceCheckUtils]: 9: Hoare triple {380#(and (< (mod (+ main_~x~0 4294967295) 4294967296) 6) (<= 6 (mod main_~x~0 4294967296)))} call __VERIFIER_assert((if 6 == ~x~0 % 4294967296 then 1 else 0)); {384#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:08:40,916 INFO L273 TraceCheckUtils]: 10: Hoare triple {384#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {388#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:08:40,917 INFO L273 TraceCheckUtils]: 11: Hoare triple {388#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {347#false} is VALID [2018-11-23 13:08:40,917 INFO L273 TraceCheckUtils]: 12: Hoare triple {347#false} assume !false; {347#false} is VALID [2018-11-23 13:08:40,918 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 13:08:40,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:08:40,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-11-23 13:08:40,938 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2018-11-23 13:08:40,939 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:40,939 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 13:08:40,976 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-23 13:08:40,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 13:08:40,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 13:08:40,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:08:40,977 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 10 states. [2018-11-23 13:08:41,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:41,301 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-23 13:08:41,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 13:08:41,301 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2018-11-23 13:08:41,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:41,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:08:41,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 19 transitions. [2018-11-23 13:08:41,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:08:41,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 19 transitions. [2018-11-23 13:08:41,306 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 19 transitions. [2018-11-23 13:08:41,367 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:41,367 INFO L225 Difference]: With dead ends: 18 [2018-11-23 13:08:41,367 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 13:08:41,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:08:41,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 13:08:41,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 13:08:41,369 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:41,369 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 13:08:41,369 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:08:41,369 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:08:41,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:41,370 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:08:41,370 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:08:41,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:41,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:41,370 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:08:41,370 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:08:41,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:41,371 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:08:41,371 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:08:41,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:41,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:41,371 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:41,371 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:41,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 13:08:41,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 13:08:41,372 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2018-11-23 13:08:41,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:41,372 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:08:41,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 13:08:41,372 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:08:41,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:41,377 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 13:08:41,549 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 13:08:41,549 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:08:41,549 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:08:41,550 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 13:08:41,550 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:08:41,550 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:08:41,550 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 8 16) the Hoare annotation is: true [2018-11-23 13:08:41,550 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 8 16) no Hoare annotation was computed. [2018-11-23 13:08:41,550 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 8 16) no Hoare annotation was computed. [2018-11-23 13:08:41,551 INFO L444 ceAbstractionStarter]: At program point L11-2(lines 11 14) the Hoare annotation is: (or (and (<= main_~x~0 0) (<= 0 main_~x~0)) (< (mod (+ main_~x~0 4294967295) 4294967296) 6)) [2018-11-23 13:08:41,551 INFO L444 ceAbstractionStarter]: At program point L11-3(lines 11 14) the Hoare annotation is: (and (< (mod (+ main_~x~0 4294967295) 4294967296) 6) (<= 6 (mod main_~x~0 4294967296))) [2018-11-23 13:08:41,551 INFO L448 ceAbstractionStarter]: For program point L3-2(lines 2 7) no Hoare annotation was computed. [2018-11-23 13:08:41,551 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 2 7) the Hoare annotation is: true [2018-11-23 13:08:41,551 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 2 7) no Hoare annotation was computed. [2018-11-23 13:08:41,552 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2018-11-23 13:08:41,552 INFO L448 ceAbstractionStarter]: For program point L4(line 4) no Hoare annotation was computed. [2018-11-23 13:08:41,552 INFO L448 ceAbstractionStarter]: For program point L3(lines 3 5) no Hoare annotation was computed. [2018-11-23 13:08:41,553 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:08:41,554 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-23 13:08:41,554 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:08:41,554 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:08:41,558 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-23 13:08:41,558 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-23 13:08:41,558 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:08:41,558 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:08:41,559 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:08:41,559 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:08:41,559 WARN L170 areAnnotationChecker]: L3-2 has no Hoare annotation [2018-11-23 13:08:41,559 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:08:41,559 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:08:41,560 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 13:08:41,560 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 13:08:41,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:08:41 BoogieIcfgContainer [2018-11-23 13:08:41,570 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:08:41,571 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:08:41,571 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:08:41,571 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:08:41,572 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:08:37" (3/4) ... [2018-11-23 13:08:41,575 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 13:08:41,581 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 13:08:41,581 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 13:08:41,582 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 13:08:41,586 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-23 13:08:41,586 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-23 13:08:41,586 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 13:08:41,625 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loop-acceleration/underapprox_true-unreach-call2_true-termination.i-witness.graphml [2018-11-23 13:08:41,625 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:08:41,626 INFO L168 Benchmark]: Toolchain (without parser) took 5174.44 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 733.0 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -552.0 MB). Peak memory consumption was 180.9 MB. Max. memory is 7.1 GB. [2018-11-23 13:08:41,628 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:08:41,629 INFO L168 Benchmark]: CACSL2BoogieTranslator took 344.14 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 13:08:41,630 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.19 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 13:08:41,630 INFO L168 Benchmark]: Boogie Preprocessor took 25.36 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 13:08:41,631 INFO L168 Benchmark]: RCFGBuilder took 521.32 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 733.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -786.9 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2018-11-23 13:08:41,632 INFO L168 Benchmark]: TraceAbstraction took 4200.74 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: 224.3 MB). Peak memory consumption was 224.3 MB. Max. memory is 7.1 GB. [2018-11-23 13:08:41,633 INFO L168 Benchmark]: Witness Printer took 54.68 ms. Allocated memory is still 2.3 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:08:41,637 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 344.14 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 23.19 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 25.36 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 521.32 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 733.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -786.9 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4200.74 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: 224.3 MB). Peak memory consumption was 224.3 MB. Max. memory is 7.1 GB. * Witness Printer took 54.68 ms. Allocated memory is still 2.3 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: 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: 11]: Loop Invariant Derived loop invariant: (x <= 0 && 0 <= x) || (x + 4294967295) % 4294967296 < 6 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 17 locations, 1 error locations. SAFE Result, 4.1s OverallTime, 4 OverallIterations, 3 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 42 SDtfs, 2 SDslu, 88 SDs, 0 SdLazy, 60 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 31 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.7s 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.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 11 PreInvPairs, 16 NumberOfFragments, 33 HoareAnnotationTreeSize, 11 FomulaSimplifications, 18 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 14 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 82 NumberOfCodeBlocks, 81 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 2185 SizeOfPredicates, 2 NumberOfNonLiveVariables, 97 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 7 InterpolantComputations, 2 PerfectInterpolantSequences, 6/20 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...