./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/termination-crafted/NestedRecursion_2b_true-no-overflow_false-termination_true-valid-memsafety.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/NestedRecursion_2b_true-no-overflow_false-termination_true-valid-memsafety.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 1b7166d94206693c3f254a3c1de8d5825f8510fb ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 01:17:03,554 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 01:17:03,556 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 01:17:03,568 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 01:17:03,568 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 01:17:03,569 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 01:17:03,571 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 01:17:03,573 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 01:17:03,575 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 01:17:03,576 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 01:17:03,577 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 01:17:03,577 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 01:17:03,578 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 01:17:03,579 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 01:17:03,580 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 01:17:03,581 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 01:17:03,582 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 01:17:03,584 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 01:17:03,589 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 01:17:03,593 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 01:17:03,597 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 01:17:03,598 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 01:17:03,601 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 01:17:03,601 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 01:17:03,602 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 01:17:03,603 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 01:17:03,604 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 01:17:03,605 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 01:17:03,606 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 01:17:03,607 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 01:17:03,607 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 01:17:03,608 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 01:17:03,608 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 01:17:03,609 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 01:17:03,610 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 01:17:03,610 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 01:17:03,611 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-01-14 01:17:03,639 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 01:17:03,639 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 01:17:03,641 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 01:17:03,643 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 01:17:03,643 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 01:17:03,644 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 01:17:03,644 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 01:17:03,644 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 01:17:03,644 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 01:17:03,644 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 01:17:03,645 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 01:17:03,645 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 01:17:03,645 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-14 01:17:03,645 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 01:17:03,645 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 01:17:03,645 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 01:17:03,646 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 01:17:03,647 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 01:17:03,647 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 01:17:03,647 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 01:17:03,647 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 01:17:03,648 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 01:17:03,648 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 01:17:03,648 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 01:17:03,648 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 01:17:03,648 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 01:17:03,649 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 01:17:03,649 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 -> 1b7166d94206693c3f254a3c1de8d5825f8510fb [2019-01-14 01:17:03,702 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 01:17:03,719 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 01:17:03,724 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 01:17:03,725 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 01:17:03,726 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 01:17:03,727 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted/NestedRecursion_2b_true-no-overflow_false-termination_true-valid-memsafety.c [2019-01-14 01:17:03,784 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05fc1a73d/5298112b44de46b594db799ab80adf9a/FLAG7767d1f2f [2019-01-14 01:17:04,195 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 01:17:04,195 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted/NestedRecursion_2b_true-no-overflow_false-termination_true-valid-memsafety.c [2019-01-14 01:17:04,202 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05fc1a73d/5298112b44de46b594db799ab80adf9a/FLAG7767d1f2f [2019-01-14 01:17:04,567 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05fc1a73d/5298112b44de46b594db799ab80adf9a [2019-01-14 01:17:04,571 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 01:17:04,572 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 01:17:04,574 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 01:17:04,576 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 01:17:04,582 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 01:17:04,583 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 01:17:04" (1/1) ... [2019-01-14 01:17:04,585 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17ef7ba7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:17:04, skipping insertion in model container [2019-01-14 01:17:04,586 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 01:17:04" (1/1) ... [2019-01-14 01:17:04,595 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 01:17:04,612 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 01:17:04,821 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 01:17:04,826 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 01:17:04,845 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 01:17:04,862 INFO L195 MainTranslator]: Completed translation [2019-01-14 01:17:04,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:17:04 WrapperNode [2019-01-14 01:17:04,864 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 01:17:04,865 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 01:17:04,865 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 01:17:04,865 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 01:17:04,876 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:17:04" (1/1) ... [2019-01-14 01:17:04,881 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:17:04" (1/1) ... [2019-01-14 01:17:04,906 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 01:17:04,908 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 01:17:04,908 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 01:17:04,908 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 01:17:04,919 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:17:04" (1/1) ... [2019-01-14 01:17:04,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:17:04" (1/1) ... [2019-01-14 01:17:04,920 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:17:04" (1/1) ... [2019-01-14 01:17:04,920 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:17:04" (1/1) ... [2019-01-14 01:17:04,922 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:17:04" (1/1) ... [2019-01-14 01:17:04,925 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:17:04" (1/1) ... [2019-01-14 01:17:04,926 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:17:04" (1/1) ... [2019-01-14 01:17:04,927 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 01:17:04,928 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 01:17:04,928 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 01:17:04,928 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 01:17:04,929 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:17:04" (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 01:17:05,062 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-01-14 01:17:05,062 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-01-14 01:17:05,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 01:17:05,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 01:17:05,333 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 01:17:05,334 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-14 01:17:05,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 01:17:05 BoogieIcfgContainer [2019-01-14 01:17:05,336 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 01:17:05,337 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 01:17:05,337 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 01:17:05,340 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 01:17:05,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 01:17:04" (1/3) ... [2019-01-14 01:17:05,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36db3f95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 01:17:05, skipping insertion in model container [2019-01-14 01:17:05,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:17:04" (2/3) ... [2019-01-14 01:17:05,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36db3f95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 01:17:05, skipping insertion in model container [2019-01-14 01:17:05,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 01:17:05" (3/3) ... [2019-01-14 01:17:05,344 INFO L112 eAbstractionObserver]: Analyzing ICFG NestedRecursion_2b_true-no-overflow_false-termination_true-valid-memsafety.c [2019-01-14 01:17:05,356 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 01:17:05,366 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-01-14 01:17:05,387 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-01-14 01:17:05,422 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 01:17:05,423 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 01:17:05,423 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 01:17:05,423 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 01:17:05,423 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 01:17:05,424 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 01:17:05,424 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 01:17:05,424 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 01:17:05,424 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 01:17:05,455 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-01-14 01:17:05,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-14 01:17:05,461 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:17:05,462 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-14 01:17:05,464 INFO L423 AbstractCegarLoop]: === Iteration 1 === [gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:17:05,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:17:05,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1454635077, now seen corresponding path program 1 times [2019-01-14 01:17:05,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:17:05,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:17:05,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:05,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:17:05,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:05,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:17:05,677 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 01:17:05,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:17:05,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 01:17:05,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 01:17:05,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 01:17:05,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:17:05,697 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2019-01-14 01:17:05,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:17:05,898 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2019-01-14 01:17:05,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 01:17:05,901 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-01-14 01:17:05,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:17:05,910 INFO L225 Difference]: With dead ends: 41 [2019-01-14 01:17:05,911 INFO L226 Difference]: Without dead ends: 36 [2019-01-14 01:17:05,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 01:17:05,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-14 01:17:05,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2019-01-14 01:17:05,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-14 01:17:05,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2019-01-14 01:17:05,958 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 6 [2019-01-14 01:17:05,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:17:05,959 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-01-14 01:17:05,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 01:17:05,959 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2019-01-14 01:17:05,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-14 01:17:05,959 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:17:05,960 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:17:05,960 INFO L423 AbstractCegarLoop]: === Iteration 2 === [gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:17:05,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:17:05,961 INFO L82 PathProgramCache]: Analyzing trace with hash 2144014465, now seen corresponding path program 1 times [2019-01-14 01:17:05,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:17:05,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:17:05,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:05,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:17:05,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:05,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:17:06,044 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 01:17:06,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:17:06,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 01:17:06,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 01:17:06,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 01:17:06,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:17:06,051 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand 5 states. [2019-01-14 01:17:06,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:17:06,351 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2019-01-14 01:17:06,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 01:17:06,352 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-01-14 01:17:06,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:17:06,354 INFO L225 Difference]: With dead ends: 50 [2019-01-14 01:17:06,354 INFO L226 Difference]: Without dead ends: 46 [2019-01-14 01:17:06,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 01:17:06,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-14 01:17:06,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2019-01-14 01:17:06,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-14 01:17:06,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2019-01-14 01:17:06,373 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 7 [2019-01-14 01:17:06,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:17:06,373 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2019-01-14 01:17:06,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 01:17:06,374 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2019-01-14 01:17:06,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-14 01:17:06,374 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:17:06,375 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-14 01:17:06,375 INFO L423 AbstractCegarLoop]: === Iteration 3 === [gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:17:06,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:17:06,375 INFO L82 PathProgramCache]: Analyzing trace with hash -736378463, now seen corresponding path program 1 times [2019-01-14 01:17:06,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:17:06,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:17:06,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:06,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:17:06,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:06,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:17:06,526 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:17:06,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:17:06,527 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 01:17:06,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:17:06,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:17:06,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:17:06,594 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:17:06,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:17:06,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-14 01:17:06,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 01:17:06,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 01:17:06,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-14 01:17:06,622 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand 7 states. [2019-01-14 01:17:06,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:17:06,949 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2019-01-14 01:17:06,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 01:17:06,951 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-01-14 01:17:06,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:17:06,954 INFO L225 Difference]: With dead ends: 63 [2019-01-14 01:17:06,954 INFO L226 Difference]: Without dead ends: 62 [2019-01-14 01:17:06,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-01-14 01:17:06,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-14 01:17:06,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 52. [2019-01-14 01:17:06,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-14 01:17:06,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2019-01-14 01:17:06,970 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 66 transitions. Word has length 12 [2019-01-14 01:17:06,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:17:06,970 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 66 transitions. [2019-01-14 01:17:06,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 01:17:06,970 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2019-01-14 01:17:06,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-14 01:17:06,972 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:17:06,972 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:17:06,972 INFO L423 AbstractCegarLoop]: === Iteration 4 === [gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:17:06,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:17:06,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1009328462, now seen corresponding path program 1 times [2019-01-14 01:17:06,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:17:06,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:17:06,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:06,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:17:06,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:06,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:17:07,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 01:17:07,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:17:07,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 01:17:07,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 01:17:07,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 01:17:07,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 01:17:07,045 INFO L87 Difference]: Start difference. First operand 52 states and 66 transitions. Second operand 4 states. [2019-01-14 01:17:07,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:17:07,079 INFO L93 Difference]: Finished difference Result 78 states and 109 transitions. [2019-01-14 01:17:07,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 01:17:07,081 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-01-14 01:17:07,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:17:07,083 INFO L225 Difference]: With dead ends: 78 [2019-01-14 01:17:07,084 INFO L226 Difference]: Without dead ends: 77 [2019-01-14 01:17:07,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 01:17:07,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-14 01:17:07,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 66. [2019-01-14 01:17:07,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-14 01:17:07,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2019-01-14 01:17:07,100 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 14 [2019-01-14 01:17:07,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:17:07,100 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2019-01-14 01:17:07,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 01:17:07,101 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2019-01-14 01:17:07,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-14 01:17:07,101 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:17:07,102 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:17:07,102 INFO L423 AbstractCegarLoop]: === Iteration 5 === [gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:17:07,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:17:07,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1224411294, now seen corresponding path program 1 times [2019-01-14 01:17:07,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:17:07,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:17:07,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:07,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:17:07,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:07,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:17:07,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 01:17:07,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:17:07,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 01:17:07,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 01:17:07,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 01:17:07,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:17:07,139 INFO L87 Difference]: Start difference. First operand 66 states and 84 transitions. Second operand 3 states. [2019-01-14 01:17:07,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:17:07,160 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2019-01-14 01:17:07,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 01:17:07,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-01-14 01:17:07,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:17:07,164 INFO L225 Difference]: With dead ends: 66 [2019-01-14 01:17:07,164 INFO L226 Difference]: Without dead ends: 65 [2019-01-14 01:17:07,165 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-14 01:17:07,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-14 01:17:07,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-01-14 01:17:07,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-14 01:17:07,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 80 transitions. [2019-01-14 01:17:07,177 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 80 transitions. Word has length 15 [2019-01-14 01:17:07,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:17:07,177 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 80 transitions. [2019-01-14 01:17:07,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 01:17:07,177 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 80 transitions. [2019-01-14 01:17:07,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 01:17:07,178 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:17:07,178 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1] [2019-01-14 01:17:07,179 INFO L423 AbstractCegarLoop]: === Iteration 6 === [gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:17:07,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:17:07,179 INFO L82 PathProgramCache]: Analyzing trace with hash -231947135, now seen corresponding path program 2 times [2019-01-14 01:17:07,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:17:07,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:17:07,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:07,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:17:07,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:07,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:17:07,342 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:17:07,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:17:07,343 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 01:17:07,358 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 01:17:07,394 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 01:17:07,394 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:17:07,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:17:07,405 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:17:07,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:17:07,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-14 01:17:07,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 01:17:07,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 01:17:07,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-14 01:17:07,440 INFO L87 Difference]: Start difference. First operand 65 states and 80 transitions. Second operand 9 states. [2019-01-14 01:17:07,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:17:07,967 INFO L93 Difference]: Finished difference Result 85 states and 101 transitions. [2019-01-14 01:17:07,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 01:17:07,970 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2019-01-14 01:17:07,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:17:07,971 INFO L225 Difference]: With dead ends: 85 [2019-01-14 01:17:07,971 INFO L226 Difference]: Without dead ends: 84 [2019-01-14 01:17:07,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-01-14 01:17:07,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-14 01:17:07,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2019-01-14 01:17:07,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-14 01:17:07,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 100 transitions. [2019-01-14 01:17:07,986 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 100 transitions. Word has length 17 [2019-01-14 01:17:07,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:17:07,986 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 100 transitions. [2019-01-14 01:17:07,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 01:17:07,986 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2019-01-14 01:17:07,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 01:17:07,987 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:17:07,987 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:17:07,988 INFO L423 AbstractCegarLoop]: === Iteration 7 === [gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:17:07,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:17:07,988 INFO L82 PathProgramCache]: Analyzing trace with hash -855233152, now seen corresponding path program 1 times [2019-01-14 01:17:07,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:17:07,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:17:07,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:07,990 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:17:07,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:08,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:17:08,071 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 01:17:08,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:17:08,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 01:17:08,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 01:17:08,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 01:17:08,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 01:17:08,073 INFO L87 Difference]: Start difference. First operand 81 states and 100 transitions. Second operand 6 states. [2019-01-14 01:17:08,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:17:08,368 INFO L93 Difference]: Finished difference Result 117 states and 149 transitions. [2019-01-14 01:17:08,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 01:17:08,368 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-01-14 01:17:08,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:17:08,372 INFO L225 Difference]: With dead ends: 117 [2019-01-14 01:17:08,372 INFO L226 Difference]: Without dead ends: 116 [2019-01-14 01:17:08,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-01-14 01:17:08,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-01-14 01:17:08,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 109. [2019-01-14 01:17:08,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-14 01:17:08,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 143 transitions. [2019-01-14 01:17:08,396 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 143 transitions. Word has length 19 [2019-01-14 01:17:08,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:17:08,396 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 143 transitions. [2019-01-14 01:17:08,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 01:17:08,397 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 143 transitions. [2019-01-14 01:17:08,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 01:17:08,398 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:17:08,398 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:17:08,398 INFO L423 AbstractCegarLoop]: === Iteration 8 === [gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:17:08,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:17:08,399 INFO L82 PathProgramCache]: Analyzing trace with hash -742423898, now seen corresponding path program 1 times [2019-01-14 01:17:08,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:17:08,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:17:08,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:08,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:17:08,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:08,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:17:08,469 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 01:17:08,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:17:08,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 01:17:08,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 01:17:08,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 01:17:08,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 01:17:08,472 INFO L87 Difference]: Start difference. First operand 109 states and 143 transitions. Second operand 6 states. [2019-01-14 01:17:08,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:17:08,593 INFO L93 Difference]: Finished difference Result 130 states and 174 transitions. [2019-01-14 01:17:08,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 01:17:08,594 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-01-14 01:17:08,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:17:08,595 INFO L225 Difference]: With dead ends: 130 [2019-01-14 01:17:08,595 INFO L226 Difference]: Without dead ends: 66 [2019-01-14 01:17:08,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-14 01:17:08,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-14 01:17:08,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 35. [2019-01-14 01:17:08,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-14 01:17:08,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2019-01-14 01:17:08,605 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 20 [2019-01-14 01:17:08,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:17:08,606 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2019-01-14 01:17:08,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 01:17:08,606 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2019-01-14 01:17:08,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-14 01:17:08,607 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:17:08,607 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1] [2019-01-14 01:17:08,608 INFO L423 AbstractCegarLoop]: === Iteration 9 === [gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:17:08,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:17:08,608 INFO L82 PathProgramCache]: Analyzing trace with hash -559247967, now seen corresponding path program 3 times [2019-01-14 01:17:08,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:17:08,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:17:08,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:08,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:17:08,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:08,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:17:08,791 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:17:08,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:17:08,792 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 01:17:08,808 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 01:17:08,827 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-14 01:17:08,827 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:17:08,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:17:08,838 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:17:08,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:17:08,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-01-14 01:17:08,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 01:17:08,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 01:17:08,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-01-14 01:17:08,861 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 11 states. [2019-01-14 01:17:09,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:17:09,437 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2019-01-14 01:17:09,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-14 01:17:09,438 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2019-01-14 01:17:09,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:17:09,440 INFO L225 Difference]: With dead ends: 62 [2019-01-14 01:17:09,440 INFO L226 Difference]: Without dead ends: 61 [2019-01-14 01:17:09,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2019-01-14 01:17:09,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-14 01:17:09,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 42. [2019-01-14 01:17:09,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-14 01:17:09,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-01-14 01:17:09,451 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 22 [2019-01-14 01:17:09,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:17:09,451 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-01-14 01:17:09,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 01:17:09,451 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-01-14 01:17:09,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-14 01:17:09,454 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:17:09,454 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:17:09,455 INFO L423 AbstractCegarLoop]: === Iteration 10 === [gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:17:09,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:17:09,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1606295908, now seen corresponding path program 2 times [2019-01-14 01:17:09,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:17:09,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:17:09,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:09,458 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:17:09,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:09,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:17:09,561 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 01:17:09,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:17:09,562 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 01:17:09,571 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 01:17:09,581 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 01:17:09,581 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:17:09,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:17:09,590 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 01:17:09,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:17:09,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-14 01:17:09,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 01:17:09,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 01:17:09,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-14 01:17:09,613 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 8 states. [2019-01-14 01:17:09,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:17:09,871 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2019-01-14 01:17:09,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 01:17:09,872 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-01-14 01:17:09,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:17:09,873 INFO L225 Difference]: With dead ends: 70 [2019-01-14 01:17:09,873 INFO L226 Difference]: Without dead ends: 54 [2019-01-14 01:17:09,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-01-14 01:17:09,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-14 01:17:09,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2019-01-14 01:17:09,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-14 01:17:09,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-01-14 01:17:09,880 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 25 [2019-01-14 01:17:09,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:17:09,881 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-01-14 01:17:09,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 01:17:09,881 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-01-14 01:17:09,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-14 01:17:09,884 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:17:09,884 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1] [2019-01-14 01:17:09,884 INFO L423 AbstractCegarLoop]: === Iteration 11 === [gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:17:09,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:17:09,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1828550785, now seen corresponding path program 4 times [2019-01-14 01:17:09,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:17:09,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:17:09,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:09,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:17:09,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:09,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:17:10,031 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:17:10,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:17:10,032 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 01:17:10,046 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 01:17:10,056 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 01:17:10,056 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:17:10,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:17:10,186 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-01-14 01:17:10,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:17:10,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 13 [2019-01-14 01:17:10,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-14 01:17:10,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-14 01:17:10,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-01-14 01:17:10,207 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 14 states. [2019-01-14 01:17:10,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:17:10,296 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2019-01-14 01:17:10,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 01:17:10,298 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2019-01-14 01:17:10,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:17:10,299 INFO L225 Difference]: With dead ends: 61 [2019-01-14 01:17:10,300 INFO L226 Difference]: Without dead ends: 60 [2019-01-14 01:17:10,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-01-14 01:17:10,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-14 01:17:10,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 33. [2019-01-14 01:17:10,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-14 01:17:10,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2019-01-14 01:17:10,308 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 27 [2019-01-14 01:17:10,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:17:10,310 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2019-01-14 01:17:10,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-14 01:17:10,310 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2019-01-14 01:17:10,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-14 01:17:10,312 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:17:10,312 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:17:10,313 INFO L423 AbstractCegarLoop]: === Iteration 12 === [gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:17:10,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:17:10,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1103662182, now seen corresponding path program 3 times [2019-01-14 01:17:10,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:17:10,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:17:10,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:10,317 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:17:10,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:10,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:17:10,428 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 20 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 01:17:10,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:17:10,428 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:17:10,463 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 01:17:10,478 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-14 01:17:10,478 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:17:10,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:17:10,488 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 20 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 01:17:10,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:17:10,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-14 01:17:10,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 01:17:10,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 01:17:10,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-01-14 01:17:10,517 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 10 states. [2019-01-14 01:17:10,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:17:10,724 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2019-01-14 01:17:10,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 01:17:10,725 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2019-01-14 01:17:10,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:17:10,726 INFO L225 Difference]: With dead ends: 42 [2019-01-14 01:17:10,726 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 01:17:10,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-01-14 01:17:10,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 01:17:10,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 01:17:10,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 01:17:10,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 01:17:10,727 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2019-01-14 01:17:10,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:17:10,727 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 01:17:10,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 01:17:10,729 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 01:17:10,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 01:17:10,736 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-14 01:17:10,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:17:10,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:17:10,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:17:10,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:17:10,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:17:10,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:17:10,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:17:10,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:17:11,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:17:11,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:17:11,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:17:11,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:17:11,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:17:11,362 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 1 [2019-01-14 01:17:12,534 WARN L181 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 85 DAG size of output: 26 [2019-01-14 01:17:12,661 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 23 [2019-01-14 01:17:12,665 INFO L448 ceAbstractionStarter]: For program point gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 15) no Hoare annotation was computed. [2019-01-14 01:17:12,666 INFO L448 ceAbstractionStarter]: For program point gFINAL(lines 10 16) no Hoare annotation was computed. [2019-01-14 01:17:12,666 INFO L448 ceAbstractionStarter]: For program point gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 15) no Hoare annotation was computed. [2019-01-14 01:17:12,666 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2019-01-14 01:17:12,666 INFO L448 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. [2019-01-14 01:17:12,666 INFO L444 ceAbstractionStarter]: At program point L15-2(line 15) the Hoare annotation is: (and (or (or (< 2147483647 |g_#in~x|) (< |g_#in~x| 0)) (and (<= 0 g_~x) (<= g_~x 2147483647) (not (= 0 g_~x)))) (or (<= 2 g_~x) (< |g_#in~x| 2) (< 2 |g_#in~x|))) [2019-01-14 01:17:12,667 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 15) no Hoare annotation was computed. [2019-01-14 01:17:12,668 INFO L448 ceAbstractionStarter]: For program point L15-3(line 15) no Hoare annotation was computed. [2019-01-14 01:17:12,669 INFO L448 ceAbstractionStarter]: For program point L15-4(line 15) no Hoare annotation was computed. [2019-01-14 01:17:12,669 INFO L448 ceAbstractionStarter]: For program point gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 15) no Hoare annotation was computed. [2019-01-14 01:17:12,669 INFO L448 ceAbstractionStarter]: For program point L15-5(line 15) no Hoare annotation was computed. [2019-01-14 01:17:12,669 INFO L448 ceAbstractionStarter]: For program point gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 15) no Hoare annotation was computed. [2019-01-14 01:17:12,669 INFO L444 ceAbstractionStarter]: At program point L15-6(line 15) the Hoare annotation is: (let ((.cse0 (< 2147483647 |g_#in~x|)) (.cse1 (< |g_#in~x| 0))) (and (or (and (and (<= g_~x 2147483647) (<= |g_#t~ret0| 1)) (<= 1 |g_#t~ret0|)) (or .cse0 .cse1)) (or (< |g_#in~x| 2) (< 2 |g_#in~x|)) (or (<= 1 g_~x) .cse0 .cse1))) [2019-01-14 01:17:12,669 INFO L448 ceAbstractionStarter]: For program point gEXIT(lines 10 16) no Hoare annotation was computed. [2019-01-14 01:17:12,672 INFO L448 ceAbstractionStarter]: For program point L15-7(line 15) no Hoare annotation was computed. [2019-01-14 01:17:12,672 INFO L451 ceAbstractionStarter]: At program point gENTRY(lines 10 16) the Hoare annotation is: true [2019-01-14 01:17:12,672 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-14 01:17:12,672 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-14 01:17:12,672 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-14 01:17:12,672 INFO L444 ceAbstractionStarter]: At program point L21(line 21) the Hoare annotation is: (and (<= ULTIMATE.start_main_~x~0 2147483647) (<= 0 ULTIMATE.start_main_~x~0)) [2019-01-14 01:17:12,672 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2019-01-14 01:17:12,672 INFO L448 ceAbstractionStarter]: For program point L21-1(line 21) no Hoare annotation was computed. [2019-01-14 01:17:12,672 INFO L444 ceAbstractionStarter]: At program point L18(lines 18 22) the Hoare annotation is: (<= ULTIMATE.start_main_~x~0 2147483647) [2019-01-14 01:17:12,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 01:17:12 BoogieIcfgContainer [2019-01-14 01:17:12,685 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 01:17:12,685 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 01:17:12,685 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 01:17:12,686 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 01:17:12,686 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 01:17:05" (3/4) ... [2019-01-14 01:17:12,689 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 01:17:12,695 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2019-01-14 01:17:12,700 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-14 01:17:12,700 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-14 01:17:12,748 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 01:17:12,748 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 01:17:12,749 INFO L168 Benchmark]: Toolchain (without parser) took 8177.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 205.5 MB). Free memory was 951.3 MB in the beginning and 1.0 GB in the end (delta: -91.3 MB). Peak memory consumption was 114.3 MB. Max. memory is 11.5 GB. [2019-01-14 01:17:12,751 INFO L168 Benchmark]: CDTParser took 0.20 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 01:17:12,751 INFO L168 Benchmark]: CACSL2BoogieTranslator took 289.85 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 01:17:12,752 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.61 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 01:17:12,752 INFO L168 Benchmark]: Boogie Preprocessor took 19.63 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 01:17:12,752 INFO L168 Benchmark]: RCFGBuilder took 407.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -174.6 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-01-14 01:17:12,754 INFO L168 Benchmark]: TraceAbstraction took 7348.43 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 72.6 MB). Peak memory consumption was 138.1 MB. Max. memory is 11.5 GB. [2019-01-14 01:17:12,755 INFO L168 Benchmark]: Witness Printer took 62.92 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 01:17:12,760 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.20 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 289.85 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.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 41.61 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.63 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 407.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -174.6 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7348.43 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 72.6 MB). Peak memory consumption was 138.1 MB. Max. memory is 11.5 GB. * Witness Printer took 62.92 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: 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: 18]: Loop Invariant Derived loop invariant: x <= 2147483647 - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 4 error locations. SAFE Result, 7.2s OverallTime, 12 OverallIterations, 5 TraceHistogramMax, 3.0s AutomataDifference, 0.0s DeadEndRemovalTime, 1.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 199 SDtfs, 353 SDslu, 618 SDs, 0 SdLazy, 618 SolverSat, 125 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 238 GetRequests, 134 SyntacticMatches, 4 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 126 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 62 PreInvPairs, 67 NumberOfFragments, 88 HoareAnnotationTreeSize, 62 FomulaSimplifications, 18128 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 5 FomulaSimplificationsInter, 4818 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 347 NumberOfCodeBlocks, 347 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 329 ConstructedInterpolants, 0 QuantifiedInterpolants, 21879 SizeOfPredicates, 19 NumberOfNonLiveVariables, 265 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 131/307 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...