./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/recursive-simple/id_i20_o20_true-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/recursive-simple/id_i20_o20_true-unreach-call_true-termination.c -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 4d7026bf672987d88e3a6ea48c2c5a690fd9a5f2 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-12 15:12:07,715 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 15:12:07,717 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 15:12:07,729 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 15:12:07,729 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 15:12:07,730 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 15:12:07,732 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 15:12:07,734 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 15:12:07,735 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 15:12:07,736 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 15:12:07,737 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 15:12:07,737 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 15:12:07,738 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 15:12:07,739 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 15:12:07,740 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 15:12:07,741 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 15:12:07,742 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 15:12:07,744 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 15:12:07,746 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 15:12:07,747 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 15:12:07,748 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 15:12:07,750 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 15:12:07,752 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 15:12:07,753 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 15:12:07,753 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 15:12:07,754 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 15:12:07,755 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 15:12:07,756 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 15:12:07,757 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 15:12:07,762 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 15:12:07,762 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 15:12:07,763 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 15:12:07,764 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 15:12:07,764 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 15:12:07,765 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 15:12:07,766 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 15:12:07,766 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 15:12:07,800 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 15:12:07,801 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 15:12:07,802 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 15:12:07,802 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 15:12:07,802 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 15:12:07,802 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 15:12:07,803 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 15:12:07,804 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 15:12:07,804 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 15:12:07,804 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 15:12:07,804 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 15:12:07,805 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 15:12:07,805 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 15:12:07,805 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 15:12:07,805 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 15:12:07,805 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 15:12:07,805 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 15:12:07,807 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 15:12:07,807 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 15:12:07,807 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 15:12:07,807 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 15:12:07,807 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 15:12:07,808 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 15:12:07,808 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 15:12:07,808 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 15:12:07,808 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 15:12:07,809 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 15:12:07,809 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 15:12:07,809 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 -> 4d7026bf672987d88e3a6ea48c2c5a690fd9a5f2 [2019-01-12 15:12:07,866 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 15:12:07,882 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 15:12:07,888 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 15:12:07,890 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 15:12:07,890 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 15:12:07,891 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/id_i20_o20_true-unreach-call_true-termination.c [2019-01-12 15:12:07,945 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/213c40446/8fb058dfee6846a9b074fd497959b3a2/FLAG00cdea0e7 [2019-01-12 15:12:08,362 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 15:12:08,362 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/id_i20_o20_true-unreach-call_true-termination.c [2019-01-12 15:12:08,367 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/213c40446/8fb058dfee6846a9b074fd497959b3a2/FLAG00cdea0e7 [2019-01-12 15:12:08,756 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/213c40446/8fb058dfee6846a9b074fd497959b3a2 [2019-01-12 15:12:08,759 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 15:12:08,760 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 15:12:08,761 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 15:12:08,761 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 15:12:08,765 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 15:12:08,766 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:12:08" (1/1) ... [2019-01-12 15:12:08,769 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74bc7883 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:12:08, skipping insertion in model container [2019-01-12 15:12:08,769 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:12:08" (1/1) ... [2019-01-12 15:12:08,777 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 15:12:08,792 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 15:12:09,018 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 15:12:09,025 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 15:12:09,045 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 15:12:09,063 INFO L195 MainTranslator]: Completed translation [2019-01-12 15:12:09,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:12:09 WrapperNode [2019-01-12 15:12:09,065 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 15:12:09,066 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 15:12:09,066 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 15:12:09,066 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 15:12:09,078 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:12:09" (1/1) ... [2019-01-12 15:12:09,083 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:12:09" (1/1) ... [2019-01-12 15:12:09,108 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 15:12:09,110 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 15:12:09,110 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 15:12:09,110 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 15:12:09,121 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:12:09" (1/1) ... [2019-01-12 15:12:09,121 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:12:09" (1/1) ... [2019-01-12 15:12:09,122 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:12:09" (1/1) ... [2019-01-12 15:12:09,123 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:12:09" (1/1) ... [2019-01-12 15:12:09,126 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:12:09" (1/1) ... [2019-01-12 15:12:09,129 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:12:09" (1/1) ... [2019-01-12 15:12:09,132 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:12:09" (1/1) ... [2019-01-12 15:12:09,134 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 15:12:09,134 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 15:12:09,134 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 15:12:09,134 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 15:12:09,135 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:12:09" (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-12 15:12:09,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 15:12:09,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 15:12:09,261 INFO L130 BoogieDeclarations]: Found specification of procedure id [2019-01-12 15:12:09,261 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2019-01-12 15:12:09,455 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 15:12:09,456 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-12 15:12:09,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:12:09 BoogieIcfgContainer [2019-01-12 15:12:09,457 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 15:12:09,458 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 15:12:09,458 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 15:12:09,461 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 15:12:09,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 03:12:08" (1/3) ... [2019-01-12 15:12:09,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c8e3774 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:12:09, skipping insertion in model container [2019-01-12 15:12:09,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:12:09" (2/3) ... [2019-01-12 15:12:09,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c8e3774 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:12:09, skipping insertion in model container [2019-01-12 15:12:09,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:12:09" (3/3) ... [2019-01-12 15:12:09,464 INFO L112 eAbstractionObserver]: Analyzing ICFG id_i20_o20_true-unreach-call_true-termination.c [2019-01-12 15:12:09,473 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 15:12:09,480 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 15:12:09,493 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 15:12:09,524 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 15:12:09,525 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 15:12:09,525 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 15:12:09,525 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 15:12:09,525 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 15:12:09,525 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 15:12:09,525 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 15:12:09,525 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 15:12:09,526 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 15:12:09,543 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2019-01-12 15:12:09,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-12 15:12:09,550 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:09,551 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:09,553 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:09,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:09,559 INFO L82 PathProgramCache]: Analyzing trace with hash 389977641, now seen corresponding path program 1 times [2019-01-12 15:12:09,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:09,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:09,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:09,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:12:09,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:09,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:09,825 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-12 15:12:09,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:12:09,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 15:12:09,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 15:12:09,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 15:12:09,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:12:09,846 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 5 states. [2019-01-12 15:12:09,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:09,985 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2019-01-12 15:12:09,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 15:12:09,987 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-12 15:12:09,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:09,997 INFO L225 Difference]: With dead ends: 24 [2019-01-12 15:12:09,998 INFO L226 Difference]: Without dead ends: 14 [2019-01-12 15:12:10,001 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 [2019-01-12 15:12:10,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-12 15:12:10,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-01-12 15:12:10,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-12 15:12:10,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-01-12 15:12:10,040 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2019-01-12 15:12:10,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:10,041 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-01-12 15:12:10,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 15:12:10,041 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-01-12 15:12:10,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-12 15:12:10,043 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:10,043 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:10,043 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:10,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:10,044 INFO L82 PathProgramCache]: Analyzing trace with hash -881029229, now seen corresponding path program 1 times [2019-01-12 15:12:10,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:10,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:10,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:10,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:12:10,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:10,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:10,149 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 15:12:10,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:10,150 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-12 15:12:10,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:12:10,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:10,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:10,233 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 15:12:10,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:10,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-12 15:12:10,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 15:12:10,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 15:12:10,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 15:12:10,276 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 6 states. [2019-01-12 15:12:10,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:10,470 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-01-12 15:12:10,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 15:12:10,471 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-01-12 15:12:10,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:10,472 INFO L225 Difference]: With dead ends: 21 [2019-01-12 15:12:10,473 INFO L226 Difference]: Without dead ends: 17 [2019-01-12 15:12:10,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-12 15:12:10,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-12 15:12:10,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-12 15:12:10,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-12 15:12:10,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-01-12 15:12:10,482 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2019-01-12 15:12:10,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:10,482 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-01-12 15:12:10,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 15:12:10,484 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-01-12 15:12:10,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-12 15:12:10,486 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:10,487 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:10,487 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:10,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:10,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1824240471, now seen corresponding path program 2 times [2019-01-12 15:12:10,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:10,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:10,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:10,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:12:10,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:10,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:10,716 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-12 15:12:10,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:10,717 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-12 15:12:10,733 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 15:12:10,772 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 15:12:10,772 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:10,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:10,799 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-12 15:12:10,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:10,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-12 15:12:10,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 15:12:10,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 15:12:10,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 15:12:10,823 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 7 states. [2019-01-12 15:12:11,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:11,003 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2019-01-12 15:12:11,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 15:12:11,007 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-01-12 15:12:11,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:11,008 INFO L225 Difference]: With dead ends: 24 [2019-01-12 15:12:11,008 INFO L226 Difference]: Without dead ends: 20 [2019-01-12 15:12:11,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-12 15:12:11,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-12 15:12:11,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-01-12 15:12:11,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-12 15:12:11,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-01-12 15:12:11,016 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 21 [2019-01-12 15:12:11,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:11,017 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-01-12 15:12:11,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 15:12:11,017 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-01-12 15:12:11,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-12 15:12:11,018 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:11,019 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:11,019 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:11,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:11,019 INFO L82 PathProgramCache]: Analyzing trace with hash -28473709, now seen corresponding path program 3 times [2019-01-12 15:12:11,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:11,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:11,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:11,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:11,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:11,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:11,279 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-12 15:12:11,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:11,279 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-12 15:12:11,292 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 15:12:11,313 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-12 15:12:11,313 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:11,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:11,334 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-12 15:12:11,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:11,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-12 15:12:11,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 15:12:11,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 15:12:11,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-12 15:12:11,362 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 8 states. [2019-01-12 15:12:11,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:11,486 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-01-12 15:12:11,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 15:12:11,488 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-01-12 15:12:11,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:11,489 INFO L225 Difference]: With dead ends: 27 [2019-01-12 15:12:11,489 INFO L226 Difference]: Without dead ends: 23 [2019-01-12 15:12:11,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-01-12 15:12:11,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-12 15:12:11,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-12 15:12:11,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-12 15:12:11,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-01-12 15:12:11,496 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 27 [2019-01-12 15:12:11,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:11,496 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-01-12 15:12:11,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 15:12:11,496 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-01-12 15:12:11,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-12 15:12:11,498 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:11,498 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:11,498 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:11,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:11,499 INFO L82 PathProgramCache]: Analyzing trace with hash -2080894167, now seen corresponding path program 4 times [2019-01-12 15:12:11,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:11,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:11,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:11,500 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:11,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:11,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:11,978 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-12 15:12:11,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:11,979 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-12 15:12:11,995 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 15:12:12,013 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 15:12:12,014 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:12,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:12,048 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-12 15:12:12,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:12,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-12 15:12:12,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 15:12:12,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 15:12:12,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-01-12 15:12:12,072 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 9 states. [2019-01-12 15:12:12,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:12,218 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2019-01-12 15:12:12,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 15:12:12,218 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-01-12 15:12:12,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:12,220 INFO L225 Difference]: With dead ends: 30 [2019-01-12 15:12:12,220 INFO L226 Difference]: Without dead ends: 26 [2019-01-12 15:12:12,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-12 15:12:12,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-12 15:12:12,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-12 15:12:12,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-12 15:12:12,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-01-12 15:12:12,227 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 33 [2019-01-12 15:12:12,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:12,228 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-01-12 15:12:12,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 15:12:12,228 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-01-12 15:12:12,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-12 15:12:12,229 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:12,229 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:12,230 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:12,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:12,230 INFO L82 PathProgramCache]: Analyzing trace with hash -687460973, now seen corresponding path program 5 times [2019-01-12 15:12:12,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:12,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:12,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:12,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:12,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:12,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:12,503 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-01-12 15:12:12,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:12,504 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-12 15:12:12,525 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 15:12:12,553 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-01-12 15:12:12,553 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:12,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:12,587 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-01-12 15:12:12,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:12,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-01-12 15:12:12,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 15:12:12,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 15:12:12,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-12 15:12:12,610 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 10 states. [2019-01-12 15:12:12,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:12,845 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-01-12 15:12:12,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 15:12:12,846 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2019-01-12 15:12:12,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:12,847 INFO L225 Difference]: With dead ends: 33 [2019-01-12 15:12:12,848 INFO L226 Difference]: Without dead ends: 29 [2019-01-12 15:12:12,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-01-12 15:12:12,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-12 15:12:12,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-12 15:12:12,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-12 15:12:12,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-01-12 15:12:12,855 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 39 [2019-01-12 15:12:12,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:12,855 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-01-12 15:12:12,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 15:12:12,856 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-01-12 15:12:12,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-12 15:12:12,857 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:12,857 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:12,857 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:12,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:12,858 INFO L82 PathProgramCache]: Analyzing trace with hash 547744169, now seen corresponding path program 6 times [2019-01-12 15:12:12,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:12,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:12,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:12,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:12,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:12,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:13,109 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-01-12 15:12:13,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:13,110 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-12 15:12:13,121 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 15:12:13,155 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-01-12 15:12:13,155 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:13,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:13,199 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-01-12 15:12:13,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:13,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-01-12 15:12:13,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 15:12:13,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 15:12:13,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-01-12 15:12:13,228 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 11 states. [2019-01-12 15:12:13,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:13,518 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2019-01-12 15:12:13,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 15:12:13,519 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 45 [2019-01-12 15:12:13,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:13,521 INFO L225 Difference]: With dead ends: 36 [2019-01-12 15:12:13,521 INFO L226 Difference]: Without dead ends: 32 [2019-01-12 15:12:13,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2019-01-12 15:12:13,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-12 15:12:13,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-01-12 15:12:13,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-12 15:12:13,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-01-12 15:12:13,529 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 45 [2019-01-12 15:12:13,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:13,529 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-01-12 15:12:13,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 15:12:13,530 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-01-12 15:12:13,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-12 15:12:13,531 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:13,532 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:13,532 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:13,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:13,532 INFO L82 PathProgramCache]: Analyzing trace with hash -247823213, now seen corresponding path program 7 times [2019-01-12 15:12:13,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:13,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:13,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:13,534 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:13,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:13,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:13,723 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-01-12 15:12:13,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:13,723 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:12:13,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:12:13,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:13,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:13,787 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-01-12 15:12:13,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:13,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2019-01-12 15:12:13,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-12 15:12:13,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-12 15:12:13,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-01-12 15:12:13,810 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 12 states. [2019-01-12 15:12:14,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:14,110 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-01-12 15:12:14,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 15:12:14,111 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2019-01-12 15:12:14,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:14,113 INFO L225 Difference]: With dead ends: 39 [2019-01-12 15:12:14,113 INFO L226 Difference]: Without dead ends: 35 [2019-01-12 15:12:14,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2019-01-12 15:12:14,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-12 15:12:14,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-01-12 15:12:14,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-12 15:12:14,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-01-12 15:12:14,123 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 51 [2019-01-12 15:12:14,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:14,124 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-01-12 15:12:14,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-12 15:12:14,124 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-01-12 15:12:14,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-12 15:12:14,128 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:14,128 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:14,128 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:14,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:14,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1818636247, now seen corresponding path program 8 times [2019-01-12 15:12:14,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:14,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:14,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:14,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:12:14,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:14,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:14,373 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-01-12 15:12:14,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:14,374 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:12:14,385 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 15:12:14,412 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 15:12:14,413 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:14,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:14,470 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-01-12 15:12:14,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:14,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2019-01-12 15:12:14,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-12 15:12:14,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-12 15:12:14,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-12 15:12:14,496 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 13 states. [2019-01-12 15:12:14,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:14,792 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2019-01-12 15:12:14,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 15:12:14,794 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-01-12 15:12:14,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:14,795 INFO L225 Difference]: With dead ends: 42 [2019-01-12 15:12:14,795 INFO L226 Difference]: Without dead ends: 38 [2019-01-12 15:12:14,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2019-01-12 15:12:14,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-12 15:12:14,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-01-12 15:12:14,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-12 15:12:14,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-01-12 15:12:14,803 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 57 [2019-01-12 15:12:14,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:14,804 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-01-12 15:12:14,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-12 15:12:14,804 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-01-12 15:12:14,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-12 15:12:14,805 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:14,805 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:14,806 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:14,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:14,806 INFO L82 PathProgramCache]: Analyzing trace with hash -2055304301, now seen corresponding path program 9 times [2019-01-12 15:12:14,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:14,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:14,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:14,807 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:14,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:14,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:14,981 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-01-12 15:12:14,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:14,982 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:12:14,992 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 15:12:15,128 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-12 15:12:15,128 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:15,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:15,172 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-01-12 15:12:15,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:15,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2019-01-12 15:12:15,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-12 15:12:15,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-12 15:12:15,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-12 15:12:15,228 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 14 states. [2019-01-12 15:12:15,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:15,660 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2019-01-12 15:12:15,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 15:12:15,661 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 63 [2019-01-12 15:12:15,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:15,662 INFO L225 Difference]: With dead ends: 45 [2019-01-12 15:12:15,662 INFO L226 Difference]: Without dead ends: 41 [2019-01-12 15:12:15,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2019-01-12 15:12:15,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-12 15:12:15,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-12 15:12:15,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-12 15:12:15,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-01-12 15:12:15,676 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 63 [2019-01-12 15:12:15,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:15,676 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-01-12 15:12:15,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-12 15:12:15,678 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-01-12 15:12:15,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-12 15:12:15,679 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:15,679 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:15,680 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:15,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:15,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1172322647, now seen corresponding path program 10 times [2019-01-12 15:12:15,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:15,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:15,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:15,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:15,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:15,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:15,917 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-01-12 15:12:15,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:15,917 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:12:15,935 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 15:12:15,985 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 15:12:15,985 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:15,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:16,030 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-01-12 15:12:16,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:16,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2019-01-12 15:12:16,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-12 15:12:16,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-12 15:12:16,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2019-01-12 15:12:16,067 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 15 states. [2019-01-12 15:12:16,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:16,443 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2019-01-12 15:12:16,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-12 15:12:16,445 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 69 [2019-01-12 15:12:16,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:16,448 INFO L225 Difference]: With dead ends: 48 [2019-01-12 15:12:16,448 INFO L226 Difference]: Without dead ends: 44 [2019-01-12 15:12:16,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=236, Invalid=414, Unknown=0, NotChecked=0, Total=650 [2019-01-12 15:12:16,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-12 15:12:16,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-01-12 15:12:16,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-12 15:12:16,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2019-01-12 15:12:16,456 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 69 [2019-01-12 15:12:16,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:16,456 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2019-01-12 15:12:16,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-12 15:12:16,457 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2019-01-12 15:12:16,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-12 15:12:16,458 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:16,458 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:16,459 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:16,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:16,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1452916077, now seen corresponding path program 11 times [2019-01-12 15:12:16,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:16,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:16,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:16,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:16,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:16,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:16,751 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-01-12 15:12:16,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:16,752 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:12:16,762 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 15:12:16,791 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-01-12 15:12:16,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:16,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:16,826 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-01-12 15:12:16,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:16,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2019-01-12 15:12:16,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-12 15:12:16,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-12 15:12:16,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2019-01-12 15:12:16,852 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 16 states. [2019-01-12 15:12:17,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:17,168 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2019-01-12 15:12:17,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-12 15:12:17,169 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 75 [2019-01-12 15:12:17,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:17,170 INFO L225 Difference]: With dead ends: 51 [2019-01-12 15:12:17,170 INFO L226 Difference]: Without dead ends: 47 [2019-01-12 15:12:17,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=275, Invalid=481, Unknown=0, NotChecked=0, Total=756 [2019-01-12 15:12:17,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-12 15:12:17,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-01-12 15:12:17,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-12 15:12:17,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-01-12 15:12:17,177 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 75 [2019-01-12 15:12:17,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:17,178 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-01-12 15:12:17,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-12 15:12:17,178 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-01-12 15:12:17,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-12 15:12:17,179 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:17,179 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:17,180 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:17,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:17,180 INFO L82 PathProgramCache]: Analyzing trace with hash -461124311, now seen corresponding path program 12 times [2019-01-12 15:12:17,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:17,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:17,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:17,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:17,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:17,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:17,554 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-01-12 15:12:17,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:17,554 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:12:17,566 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 15:12:17,620 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-01-12 15:12:17,620 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:17,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:17,680 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-01-12 15:12:17,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:17,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2019-01-12 15:12:17,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-12 15:12:17,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-12 15:12:17,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=163, Unknown=0, NotChecked=0, Total=272 [2019-01-12 15:12:17,717 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 17 states. [2019-01-12 15:12:18,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:18,013 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2019-01-12 15:12:18,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-12 15:12:18,014 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 81 [2019-01-12 15:12:18,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:18,016 INFO L225 Difference]: With dead ends: 54 [2019-01-12 15:12:18,016 INFO L226 Difference]: Without dead ends: 50 [2019-01-12 15:12:18,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=317, Invalid=553, Unknown=0, NotChecked=0, Total=870 [2019-01-12 15:12:18,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-12 15:12:18,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-01-12 15:12:18,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-12 15:12:18,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2019-01-12 15:12:18,024 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 81 [2019-01-12 15:12:18,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:18,025 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2019-01-12 15:12:18,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-12 15:12:18,025 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2019-01-12 15:12:18,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-01-12 15:12:18,026 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:18,026 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:18,027 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:18,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:18,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1887065709, now seen corresponding path program 13 times [2019-01-12 15:12:18,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:18,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:18,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:18,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:18,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:18,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:18,330 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-01-12 15:12:18,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:18,330 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:12:18,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:12:18,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:18,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:18,423 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-01-12 15:12:18,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:18,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2019-01-12 15:12:18,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-12 15:12:18,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-12 15:12:18,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=182, Unknown=0, NotChecked=0, Total=306 [2019-01-12 15:12:18,446 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 18 states. [2019-01-12 15:12:18,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:18,882 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2019-01-12 15:12:18,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-12 15:12:18,883 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 87 [2019-01-12 15:12:18,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:18,885 INFO L225 Difference]: With dead ends: 57 [2019-01-12 15:12:18,885 INFO L226 Difference]: Without dead ends: 53 [2019-01-12 15:12:18,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=362, Invalid=630, Unknown=0, NotChecked=0, Total=992 [2019-01-12 15:12:18,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-12 15:12:18,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-12 15:12:18,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-12 15:12:18,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-01-12 15:12:18,893 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 87 [2019-01-12 15:12:18,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:18,893 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-01-12 15:12:18,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-12 15:12:18,893 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-01-12 15:12:18,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-12 15:12:18,894 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:18,894 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:18,895 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:18,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:18,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1777212503, now seen corresponding path program 14 times [2019-01-12 15:12:18,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:18,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:18,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:18,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:12:18,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:18,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:19,161 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-01-12 15:12:19,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:19,161 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:12:19,173 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 15:12:19,202 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 15:12:19,202 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:19,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:19,257 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-01-12 15:12:19,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:19,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2019-01-12 15:12:19,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-12 15:12:19,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-12 15:12:19,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=202, Unknown=0, NotChecked=0, Total=342 [2019-01-12 15:12:19,296 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 19 states. [2019-01-12 15:12:19,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:19,638 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2019-01-12 15:12:19,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-12 15:12:19,640 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 93 [2019-01-12 15:12:19,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:19,641 INFO L225 Difference]: With dead ends: 60 [2019-01-12 15:12:19,641 INFO L226 Difference]: Without dead ends: 56 [2019-01-12 15:12:19,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=410, Invalid=712, Unknown=0, NotChecked=0, Total=1122 [2019-01-12 15:12:19,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-12 15:12:19,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-01-12 15:12:19,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-12 15:12:19,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2019-01-12 15:12:19,649 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 93 [2019-01-12 15:12:19,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:19,649 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2019-01-12 15:12:19,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-12 15:12:19,650 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2019-01-12 15:12:19,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-12 15:12:19,651 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:19,651 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:19,651 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:19,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:19,652 INFO L82 PathProgramCache]: Analyzing trace with hash -948911981, now seen corresponding path program 15 times [2019-01-12 15:12:19,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:19,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:19,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:19,653 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:19,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:19,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:19,953 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2019-01-12 15:12:19,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:19,954 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:12:19,966 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 15:12:20,005 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-12 15:12:20,005 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:20,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:20,055 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2019-01-12 15:12:20,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:20,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2019-01-12 15:12:20,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-12 15:12:20,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-12 15:12:20,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=223, Unknown=0, NotChecked=0, Total=380 [2019-01-12 15:12:20,088 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 20 states. [2019-01-12 15:12:20,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:20,555 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2019-01-12 15:12:20,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-12 15:12:20,556 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 99 [2019-01-12 15:12:20,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:20,558 INFO L225 Difference]: With dead ends: 63 [2019-01-12 15:12:20,558 INFO L226 Difference]: Without dead ends: 59 [2019-01-12 15:12:20,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=461, Invalid=799, Unknown=0, NotChecked=0, Total=1260 [2019-01-12 15:12:20,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-12 15:12:20,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-01-12 15:12:20,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-12 15:12:20,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-01-12 15:12:20,568 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 99 [2019-01-12 15:12:20,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:20,569 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-01-12 15:12:20,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-12 15:12:20,569 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-01-12 15:12:20,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-12 15:12:20,570 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:20,570 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:20,571 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:20,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:20,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1159072297, now seen corresponding path program 16 times [2019-01-12 15:12:20,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:20,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:20,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:20,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:20,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:20,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:20,904 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-01-12 15:12:20,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:20,905 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:12:20,916 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 15:12:20,965 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 15:12:20,965 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:20,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:21,026 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-01-12 15:12:21,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:21,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2019-01-12 15:12:21,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-12 15:12:21,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-12 15:12:21,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=245, Unknown=0, NotChecked=0, Total=420 [2019-01-12 15:12:21,049 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 21 states. [2019-01-12 15:12:21,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:21,415 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2019-01-12 15:12:21,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-12 15:12:21,416 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 105 [2019-01-12 15:12:21,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:21,418 INFO L225 Difference]: With dead ends: 66 [2019-01-12 15:12:21,418 INFO L226 Difference]: Without dead ends: 62 [2019-01-12 15:12:21,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=515, Invalid=891, Unknown=0, NotChecked=0, Total=1406 [2019-01-12 15:12:21,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-12 15:12:21,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-01-12 15:12:21,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-12 15:12:21,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2019-01-12 15:12:21,427 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 105 [2019-01-12 15:12:21,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:21,427 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2019-01-12 15:12:21,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-12 15:12:21,427 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2019-01-12 15:12:21,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-12 15:12:21,428 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:21,429 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:21,431 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:21,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:21,432 INFO L82 PathProgramCache]: Analyzing trace with hash 2109441939, now seen corresponding path program 17 times [2019-01-12 15:12:21,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:21,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:21,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:21,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:21,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:21,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:21,771 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2019-01-12 15:12:21,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:21,771 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:12:21,782 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 15:12:21,830 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-01-12 15:12:21,830 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:21,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:21,887 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2019-01-12 15:12:21,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:21,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2019-01-12 15:12:21,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-12 15:12:21,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-12 15:12:21,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=268, Unknown=0, NotChecked=0, Total=462 [2019-01-12 15:12:21,927 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 22 states. [2019-01-12 15:12:22,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:22,448 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2019-01-12 15:12:22,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-12 15:12:22,450 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 111 [2019-01-12 15:12:22,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:22,452 INFO L225 Difference]: With dead ends: 69 [2019-01-12 15:12:22,452 INFO L226 Difference]: Without dead ends: 65 [2019-01-12 15:12:22,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=572, Invalid=988, Unknown=0, NotChecked=0, Total=1560 [2019-01-12 15:12:22,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-12 15:12:22,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-01-12 15:12:22,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-12 15:12:22,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-01-12 15:12:22,460 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 111 [2019-01-12 15:12:22,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:22,460 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-01-12 15:12:22,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-12 15:12:22,460 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-01-12 15:12:22,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-01-12 15:12:22,462 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:22,462 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:22,463 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:22,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:22,463 INFO L82 PathProgramCache]: Analyzing trace with hash 450642089, now seen corresponding path program 18 times [2019-01-12 15:12:22,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:22,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:22,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:22,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:22,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:22,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:23,554 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-01-12 15:12:23,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:23,554 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:12:23,563 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 15:12:23,611 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-01-12 15:12:23,611 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:23,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:23,658 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-01-12 15:12:23,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:23,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2019-01-12 15:12:23,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-12 15:12:23,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-12 15:12:23,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=292, Unknown=0, NotChecked=0, Total=506 [2019-01-12 15:12:23,681 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 23 states. [2019-01-12 15:12:24,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:24,378 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2019-01-12 15:12:24,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-12 15:12:24,379 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 117 [2019-01-12 15:12:24,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:24,381 INFO L225 Difference]: With dead ends: 72 [2019-01-12 15:12:24,381 INFO L226 Difference]: Without dead ends: 68 [2019-01-12 15:12:24,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=632, Invalid=1090, Unknown=0, NotChecked=0, Total=1722 [2019-01-12 15:12:24,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-12 15:12:24,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-01-12 15:12:24,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-12 15:12:24,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2019-01-12 15:12:24,395 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 117 [2019-01-12 15:12:24,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:24,396 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2019-01-12 15:12:24,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-12 15:12:24,396 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2019-01-12 15:12:24,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-01-12 15:12:24,398 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:24,399 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:24,399 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:24,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:24,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1141244269, now seen corresponding path program 19 times [2019-01-12 15:12:24,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:24,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:24,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:24,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:24,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:24,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:24,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-01-12 15:12:24,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:24,956 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:12:24,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:12:25,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:25,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:25,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-01-12 15:12:25,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:25,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2019-01-12 15:12:25,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-12 15:12:25,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-12 15:12:25,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=317, Unknown=0, NotChecked=0, Total=552 [2019-01-12 15:12:25,105 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 24 states. [2019-01-12 15:12:25,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:25,844 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2019-01-12 15:12:25,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-12 15:12:25,846 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 123 [2019-01-12 15:12:25,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:25,847 INFO L225 Difference]: With dead ends: 75 [2019-01-12 15:12:25,848 INFO L226 Difference]: Without dead ends: 71 [2019-01-12 15:12:25,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=695, Invalid=1197, Unknown=0, NotChecked=0, Total=1892 [2019-01-12 15:12:25,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-12 15:12:25,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-12 15:12:25,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-12 15:12:25,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-01-12 15:12:25,855 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 123 [2019-01-12 15:12:25,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:25,855 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-01-12 15:12:25,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-12 15:12:25,855 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-01-12 15:12:25,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-01-12 15:12:25,856 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:25,856 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:25,857 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:25,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:25,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1280276695, now seen corresponding path program 20 times [2019-01-12 15:12:25,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:25,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:25,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:25,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:12:25,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:25,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:27,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2019-01-12 15:12:27,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:27,208 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:12:27,223 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 15:12:27,264 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 15:12:27,264 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:27,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:27,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2019-01-12 15:12:27,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:27,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2019-01-12 15:12:27,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-01-12 15:12:27,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-01-12 15:12:27,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-01-12 15:12:27,762 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 45 states. [2019-01-12 15:12:28,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:28,964 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2019-01-12 15:12:28,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-12 15:12:28,965 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 129 [2019-01-12 15:12:28,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:28,968 INFO L225 Difference]: With dead ends: 78 [2019-01-12 15:12:28,968 INFO L226 Difference]: Without dead ends: 74 [2019-01-12 15:12:28,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 128 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-01-12 15:12:28,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-12 15:12:28,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-01-12 15:12:28,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-12 15:12:28,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2019-01-12 15:12:28,974 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 129 [2019-01-12 15:12:28,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:28,975 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2019-01-12 15:12:28,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-01-12 15:12:28,975 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2019-01-12 15:12:28,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-01-12 15:12:28,979 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:28,979 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:28,979 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:28,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:28,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1463802477, now seen corresponding path program 21 times [2019-01-12 15:12:28,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:28,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:28,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:28,981 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:28,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:28,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:30,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 672 proven. 0 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2019-01-12 15:12:30,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:12:30,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-01-12 15:12:30,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-12 15:12:30,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-12 15:12:30,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=370, Unknown=0, NotChecked=0, Total=650 [2019-01-12 15:12:30,161 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 26 states. [2019-01-12 15:12:30,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:30,710 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2019-01-12 15:12:30,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-12 15:12:30,712 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 135 [2019-01-12 15:12:30,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:30,713 INFO L225 Difference]: With dead ends: 74 [2019-01-12 15:12:30,713 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 15:12:30,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=830, Invalid=1426, Unknown=0, NotChecked=0, Total=2256 [2019-01-12 15:12:30,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 15:12:30,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 15:12:30,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 15:12:30,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 15:12:30,718 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 135 [2019-01-12 15:12:30,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:30,718 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 15:12:30,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-12 15:12:30,718 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 15:12:30,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 15:12:30,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 15:12:30,755 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 15:12:30,755 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 15:12:30,755 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 15:12:30,756 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2019-01-12 15:12:30,756 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 14) no Hoare annotation was computed. [2019-01-12 15:12:30,756 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2019-01-12 15:12:30,756 INFO L444 ceAbstractionStarter]: At program point L11(line 11) the Hoare annotation is: (and (<= 20 ULTIMATE.start_main_~input~0) (<= ULTIMATE.start_main_~input~0 20)) [2019-01-12 15:12:30,756 INFO L448 ceAbstractionStarter]: For program point L11-1(line 11) no Hoare annotation was computed. [2019-01-12 15:12:30,757 INFO L448 ceAbstractionStarter]: For program point L9(lines 9 15) no Hoare annotation was computed. [2019-01-12 15:12:30,757 INFO L448 ceAbstractionStarter]: For program point idFINAL(lines 4 7) no Hoare annotation was computed. [2019-01-12 15:12:30,757 INFO L448 ceAbstractionStarter]: For program point idEXIT(lines 4 7) no Hoare annotation was computed. [2019-01-12 15:12:30,757 INFO L451 ceAbstractionStarter]: At program point idENTRY(lines 4 7) the Hoare annotation is: true [2019-01-12 15:12:30,757 INFO L444 ceAbstractionStarter]: At program point L6(line 6) the Hoare annotation is: (and (<= |id_#in~x| id_~x) (<= id_~x |id_#in~x|)) [2019-01-12 15:12:30,757 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-01-12 15:12:30,757 INFO L448 ceAbstractionStarter]: For program point L6-1(line 6) no Hoare annotation was computed. [2019-01-12 15:12:30,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 03:12:30 BoogieIcfgContainer [2019-01-12 15:12:30,761 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 15:12:30,761 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 15:12:30,761 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 15:12:30,762 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 15:12:30,763 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:12:09" (3/4) ... [2019-01-12 15:12:30,768 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 15:12:30,775 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure id [2019-01-12 15:12:30,779 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-12 15:12:30,779 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 15:12:30,821 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 15:12:30,822 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 15:12:30,823 INFO L168 Benchmark]: Toolchain (without parser) took 22063.72 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 358.6 MB). Free memory was 947.3 MB in the beginning and 1.2 GB in the end (delta: -280.5 MB). Peak memory consumption was 78.1 MB. Max. memory is 11.5 GB. [2019-01-12 15:12:30,825 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:12:30,826 INFO L168 Benchmark]: CACSL2BoogieTranslator took 304.23 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-12 15:12:30,826 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.75 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:12:30,826 INFO L168 Benchmark]: Boogie Preprocessor took 24.10 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:12:30,827 INFO L168 Benchmark]: RCFGBuilder took 322.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -182.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2019-01-12 15:12:30,827 INFO L168 Benchmark]: TraceAbstraction took 21303.13 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 219.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -126.4 MB). Peak memory consumption was 92.8 MB. Max. memory is 11.5 GB. [2019-01-12 15:12:30,831 INFO L168 Benchmark]: Witness Printer took 61.01 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 11.5 GB. [2019-01-12 15:12:30,835 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 304.23 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.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 43.75 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.10 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 322.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -182.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 21303.13 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 219.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -126.4 MB). Peak memory consumption was 92.8 MB. Max. memory is 11.5 GB. * Witness Printer took 61.01 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 13]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 15 locations, 1 error locations. SAFE Result, 21.2s OverallTime, 22 OverallIterations, 22 TraceHistogramMax, 8.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 281 SDtfs, 528 SDslu, 3086 SDs, 0 SdLazy, 2689 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2224 GetRequests, 1673 SyntacticMatches, 2 SemanticMatches, 549 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1540 ImplicationChecksByTransitivity, 12.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=21, 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, 22 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 5 PreInvPairs, 5 NumberOfFragments, 15 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 9.8s InterpolantComputationTime, 3024 NumberOfCodeBlocks, 3024 NumberOfCodeBlocksAsserted, 145 NumberOfCheckSat, 2982 ConstructedInterpolants, 0 QuantifiedInterpolants, 742592 SizeOfPredicates, 229 NumberOfNonLiveVariables, 3400 ConjunctsInSsa, 543 ConjunctsInUnsatCore, 42 InterpolantComputations, 2 PerfectInterpolantSequences, 10164/18984 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...