./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/termination-crafted-lit/CookSeeZuleger-TACAS2013-Fig7b_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2e94e6aa 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/CookSeeZuleger-TACAS2013-Fig7b_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 41d35d9d9785c70c81ceac96efa22b5a4097e6f4 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 20:47:48,185 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 20:47:48,187 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 20:47:48,199 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 20:47:48,200 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 20:47:48,201 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 20:47:48,202 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 20:47:48,204 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 20:47:48,206 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 20:47:48,207 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 20:47:48,207 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 20:47:48,208 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 20:47:48,209 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 20:47:48,211 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 20:47:48,212 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 20:47:48,213 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 20:47:48,214 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 20:47:48,216 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 20:47:48,218 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 20:47:48,219 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 20:47:48,221 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 20:47:48,222 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 20:47:48,224 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 20:47:48,225 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 20:47:48,225 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 20:47:48,226 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 20:47:48,227 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 20:47:48,228 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 20:47:48,229 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 20:47:48,230 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 20:47:48,230 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 20:47:48,231 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 20:47:48,231 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 20:47:48,231 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 20:47:48,232 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 20:47:48,233 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 20:47:48,233 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-01-01 20:47:48,264 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 20:47:48,266 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 20:47:48,267 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 20:47:48,267 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 20:47:48,267 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 20:47:48,268 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 20:47:48,269 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 20:47:48,269 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 20:47:48,269 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 20:47:48,269 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-01 20:47:48,269 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 20:47:48,269 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-01 20:47:48,270 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-01 20:47:48,270 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 20:47:48,270 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 20:47:48,270 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-01 20:47:48,270 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 20:47:48,271 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 20:47:48,271 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 20:47:48,271 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 20:47:48,272 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 20:47:48,272 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 20:47:48,272 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 20:47:48,272 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-01 20:47:48,272 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 20:47:48,273 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 20:47:48,273 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-01 20:47:48,273 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 -> 41d35d9d9785c70c81ceac96efa22b5a4097e6f4 [2019-01-01 20:47:48,331 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 20:47:48,346 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 20:47:48,353 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 20:47:48,355 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 20:47:48,355 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 20:47:48,357 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted-lit/CookSeeZuleger-TACAS2013-Fig7b_true-termination_true-no-overflow.c [2019-01-01 20:47:48,441 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5a2e3f3f/39f5421db40b414db58d135f80c0505f/FLAGae361d73b [2019-01-01 20:47:48,933 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 20:47:48,934 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted-lit/CookSeeZuleger-TACAS2013-Fig7b_true-termination_true-no-overflow.c [2019-01-01 20:47:48,940 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5a2e3f3f/39f5421db40b414db58d135f80c0505f/FLAGae361d73b [2019-01-01 20:47:49,302 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5a2e3f3f/39f5421db40b414db58d135f80c0505f [2019-01-01 20:47:49,306 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 20:47:49,308 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 20:47:49,309 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 20:47:49,309 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 20:47:49,313 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 20:47:49,314 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 08:47:49" (1/1) ... [2019-01-01 20:47:49,317 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1509bd75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:47:49, skipping insertion in model container [2019-01-01 20:47:49,317 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 08:47:49" (1/1) ... [2019-01-01 20:47:49,325 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 20:47:49,343 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 20:47:49,526 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 20:47:49,532 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 20:47:49,558 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 20:47:49,575 INFO L195 MainTranslator]: Completed translation [2019-01-01 20:47:49,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:47:49 WrapperNode [2019-01-01 20:47:49,577 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 20:47:49,578 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 20:47:49,578 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 20:47:49,578 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 20:47:49,589 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:47:49" (1/1) ... [2019-01-01 20:47:49,595 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:47:49" (1/1) ... [2019-01-01 20:47:49,614 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 20:47:49,615 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 20:47:49,615 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 20:47:49,615 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 20:47:49,623 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:47:49" (1/1) ... [2019-01-01 20:47:49,624 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:47:49" (1/1) ... [2019-01-01 20:47:49,625 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:47:49" (1/1) ... [2019-01-01 20:47:49,625 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:47:49" (1/1) ... [2019-01-01 20:47:49,627 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:47:49" (1/1) ... [2019-01-01 20:47:49,633 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:47:49" (1/1) ... [2019-01-01 20:47:49,634 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:47:49" (1/1) ... [2019-01-01 20:47:49,636 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 20:47:49,637 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 20:47:49,637 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 20:47:49,637 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 20:47:49,638 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:47:49" (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-01 20:47:49,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 20:47:49,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 20:47:50,075 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 20:47:50,076 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-01 20:47:50,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:47:50 BoogieIcfgContainer [2019-01-01 20:47:50,076 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 20:47:50,077 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 20:47:50,077 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 20:47:50,087 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 20:47:50,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 08:47:49" (1/3) ... [2019-01-01 20:47:50,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dc60d83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 08:47:50, skipping insertion in model container [2019-01-01 20:47:50,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:47:49" (2/3) ... [2019-01-01 20:47:50,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dc60d83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 08:47:50, skipping insertion in model container [2019-01-01 20:47:50,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:47:50" (3/3) ... [2019-01-01 20:47:50,093 INFO L112 eAbstractionObserver]: Analyzing ICFG CookSeeZuleger-TACAS2013-Fig7b_true-termination_true-no-overflow.c [2019-01-01 20:47:50,105 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 20:47:50,117 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-01-01 20:47:50,138 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-01-01 20:47:50,169 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 20:47:50,170 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 20:47:50,170 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-01 20:47:50,170 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 20:47:50,170 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 20:47:50,171 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 20:47:50,171 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 20:47:50,171 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 20:47:50,171 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 20:47:50,187 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-01-01 20:47:50,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-01 20:47:50,194 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:47:50,195 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-01 20:47:50,198 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:47:50,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:47:50,205 INFO L82 PathProgramCache]: Analyzing trace with hash 963339, now seen corresponding path program 1 times [2019-01-01 20:47:50,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:47:50,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:47:50,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:50,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:47:50,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:50,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:50,350 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-01 20:47:50,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:47:50,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-01 20:47:50,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 20:47:50,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 20:47:50,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:47:50,373 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2019-01-01 20:47:50,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:47:50,449 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2019-01-01 20:47:50,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 20:47:50,452 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-01 20:47:50,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:47:50,465 INFO L225 Difference]: With dead ends: 24 [2019-01-01 20:47:50,465 INFO L226 Difference]: Without dead ends: 15 [2019-01-01 20:47:50,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:47:50,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-01-01 20:47:50,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-01-01 20:47:50,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-01 20:47:50,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-01-01 20:47:50,512 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 4 [2019-01-01 20:47:50,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:47:50,512 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-01-01 20:47:50,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 20:47:50,512 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2019-01-01 20:47:50,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-01 20:47:50,514 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:47:50,514 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-01 20:47:50,514 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:47:50,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:47:50,515 INFO L82 PathProgramCache]: Analyzing trace with hash 29869546, now seen corresponding path program 1 times [2019-01-01 20:47:50,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:47:50,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:47:50,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:50,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:47:50,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:50,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:50,565 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-01 20:47:50,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:47:50,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-01 20:47:50,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 20:47:50,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 20:47:50,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:47:50,570 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 3 states. [2019-01-01 20:47:50,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:47:50,625 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2019-01-01 20:47:50,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 20:47:50,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-01-01 20:47:50,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:47:50,626 INFO L225 Difference]: With dead ends: 15 [2019-01-01 20:47:50,626 INFO L226 Difference]: Without dead ends: 14 [2019-01-01 20:47:50,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:47:50,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-01 20:47:50,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-01-01 20:47:50,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-01 20:47:50,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-01-01 20:47:50,631 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 5 [2019-01-01 20:47:50,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:47:50,631 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-01-01 20:47:50,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 20:47:50,631 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2019-01-01 20:47:50,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-01 20:47:50,632 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:47:50,632 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-01 20:47:50,632 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:47:50,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:47:50,633 INFO L82 PathProgramCache]: Analyzing trace with hash 29869738, now seen corresponding path program 1 times [2019-01-01 20:47:50,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:47:50,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:47:50,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:50,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:47:50,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:50,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:50,689 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-01 20:47:50,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:47:50,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-01 20:47:50,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 20:47:50,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 20:47:50,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:47:50,691 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 3 states. [2019-01-01 20:47:50,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:47:50,720 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2019-01-01 20:47:50,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 20:47:50,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-01-01 20:47:50,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:47:50,722 INFO L225 Difference]: With dead ends: 14 [2019-01-01 20:47:50,722 INFO L226 Difference]: Without dead ends: 13 [2019-01-01 20:47:50,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:47:50,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-01 20:47:50,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-01 20:47:50,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-01 20:47:50,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2019-01-01 20:47:50,730 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 5 [2019-01-01 20:47:50,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:47:50,731 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-01-01 20:47:50,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 20:47:50,731 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2019-01-01 20:47:50,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-01 20:47:50,732 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:47:50,733 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-01 20:47:50,733 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:47:50,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:47:50,734 INFO L82 PathProgramCache]: Analyzing trace with hash 29863556, now seen corresponding path program 1 times [2019-01-01 20:47:50,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:47:50,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:47:50,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:50,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:47:50,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:50,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:50,784 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-01 20:47:50,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:47:50,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 20:47:50,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 20:47:50,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 20:47:50,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:47:50,785 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 3 states. [2019-01-01 20:47:50,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:47:50,846 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2019-01-01 20:47:50,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 20:47:50,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-01-01 20:47:50,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:47:50,847 INFO L225 Difference]: With dead ends: 14 [2019-01-01 20:47:50,847 INFO L226 Difference]: Without dead ends: 13 [2019-01-01 20:47:50,848 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 [2019-01-01 20:47:50,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-01 20:47:50,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-01-01 20:47:50,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-01 20:47:50,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-01-01 20:47:50,851 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 5 [2019-01-01 20:47:50,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:47:50,851 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-01-01 20:47:50,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 20:47:50,852 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-01-01 20:47:50,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-01 20:47:50,852 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:47:50,852 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-01 20:47:50,853 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:47:50,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:47:50,853 INFO L82 PathProgramCache]: Analyzing trace with hash 925955982, now seen corresponding path program 1 times [2019-01-01 20:47:50,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:47:50,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:47:50,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:50,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:47:50,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:50,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:50,904 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-01 20:47:50,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:47:50,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 20:47:50,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 20:47:50,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 20:47:50,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:47:50,905 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 3 states. [2019-01-01 20:47:50,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:47:50,928 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2019-01-01 20:47:50,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 20:47:50,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-01-01 20:47:50,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:47:50,930 INFO L225 Difference]: With dead ends: 13 [2019-01-01 20:47:50,930 INFO L226 Difference]: Without dead ends: 12 [2019-01-01 20:47:50,930 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 [2019-01-01 20:47:50,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-01 20:47:50,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-01-01 20:47:50,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-01 20:47:50,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2019-01-01 20:47:50,933 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 6 [2019-01-01 20:47:50,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:47:50,934 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-01-01 20:47:50,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 20:47:50,934 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2019-01-01 20:47:50,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-01 20:47:50,934 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:47:50,934 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-01 20:47:50,935 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:47:50,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:47:50,935 INFO L82 PathProgramCache]: Analyzing trace with hash 925961940, now seen corresponding path program 1 times [2019-01-01 20:47:50,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:47:50,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:47:50,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:50,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:47:50,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:50,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:50,967 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-01 20:47:50,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:47:50,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 20:47:50,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 20:47:50,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 20:47:50,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:47:50,968 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 3 states. [2019-01-01 20:47:50,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:47:50,994 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2019-01-01 20:47:50,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 20:47:50,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-01-01 20:47:50,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:47:50,995 INFO L225 Difference]: With dead ends: 12 [2019-01-01 20:47:50,995 INFO L226 Difference]: Without dead ends: 0 [2019-01-01 20:47:50,996 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 [2019-01-01 20:47:50,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-01 20:47:50,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-01 20:47:50,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-01 20:47:50,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 20:47:50,996 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2019-01-01 20:47:50,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:47:50,997 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 20:47:50,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 20:47:50,997 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-01 20:47:50,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-01 20:47:51,002 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-01 20:47:51,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:47:51,108 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-01 20:47:51,109 INFO L444 ceAbstractionStarter]: At program point L31(lines 15 32) the Hoare annotation is: (<= ULTIMATE.start_main_~x~0 2147483647) [2019-01-01 20:47:51,109 INFO L448 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2019-01-01 20:47:51,109 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2019-01-01 20:47:51,109 INFO L448 ceAbstractionStarter]: For program point L27-1(line 27) no Hoare annotation was computed. [2019-01-01 20:47:51,109 INFO L448 ceAbstractionStarter]: For program point L23(lines 23 29) no Hoare annotation was computed. [2019-01-01 20:47:51,109 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 27) no Hoare annotation was computed. [2019-01-01 20:47:51,110 INFO L448 ceAbstractionStarter]: For program point L21(lines 21 29) no Hoare annotation was computed. [2019-01-01 20:47:51,110 INFO L444 ceAbstractionStarter]: At program point L23-2(lines 20 30) the Hoare annotation is: (and (<= ULTIMATE.start_main_~x~0 2147483647) (<= ULTIMATE.start_main_~z~0 2147483647) (<= ULTIMATE.start_main_~y~0 2147483647)) [2019-01-01 20:47:51,110 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2019-01-01 20:47:51,110 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-01 20:47:51,110 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2019-01-01 20:47:51,110 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-01 20:47:51,114 INFO L448 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2019-01-01 20:47:51,114 INFO L448 ceAbstractionStarter]: For program point L24-1(line 24) no Hoare annotation was computed. [2019-01-01 20:47:51,114 INFO L448 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-01-01 20:47:51,114 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 27) no Hoare annotation was computed. [2019-01-01 20:47:51,114 INFO L448 ceAbstractionStarter]: For program point L22-1(line 22) no Hoare annotation was computed. [2019-01-01 20:47:51,114 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2019-01-01 20:47:51,115 INFO L448 ceAbstractionStarter]: For program point L20-2(lines 20 30) no Hoare annotation was computed. [2019-01-01 20:47:51,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 08:47:51 BoogieIcfgContainer [2019-01-01 20:47:51,130 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 20:47:51,131 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 20:47:51,131 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 20:47:51,131 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 20:47:51,131 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:47:50" (3/4) ... [2019-01-01 20:47:51,139 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-01 20:47:51,151 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-01 20:47:51,152 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-01 20:47:51,218 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 20:47:51,219 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 20:47:51,219 INFO L168 Benchmark]: Toolchain (without parser) took 1912.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -124.8 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-01-01 20:47:51,222 INFO L168 Benchmark]: CDTParser took 1.09 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:47:51,222 INFO L168 Benchmark]: CACSL2BoogieTranslator took 268.57 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 932.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 20:47:51,223 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.36 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:47:51,223 INFO L168 Benchmark]: Boogie Preprocessor took 21.62 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:47:51,225 INFO L168 Benchmark]: RCFGBuilder took 439.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -182.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-01-01 20:47:51,226 INFO L168 Benchmark]: TraceAbstraction took 1053.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 11.5 GB. [2019-01-01 20:47:51,226 INFO L168 Benchmark]: Witness Printer took 88.07 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:47:51,237 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.09 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 268.57 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 932.6 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 36.36 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.62 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 439.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -182.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1053.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 11.5 GB. * Witness Printer took 88.07 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: x <= 2147483647 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (x <= 2147483647 && z <= 2147483647) && y <= 2147483647 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 6 error locations. SAFE Result, 0.9s OverallTime, 6 OverallIterations, 1 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 72 SDtfs, 56 SDslu, 0 SDs, 0 SdLazy, 30 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 4 NumberOfFragments, 13 HoareAnnotationTreeSize, 2 FomulaSimplifications, 98 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 31 NumberOfCodeBlocks, 31 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 25 ConstructedInterpolants, 0 QuantifiedInterpolants, 293 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...