./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/termination-crafted-lit/BradleyMannaSipma-CAV2005-Fig1_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 0ed9222f 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/BradleyMannaSipma-CAV2005-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 6c09c2a46ed7454ea61f3b2ddb99e3e2ba9fd4da ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 21:38:49,725 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 21:38:49,729 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 21:38:49,750 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 21:38:49,750 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 21:38:49,751 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 21:38:49,752 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 21:38:49,754 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 21:38:49,756 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 21:38:49,756 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 21:38:49,757 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 21:38:49,758 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 21:38:49,759 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 21:38:49,759 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 21:38:49,761 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 21:38:49,761 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 21:38:49,762 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 21:38:49,764 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 21:38:49,766 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 21:38:49,767 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 21:38:49,768 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 21:38:49,770 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 21:38:49,772 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 21:38:49,772 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 21:38:49,772 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 21:38:49,773 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 21:38:49,774 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 21:38:49,775 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 21:38:49,776 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 21:38:49,777 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 21:38:49,777 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 21:38:49,778 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 21:38:49,778 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 21:38:49,778 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 21:38:49,779 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 21:38:49,780 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 21:38:49,780 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-01-14 21:38:49,796 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 21:38:49,796 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 21:38:49,798 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 21:38:49,798 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 21:38:49,798 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 21:38:49,798 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 21:38:49,798 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 21:38:49,799 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 21:38:49,799 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 21:38:49,799 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 21:38:49,799 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 21:38:49,799 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 21:38:49,799 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-14 21:38:49,800 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 21:38:49,800 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 21:38:49,800 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 21:38:49,800 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 21:38:49,800 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 21:38:49,800 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 21:38:49,801 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 21:38:49,801 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 21:38:49,801 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 21:38:49,801 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 21:38:49,801 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 21:38:49,801 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 21:38:49,802 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 21:38:49,802 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 -> 6c09c2a46ed7454ea61f3b2ddb99e3e2ba9fd4da [2019-01-14 21:38:49,855 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 21:38:49,877 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 21:38:49,881 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 21:38:49,883 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 21:38:49,883 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 21:38:49,884 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted-lit/BradleyMannaSipma-CAV2005-Fig1_true-termination_true-no-overflow.c [2019-01-14 21:38:49,948 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b54cdddd/5c13ab25e2e64e1f994358abf449cbfa/FLAG5d7a88fcc [2019-01-14 21:38:50,423 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 21:38:50,423 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted-lit/BradleyMannaSipma-CAV2005-Fig1_true-termination_true-no-overflow.c [2019-01-14 21:38:50,431 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b54cdddd/5c13ab25e2e64e1f994358abf449cbfa/FLAG5d7a88fcc [2019-01-14 21:38:50,772 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b54cdddd/5c13ab25e2e64e1f994358abf449cbfa [2019-01-14 21:38:50,776 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 21:38:50,777 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 21:38:50,779 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 21:38:50,779 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 21:38:50,782 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 21:38:50,783 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 09:38:50" (1/1) ... [2019-01-14 21:38:50,786 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b748759 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:38:50, skipping insertion in model container [2019-01-14 21:38:50,786 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 09:38:50" (1/1) ... [2019-01-14 21:38:50,795 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 21:38:50,817 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 21:38:51,002 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 21:38:51,005 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 21:38:51,022 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 21:38:51,037 INFO L195 MainTranslator]: Completed translation [2019-01-14 21:38:51,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:38:51 WrapperNode [2019-01-14 21:38:51,038 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 21:38:51,039 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 21:38:51,039 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 21:38:51,039 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 21:38:51,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:38:51" (1/1) ... [2019-01-14 21:38:51,054 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:38:51" (1/1) ... [2019-01-14 21:38:51,074 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 21:38:51,077 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 21:38:51,077 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 21:38:51,077 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 21:38:51,087 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:38:51" (1/1) ... [2019-01-14 21:38:51,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:38:51" (1/1) ... [2019-01-14 21:38:51,089 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:38:51" (1/1) ... [2019-01-14 21:38:51,089 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:38:51" (1/1) ... [2019-01-14 21:38:51,092 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:38:51" (1/1) ... [2019-01-14 21:38:51,097 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:38:51" (1/1) ... [2019-01-14 21:38:51,100 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:38:51" (1/1) ... [2019-01-14 21:38:51,101 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 21:38:51,102 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 21:38:51,102 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 21:38:51,102 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 21:38:51,103 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:38:51" (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 [2019-01-14 21:38:51,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 21:38:51,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 21:38:51,458 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 21:38:51,458 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-14 21:38:51,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 09:38:51 BoogieIcfgContainer [2019-01-14 21:38:51,461 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 21:38:51,462 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 21:38:51,462 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 21:38:51,476 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 21:38:51,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 09:38:50" (1/3) ... [2019-01-14 21:38:51,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e4070d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 09:38:51, skipping insertion in model container [2019-01-14 21:38:51,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:38:51" (2/3) ... [2019-01-14 21:38:51,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e4070d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 09:38:51, skipping insertion in model container [2019-01-14 21:38:51,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 09:38:51" (3/3) ... [2019-01-14 21:38:51,488 INFO L112 eAbstractionObserver]: Analyzing ICFG BradleyMannaSipma-CAV2005-Fig1_true-termination_true-no-overflow.c [2019-01-14 21:38:51,509 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 21:38:51,527 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-01-14 21:38:51,548 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-01-14 21:38:51,578 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 21:38:51,578 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 21:38:51,579 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 21:38:51,579 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 21:38:51,579 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 21:38:51,579 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 21:38:51,579 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 21:38:51,579 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 21:38:51,579 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 21:38:51,594 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2019-01-14 21:38:51,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-14 21:38:51,600 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:38:51,601 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-14 21:38:51,604 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:38:51,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:38:51,610 INFO L82 PathProgramCache]: Analyzing trace with hash 29684842, now seen corresponding path program 1 times [2019-01-14 21:38:51,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:38:51,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:38:51,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:51,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:38:51,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:51,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:51,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:38:51,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:38:51,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 21:38:51,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 21:38:51,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 21:38:51,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 21:38:51,771 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 4 states. [2019-01-14 21:38:51,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:38:51,980 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2019-01-14 21:38:51,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 21:38:51,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-14 21:38:51,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:38:51,991 INFO L225 Difference]: With dead ends: 42 [2019-01-14 21:38:51,991 INFO L226 Difference]: Without dead ends: 24 [2019-01-14 21:38:51,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 21:38:52,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-14 21:38:52,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 14. [2019-01-14 21:38:52,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-14 21:38:52,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-01-14 21:38:52,022 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 5 [2019-01-14 21:38:52,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:38:52,022 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-01-14 21:38:52,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 21:38:52,022 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2019-01-14 21:38:52,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-14 21:38:52,024 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:38:52,024 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-14 21:38:52,024 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:38:52,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:38:52,025 INFO L82 PathProgramCache]: Analyzing trace with hash 29685034, now seen corresponding path program 1 times [2019-01-14 21:38:52,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:38:52,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:38:52,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:52,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:38:52,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:52,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:52,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:38:52,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:38:52,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 21:38:52,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 21:38:52,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 21:38:52,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 21:38:52,106 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 4 states. [2019-01-14 21:38:52,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:38:52,388 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2019-01-14 21:38:52,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 21:38:52,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-14 21:38:52,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:38:52,390 INFO L225 Difference]: With dead ends: 25 [2019-01-14 21:38:52,390 INFO L226 Difference]: Without dead ends: 23 [2019-01-14 21:38:52,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 21:38:52,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-14 21:38:52,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 14. [2019-01-14 21:38:52,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-14 21:38:52,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-01-14 21:38:52,396 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 5 [2019-01-14 21:38:52,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:38:52,397 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-01-14 21:38:52,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 21:38:52,397 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2019-01-14 21:38:52,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-14 21:38:52,398 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:38:52,398 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2019-01-14 21:38:52,398 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:38:52,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:38:52,400 INFO L82 PathProgramCache]: Analyzing trace with hash -199749339, now seen corresponding path program 1 times [2019-01-14 21:38:52,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:38:52,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:38:52,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:52,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:38:52,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:52,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:52,485 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:38:52,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:38:52,485 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 [2019-01-14 21:38:52,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:38:52,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:52,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:38:52,622 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:38:52,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 21:38:52,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 7 [2019-01-14 21:38:52,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 21:38:52,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 21:38:52,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-14 21:38:52,653 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 8 states. [2019-01-14 21:38:52,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:38:52,920 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2019-01-14 21:38:52,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 21:38:52,921 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-01-14 21:38:52,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:38:52,923 INFO L225 Difference]: With dead ends: 32 [2019-01-14 21:38:52,923 INFO L226 Difference]: Without dead ends: 31 [2019-01-14 21:38:52,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-01-14 21:38:52,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-14 21:38:52,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 17. [2019-01-14 21:38:52,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-14 21:38:52,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-01-14 21:38:52,928 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 9 [2019-01-14 21:38:52,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:38:52,929 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-01-14 21:38:52,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 21:38:52,929 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2019-01-14 21:38:52,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-14 21:38:52,930 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:38:52,930 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:38:52,930 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:38:52,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:38:52,931 INFO L82 PathProgramCache]: Analyzing trace with hash -199749147, now seen corresponding path program 1 times [2019-01-14 21:38:52,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:38:52,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:38:52,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:52,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:38:52,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:52,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:52,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:38:52,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:38:52,987 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 [2019-01-14 21:38:52,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:38:53,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:53,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:38:53,140 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:38:53,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:38:53,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-01-14 21:38:53,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 21:38:53,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 21:38:53,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-14 21:38:53,161 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand 8 states. [2019-01-14 21:38:53,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:38:53,752 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2019-01-14 21:38:53,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 21:38:53,753 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-01-14 21:38:53,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:38:53,754 INFO L225 Difference]: With dead ends: 48 [2019-01-14 21:38:53,755 INFO L226 Difference]: Without dead ends: 47 [2019-01-14 21:38:53,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-01-14 21:38:53,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-14 21:38:53,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 31. [2019-01-14 21:38:53,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-14 21:38:53,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2019-01-14 21:38:53,764 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 9 [2019-01-14 21:38:53,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:38:53,765 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2019-01-14 21:38:53,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 21:38:53,765 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2019-01-14 21:38:53,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-14 21:38:53,766 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:38:53,766 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:38:53,766 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:38:53,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:38:53,767 INFO L82 PathProgramCache]: Analyzing trace with hash -22254561, now seen corresponding path program 1 times [2019-01-14 21:38:53,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:38:53,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:38:53,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:53,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:38:53,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:53,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:53,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:38:53,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:38:53,867 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 [2019-01-14 21:38:53,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:38:53,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:53,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:38:53,940 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:38:53,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 21:38:53,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2019-01-14 21:38:53,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 21:38:53,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 21:38:53,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-14 21:38:53,963 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand 7 states. [2019-01-14 21:38:54,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:38:54,019 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2019-01-14 21:38:54,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 21:38:54,021 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-01-14 21:38:54,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:38:54,022 INFO L225 Difference]: With dead ends: 31 [2019-01-14 21:38:54,022 INFO L226 Difference]: Without dead ends: 30 [2019-01-14 21:38:54,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-01-14 21:38:54,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-14 21:38:54,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 22. [2019-01-14 21:38:54,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-14 21:38:54,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2019-01-14 21:38:54,028 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 9 [2019-01-14 21:38:54,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:38:54,028 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-01-14 21:38:54,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 21:38:54,029 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2019-01-14 21:38:54,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-14 21:38:54,029 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:38:54,029 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2019-01-14 21:38:54,030 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:38:54,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:38:54,030 INFO L82 PathProgramCache]: Analyzing trace with hash -22254369, now seen corresponding path program 1 times [2019-01-14 21:38:54,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:38:54,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:38:54,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:54,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:38:54,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:54,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:54,123 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:38:54,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:38:54,124 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 [2019-01-14 21:38:54,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:38:54,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:54,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:38:54,201 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:38:54,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 21:38:54,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 7 [2019-01-14 21:38:54,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 21:38:54,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 21:38:54,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-14 21:38:54,222 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand 8 states. [2019-01-14 21:38:54,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:38:54,405 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2019-01-14 21:38:54,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 21:38:54,406 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-01-14 21:38:54,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:38:54,407 INFO L225 Difference]: With dead ends: 43 [2019-01-14 21:38:54,407 INFO L226 Difference]: Without dead ends: 42 [2019-01-14 21:38:54,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-01-14 21:38:54,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-14 21:38:54,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 20. [2019-01-14 21:38:54,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-14 21:38:54,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-01-14 21:38:54,414 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 9 [2019-01-14 21:38:54,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:38:54,415 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-01-14 21:38:54,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 21:38:54,415 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2019-01-14 21:38:54,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 21:38:54,416 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:38:54,416 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-01-14 21:38:54,416 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:38:54,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:38:54,417 INFO L82 PathProgramCache]: Analyzing trace with hash -573512235, now seen corresponding path program 1 times [2019-01-14 21:38:54,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:38:54,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:38:54,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:54,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:38:54,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:54,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:54,506 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 21:38:54,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:38:54,506 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 [2019-01-14 21:38:54,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:38:54,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:54,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:38:54,686 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:38:54,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:38:54,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-01-14 21:38:54,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 21:38:54,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 21:38:54,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-01-14 21:38:54,708 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 11 states. [2019-01-14 21:38:55,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:38:55,335 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2019-01-14 21:38:55,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-14 21:38:55,336 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2019-01-14 21:38:55,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:38:55,336 INFO L225 Difference]: With dead ends: 41 [2019-01-14 21:38:55,336 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 21:38:55,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=168, Invalid=338, Unknown=0, NotChecked=0, Total=506 [2019-01-14 21:38:55,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 21:38:55,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 21:38:55,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 21:38:55,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 21:38:55,341 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2019-01-14 21:38:55,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:38:55,342 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 21:38:55,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 21:38:55,344 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 21:38:55,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 21:38:55,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-14 21:38:55,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:38:55,675 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 11 [2019-01-14 21:38:55,677 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-14 21:38:55,677 INFO L444 ceAbstractionStarter]: At program point L27(lines 14 28) the Hoare annotation is: (or (<= ULTIMATE.start_main_~y1~0 2147483647) (<= ULTIMATE.start_main_~y1~0 (+ ULTIMATE.start_main_~y2~0 2147483646))) [2019-01-14 21:38:55,677 INFO L448 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2019-01-14 21:38:55,677 INFO L448 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. [2019-01-14 21:38:55,678 INFO L448 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2019-01-14 21:38:55,678 INFO L448 ceAbstractionStarter]: For program point L21-1(line 21) no Hoare annotation was computed. [2019-01-14 21:38:55,678 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 23) no Hoare annotation was computed. [2019-01-14 21:38:55,678 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 21) no Hoare annotation was computed. [2019-01-14 21:38:55,678 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-14 21:38:55,678 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-14 21:38:55,678 INFO L448 ceAbstractionStarter]: For program point L20(lines 20 24) no Hoare annotation was computed. [2019-01-14 21:38:55,679 INFO L448 ceAbstractionStarter]: For program point L18(lines 18 26) no Hoare annotation was computed. [2019-01-14 21:38:55,679 INFO L444 ceAbstractionStarter]: At program point L20-2(lines 19 25) the Hoare annotation is: (and (<= 1 ULTIMATE.start_main_~y1~0) (<= ULTIMATE.start_main_~y1~0 2147483647) (<= ULTIMATE.start_main_~y2~0 2147483647) (<= 0 ULTIMATE.start_main_~y2~0)) [2019-01-14 21:38:55,679 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 23) no Hoare annotation was computed. [2019-01-14 21:38:55,679 INFO L448 ceAbstractionStarter]: For program point L18-1(lines 18 26) no Hoare annotation was computed. [2019-01-14 21:38:55,679 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 21) no Hoare annotation was computed. [2019-01-14 21:38:55,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 09:38:55 BoogieIcfgContainer [2019-01-14 21:38:55,692 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 21:38:55,692 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 21:38:55,692 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 21:38:55,692 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 21:38:55,693 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 09:38:51" (3/4) ... [2019-01-14 21:38:55,697 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 21:38:55,708 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-14 21:38:55,708 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-14 21:38:55,750 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 21:38:55,750 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 21:38:55,750 INFO L168 Benchmark]: Toolchain (without parser) took 4974.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 954.0 MB in the beginning and 858.4 MB in the end (delta: 95.6 MB). Peak memory consumption was 217.2 MB. Max. memory is 11.5 GB. [2019-01-14 21:38:55,751 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. [2019-01-14 21:38:55,752 INFO L168 Benchmark]: CACSL2BoogieTranslator took 259.50 ms. Allocated memory is still 1.0 GB. Free memory was 954.0 MB in the beginning and 941.9 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-01-14 21:38:55,752 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.51 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. [2019-01-14 21:38:55,753 INFO L168 Benchmark]: Boogie Preprocessor took 24.83 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. [2019-01-14 21:38:55,753 INFO L168 Benchmark]: RCFGBuilder took 359.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 941.9 MB in the beginning and 1.1 GB in the end (delta: -154.6 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. [2019-01-14 21:38:55,754 INFO L168 Benchmark]: TraceAbstraction took 4229.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 858.4 MB in the end (delta: 238.1 MB). Peak memory consumption was 238.1 MB. Max. memory is 11.5 GB. [2019-01-14 21:38:55,755 INFO L168 Benchmark]: Witness Printer took 57.76 ms. Allocated memory is still 1.2 GB. Free memory is still 858.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 21:38:55,758 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 259.50 ms. Allocated memory is still 1.0 GB. Free memory was 954.0 MB in the beginning and 941.9 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.51 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 24.83 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 359.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 941.9 MB in the beginning and 1.1 GB in the end (delta: -154.6 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4229.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 858.4 MB in the end (delta: 238.1 MB). Peak memory consumption was 238.1 MB. Max. memory is 11.5 GB. * Witness Printer took 57.76 ms. Allocated memory is still 1.2 GB. Free memory is still 858.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 21]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 21]: 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: 14]: Loop Invariant Derived loop invariant: y1 <= 2147483647 || y1 <= y2 + 2147483646 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: ((1 <= y1 && y1 <= 2147483647) && y2 <= 2147483647) && 0 <= y2 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 4 error locations. SAFE Result, 4.1s OverallTime, 7 OverallIterations, 4 TraceHistogramMax, 2.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 14 SDtfs, 189 SDslu, 6 SDs, 0 SdLazy, 453 SolverSat, 65 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=4, 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, 7 MinimizatonAttempts, 79 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 12 NumberOfFragments, 23 HoareAnnotationTreeSize, 2 FomulaSimplifications, 396 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 199 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 116 NumberOfCodeBlocks, 116 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 104 ConstructedInterpolants, 0 QuantifiedInterpolants, 5360 SizeOfPredicates, 0 NumberOfNonLiveVariables, 117 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 12 InterpolantComputations, 5 PerfectInterpolantSequences, 25/50 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...