./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/loop-invgen/SpamAssassin-loop_true-unreach-call_false-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/loop-invgen/SpamAssassin-loop_true-unreach-call_false-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 751def0588f132c393a8666a5acb62e8205c40a1 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 18:20:35,515 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 18:20:35,517 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 18:20:35,529 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 18:20:35,529 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 18:20:35,530 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 18:20:35,532 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 18:20:35,540 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 18:20:35,542 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 18:20:35,543 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 18:20:35,544 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 18:20:35,544 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 18:20:35,545 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 18:20:35,546 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 18:20:35,548 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 18:20:35,548 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 18:20:35,549 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 18:20:35,551 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 18:20:35,554 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 18:20:35,555 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 18:20:35,556 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 18:20:35,558 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 18:20:35,560 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 18:20:35,561 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 18:20:35,561 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 18:20:35,562 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 18:20:35,563 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 18:20:35,564 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 18:20:35,565 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 18:20:35,566 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 18:20:35,567 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 18:20:35,567 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 18:20:35,568 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 18:20:35,568 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 18:20:35,569 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 18:20:35,570 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 18:20:35,570 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 18:20:35,585 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 18:20:35,586 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 18:20:35,586 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 18:20:35,587 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 18:20:35,587 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 18:20:35,587 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 18:20:35,588 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 18:20:35,588 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 18:20:35,589 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 18:20:35,589 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 18:20:35,589 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 18:20:35,589 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 18:20:35,589 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 18:20:35,589 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 18:20:35,590 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 18:20:35,590 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 18:20:35,590 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 18:20:35,590 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 18:20:35,590 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 18:20:35,591 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 18:20:35,592 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 18:20:35,592 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 18:20:35,592 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 18:20:35,593 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 18:20:35,593 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 18:20:35,593 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 18:20:35,593 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 18:20:35,593 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 18:20:35,593 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 18:20:35,595 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 18:20:35,595 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 ! call(__VERIFIER_error())) ) 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 751def0588f132c393a8666a5acb62e8205c40a1 [2018-11-28 18:20:35,631 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 18:20:35,644 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 18:20:35,648 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 18:20:35,649 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 18:20:35,650 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 18:20:35,651 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loop-invgen/SpamAssassin-loop_true-unreach-call_false-termination.i [2018-11-28 18:20:35,705 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1715c8647/57f7d7b6577e418788950f1e6027514d/FLAG73a05e66e [2018-11-28 18:20:36,101 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 18:20:36,102 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loop-invgen/SpamAssassin-loop_true-unreach-call_false-termination.i [2018-11-28 18:20:36,108 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1715c8647/57f7d7b6577e418788950f1e6027514d/FLAG73a05e66e [2018-11-28 18:20:36,467 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1715c8647/57f7d7b6577e418788950f1e6027514d [2018-11-28 18:20:36,471 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 18:20:36,473 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 18:20:36,474 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 18:20:36,474 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 18:20:36,478 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 18:20:36,479 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:20:36" (1/1) ... [2018-11-28 18:20:36,483 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fd1fc6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:36, skipping insertion in model container [2018-11-28 18:20:36,483 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:20:36" (1/1) ... [2018-11-28 18:20:36,492 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 18:20:36,514 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 18:20:36,725 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:20:36,729 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 18:20:36,761 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:20:36,778 INFO L195 MainTranslator]: Completed translation [2018-11-28 18:20:36,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:36 WrapperNode [2018-11-28 18:20:36,779 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 18:20:36,780 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 18:20:36,780 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 18:20:36,781 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 18:20:36,790 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:36" (1/1) ... [2018-11-28 18:20:36,796 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:36" (1/1) ... [2018-11-28 18:20:36,806 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 18:20:36,806 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 18:20:36,807 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 18:20:36,807 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 18:20:36,818 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:36" (1/1) ... [2018-11-28 18:20:36,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:36" (1/1) ... [2018-11-28 18:20:36,819 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:36" (1/1) ... [2018-11-28 18:20:36,819 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:36" (1/1) ... [2018-11-28 18:20:36,833 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:36" (1/1) ... [2018-11-28 18:20:36,844 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:36" (1/1) ... [2018-11-28 18:20:36,845 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:36" (1/1) ... [2018-11-28 18:20:36,847 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 18:20:36,848 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 18:20:36,848 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 18:20:36,848 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 18:20:36,849 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 18:20:36,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 18:20:36,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 18:20:36,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 18:20:36,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 18:20:36,983 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 18:20:36,983 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 18:20:36,983 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-28 18:20:36,983 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-28 18:20:37,519 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 18:20:37,519 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-28 18:20:37,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:20:37 BoogieIcfgContainer [2018-11-28 18:20:37,520 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 18:20:37,521 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 18:20:37,522 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 18:20:37,525 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 18:20:37,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:20:36" (1/3) ... [2018-11-28 18:20:37,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40522ef1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:20:37, skipping insertion in model container [2018-11-28 18:20:37,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:36" (2/3) ... [2018-11-28 18:20:37,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40522ef1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:20:37, skipping insertion in model container [2018-11-28 18:20:37,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:20:37" (3/3) ... [2018-11-28 18:20:37,529 INFO L112 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop_true-unreach-call_false-termination.i [2018-11-28 18:20:37,537 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 18:20:37,545 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 18:20:37,559 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 18:20:37,594 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 18:20:37,594 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 18:20:37,595 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 18:20:37,595 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 18:20:37,595 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 18:20:37,595 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 18:20:37,595 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 18:20:37,596 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 18:20:37,596 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 18:20:37,623 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-11-28 18:20:37,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-28 18:20:37,630 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:20:37,631 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:20:37,633 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:20:37,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:20:37,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1778619980, now seen corresponding path program 1 times [2018-11-28 18:20:37,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:20:37,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:20:37,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:20:37,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:20:37,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:20:37,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:20:37,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:20:37,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:20:37,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 18:20:37,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 18:20:37,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 18:20:37,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:20:37,904 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 5 states. [2018-11-28 18:20:38,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:20:38,242 INFO L93 Difference]: Finished difference Result 84 states and 147 transitions. [2018-11-28 18:20:38,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 18:20:38,247 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-28 18:20:38,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:20:38,261 INFO L225 Difference]: With dead ends: 84 [2018-11-28 18:20:38,261 INFO L226 Difference]: Without dead ends: 43 [2018-11-28 18:20:38,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:20:38,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-28 18:20:38,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2018-11-28 18:20:38,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-28 18:20:38,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2018-11-28 18:20:38,354 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 13 [2018-11-28 18:20:38,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:20:38,354 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2018-11-28 18:20:38,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 18:20:38,355 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2018-11-28 18:20:38,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-28 18:20:38,356 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:20:38,356 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:20:38,357 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:20:38,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:20:38,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1756664013, now seen corresponding path program 1 times [2018-11-28 18:20:38,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:20:38,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:20:38,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:20:38,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:20:38,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:20:38,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:20:38,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:20:38,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:20:38,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 18:20:38,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 18:20:38,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 18:20:38,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:20:38,516 INFO L87 Difference]: Start difference. First operand 41 states and 58 transitions. Second operand 5 states. [2018-11-28 18:20:38,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:20:38,722 INFO L93 Difference]: Finished difference Result 56 states and 75 transitions. [2018-11-28 18:20:38,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 18:20:38,722 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-28 18:20:38,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:20:38,726 INFO L225 Difference]: With dead ends: 56 [2018-11-28 18:20:38,726 INFO L226 Difference]: Without dead ends: 54 [2018-11-28 18:20:38,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:20:38,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-28 18:20:38,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2018-11-28 18:20:38,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-28 18:20:38,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 66 transitions. [2018-11-28 18:20:38,744 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 66 transitions. Word has length 13 [2018-11-28 18:20:38,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:20:38,745 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 66 transitions. [2018-11-28 18:20:38,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 18:20:38,745 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2018-11-28 18:20:38,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 18:20:38,746 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:20:38,746 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:20:38,746 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:20:38,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:20:38,747 INFO L82 PathProgramCache]: Analyzing trace with hash -276218857, now seen corresponding path program 1 times [2018-11-28 18:20:38,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:20:38,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:20:38,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:20:38,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:20:38,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:20:38,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:20:38,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:20:38,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:20:38,975 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:20:38,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:20:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:20:39,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:20:39,088 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:20:39,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 18:20:39,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2018-11-28 18:20:39,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 18:20:39,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 18:20:39,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-28 18:20:39,111 INFO L87 Difference]: Start difference. First operand 50 states and 66 transitions. Second operand 9 states. [2018-11-28 18:20:39,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:20:39,931 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2018-11-28 18:20:39,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 18:20:39,932 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-11-28 18:20:39,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:20:39,936 INFO L225 Difference]: With dead ends: 58 [2018-11-28 18:20:39,937 INFO L226 Difference]: Without dead ends: 56 [2018-11-28 18:20:39,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-28 18:20:39,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-28 18:20:39,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2018-11-28 18:20:39,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-28 18:20:39,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2018-11-28 18:20:39,953 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 18 [2018-11-28 18:20:39,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:20:39,953 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2018-11-28 18:20:39,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 18:20:39,953 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2018-11-28 18:20:39,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 18:20:39,955 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:20:39,956 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:20:39,956 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:20:39,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:20:39,956 INFO L82 PathProgramCache]: Analyzing trace with hash -12086036, now seen corresponding path program 1 times [2018-11-28 18:20:39,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:20:39,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:20:39,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:20:39,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:20:39,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:20:39,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:20:40,126 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 18:20:40,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:20:40,127 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:20:40,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:20:40,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:20:40,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:20:40,208 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 18:20:40,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 18:20:40,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2018-11-28 18:20:40,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 18:20:40,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 18:20:40,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-28 18:20:40,228 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand 11 states. [2018-11-28 18:20:40,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:20:40,737 INFO L93 Difference]: Finished difference Result 62 states and 77 transitions. [2018-11-28 18:20:40,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 18:20:40,740 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-11-28 18:20:40,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:20:40,742 INFO L225 Difference]: With dead ends: 62 [2018-11-28 18:20:40,742 INFO L226 Difference]: Without dead ends: 60 [2018-11-28 18:20:40,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-11-28 18:20:40,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-28 18:20:40,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-11-28 18:20:40,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-28 18:20:40,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2018-11-28 18:20:40,755 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 23 [2018-11-28 18:20:40,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:20:40,756 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2018-11-28 18:20:40,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 18:20:40,756 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2018-11-28 18:20:40,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 18:20:40,757 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:20:40,757 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:20:40,758 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:20:40,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:20:40,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1403678473, now seen corresponding path program 1 times [2018-11-28 18:20:40,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:20:40,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:20:40,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:20:40,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:20:40,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:20:40,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:20:40,844 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-28 18:20:40,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:20:40,845 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:20:40,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:20:40,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:20:40,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:20:40,905 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-28 18:20:40,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 18:20:40,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2018-11-28 18:20:40,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 18:20:40,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 18:20:40,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-28 18:20:40,927 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand 9 states. [2018-11-28 18:20:41,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:20:41,546 INFO L93 Difference]: Finished difference Result 67 states and 81 transitions. [2018-11-28 18:20:41,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 18:20:41,549 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-11-28 18:20:41,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:20:41,551 INFO L225 Difference]: With dead ends: 67 [2018-11-28 18:20:41,551 INFO L226 Difference]: Without dead ends: 65 [2018-11-28 18:20:41,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-28 18:20:41,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-28 18:20:41,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2018-11-28 18:20:41,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-28 18:20:41,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2018-11-28 18:20:41,564 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 28 [2018-11-28 18:20:41,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:20:41,565 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2018-11-28 18:20:41,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 18:20:41,565 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2018-11-28 18:20:41,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-28 18:20:41,567 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:20:41,567 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:20:41,567 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:20:41,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:20:41,568 INFO L82 PathProgramCache]: Analyzing trace with hash -869865180, now seen corresponding path program 1 times [2018-11-28 18:20:41,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:20:41,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:20:41,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:20:41,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:20:41,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:20:41,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:20:41,677 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 11 proven. 16 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-28 18:20:41,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:20:41,678 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:20:41,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:20:41,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:20:41,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:20:41,782 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-28 18:20:41,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 18:20:41,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2018-11-28 18:20:41,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 18:20:41,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 18:20:41,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-28 18:20:41,814 INFO L87 Difference]: Start difference. First operand 62 states and 75 transitions. Second operand 9 states. [2018-11-28 18:20:42,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:20:42,220 INFO L93 Difference]: Finished difference Result 74 states and 90 transitions. [2018-11-28 18:20:42,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 18:20:42,221 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 46 [2018-11-28 18:20:42,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:20:42,222 INFO L225 Difference]: With dead ends: 74 [2018-11-28 18:20:42,222 INFO L226 Difference]: Without dead ends: 72 [2018-11-28 18:20:42,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-28 18:20:42,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-28 18:20:42,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 66. [2018-11-28 18:20:42,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-28 18:20:42,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2018-11-28 18:20:42,235 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 46 [2018-11-28 18:20:42,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:20:42,236 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2018-11-28 18:20:42,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 18:20:42,236 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2018-11-28 18:20:42,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-28 18:20:42,238 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:20:42,238 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:20:42,239 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:20:42,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:20:42,239 INFO L82 PathProgramCache]: Analyzing trace with hash -863098428, now seen corresponding path program 1 times [2018-11-28 18:20:42,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:20:42,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:20:42,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:20:42,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:20:42,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:20:42,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:20:42,561 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 15 proven. 22 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-11-28 18:20:42,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:20:42,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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:20:42,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:20:42,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:20:42,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:20:42,654 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-28 18:20:42,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 18:20:42,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 11 [2018-11-28 18:20:42,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 18:20:42,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 18:20:42,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-11-28 18:20:42,682 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand 11 states. [2018-11-28 18:20:43,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:20:43,060 INFO L93 Difference]: Finished difference Result 78 states and 93 transitions. [2018-11-28 18:20:43,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 18:20:43,061 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2018-11-28 18:20:43,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:20:43,063 INFO L225 Difference]: With dead ends: 78 [2018-11-28 18:20:43,063 INFO L226 Difference]: Without dead ends: 76 [2018-11-28 18:20:43,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-11-28 18:20:43,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-28 18:20:43,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 70. [2018-11-28 18:20:43,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-28 18:20:43,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2018-11-28 18:20:43,076 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 56 [2018-11-28 18:20:43,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:20:43,076 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2018-11-28 18:20:43,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 18:20:43,076 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2018-11-28 18:20:43,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-28 18:20:43,080 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:20:43,080 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:20:43,081 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:20:43,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:20:43,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1349635161, now seen corresponding path program 1 times [2018-11-28 18:20:43,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:20:43,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:20:43,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:20:43,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:20:43,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:20:43,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:20:43,271 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 19 proven. 28 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-11-28 18:20:43,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:20:43,271 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 [2018-11-28 18:20:43,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:20:43,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:20:43,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:20:43,378 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-28 18:20:43,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 18:20:43,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 12 [2018-11-28 18:20:43,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 18:20:43,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 18:20:43,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-11-28 18:20:43,398 INFO L87 Difference]: Start difference. First operand 70 states and 81 transitions. Second operand 12 states. [2018-11-28 18:20:44,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:20:44,038 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2018-11-28 18:20:44,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 18:20:44,039 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2018-11-28 18:20:44,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:20:44,040 INFO L225 Difference]: With dead ends: 76 [2018-11-28 18:20:44,040 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 18:20:44,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2018-11-28 18:20:44,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 18:20:44,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 18:20:44,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 18:20:44,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 18:20:44,042 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2018-11-28 18:20:44,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:20:44,044 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 18:20:44,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 18:20:44,045 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 18:20:44,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 18:20:44,050 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 18:20:44,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:20:44,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:20:44,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:20:44,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:20:44,783 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-28 18:20:44,783 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 18:20:44,783 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 18:20:44,784 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-28 18:20:44,784 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 18:20:44,784 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 18:20:44,784 INFO L444 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 2) main_~len~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2018-11-28 18:20:44,784 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 10 53) no Hoare annotation was computed. [2018-11-28 18:20:44,784 INFO L444 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 2) main_~len~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2018-11-28 18:20:44,784 INFO L444 ceAbstractionStarter]: At program point L23-1(line 23) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 2) main_~len~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2018-11-28 18:20:44,785 INFO L444 ceAbstractionStarter]: At program point L44(line 44) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~len~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2018-11-28 18:20:44,785 INFO L444 ceAbstractionStarter]: At program point L32(line 32) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~len~0) (<= (+ main_~j~0 4) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2018-11-28 18:20:44,785 INFO L444 ceAbstractionStarter]: At program point L32-1(line 32) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~len~0) (<= (+ main_~j~0 4) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2018-11-28 18:20:44,785 INFO L444 ceAbstractionStarter]: At program point L28(line 28) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 2) main_~len~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2018-11-28 18:20:44,785 INFO L448 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-11-28 18:20:44,785 INFO L444 ceAbstractionStarter]: At program point L20-2(lines 20 51) the Hoare annotation is: (and (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2018-11-28 18:20:44,786 INFO L448 ceAbstractionStarter]: For program point L20-3(lines 20 51) no Hoare annotation was computed. [2018-11-28 18:20:44,786 INFO L444 ceAbstractionStarter]: At program point L45(line 45) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~len~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2018-11-28 18:20:44,786 INFO L444 ceAbstractionStarter]: At program point L33(line 33) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~len~0) (<= (+ main_~j~0 4) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2018-11-28 18:20:44,786 INFO L448 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2018-11-28 18:20:44,786 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-11-28 18:20:44,786 INFO L444 ceAbstractionStarter]: At program point L21-2(lines 21 50) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2018-11-28 18:20:44,786 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2018-11-28 18:20:44,786 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-11-28 18:20:44,787 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 10 53) no Hoare annotation was computed. [2018-11-28 18:20:44,787 INFO L444 ceAbstractionStarter]: At program point L42(lines 22 49) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~len~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2018-11-28 18:20:44,787 INFO L444 ceAbstractionStarter]: At program point L38(line 38) the Hoare annotation is: (and (<= 0 main_~j~0) (<= (+ main_~j~0 3) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2018-11-28 18:20:44,787 INFO L444 ceAbstractionStarter]: At program point L38-1(line 38) the Hoare annotation is: (and (<= 0 main_~j~0) (<= (+ main_~j~0 3) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2018-11-28 18:20:44,787 INFO L444 ceAbstractionStarter]: At program point L34(line 34) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~len~0) (<= (+ main_~j~0 4) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2018-11-28 18:20:44,787 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 10 53) the Hoare annotation is: true [2018-11-28 18:20:44,787 INFO L444 ceAbstractionStarter]: At program point L26(line 26) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 2) main_~len~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2018-11-28 18:20:44,788 INFO L444 ceAbstractionStarter]: At program point L26-1(line 26) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 2) main_~len~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2018-11-28 18:20:44,788 INFO L448 ceAbstractionStarter]: For program point L22(lines 22 49) no Hoare annotation was computed. [2018-11-28 18:20:44,788 INFO L444 ceAbstractionStarter]: At program point L43(line 43) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~len~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2018-11-28 18:20:44,788 INFO L448 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-11-28 18:20:44,788 INFO L448 ceAbstractionStarter]: For program point L35(line 35) no Hoare annotation was computed. [2018-11-28 18:20:44,788 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-28 18:20:44,789 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-28 18:20:44,789 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-28 18:20:44,789 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-28 18:20:44,789 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-28 18:20:44,789 INFO L448 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-28 18:20:44,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:20:44 BoogieIcfgContainer [2018-11-28 18:20:44,804 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 18:20:44,805 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 18:20:44,805 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 18:20:44,805 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 18:20:44,806 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:20:37" (3/4) ... [2018-11-28 18:20:44,813 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 18:20:44,819 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 18:20:44,820 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 18:20:44,820 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-28 18:20:44,826 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2018-11-28 18:20:44,826 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-11-28 18:20:44,826 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 18:20:44,902 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 18:20:44,903 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 18:20:44,907 INFO L168 Benchmark]: Toolchain (without parser) took 8435.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 202.9 MB). Free memory was 951.3 MB in the beginning and 1.0 GB in the end (delta: -56.1 MB). Peak memory consumption was 146.8 MB. Max. memory is 11.5 GB. [2018-11-28 18:20:44,908 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:20:44,909 INFO L168 Benchmark]: CACSL2BoogieTranslator took 305.45 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. [2018-11-28 18:20:44,909 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.89 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. [2018-11-28 18:20:44,910 INFO L168 Benchmark]: Boogie Preprocessor took 40.82 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-28 18:20:44,910 INFO L168 Benchmark]: RCFGBuilder took 672.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -184.8 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. [2018-11-28 18:20:44,912 INFO L168 Benchmark]: TraceAbstraction took 7282.93 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 60.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 112.5 MB). Peak memory consumption was 172.8 MB. Max. memory is 11.5 GB. [2018-11-28 18:20:44,913 INFO L168 Benchmark]: Witness Printer took 101.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2018-11-28 18:20:44,918 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.15 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 305.45 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 25.89 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 40.82 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 672.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -184.8 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7282.93 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 60.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 112.5 MB). Peak memory consumption was 172.8 MB. Max. memory is 11.5 GB. * Witness Printer took 101.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 0 <= i && limit + 4 <= bufsize - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (0 <= j && 0 <= i) && limit + 4 <= bufsize - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (((0 <= j && 0 <= i) && i + 1 <= len) && j + 5 <= bufsize) && limit + 4 <= bufsize - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 42 locations, 1 error locations. SAFE Result, 7.2s OverallTime, 8 OverallIterations, 11 TraceHistogramMax, 3.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 303 SDtfs, 173 SDslu, 1034 SDs, 0 SdLazy, 1298 SolverSat, 228 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 323 GetRequests, 245 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred 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, 8 MinimizatonAttempts, 25 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 58 PreInvPairs, 82 NumberOfFragments, 368 HoareAnnotationTreeSize, 58 FomulaSimplifications, 3237 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 23 FomulaSimplificationsInter, 48 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 502 NumberOfCodeBlocks, 502 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 488 ConstructedInterpolants, 0 QuantifiedInterpolants, 50230 SizeOfPredicates, 15 NumberOfNonLiveVariables, 526 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 14 InterpolantComputations, 8 PerfectInterpolantSequences, 778/856 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...