./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/termination-crafted-lit/HeizmannHoenickeLeikePodelski-ATVA2013-Fig1_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/termination-crafted-lit/HeizmannHoenickeLeikePodelski-ATVA2013-Fig1_true-termination_true-no-overflow.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 0564e568992a96ba006237c1af458e049de52506 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:08:11,595 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:08:11,597 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:08:11,609 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:08:11,609 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:08:11,611 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:08:11,612 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:08:11,614 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:08:11,618 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:08:11,619 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:08:11,620 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:08:11,620 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:08:11,627 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:08:11,630 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:08:11,631 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:08:11,632 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:08:11,633 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:08:11,634 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:08:11,636 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:08:11,638 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:08:11,639 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:08:11,641 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:08:11,643 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:08:11,644 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:08:11,644 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:08:11,645 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:08:11,646 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:08:11,647 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:08:11,648 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:08:11,650 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:08:11,650 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:08:11,651 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:08:11,651 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:08:11,651 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:08:11,652 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:08:11,653 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:08:11,654 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2018-11-28 23:08:11,685 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:08:11,687 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:08:11,688 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 23:08:11,688 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 23:08:11,688 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:08:11,690 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:08:11,691 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:08:11,691 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:08:11,691 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:08:11,691 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:08:11,692 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:08:11,693 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 23:08:11,693 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 23:08:11,693 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 23:08:11,693 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-28 23:08:11,694 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:08:11,694 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:08:11,694 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 23:08:11,694 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:08:11,694 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:08:11,695 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 23:08:11,698 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 23:08:11,698 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 23:08:11,698 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:08:11,698 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 23:08:11,698 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 23:08:11,698 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:08:11,700 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 23:08:11,700 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 23:08:11,700 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0564e568992a96ba006237c1af458e049de52506 [2018-11-28 23:08:11,760 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:08:11,782 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:08:11,789 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:08:11,791 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:08:11,791 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:08:11,792 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted-lit/HeizmannHoenickeLeikePodelski-ATVA2013-Fig1_true-termination_true-no-overflow.c [2018-11-28 23:08:11,855 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8458751e4/bc677197863b4b09a7f8a433ba082991/FLAG94e7ad0c6 [2018-11-28 23:08:12,352 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:08:12,353 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted-lit/HeizmannHoenickeLeikePodelski-ATVA2013-Fig1_true-termination_true-no-overflow.c [2018-11-28 23:08:12,359 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8458751e4/bc677197863b4b09a7f8a433ba082991/FLAG94e7ad0c6 [2018-11-28 23:08:12,707 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8458751e4/bc677197863b4b09a7f8a433ba082991 [2018-11-28 23:08:12,710 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:08:12,712 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:08:12,713 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:08:12,713 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:08:12,717 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:08:12,718 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:08:12" (1/1) ... [2018-11-28 23:08:12,722 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ad04fd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:08:12, skipping insertion in model container [2018-11-28 23:08:12,722 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:08:12" (1/1) ... [2018-11-28 23:08:12,731 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:08:12,753 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:08:12,992 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:08:12,997 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:08:13,016 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:08:13,030 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:08:13,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:08:13 WrapperNode [2018-11-28 23:08:13,031 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:08:13,032 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:08:13,032 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:08:13,032 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:08:13,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:08:13" (1/1) ... [2018-11-28 23:08:13,048 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:08:13" (1/1) ... [2018-11-28 23:08:13,056 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:08:13,056 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:08:13,056 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:08:13,056 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:08:13,068 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:08:13" (1/1) ... [2018-11-28 23:08:13,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:08:13" (1/1) ... [2018-11-28 23:08:13,069 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:08:13" (1/1) ... [2018-11-28 23:08:13,069 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:08:13" (1/1) ... [2018-11-28 23:08:13,076 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:08:13" (1/1) ... [2018-11-28 23:08:13,082 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:08:13" (1/1) ... [2018-11-28 23:08:13,083 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:08:13" (1/1) ... [2018-11-28 23:08:13,085 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:08:13,085 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:08:13,085 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:08:13,086 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:08:13,087 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:08:13" (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-28 23:08:13,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 23:08:13,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 23:08:13,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:08:13,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:08:13,227 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 23:08:13,227 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 23:08:13,518 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:08:13,519 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-28 23:08:13,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:08:13 BoogieIcfgContainer [2018-11-28 23:08:13,520 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:08:13,521 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 23:08:13,521 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 23:08:13,525 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 23:08:13,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:08:12" (1/3) ... [2018-11-28 23:08:13,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40b8d813 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:08:13, skipping insertion in model container [2018-11-28 23:08:13,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:08:13" (2/3) ... [2018-11-28 23:08:13,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40b8d813 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:08:13, skipping insertion in model container [2018-11-28 23:08:13,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:08:13" (3/3) ... [2018-11-28 23:08:13,530 INFO L112 eAbstractionObserver]: Analyzing ICFG HeizmannHoenickeLeikePodelski-ATVA2013-Fig1_true-termination_true-no-overflow.c [2018-11-28 23:08:13,541 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 23:08:13,550 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-11-28 23:08:13,567 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2018-11-28 23:08:13,597 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:08:13,597 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 23:08:13,597 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 23:08:13,598 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 23:08:13,598 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:08:13,598 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:08:13,598 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 23:08:13,598 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:08:13,598 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 23:08:13,618 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-28 23:08:13,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-28 23:08:13,624 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:08:13,626 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:08:13,628 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:08:13,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:08:13,635 INFO L82 PathProgramCache]: Analyzing trace with hash -37667266, now seen corresponding path program 1 times [2018-11-28 23:08:13,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:08:13,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:08:13,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:08:13,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:08:13,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:08:13,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:08:13,850 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-28 23:08:13,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:08:13,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:08:13,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 23:08:13,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:08:13,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:08:13,895 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2018-11-28 23:08:14,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:08:14,077 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-11-28 23:08:14,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:08:14,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-28 23:08:14,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:08:14,089 INFO L225 Difference]: With dead ends: 31 [2018-11-28 23:08:14,089 INFO L226 Difference]: Without dead ends: 17 [2018-11-28 23:08:14,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:08:14,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-28 23:08:14,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-11-28 23:08:14,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-28 23:08:14,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-11-28 23:08:14,135 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 7 [2018-11-28 23:08:14,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:08:14,136 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-11-28 23:08:14,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 23:08:14,136 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-28 23:08:14,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-28 23:08:14,137 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:08:14,137 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:08:14,137 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:08:14,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:08:14,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1167685199, now seen corresponding path program 1 times [2018-11-28 23:08:14,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:08:14,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:08:14,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:08:14,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:08:14,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:08:14,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:08:14,251 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-28 23:08:14,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:08:14,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:08:14,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 23:08:14,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 23:08:14,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:08:14,254 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 4 states. [2018-11-28 23:08:14,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:08:14,409 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-11-28 23:08:14,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:08:14,409 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-11-28 23:08:14,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:08:14,411 INFO L225 Difference]: With dead ends: 21 [2018-11-28 23:08:14,411 INFO L226 Difference]: Without dead ends: 19 [2018-11-28 23:08:14,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:08:14,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-28 23:08:14,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2018-11-28 23:08:14,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-28 23:08:14,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-11-28 23:08:14,417 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 8 [2018-11-28 23:08:14,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:08:14,417 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-11-28 23:08:14,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 23:08:14,418 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-28 23:08:14,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 23:08:14,418 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:08:14,418 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:08:14,419 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:08:14,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:08:14,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1159010413, now seen corresponding path program 1 times [2018-11-28 23:08:14,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:08:14,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:08:14,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:08:14,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:08:14,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:08:14,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:08:14,470 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-28 23:08:14,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:08:14,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:08:14,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 23:08:14,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:08:14,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:08:14,472 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 3 states. [2018-11-28 23:08:14,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:08:14,524 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-28 23:08:14,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:08:14,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-28 23:08:14,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:08:14,526 INFO L225 Difference]: With dead ends: 18 [2018-11-28 23:08:14,526 INFO L226 Difference]: Without dead ends: 17 [2018-11-28 23:08:14,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:08:14,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-28 23:08:14,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-28 23:08:14,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-28 23:08:14,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-11-28 23:08:14,531 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 10 [2018-11-28 23:08:14,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:08:14,532 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-11-28 23:08:14,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 23:08:14,532 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-28 23:08:14,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-28 23:08:14,532 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:08:14,533 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:08:14,533 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:08:14,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:08:14,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1412475851, now seen corresponding path program 1 times [2018-11-28 23:08:14,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:08:14,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:08:14,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:08:14,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:08:14,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:08:14,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:08:14,689 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:08:14,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:08:14,690 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-28 23:08:14,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:08:14,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:08:14,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:08:15,014 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:08:15,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 23:08:15,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2018-11-28 23:08:15,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 23:08:15,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 23:08:15,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-11-28 23:08:15,042 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 9 states. [2018-11-28 23:08:15,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:08:15,190 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-28 23:08:15,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 23:08:15,191 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-11-28 23:08:15,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:08:15,192 INFO L225 Difference]: With dead ends: 18 [2018-11-28 23:08:15,192 INFO L226 Difference]: Without dead ends: 17 [2018-11-28 23:08:15,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-11-28 23:08:15,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-28 23:08:15,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-11-28 23:08:15,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-28 23:08:15,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-11-28 23:08:15,198 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 12 [2018-11-28 23:08:15,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:08:15,198 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-11-28 23:08:15,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 23:08:15,199 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-28 23:08:15,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-28 23:08:15,199 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:08:15,199 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:08:15,201 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:08:15,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:08:15,201 INFO L82 PathProgramCache]: Analyzing trace with hash -837078374, now seen corresponding path program 1 times [2018-11-28 23:08:15,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:08:15,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:08:15,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:08:15,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:08:15,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:08:15,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:08:15,262 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-28 23:08:15,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:08:15,263 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-28 23:08:15,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:08:15,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:08:15,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:08:15,425 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:08:15,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 23:08:15,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2018-11-28 23:08:15,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 23:08:15,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 23:08:15,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-28 23:08:15,446 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 8 states. [2018-11-28 23:08:15,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:08:15,653 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-11-28 23:08:15,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 23:08:15,653 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-11-28 23:08:15,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:08:15,654 INFO L225 Difference]: With dead ends: 27 [2018-11-28 23:08:15,655 INFO L226 Difference]: Without dead ends: 25 [2018-11-28 23:08:15,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-11-28 23:08:15,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-28 23:08:15,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-28 23:08:15,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-28 23:08:15,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-11-28 23:08:15,662 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 13 [2018-11-28 23:08:15,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:08:15,662 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-11-28 23:08:15,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 23:08:15,662 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-11-28 23:08:15,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 23:08:15,665 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:08:15,665 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2018-11-28 23:08:15,665 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:08:15,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:08:15,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1754295689, now seen corresponding path program 1 times [2018-11-28 23:08:15,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:08:15,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:08:15,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:08:15,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:08:15,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:08:15,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:08:15,904 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:08:15,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:08:15,905 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-28 23:08:15,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:08:15,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:08:15,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:08:15,968 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:08:16,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:08:16,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-28 23:08:16,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 23:08:16,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 23:08:16,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:08:16,004 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 6 states. [2018-11-28 23:08:16,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:08:16,174 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-11-28 23:08:16,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 23:08:16,175 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-11-28 23:08:16,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:08:16,176 INFO L225 Difference]: With dead ends: 32 [2018-11-28 23:08:16,177 INFO L226 Difference]: Without dead ends: 31 [2018-11-28 23:08:16,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:08:16,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-28 23:08:16,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-11-28 23:08:16,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-28 23:08:16,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-11-28 23:08:16,185 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 24 [2018-11-28 23:08:16,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:08:16,186 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-11-28 23:08:16,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 23:08:16,186 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-28 23:08:16,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 23:08:16,187 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:08:16,187 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1] [2018-11-28 23:08:16,187 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:08:16,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:08:16,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1485878944, now seen corresponding path program 2 times [2018-11-28 23:08:16,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:08:16,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:08:16,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:08:16,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:08:16,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:08:16,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:08:16,317 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:08:16,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:08:16,318 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:08:16,336 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:08:16,355 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 23:08:16,356 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:08:16,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:08:16,367 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:08:16,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:08:16,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-28 23:08:16,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 23:08:16,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 23:08:16,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-28 23:08:16,392 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 7 states. [2018-11-28 23:08:16,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:08:16,460 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-11-28 23:08:16,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 23:08:16,461 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-11-28 23:08:16,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:08:16,462 INFO L225 Difference]: With dead ends: 37 [2018-11-28 23:08:16,462 INFO L226 Difference]: Without dead ends: 36 [2018-11-28 23:08:16,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-28 23:08:16,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-28 23:08:16,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-11-28 23:08:16,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-28 23:08:16,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-11-28 23:08:16,470 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 29 [2018-11-28 23:08:16,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:08:16,471 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-11-28 23:08:16,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 23:08:16,472 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-11-28 23:08:16,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-28 23:08:16,474 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:08:16,474 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1] [2018-11-28 23:08:16,474 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:08:16,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:08:16,475 INFO L82 PathProgramCache]: Analyzing trace with hash -563446761, now seen corresponding path program 3 times [2018-11-28 23:08:16,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:08:16,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:08:16,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:08:16,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:08:16,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:08:16,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:08:16,638 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:08:16,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:08:16,639 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:08:16,649 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 23:08:16,662 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-28 23:08:16,662 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:08:16,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:08:17,006 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 40 proven. 21 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-28 23:08:17,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:08:17,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2018-11-28 23:08:17,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-28 23:08:17,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-28 23:08:17,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-11-28 23:08:17,031 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 15 states. [2018-11-28 23:08:18,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:08:18,202 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2018-11-28 23:08:18,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-28 23:08:18,202 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2018-11-28 23:08:18,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:08:18,203 INFO L225 Difference]: With dead ends: 42 [2018-11-28 23:08:18,204 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 23:08:18,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=336, Invalid=924, Unknown=0, NotChecked=0, Total=1260 [2018-11-28 23:08:18,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 23:08:18,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 23:08:18,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 23:08:18,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 23:08:18,206 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2018-11-28 23:08:18,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:08:18,206 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:08:18,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-28 23:08:18,207 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:08:18,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 23:08:18,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 23:08:18,373 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 29 [2018-11-28 23:08:18,377 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-28 23:08:18,377 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 23:08:18,377 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 23:08:18,377 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-28 23:08:18,377 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 23:08:18,377 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 23:08:18,377 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 13 22) the Hoare annotation is: true [2018-11-28 23:08:18,377 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 13 22) no Hoare annotation was computed. [2018-11-28 23:08:18,378 INFO L448 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2018-11-28 23:08:18,378 INFO L448 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2018-11-28 23:08:18,378 INFO L448 ceAbstractionStarter]: For program point L19-1(line 19) no Hoare annotation was computed. [2018-11-28 23:08:18,378 INFO L448 ceAbstractionStarter]: For program point L18-1(line 18) no Hoare annotation was computed. [2018-11-28 23:08:18,378 INFO L444 ceAbstractionStarter]: At program point L17-2(lines 17 20) the Hoare annotation is: (let ((.cse0 (<= 24 main_~y~0))) (or (and (<= main_~y~0 24) .cse0 (<= main_~x~0 2147483624)) (and (<= 23 main_~y~0) (<= main_~y~0 23) (<= main_~x~0 (+ main_~y~0 2147483624))) (and (<= main_~y~0 2147483647) (exists ((v_main_~y~0_23 Int)) (and (<= (+ main_~x~0 (* 2 v_main_~y~0_23)) 2147483648) (<= main_~y~0 (+ v_main_~y~0_23 1)))) .cse0))) [2018-11-28 23:08:18,378 INFO L448 ceAbstractionStarter]: For program point L17-3(lines 17 20) no Hoare annotation was computed. [2018-11-28 23:08:18,378 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 13 22) no Hoare annotation was computed. [2018-11-28 23:08:18,379 INFO L448 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 19) no Hoare annotation was computed. [2018-11-28 23:08:18,379 INFO L448 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 19) no Hoare annotation was computed. [2018-11-28 23:08:18,379 INFO L448 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 18) no Hoare annotation was computed. [2018-11-28 23:08:18,379 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 18) no Hoare annotation was computed. [2018-11-28 23:08:18,385 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_23,QUANTIFIED] [2018-11-28 23:08:18,386 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_23,QUANTIFIED] [2018-11-28 23:08:18,393 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_23,QUANTIFIED] [2018-11-28 23:08:18,394 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_23,QUANTIFIED] [2018-11-28 23:08:18,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 11:08:18 BoogieIcfgContainer [2018-11-28 23:08:18,397 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 23:08:18,397 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:08:18,397 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:08:18,397 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:08:18,398 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:08:13" (3/4) ... [2018-11-28 23:08:18,403 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 23:08:18,410 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 23:08:18,411 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 23:08:18,415 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-28 23:08:18,415 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-28 23:08:18,415 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 23:08:18,442 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((y <= 24 && 24 <= y) && x <= 2147483624) || ((23 <= y && y <= 23) && x <= y + 2147483624)) || ((y <= 2147483647 && (\exists v_main_~y~0_23 : int :: x + 2 * v_main_~y~0_23 <= 2147483648 && y <= v_main_~y~0_23 + 1)) && 24 <= y) [2018-11-28 23:08:18,456 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 23:08:18,457 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:08:18,458 INFO L168 Benchmark]: Toolchain (without parser) took 5747.28 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 952.7 MB in the beginning and 845.4 MB in the end (delta: 107.3 MB). Peak memory consumption was 225.8 MB. Max. memory is 11.5 GB. [2018-11-28 23:08:18,460 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:08:18,461 INFO L168 Benchmark]: CACSL2BoogieTranslator took 318.31 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:08:18,461 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.15 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:08:18,463 INFO L168 Benchmark]: Boogie Preprocessor took 28.86 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:08:18,463 INFO L168 Benchmark]: RCFGBuilder took 434.98 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 941.9 MB in the beginning and 1.1 GB in the end (delta: -154.9 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2018-11-28 23:08:18,465 INFO L168 Benchmark]: TraceAbstraction took 4875.73 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 852.1 MB in the end (delta: 244.8 MB). Peak memory consumption was 244.8 MB. Max. memory is 11.5 GB. [2018-11-28 23:08:18,465 INFO L168 Benchmark]: Witness Printer took 59.93 ms. Allocated memory is still 1.1 GB. Free memory was 852.1 MB in the beginning and 845.4 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:08:18,471 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 318.31 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.15 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.86 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 434.98 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 941.9 MB in the beginning and 1.1 GB in the end (delta: -154.9 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4875.73 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 852.1 MB in the end (delta: 244.8 MB). Peak memory consumption was 244.8 MB. Max. memory is 11.5 GB. * Witness Printer took 59.93 ms. Allocated memory is still 1.1 GB. Free memory was 852.1 MB in the beginning and 845.4 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_23,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 17]: Loop Invariant [2018-11-28 23:08:18,481 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_23,QUANTIFIED] [2018-11-28 23:08:18,481 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_23,QUANTIFIED] [2018-11-28 23:08:18,486 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_23,QUANTIFIED] [2018-11-28 23:08:18,486 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_23,QUANTIFIED] Derived loop invariant: (((y <= 24 && 24 <= y) && x <= 2147483624) || ((23 <= y && y <= 23) && x <= y + 2147483624)) || ((y <= 2147483647 && (\exists v_main_~y~0_23 : int :: x + 2 * v_main_~y~0_23 <= 2147483648 && y <= v_main_~y~0_23 + 1)) && 24 <= y) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 19 locations, 4 error locations. SAFE Result, 4.7s OverallTime, 8 OverallIterations, 6 TraceHistogramMax, 2.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 59 SDtfs, 96 SDslu, 133 SDs, 0 SdLazy, 230 SolverSat, 54 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 167 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=7, 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, 8 MinimizatonAttempts, 5 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 12 NumberOfFragments, 48 HoareAnnotationTreeSize, 5 FomulaSimplifications, 132 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 61 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 249 NumberOfCodeBlocks, 244 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 236 ConstructedInterpolants, 1 QuantifiedInterpolants, 15427 SizeOfPredicates, 2 NumberOfNonLiveVariables, 220 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 13 InterpolantComputations, 5 PerfectInterpolantSequences, 54/296 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...