./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/loop-lit/gr2006_true-unreach-call_true-termination.c.i --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/loop-lit/gr2006_true-unreach-call_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 76260ed82768318ee6f3ac3cb9cfff5a60080963 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 11:24:40,021 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 11:24:40,023 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 11:24:40,034 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 11:24:40,035 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 11:24:40,036 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 11:24:40,037 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 11:24:40,039 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 11:24:40,040 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 11:24:40,041 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 11:24:40,042 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 11:24:40,042 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 11:24:40,043 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 11:24:40,044 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 11:24:40,045 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 11:24:40,046 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 11:24:40,047 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 11:24:40,049 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 11:24:40,050 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 11:24:40,052 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 11:24:40,053 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 11:24:40,054 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 11:24:40,057 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 11:24:40,057 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 11:24:40,057 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 11:24:40,058 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 11:24:40,059 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 11:24:40,060 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 11:24:40,061 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 11:24:40,062 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 11:24:40,063 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 11:24:40,063 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 11:24:40,064 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 11:24:40,064 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 11:24:40,065 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 11:24:40,066 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 11:24:40,066 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 11:24:40,081 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 11:24:40,082 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 11:24:40,083 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 11:24:40,083 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 11:24:40,084 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 11:24:40,084 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 11:24:40,084 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 11:24:40,084 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 11:24:40,084 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 11:24:40,085 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 11:24:40,085 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 11:24:40,085 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 11:24:40,085 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 11:24:40,085 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 11:24:40,086 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 11:24:40,086 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 11:24:40,086 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 11:24:40,086 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 11:24:40,086 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 11:24:40,087 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 11:24:40,087 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 11:24:40,087 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 11:24:40,087 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 11:24:40,087 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 11:24:40,088 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 11:24:40,088 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 11:24:40,088 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 11:24:40,088 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 11:24:40,088 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 -> 76260ed82768318ee6f3ac3cb9cfff5a60080963 [2019-01-12 11:24:40,129 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 11:24:40,150 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 11:24:40,155 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 11:24:40,156 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 11:24:40,157 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 11:24:40,158 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loop-lit/gr2006_true-unreach-call_true-termination.c.i [2019-01-12 11:24:40,225 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e66ea646/f9bbe02a54074128b65a9b211ba9a0d5/FLAG912a3257f [2019-01-12 11:24:40,653 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 11:24:40,653 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loop-lit/gr2006_true-unreach-call_true-termination.c.i [2019-01-12 11:24:40,660 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e66ea646/f9bbe02a54074128b65a9b211ba9a0d5/FLAG912a3257f [2019-01-12 11:24:41,024 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e66ea646/f9bbe02a54074128b65a9b211ba9a0d5 [2019-01-12 11:24:41,029 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 11:24:41,030 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 11:24:41,032 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 11:24:41,032 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 11:24:41,036 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 11:24:41,037 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 11:24:41" (1/1) ... [2019-01-12 11:24:41,041 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d57bdec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:24:41, skipping insertion in model container [2019-01-12 11:24:41,041 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 11:24:41" (1/1) ... [2019-01-12 11:24:41,051 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 11:24:41,070 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 11:24:41,278 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 11:24:41,282 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 11:24:41,299 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 11:24:41,314 INFO L195 MainTranslator]: Completed translation [2019-01-12 11:24:41,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:24:41 WrapperNode [2019-01-12 11:24:41,314 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 11:24:41,315 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 11:24:41,315 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 11:24:41,316 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 11:24:41,324 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:24:41" (1/1) ... [2019-01-12 11:24:41,330 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:24:41" (1/1) ... [2019-01-12 11:24:41,349 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 11:24:41,349 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 11:24:41,349 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 11:24:41,349 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 11:24:41,357 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:24:41" (1/1) ... [2019-01-12 11:24:41,358 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:24:41" (1/1) ... [2019-01-12 11:24:41,358 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:24:41" (1/1) ... [2019-01-12 11:24:41,358 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:24:41" (1/1) ... [2019-01-12 11:24:41,360 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:24:41" (1/1) ... [2019-01-12 11:24:41,365 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:24:41" (1/1) ... [2019-01-12 11:24:41,365 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:24:41" (1/1) ... [2019-01-12 11:24:41,367 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 11:24:41,367 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 11:24:41,367 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 11:24:41,367 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 11:24:41,368 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:24:41" (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 11:24:41,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 11:24:41,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 11:24:41,659 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 11:24:41,660 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-12 11:24:41,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:24:41 BoogieIcfgContainer [2019-01-12 11:24:41,661 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 11:24:41,662 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 11:24:41,662 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 11:24:41,665 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 11:24:41,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 11:24:41" (1/3) ... [2019-01-12 11:24:41,666 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3831920a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 11:24:41, skipping insertion in model container [2019-01-12 11:24:41,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:24:41" (2/3) ... [2019-01-12 11:24:41,667 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3831920a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 11:24:41, skipping insertion in model container [2019-01-12 11:24:41,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:24:41" (3/3) ... [2019-01-12 11:24:41,668 INFO L112 eAbstractionObserver]: Analyzing ICFG gr2006_true-unreach-call_true-termination.c.i [2019-01-12 11:24:41,678 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 11:24:41,686 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 11:24:41,704 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 11:24:41,742 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 11:24:41,743 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 11:24:41,743 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 11:24:41,743 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 11:24:41,744 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 11:24:41,745 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 11:24:41,745 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 11:24:41,745 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 11:24:41,745 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 11:24:41,759 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2019-01-12 11:24:41,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-12 11:24:41,764 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:24:41,765 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-12 11:24:41,766 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:24:41,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:24:41,776 INFO L82 PathProgramCache]: Analyzing trace with hash 30262788, now seen corresponding path program 1 times [2019-01-12 11:24:41,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:24:41,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:24:41,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:41,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:24:41,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:41,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:41,874 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 11:24:41,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:24:41,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 11:24:41,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 11:24:41,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 11:24:41,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 11:24:41,893 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 2 states. [2019-01-12 11:24:41,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:24:41,907 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2019-01-12 11:24:41,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 11:24:41,908 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2019-01-12 11:24:41,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:24:41,917 INFO L225 Difference]: With dead ends: 20 [2019-01-12 11:24:41,917 INFO L226 Difference]: Without dead ends: 8 [2019-01-12 11:24:41,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 11:24:41,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-01-12 11:24:41,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-01-12 11:24:41,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-12 11:24:41,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2019-01-12 11:24:41,949 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 5 [2019-01-12 11:24:41,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:24:41,950 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-01-12 11:24:41,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 11:24:41,950 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2019-01-12 11:24:41,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-12 11:24:41,951 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:24:41,951 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:24:41,951 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:24:41,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:24:41,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1365765045, now seen corresponding path program 1 times [2019-01-12 11:24:41,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:24:41,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:24:41,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:41,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:24:41,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:41,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:42,083 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 11:24:42,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:24:42,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 11:24:42,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 11:24:42,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 11:24:42,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 11:24:42,087 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 4 states. [2019-01-12 11:24:42,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:24:42,219 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-01-12 11:24:42,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 11:24:42,221 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-01-12 11:24:42,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:24:42,222 INFO L225 Difference]: With dead ends: 16 [2019-01-12 11:24:42,222 INFO L226 Difference]: Without dead ends: 12 [2019-01-12 11:24:42,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 11:24:42,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-12 11:24:42,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-12 11:24:42,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-12 11:24:42,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-01-12 11:24:42,227 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 7 [2019-01-12 11:24:42,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:24:42,227 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-01-12 11:24:42,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 11:24:42,227 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-01-12 11:24:42,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-12 11:24:42,228 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:24:42,228 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:24:42,229 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:24:42,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:24:42,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1363918003, now seen corresponding path program 1 times [2019-01-12 11:24:42,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:24:42,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:24:42,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:42,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:24:42,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:42,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:42,272 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 11:24:42,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:24:42,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 11:24:42,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 11:24:42,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 11:24:42,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 11:24:42,273 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 3 states. [2019-01-12 11:24:42,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:24:42,304 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2019-01-12 11:24:42,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 11:24:42,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-01-12 11:24:42,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:24:42,305 INFO L225 Difference]: With dead ends: 26 [2019-01-12 11:24:42,305 INFO L226 Difference]: Without dead ends: 15 [2019-01-12 11:24:42,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 11:24:42,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-01-12 11:24:42,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-01-12 11:24:42,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-12 11:24:42,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-01-12 11:24:42,310 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 7 [2019-01-12 11:24:42,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:24:42,310 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-01-12 11:24:42,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 11:24:42,310 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2019-01-12 11:24:42,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-12 11:24:42,311 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:24:42,311 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-12 11:24:42,311 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:24:42,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:24:42,312 INFO L82 PathProgramCache]: Analyzing trace with hash 10637259, now seen corresponding path program 1 times [2019-01-12 11:24:42,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:24:42,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:24:42,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:42,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:24:42,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:42,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:42,360 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-12 11:24:42,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:24:42,360 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 11:24:42,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:24:42,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:42,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:24:42,417 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-12 11:24:42,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:24:42,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-01-12 11:24:42,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 11:24:42,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 11:24:42,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 11:24:42,441 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 4 states. [2019-01-12 11:24:42,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:24:42,504 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2019-01-12 11:24:42,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 11:24:42,505 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-01-12 11:24:42,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:24:42,506 INFO L225 Difference]: With dead ends: 29 [2019-01-12 11:24:42,506 INFO L226 Difference]: Without dead ends: 18 [2019-01-12 11:24:42,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 11:24:42,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-01-12 11:24:42,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-01-12 11:24:42,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-12 11:24:42,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-01-12 11:24:42,511 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2019-01-12 11:24:42,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:24:42,511 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-01-12 11:24:42,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 11:24:42,511 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-01-12 11:24:42,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-12 11:24:42,512 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:24:42,512 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1] [2019-01-12 11:24:42,512 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:24:42,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:24:42,513 INFO L82 PathProgramCache]: Analyzing trace with hash -300800067, now seen corresponding path program 2 times [2019-01-12 11:24:42,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:24:42,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:24:42,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:42,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:24:42,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:42,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:42,610 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-12 11:24:42,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:24:42,610 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 11:24:42,623 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 11:24:42,656 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 11:24:42,656 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:24:42,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:24:42,665 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-12 11:24:42,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:24:42,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-12 11:24:42,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 11:24:42,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 11:24:42,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 11:24:42,694 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 5 states. [2019-01-12 11:24:42,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:24:42,820 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2019-01-12 11:24:42,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 11:24:42,821 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-01-12 11:24:42,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:24:42,823 INFO L225 Difference]: With dead ends: 32 [2019-01-12 11:24:42,823 INFO L226 Difference]: Without dead ends: 21 [2019-01-12 11:24:42,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 11:24:42,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-12 11:24:42,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-01-12 11:24:42,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-12 11:24:42,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2019-01-12 11:24:42,829 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 16 [2019-01-12 11:24:42,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:24:42,829 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-01-12 11:24:42,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 11:24:42,830 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2019-01-12 11:24:42,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-12 11:24:42,831 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:24:42,832 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 1, 1, 1, 1, 1] [2019-01-12 11:24:42,832 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:24:42,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:24:42,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1200819573, now seen corresponding path program 3 times [2019-01-12 11:24:42,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:24:42,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:24:42,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:42,836 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:24:42,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:42,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:43,020 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-12 11:24:43,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:24:43,020 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 11:24:43,039 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 11:24:43,069 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-12 11:24:43,069 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:24:43,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:24:43,186 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-12 11:24:43,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:24:43,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2019-01-12 11:24:43,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 11:24:43,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 11:24:43,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-01-12 11:24:43,211 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 10 states. [2019-01-12 11:24:43,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:24:43,510 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2019-01-12 11:24:43,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 11:24:43,514 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-01-12 11:24:43,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:24:43,515 INFO L225 Difference]: With dead ends: 49 [2019-01-12 11:24:43,515 INFO L226 Difference]: Without dead ends: 38 [2019-01-12 11:24:43,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-01-12 11:24:43,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-12 11:24:43,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 29. [2019-01-12 11:24:43,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-12 11:24:43,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-01-12 11:24:43,522 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 19 [2019-01-12 11:24:43,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:24:43,522 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-01-12 11:24:43,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 11:24:43,523 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-01-12 11:24:43,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-12 11:24:43,524 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:24:43,524 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 1, 1, 1, 1, 1] [2019-01-12 11:24:43,524 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:24:43,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:24:43,524 INFO L82 PathProgramCache]: Analyzing trace with hash -39257347, now seen corresponding path program 4 times [2019-01-12 11:24:43,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:24:43,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:24:43,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:43,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:24:43,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:43,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:43,607 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 46 proven. 26 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-01-12 11:24:43,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:24:43,607 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 11:24:43,616 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 11:24:43,665 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 11:24:43,665 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:24:43,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:24:43,682 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 46 proven. 26 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-01-12 11:24:43,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:24:43,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-12 11:24:43,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 11:24:43,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 11:24:43,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-12 11:24:43,711 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 7 states. [2019-01-12 11:24:43,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:24:43,951 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2019-01-12 11:24:43,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 11:24:43,952 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2019-01-12 11:24:43,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:24:43,953 INFO L225 Difference]: With dead ends: 50 [2019-01-12 11:24:43,953 INFO L226 Difference]: Without dead ends: 33 [2019-01-12 11:24:43,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-12 11:24:43,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-12 11:24:43,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-01-12 11:24:43,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-12 11:24:43,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-01-12 11:24:43,970 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 28 [2019-01-12 11:24:43,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:24:43,971 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-01-12 11:24:43,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 11:24:43,971 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-01-12 11:24:43,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-12 11:24:43,972 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:24:43,972 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 5, 4, 1, 1, 1, 1, 1] [2019-01-12 11:24:43,972 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:24:43,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:24:43,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1637089483, now seen corresponding path program 5 times [2019-01-12 11:24:43,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:24:43,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:24:43,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:43,978 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:24:43,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:44,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:44,147 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 56 proven. 40 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-01-12 11:24:44,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:24:44,148 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 11:24:44,166 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 11:24:44,215 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2019-01-12 11:24:44,216 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:24:44,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:24:44,227 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 56 proven. 40 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-01-12 11:24:44,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:24:44,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-12 11:24:44,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 11:24:44,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 11:24:44,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-12 11:24:44,259 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 8 states. [2019-01-12 11:24:44,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:24:44,338 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2019-01-12 11:24:44,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 11:24:44,339 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2019-01-12 11:24:44,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:24:44,340 INFO L225 Difference]: With dead ends: 53 [2019-01-12 11:24:44,340 INFO L226 Difference]: Without dead ends: 36 [2019-01-12 11:24:44,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-12 11:24:44,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-12 11:24:44,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-01-12 11:24:44,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-12 11:24:44,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-01-12 11:24:44,346 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 31 [2019-01-12 11:24:44,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:24:44,346 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-01-12 11:24:44,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 11:24:44,347 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-01-12 11:24:44,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-12 11:24:44,348 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:24:44,348 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 6, 4, 1, 1, 1, 1, 1] [2019-01-12 11:24:44,348 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:24:44,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:24:44,349 INFO L82 PathProgramCache]: Analyzing trace with hash -194215875, now seen corresponding path program 6 times [2019-01-12 11:24:44,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:24:44,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:24:44,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:44,350 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:24:44,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:44,451 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 66 proven. 57 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-01-12 11:24:44,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:24:44,451 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 11:24:44,469 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 11:24:44,504 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-01-12 11:24:44,504 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:24:44,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:24:44,631 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 89 proven. 34 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-01-12 11:24:44,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:24:44,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2019-01-12 11:24:44,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-12 11:24:44,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-12 11:24:44,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-01-12 11:24:44,653 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 14 states. [2019-01-12 11:24:45,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:24:45,008 INFO L93 Difference]: Finished difference Result 69 states and 83 transitions. [2019-01-12 11:24:45,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-12 11:24:45,009 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2019-01-12 11:24:45,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:24:45,010 INFO L225 Difference]: With dead ends: 69 [2019-01-12 11:24:45,011 INFO L226 Difference]: Without dead ends: 52 [2019-01-12 11:24:45,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2019-01-12 11:24:45,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-12 11:24:45,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 41. [2019-01-12 11:24:45,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-12 11:24:45,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2019-01-12 11:24:45,019 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 34 [2019-01-12 11:24:45,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:24:45,020 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2019-01-12 11:24:45,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-12 11:24:45,020 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2019-01-12 11:24:45,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-12 11:24:45,021 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:24:45,021 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 7, 5, 1, 1, 1, 1, 1] [2019-01-12 11:24:45,022 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:24:45,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:24:45,022 INFO L82 PathProgramCache]: Analyzing trace with hash 77255039, now seen corresponding path program 7 times [2019-01-12 11:24:45,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:24:45,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:24:45,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:45,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:24:45,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:45,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:45,154 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 99 proven. 77 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-01-12 11:24:45,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:24:45,155 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 11:24:45,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:24:45,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:45,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:24:45,207 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 99 proven. 77 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-01-12 11:24:45,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:24:45,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-12 11:24:45,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 11:24:45,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 11:24:45,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-12 11:24:45,243 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 10 states. [2019-01-12 11:24:45,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:24:45,415 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2019-01-12 11:24:45,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 11:24:45,417 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2019-01-12 11:24:45,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:24:45,418 INFO L225 Difference]: With dead ends: 65 [2019-01-12 11:24:45,418 INFO L226 Difference]: Without dead ends: 45 [2019-01-12 11:24:45,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-12 11:24:45,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-12 11:24:45,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-01-12 11:24:45,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-12 11:24:45,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2019-01-12 11:24:45,426 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 40 [2019-01-12 11:24:45,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:24:45,427 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2019-01-12 11:24:45,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 11:24:45,427 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2019-01-12 11:24:45,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-12 11:24:45,429 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:24:45,429 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 8, 5, 1, 1, 1, 1, 1] [2019-01-12 11:24:45,429 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:24:45,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:24:45,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1553306189, now seen corresponding path program 8 times [2019-01-12 11:24:45,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:24:45,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:24:45,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:45,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:24:45,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:45,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:45,587 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 112 proven. 100 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-01-12 11:24:45,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:24:45,587 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 11:24:45,596 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 11:24:45,614 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 11:24:45,614 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:24:45,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:24:45,626 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 112 proven. 100 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-01-12 11:24:45,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:24:45,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-01-12 11:24:45,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 11:24:45,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 11:24:45,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-12 11:24:45,646 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 11 states. [2019-01-12 11:24:45,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:24:45,956 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2019-01-12 11:24:45,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 11:24:45,957 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2019-01-12 11:24:45,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:24:45,958 INFO L225 Difference]: With dead ends: 68 [2019-01-12 11:24:45,958 INFO L226 Difference]: Without dead ends: 48 [2019-01-12 11:24:45,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-12 11:24:45,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-12 11:24:45,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2019-01-12 11:24:45,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-12 11:24:45,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2019-01-12 11:24:45,965 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 43 [2019-01-12 11:24:45,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:24:45,966 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2019-01-12 11:24:45,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 11:24:45,966 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2019-01-12 11:24:45,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-12 11:24:45,967 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:24:45,968 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 9, 5, 1, 1, 1, 1, 1] [2019-01-12 11:24:45,969 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:24:45,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:24:45,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1577027905, now seen corresponding path program 9 times [2019-01-12 11:24:45,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:24:45,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:24:45,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:45,970 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:24:45,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:45,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:46,140 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 125 proven. 126 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-01-12 11:24:46,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:24:46,140 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 11:24:46,153 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 11:24:46,349 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-01-12 11:24:46,350 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:24:46,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:24:46,609 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 203 proven. 57 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-01-12 11:24:46,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:24:46,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2019-01-12 11:24:46,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-12 11:24:46,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-12 11:24:46,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-01-12 11:24:46,633 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 22 states. [2019-01-12 11:24:47,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:24:47,047 INFO L93 Difference]: Finished difference Result 151 states and 192 transitions. [2019-01-12 11:24:47,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-12 11:24:47,048 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 46 [2019-01-12 11:24:47,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:24:47,049 INFO L225 Difference]: With dead ends: 151 [2019-01-12 11:24:47,049 INFO L226 Difference]: Without dead ends: 131 [2019-01-12 11:24:47,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=405, Invalid=1235, Unknown=0, NotChecked=0, Total=1640 [2019-01-12 11:24:47,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-01-12 11:24:47,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 65. [2019-01-12 11:24:47,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-12 11:24:47,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2019-01-12 11:24:47,062 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 46 [2019-01-12 11:24:47,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:24:47,062 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2019-01-12 11:24:47,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-12 11:24:47,062 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2019-01-12 11:24:47,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-12 11:24:47,063 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:24:47,064 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 10, 10, 1, 1, 1, 1, 1] [2019-01-12 11:24:47,066 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:24:47,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:24:47,066 INFO L82 PathProgramCache]: Analyzing trace with hash 861246653, now seen corresponding path program 10 times [2019-01-12 11:24:47,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:24:47,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:24:47,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:47,068 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:24:47,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:47,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:47,235 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 298 proven. 155 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-01-12 11:24:47,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:24:47,236 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 11:24:47,246 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 11:24:47,294 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 11:24:47,294 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:24:47,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:24:47,317 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 298 proven. 155 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-01-12 11:24:47,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:24:47,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2019-01-12 11:24:47,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-12 11:24:47,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-12 11:24:47,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-01-12 11:24:47,337 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand 13 states. [2019-01-12 11:24:47,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:24:47,438 INFO L93 Difference]: Finished difference Result 104 states and 125 transitions. [2019-01-12 11:24:47,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 11:24:47,439 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 64 [2019-01-12 11:24:47,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:24:47,441 INFO L225 Difference]: With dead ends: 104 [2019-01-12 11:24:47,441 INFO L226 Difference]: Without dead ends: 69 [2019-01-12 11:24:47,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-01-12 11:24:47,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-12 11:24:47,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2019-01-12 11:24:47,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-12 11:24:47,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2019-01-12 11:24:47,452 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 64 [2019-01-12 11:24:47,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:24:47,452 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2019-01-12 11:24:47,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-12 11:24:47,453 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2019-01-12 11:24:47,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-12 11:24:47,453 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:24:47,454 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 11, 10, 1, 1, 1, 1, 1] [2019-01-12 11:24:47,456 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:24:47,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:24:47,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1441680267, now seen corresponding path program 11 times [2019-01-12 11:24:47,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:24:47,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:24:47,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:47,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:24:47,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:47,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:47,625 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 326 proven. 187 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-01-12 11:24:47,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:24:47,625 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 11:24:47,635 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 11:24:47,670 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2019-01-12 11:24:47,670 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:24:47,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:24:47,689 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 326 proven. 187 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-01-12 11:24:47,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:24:47,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2019-01-12 11:24:47,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-12 11:24:47,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-12 11:24:47,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-12 11:24:47,708 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand 14 states. [2019-01-12 11:24:47,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:24:47,883 INFO L93 Difference]: Finished difference Result 107 states and 128 transitions. [2019-01-12 11:24:47,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 11:24:47,884 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2019-01-12 11:24:47,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:24:47,884 INFO L225 Difference]: With dead ends: 107 [2019-01-12 11:24:47,884 INFO L226 Difference]: Without dead ends: 72 [2019-01-12 11:24:47,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-12 11:24:47,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-12 11:24:47,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-01-12 11:24:47,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-12 11:24:47,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2019-01-12 11:24:47,897 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 67 [2019-01-12 11:24:47,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:24:47,897 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2019-01-12 11:24:47,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-12 11:24:47,897 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2019-01-12 11:24:47,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-12 11:24:47,898 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:24:47,898 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 12, 10, 1, 1, 1, 1, 1] [2019-01-12 11:24:47,899 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:24:47,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:24:47,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1601141245, now seen corresponding path program 12 times [2019-01-12 11:24:47,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:24:47,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:24:47,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:47,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:24:47,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:47,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:48,165 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 354 proven. 222 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-01-12 11:24:48,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:24:48,166 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 11:24:48,179 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 11:24:48,300 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2019-01-12 11:24:48,300 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:24:48,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:24:48,333 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 354 proven. 222 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-01-12 11:24:48,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:24:48,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2019-01-12 11:24:48,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-12 11:24:48,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-12 11:24:48,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-01-12 11:24:48,369 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand 15 states. [2019-01-12 11:24:48,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:24:48,592 INFO L93 Difference]: Finished difference Result 110 states and 131 transitions. [2019-01-12 11:24:48,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-12 11:24:48,593 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 70 [2019-01-12 11:24:48,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:24:48,594 INFO L225 Difference]: With dead ends: 110 [2019-01-12 11:24:48,594 INFO L226 Difference]: Without dead ends: 75 [2019-01-12 11:24:48,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-01-12 11:24:48,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-12 11:24:48,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2019-01-12 11:24:48,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-12 11:24:48,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2019-01-12 11:24:48,604 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 70 [2019-01-12 11:24:48,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:24:48,604 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2019-01-12 11:24:48,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-12 11:24:48,605 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2019-01-12 11:24:48,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-12 11:24:48,605 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:24:48,608 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 13, 10, 1, 1, 1, 1, 1] [2019-01-12 11:24:48,608 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:24:48,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:24:48,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1869307467, now seen corresponding path program 13 times [2019-01-12 11:24:48,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:24:48,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:24:48,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:48,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:24:48,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:48,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:48,886 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 382 proven. 260 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-01-12 11:24:48,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:24:48,887 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 11:24:48,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:24:48,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:48,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:24:48,944 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 382 proven. 260 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-01-12 11:24:48,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:24:48,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2019-01-12 11:24:48,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-12 11:24:48,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-12 11:24:48,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-12 11:24:48,971 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand 16 states. [2019-01-12 11:24:49,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:24:49,079 INFO L93 Difference]: Finished difference Result 113 states and 134 transitions. [2019-01-12 11:24:49,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-12 11:24:49,080 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 73 [2019-01-12 11:24:49,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:24:49,081 INFO L225 Difference]: With dead ends: 113 [2019-01-12 11:24:49,081 INFO L226 Difference]: Without dead ends: 78 [2019-01-12 11:24:49,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-12 11:24:49,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-12 11:24:49,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-01-12 11:24:49,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-12 11:24:49,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2019-01-12 11:24:49,090 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 73 [2019-01-12 11:24:49,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:24:49,090 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2019-01-12 11:24:49,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-12 11:24:49,090 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2019-01-12 11:24:49,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-12 11:24:49,091 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:24:49,091 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 14, 10, 1, 1, 1, 1, 1] [2019-01-12 11:24:49,092 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:24:49,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:24:49,095 INFO L82 PathProgramCache]: Analyzing trace with hash -2124910787, now seen corresponding path program 14 times [2019-01-12 11:24:49,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:24:49,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:24:49,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:49,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:24:49,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:49,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:49,329 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 410 proven. 301 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-01-12 11:24:49,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:24:49,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 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 11:24:49,340 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 11:24:49,380 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 11:24:49,380 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:24:49,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:24:49,402 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 410 proven. 301 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-01-12 11:24:49,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:24:49,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2019-01-12 11:24:49,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-12 11:24:49,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-12 11:24:49,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-01-12 11:24:49,432 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand 17 states. [2019-01-12 11:24:49,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:24:49,572 INFO L93 Difference]: Finished difference Result 116 states and 137 transitions. [2019-01-12 11:24:49,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-12 11:24:49,573 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 76 [2019-01-12 11:24:49,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:24:49,574 INFO L225 Difference]: With dead ends: 116 [2019-01-12 11:24:49,574 INFO L226 Difference]: Without dead ends: 81 [2019-01-12 11:24:49,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-01-12 11:24:49,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-01-12 11:24:49,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2019-01-12 11:24:49,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-12 11:24:49,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2019-01-12 11:24:49,583 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 76 [2019-01-12 11:24:49,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:24:49,583 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2019-01-12 11:24:49,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-12 11:24:49,583 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2019-01-12 11:24:49,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-12 11:24:49,584 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:24:49,584 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 15, 10, 1, 1, 1, 1, 1] [2019-01-12 11:24:49,585 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:24:49,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:24:49,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1811980021, now seen corresponding path program 15 times [2019-01-12 11:24:49,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:24:49,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:24:49,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:49,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:24:49,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:49,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:49,833 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 438 proven. 345 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-01-12 11:24:49,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:24:49,833 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 11:24:49,843 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 11:24:49,924 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-01-12 11:24:49,924 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:24:49,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:24:49,941 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 438 proven. 345 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-01-12 11:24:49,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:24:49,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2019-01-12 11:24:49,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-12 11:24:49,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-12 11:24:49,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-01-12 11:24:49,970 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand 18 states. [2019-01-12 11:24:50,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:24:50,102 INFO L93 Difference]: Finished difference Result 119 states and 140 transitions. [2019-01-12 11:24:50,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-12 11:24:50,103 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 79 [2019-01-12 11:24:50,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:24:50,104 INFO L225 Difference]: With dead ends: 119 [2019-01-12 11:24:50,104 INFO L226 Difference]: Without dead ends: 84 [2019-01-12 11:24:50,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-01-12 11:24:50,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-12 11:24:50,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2019-01-12 11:24:50,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-12 11:24:50,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2019-01-12 11:24:50,114 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 79 [2019-01-12 11:24:50,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:24:50,114 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2019-01-12 11:24:50,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-12 11:24:50,114 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2019-01-12 11:24:50,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-12 11:24:50,115 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:24:50,115 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 16, 10, 1, 1, 1, 1, 1] [2019-01-12 11:24:50,115 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:24:50,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:24:50,116 INFO L82 PathProgramCache]: Analyzing trace with hash 629437565, now seen corresponding path program 16 times [2019-01-12 11:24:50,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:24:50,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:24:50,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:50,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:24:50,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:50,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:50,370 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 466 proven. 392 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-01-12 11:24:50,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:24:50,370 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 11:24:50,380 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 11:24:50,403 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 11:24:50,403 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:24:50,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:24:50,418 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 466 proven. 392 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-01-12 11:24:50,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:24:50,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2019-01-12 11:24:50,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-12 11:24:50,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-12 11:24:50,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-01-12 11:24:50,441 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand 19 states. [2019-01-12 11:24:50,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:24:50,647 INFO L93 Difference]: Finished difference Result 122 states and 143 transitions. [2019-01-12 11:24:50,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-12 11:24:50,648 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 82 [2019-01-12 11:24:50,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:24:50,649 INFO L225 Difference]: With dead ends: 122 [2019-01-12 11:24:50,649 INFO L226 Difference]: Without dead ends: 87 [2019-01-12 11:24:50,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-01-12 11:24:50,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-12 11:24:50,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2019-01-12 11:24:50,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-01-12 11:24:50,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2019-01-12 11:24:50,657 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 82 [2019-01-12 11:24:50,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:24:50,657 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2019-01-12 11:24:50,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-12 11:24:50,658 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2019-01-12 11:24:50,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-12 11:24:50,658 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:24:50,658 INFO L402 BasicCegarLoop]: trace histogram [27, 26, 17, 10, 1, 1, 1, 1, 1] [2019-01-12 11:24:50,659 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:24:50,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:24:50,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1924551627, now seen corresponding path program 17 times [2019-01-12 11:24:50,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:24:50,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:24:50,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:50,662 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:24:50,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:50,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:50,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 494 proven. 442 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-01-12 11:24:50,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:24:50,896 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 11:24:50,910 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 11:24:50,960 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 27 check-sat command(s) [2019-01-12 11:24:50,961 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:24:50,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:24:50,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 494 proven. 442 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-01-12 11:24:51,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:24:51,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2019-01-12 11:24:51,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-12 11:24:51,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-12 11:24:51,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-01-12 11:24:51,010 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand 20 states. [2019-01-12 11:24:51,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:24:51,208 INFO L93 Difference]: Finished difference Result 125 states and 146 transitions. [2019-01-12 11:24:51,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-12 11:24:51,208 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 85 [2019-01-12 11:24:51,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:24:51,209 INFO L225 Difference]: With dead ends: 125 [2019-01-12 11:24:51,209 INFO L226 Difference]: Without dead ends: 90 [2019-01-12 11:24:51,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-01-12 11:24:51,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-01-12 11:24:51,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-01-12 11:24:51,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-12 11:24:51,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2019-01-12 11:24:51,217 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 85 [2019-01-12 11:24:51,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:24:51,219 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2019-01-12 11:24:51,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-12 11:24:51,219 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2019-01-12 11:24:51,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-01-12 11:24:51,223 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:24:51,223 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 18, 10, 1, 1, 1, 1, 1] [2019-01-12 11:24:51,223 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:24:51,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:24:51,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1318614595, now seen corresponding path program 18 times [2019-01-12 11:24:51,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:24:51,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:24:51,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:51,227 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:24:51,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:51,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:51,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 522 proven. 495 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-01-12 11:24:51,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:24:51,500 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 11:24:51,510 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 11:24:51,559 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2019-01-12 11:24:51,560 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:24:51,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:24:51,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 814 proven. 262 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-01-12 11:24:51,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:24:51,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16] total 35 [2019-01-12 11:24:51,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-12 11:24:51,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-12 11:24:51,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=861, Unknown=0, NotChecked=0, Total=1190 [2019-01-12 11:24:51,843 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand 35 states. [2019-01-12 11:24:52,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:24:52,629 INFO L93 Difference]: Finished difference Result 252 states and 317 transitions. [2019-01-12 11:24:52,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-12 11:24:52,630 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 88 [2019-01-12 11:24:52,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:24:52,631 INFO L225 Difference]: With dead ends: 252 [2019-01-12 11:24:52,632 INFO L226 Difference]: Without dead ends: 217 [2019-01-12 11:24:52,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 879 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1077, Invalid=3345, Unknown=0, NotChecked=0, Total=4422 [2019-01-12 11:24:52,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-01-12 11:24:52,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 104. [2019-01-12 11:24:52,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-12 11:24:52,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 118 transitions. [2019-01-12 11:24:52,655 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 118 transitions. Word has length 88 [2019-01-12 11:24:52,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:24:52,656 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 118 transitions. [2019-01-12 11:24:52,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-12 11:24:52,657 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 118 transitions. [2019-01-12 11:24:52,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-12 11:24:52,657 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:24:52,657 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 19, 14, 1, 1, 1, 1, 1] [2019-01-12 11:24:52,658 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:24:52,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:24:52,658 INFO L82 PathProgramCache]: Analyzing trace with hash -627790453, now seen corresponding path program 19 times [2019-01-12 11:24:52,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:24:52,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:24:52,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:52,660 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:24:52,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:52,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:52,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1584 backedges. 786 proven. 551 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2019-01-12 11:24:52,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:24:52,986 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 11:24:53,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:24:53,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:53,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:24:53,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1584 backedges. 786 proven. 551 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2019-01-12 11:24:53,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:24:53,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2019-01-12 11:24:53,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-12 11:24:53,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-12 11:24:53,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-12 11:24:53,073 INFO L87 Difference]: Start difference. First operand 104 states and 118 transitions. Second operand 22 states. [2019-01-12 11:24:53,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:24:53,178 INFO L93 Difference]: Finished difference Result 155 states and 184 transitions. [2019-01-12 11:24:53,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-12 11:24:53,182 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 103 [2019-01-12 11:24:53,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:24:53,183 INFO L225 Difference]: With dead ends: 155 [2019-01-12 11:24:53,183 INFO L226 Difference]: Without dead ends: 108 [2019-01-12 11:24:53,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-12 11:24:53,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-12 11:24:53,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2019-01-12 11:24:53,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-12 11:24:53,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 121 transitions. [2019-01-12 11:24:53,197 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 121 transitions. Word has length 103 [2019-01-12 11:24:53,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:24:53,198 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 121 transitions. [2019-01-12 11:24:53,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-12 11:24:53,198 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 121 transitions. [2019-01-12 11:24:53,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-12 11:24:53,198 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:24:53,198 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 20, 14, 1, 1, 1, 1, 1] [2019-01-12 11:24:53,202 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:24:53,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:24:53,202 INFO L82 PathProgramCache]: Analyzing trace with hash -531428611, now seen corresponding path program 20 times [2019-01-12 11:24:53,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:24:53,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:24:53,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:53,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:24:53,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:53,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:54,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 826 proven. 610 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2019-01-12 11:24:54,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:24:54,216 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 11:24:54,227 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 11:24:54,259 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 11:24:54,259 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:24:54,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:24:54,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 826 proven. 610 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2019-01-12 11:24:54,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:24:54,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2019-01-12 11:24:54,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-12 11:24:54,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-12 11:24:54,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-01-12 11:24:54,299 INFO L87 Difference]: Start difference. First operand 107 states and 121 transitions. Second operand 23 states. [2019-01-12 11:24:54,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:24:54,408 INFO L93 Difference]: Finished difference Result 158 states and 187 transitions. [2019-01-12 11:24:54,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-12 11:24:54,409 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 106 [2019-01-12 11:24:54,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:24:54,411 INFO L225 Difference]: With dead ends: 158 [2019-01-12 11:24:54,411 INFO L226 Difference]: Without dead ends: 111 [2019-01-12 11:24:54,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-01-12 11:24:54,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-12 11:24:54,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2019-01-12 11:24:54,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-12 11:24:54,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 124 transitions. [2019-01-12 11:24:54,423 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 124 transitions. Word has length 106 [2019-01-12 11:24:54,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:24:54,423 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 124 transitions. [2019-01-12 11:24:54,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-12 11:24:54,423 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 124 transitions. [2019-01-12 11:24:54,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-01-12 11:24:54,426 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:24:54,427 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 21, 14, 1, 1, 1, 1, 1] [2019-01-12 11:24:54,427 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:24:54,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:24:54,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1146052683, now seen corresponding path program 21 times [2019-01-12 11:24:54,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:24:54,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:24:54,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:54,428 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:24:54,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:54,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:55,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 866 proven. 672 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2019-01-12 11:24:55,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:24:55,353 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:24:55,363 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 11:24:55,425 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2019-01-12 11:24:55,425 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:24:55,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:24:56,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 1211 proven. 534 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-01-12 11:24:56,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:24:56,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 45 [2019-01-12 11:24:56,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-12 11:24:56,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-12 11:24:56,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=551, Invalid=1519, Unknown=0, NotChecked=0, Total=2070 [2019-01-12 11:24:56,335 INFO L87 Difference]: Start difference. First operand 110 states and 124 transitions. Second operand 46 states. [2019-01-12 11:24:58,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:24:58,137 INFO L93 Difference]: Finished difference Result 505 states and 654 transitions. [2019-01-12 11:24:58,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-12 11:24:58,137 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 109 [2019-01-12 11:24:58,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:24:58,140 INFO L225 Difference]: With dead ends: 505 [2019-01-12 11:24:58,140 INFO L226 Difference]: Without dead ends: 458 [2019-01-12 11:24:58,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1744 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1689, Invalid=6143, Unknown=0, NotChecked=0, Total=7832 [2019-01-12 11:24:58,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-01-12 11:24:58,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 137. [2019-01-12 11:24:58,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-01-12 11:24:58,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 159 transitions. [2019-01-12 11:24:58,167 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 159 transitions. Word has length 109 [2019-01-12 11:24:58,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:24:58,167 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 159 transitions. [2019-01-12 11:24:58,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-12 11:24:58,167 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 159 transitions. [2019-01-12 11:24:58,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-01-12 11:24:58,168 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:24:58,168 INFO L402 BasicCegarLoop]: trace histogram [44, 43, 22, 22, 1, 1, 1, 1, 1] [2019-01-12 11:24:58,169 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:24:58,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:24:58,169 INFO L82 PathProgramCache]: Analyzing trace with hash 662394941, now seen corresponding path program 22 times [2019-01-12 11:24:58,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:24:58,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:24:58,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:58,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:24:58,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:58,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:24:58,945 INFO L134 CoverageAnalysis]: Checked inductivity of 2838 backedges. 1450 proven. 737 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2019-01-12 11:24:58,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:24:58,946 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:24:58,956 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 11:24:58,999 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 11:24:59,000 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:24:59,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:24:59,508 INFO L134 CoverageAnalysis]: Checked inductivity of 2838 backedges. 170 proven. 2667 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-12 11:24:59,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:24:59,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 44] total 44 [2019-01-12 11:24:59,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-01-12 11:24:59,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-01-12 11:24:59,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-01-12 11:24:59,529 INFO L87 Difference]: Start difference. First operand 137 states and 159 transitions. Second operand 45 states. [2019-01-12 11:24:59,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:24:59,731 INFO L93 Difference]: Finished difference Result 272 states and 337 transitions. [2019-01-12 11:24:59,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-12 11:24:59,732 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 136 [2019-01-12 11:24:59,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:24:59,733 INFO L225 Difference]: With dead ends: 272 [2019-01-12 11:24:59,734 INFO L226 Difference]: Without dead ends: 201 [2019-01-12 11:24:59,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-01-12 11:24:59,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-01-12 11:24:59,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 200. [2019-01-12 11:24:59,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-01-12 11:24:59,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 222 transitions. [2019-01-12 11:24:59,758 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 222 transitions. Word has length 136 [2019-01-12 11:24:59,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:24:59,758 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 222 transitions. [2019-01-12 11:24:59,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-01-12 11:24:59,759 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 222 transitions. [2019-01-12 11:24:59,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-01-12 11:24:59,760 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:24:59,760 INFO L402 BasicCegarLoop]: trace histogram [65, 64, 43, 22, 1, 1, 1, 1, 1] [2019-01-12 11:24:59,760 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:24:59,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:24:59,760 INFO L82 PathProgramCache]: Analyzing trace with hash -898802549, now seen corresponding path program 23 times [2019-01-12 11:24:59,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:24:59,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:24:59,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:59,761 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:24:59,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:24:59,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:00,735 INFO L134 CoverageAnalysis]: Checked inductivity of 6240 backedges. 2794 proven. 2795 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2019-01-12 11:25:00,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:25:00,736 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:25:00,748 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 11:25:00,930 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 65 check-sat command(s) [2019-01-12 11:25:00,930 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:25:00,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:25:00,971 INFO L134 CoverageAnalysis]: Checked inductivity of 6240 backedges. 2794 proven. 2795 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2019-01-12 11:25:00,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:25:00,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2019-01-12 11:25:00,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-12 11:25:00,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-12 11:25:00,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-01-12 11:25:00,991 INFO L87 Difference]: Start difference. First operand 200 states and 222 transitions. Second operand 46 states. [2019-01-12 11:25:01,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:01,280 INFO L93 Difference]: Finished difference Result 275 states and 320 transitions. [2019-01-12 11:25:01,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-12 11:25:01,282 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 199 [2019-01-12 11:25:01,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:01,283 INFO L225 Difference]: With dead ends: 275 [2019-01-12 11:25:01,284 INFO L226 Difference]: Without dead ends: 204 [2019-01-12 11:25:01,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-01-12 11:25:01,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-01-12 11:25:01,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 203. [2019-01-12 11:25:01,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-01-12 11:25:01,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 225 transitions. [2019-01-12 11:25:01,307 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 225 transitions. Word has length 199 [2019-01-12 11:25:01,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:01,307 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 225 transitions. [2019-01-12 11:25:01,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-12 11:25:01,307 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 225 transitions. [2019-01-12 11:25:01,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-01-12 11:25:01,308 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:01,308 INFO L402 BasicCegarLoop]: trace histogram [66, 65, 44, 22, 1, 1, 1, 1, 1] [2019-01-12 11:25:01,309 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:01,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:01,309 INFO L82 PathProgramCache]: Analyzing trace with hash 899998205, now seen corresponding path program 24 times [2019-01-12 11:25:01,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:01,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:01,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:01,310 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:25:01,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:01,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:02,504 INFO L134 CoverageAnalysis]: Checked inductivity of 6435 backedges. 2858 proven. 2926 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2019-01-12 11:25:02,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:25:02,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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:25:02,514 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 11:25:02,650 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 66 check-sat command(s) [2019-01-12 11:25:02,650 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:25:02,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:25:02,699 INFO L134 CoverageAnalysis]: Checked inductivity of 6435 backedges. 2858 proven. 2926 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2019-01-12 11:25:02,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:25:02,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2019-01-12 11:25:02,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-12 11:25:02,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-12 11:25:02,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-01-12 11:25:02,719 INFO L87 Difference]: Start difference. First operand 203 states and 225 transitions. Second operand 47 states. [2019-01-12 11:25:02,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:02,949 INFO L93 Difference]: Finished difference Result 278 states and 323 transitions. [2019-01-12 11:25:02,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-12 11:25:02,950 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 202 [2019-01-12 11:25:02,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:02,952 INFO L225 Difference]: With dead ends: 278 [2019-01-12 11:25:02,952 INFO L226 Difference]: Without dead ends: 207 [2019-01-12 11:25:02,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-01-12 11:25:02,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-01-12 11:25:02,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 206. [2019-01-12 11:25:02,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-01-12 11:25:02,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 228 transitions. [2019-01-12 11:25:02,975 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 228 transitions. Word has length 202 [2019-01-12 11:25:02,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:02,975 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 228 transitions. [2019-01-12 11:25:02,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-12 11:25:02,976 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 228 transitions. [2019-01-12 11:25:02,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-01-12 11:25:02,977 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:02,977 INFO L402 BasicCegarLoop]: trace histogram [67, 66, 45, 22, 1, 1, 1, 1, 1] [2019-01-12 11:25:02,977 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:02,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:02,977 INFO L82 PathProgramCache]: Analyzing trace with hash 666308427, now seen corresponding path program 25 times [2019-01-12 11:25:02,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:02,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:02,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:02,978 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:25:02,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:02,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:04,643 INFO L134 CoverageAnalysis]: Checked inductivity of 6633 backedges. 2922 proven. 3060 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2019-01-12 11:25:04,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:25:04,644 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:25:04,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:25:04,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:04,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:25:04,777 INFO L134 CoverageAnalysis]: Checked inductivity of 6633 backedges. 2922 proven. 3060 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2019-01-12 11:25:04,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:25:04,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2019-01-12 11:25:04,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-12 11:25:04,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-12 11:25:04,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-01-12 11:25:04,800 INFO L87 Difference]: Start difference. First operand 206 states and 228 transitions. Second operand 48 states. [2019-01-12 11:25:05,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:05,535 INFO L93 Difference]: Finished difference Result 281 states and 326 transitions. [2019-01-12 11:25:05,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-12 11:25:05,537 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 205 [2019-01-12 11:25:05,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:05,539 INFO L225 Difference]: With dead ends: 281 [2019-01-12 11:25:05,540 INFO L226 Difference]: Without dead ends: 210 [2019-01-12 11:25:05,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-01-12 11:25:05,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-01-12 11:25:05,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2019-01-12 11:25:05,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-01-12 11:25:05,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 231 transitions. [2019-01-12 11:25:05,585 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 231 transitions. Word has length 205 [2019-01-12 11:25:05,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:05,586 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 231 transitions. [2019-01-12 11:25:05,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-12 11:25:05,586 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 231 transitions. [2019-01-12 11:25:05,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-01-12 11:25:05,590 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:05,590 INFO L402 BasicCegarLoop]: trace histogram [68, 67, 46, 22, 1, 1, 1, 1, 1] [2019-01-12 11:25:05,590 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:05,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:05,591 INFO L82 PathProgramCache]: Analyzing trace with hash 956118845, now seen corresponding path program 26 times [2019-01-12 11:25:05,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:05,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:05,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:05,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:25:05,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:05,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:06,934 INFO L134 CoverageAnalysis]: Checked inductivity of 6834 backedges. 2986 proven. 3197 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2019-01-12 11:25:06,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:25:06,934 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:25:06,944 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 11:25:07,008 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 11:25:07,008 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:25:07,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:25:07,052 INFO L134 CoverageAnalysis]: Checked inductivity of 6834 backedges. 2986 proven. 3197 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2019-01-12 11:25:07,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:25:07,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2019-01-12 11:25:07,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-01-12 11:25:07,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-01-12 11:25:07,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-01-12 11:25:07,072 INFO L87 Difference]: Start difference. First operand 209 states and 231 transitions. Second operand 49 states. [2019-01-12 11:25:07,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:07,340 INFO L93 Difference]: Finished difference Result 284 states and 329 transitions. [2019-01-12 11:25:07,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-01-12 11:25:07,342 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 208 [2019-01-12 11:25:07,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:07,345 INFO L225 Difference]: With dead ends: 284 [2019-01-12 11:25:07,345 INFO L226 Difference]: Without dead ends: 213 [2019-01-12 11:25:07,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-01-12 11:25:07,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-01-12 11:25:07,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 212. [2019-01-12 11:25:07,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-01-12 11:25:07,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 234 transitions. [2019-01-12 11:25:07,376 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 234 transitions. Word has length 208 [2019-01-12 11:25:07,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:07,376 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 234 transitions. [2019-01-12 11:25:07,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-01-12 11:25:07,376 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 234 transitions. [2019-01-12 11:25:07,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-01-12 11:25:07,380 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:07,380 INFO L402 BasicCegarLoop]: trace histogram [69, 68, 47, 22, 1, 1, 1, 1, 1] [2019-01-12 11:25:07,381 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:07,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:07,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1814016523, now seen corresponding path program 27 times [2019-01-12 11:25:07,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:07,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:07,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:07,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:25:07,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:07,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:08,378 INFO L134 CoverageAnalysis]: Checked inductivity of 7038 backedges. 3050 proven. 3337 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2019-01-12 11:25:08,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:25:08,379 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:25:08,389 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 11:25:08,793 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2019-01-12 11:25:08,794 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:25:08,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:25:09,795 INFO L134 CoverageAnalysis]: Checked inductivity of 7038 backedges. 4709 proven. 1366 refuted. 0 times theorem prover too weak. 963 trivial. 0 not checked. [2019-01-12 11:25:09,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:25:09,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 25] total 73 [2019-01-12 11:25:09,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-01-12 11:25:09,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-01-12 11:25:09,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1524, Invalid=3732, Unknown=0, NotChecked=0, Total=5256 [2019-01-12 11:25:09,830 INFO L87 Difference]: Start difference. First operand 212 states and 234 transitions. Second operand 73 states. [2019-01-12 11:25:11,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:11,869 INFO L93 Difference]: Finished difference Result 354 states and 422 transitions. [2019-01-12 11:25:11,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-01-12 11:25:11,871 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 211 [2019-01-12 11:25:11,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:11,872 INFO L225 Difference]: With dead ends: 354 [2019-01-12 11:25:11,872 INFO L226 Difference]: Without dead ends: 283 [2019-01-12 11:25:11,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3915 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=5185, Invalid=15121, Unknown=0, NotChecked=0, Total=20306 [2019-01-12 11:25:11,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-01-12 11:25:11,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 218. [2019-01-12 11:25:11,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-01-12 11:25:11,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 241 transitions. [2019-01-12 11:25:11,908 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 241 transitions. Word has length 211 [2019-01-12 11:25:11,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:11,909 INFO L480 AbstractCegarLoop]: Abstraction has 218 states and 241 transitions. [2019-01-12 11:25:11,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-01-12 11:25:11,909 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 241 transitions. [2019-01-12 11:25:11,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-01-12 11:25:11,913 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:11,913 INFO L402 BasicCegarLoop]: trace histogram [71, 70, 48, 23, 1, 1, 1, 1, 1] [2019-01-12 11:25:11,913 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:11,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:11,914 INFO L82 PathProgramCache]: Analyzing trace with hash -418731187, now seen corresponding path program 28 times [2019-01-12 11:25:11,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:11,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:11,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:11,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:25:11,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:11,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:13,038 INFO L134 CoverageAnalysis]: Checked inductivity of 7455 backedges. 3260 proven. 3480 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2019-01-12 11:25:13,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:25:13,038 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:25:13,058 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 11:25:13,141 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 11:25:13,141 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:25:13,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:25:13,199 INFO L134 CoverageAnalysis]: Checked inductivity of 7455 backedges. 3260 proven. 3480 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2019-01-12 11:25:13,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:25:13,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 50 [2019-01-12 11:25:13,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-01-12 11:25:13,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-01-12 11:25:13,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-01-12 11:25:13,220 INFO L87 Difference]: Start difference. First operand 218 states and 241 transitions. Second operand 51 states. [2019-01-12 11:25:13,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:13,422 INFO L93 Difference]: Finished difference Result 296 states and 343 transitions. [2019-01-12 11:25:13,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-01-12 11:25:13,423 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 217 [2019-01-12 11:25:13,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:13,425 INFO L225 Difference]: With dead ends: 296 [2019-01-12 11:25:13,425 INFO L226 Difference]: Without dead ends: 222 [2019-01-12 11:25:13,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-01-12 11:25:13,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-01-12 11:25:13,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 221. [2019-01-12 11:25:13,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-01-12 11:25:13,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 244 transitions. [2019-01-12 11:25:13,454 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 244 transitions. Word has length 217 [2019-01-12 11:25:13,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:13,454 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 244 transitions. [2019-01-12 11:25:13,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-01-12 11:25:13,454 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 244 transitions. [2019-01-12 11:25:13,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-01-12 11:25:13,455 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:13,456 INFO L402 BasicCegarLoop]: trace histogram [72, 71, 49, 23, 1, 1, 1, 1, 1] [2019-01-12 11:25:13,459 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:13,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:13,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1389725633, now seen corresponding path program 29 times [2019-01-12 11:25:13,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:13,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:13,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:13,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:25:13,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:13,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:15,028 INFO L134 CoverageAnalysis]: Checked inductivity of 7668 backedges. 3327 proven. 3626 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2019-01-12 11:25:15,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:25:15,028 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:25:15,037 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 11:25:15,239 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 72 check-sat command(s) [2019-01-12 11:25:15,239 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:25:15,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:25:15,295 INFO L134 CoverageAnalysis]: Checked inductivity of 7668 backedges. 3327 proven. 3626 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2019-01-12 11:25:15,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:25:15,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 51 [2019-01-12 11:25:15,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-12 11:25:15,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-12 11:25:15,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-12 11:25:15,316 INFO L87 Difference]: Start difference. First operand 221 states and 244 transitions. Second operand 52 states. [2019-01-12 11:25:15,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:15,583 INFO L93 Difference]: Finished difference Result 319 states and 366 transitions. [2019-01-12 11:25:15,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-12 11:25:15,585 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 220 [2019-01-12 11:25:15,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:15,587 INFO L225 Difference]: With dead ends: 319 [2019-01-12 11:25:15,587 INFO L226 Difference]: Without dead ends: 245 [2019-01-12 11:25:15,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-12 11:25:15,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-01-12 11:25:15,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 224. [2019-01-12 11:25:15,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-01-12 11:25:15,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 247 transitions. [2019-01-12 11:25:15,610 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 247 transitions. Word has length 220 [2019-01-12 11:25:15,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:15,610 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 247 transitions. [2019-01-12 11:25:15,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-12 11:25:15,610 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 247 transitions. [2019-01-12 11:25:15,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-01-12 11:25:15,611 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:15,612 INFO L402 BasicCegarLoop]: trace histogram [73, 72, 50, 23, 1, 1, 1, 1, 1] [2019-01-12 11:25:15,612 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:15,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:15,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1680527859, now seen corresponding path program 30 times [2019-01-12 11:25:15,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:15,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:15,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:15,613 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:25:15,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:15,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:17,018 INFO L134 CoverageAnalysis]: Checked inductivity of 7884 backedges. 6320 proven. 1497 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-01-12 11:25:17,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:25:17,018 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:25:17,030 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 11:25:17,184 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 73 check-sat command(s) [2019-01-12 11:25:17,185 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:25:17,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:25:17,257 INFO L134 CoverageAnalysis]: Checked inductivity of 7884 backedges. 6320 proven. 1497 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-01-12 11:25:17,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:25:17,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2019-01-12 11:25:17,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-12 11:25:17,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-12 11:25:17,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-01-12 11:25:17,288 INFO L87 Difference]: Start difference. First operand 224 states and 247 transitions. Second operand 53 states. [2019-01-12 11:25:20,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:20,298 INFO L93 Difference]: Finished difference Result 2188 states and 2882 transitions. [2019-01-12 11:25:20,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-12 11:25:20,299 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 223 [2019-01-12 11:25:20,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:20,310 INFO L225 Difference]: With dead ends: 2188 [2019-01-12 11:25:20,311 INFO L226 Difference]: Without dead ends: 2184 [2019-01-12 11:25:20,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-01-12 11:25:20,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2184 states. [2019-01-12 11:25:20,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2184 to 308. [2019-01-12 11:25:20,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-01-12 11:25:20,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 359 transitions. [2019-01-12 11:25:20,475 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 359 transitions. Word has length 223 [2019-01-12 11:25:20,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:20,478 INFO L480 AbstractCegarLoop]: Abstraction has 308 states and 359 transitions. [2019-01-12 11:25:20,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-12 11:25:20,478 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 359 transitions. [2019-01-12 11:25:20,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-01-12 11:25:20,482 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:20,482 INFO L402 BasicCegarLoop]: trace histogram [101, 100, 51, 50, 1, 1, 1, 1, 1] [2019-01-12 11:25:20,482 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:20,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:20,483 INFO L82 PathProgramCache]: Analyzing trace with hash 168430093, now seen corresponding path program 31 times [2019-01-12 11:25:20,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:20,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:20,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:20,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:25:20,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:20,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:22,790 INFO L134 CoverageAnalysis]: Checked inductivity of 15150 backedges. 7648 proven. 3876 refuted. 0 times theorem prover too weak. 3626 trivial. 0 not checked. [2019-01-12 11:25:22,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:25:22,790 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:25:22,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:25:22,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:22,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:25:27,290 INFO L134 CoverageAnalysis]: Checked inductivity of 15150 backedges. 0 proven. 15150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:25:27,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:25:27,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 104] total 105 [2019-01-12 11:25:27,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-01-12 11:25:27,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-01-12 11:25:27,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1483, Invalid=9437, Unknown=0, NotChecked=0, Total=10920 [2019-01-12 11:25:27,313 INFO L87 Difference]: Start difference. First operand 308 states and 359 transitions. Second operand 105 states. [2019-01-12 11:25:36,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:36,585 INFO L93 Difference]: Finished difference Result 4538 states and 5916 transitions. [2019-01-12 11:25:36,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-01-12 11:25:36,586 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 307 [2019-01-12 11:25:36,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:36,603 INFO L225 Difference]: With dead ends: 4538 [2019-01-12 11:25:36,603 INFO L226 Difference]: Without dead ends: 4378 [2019-01-12 11:25:36,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 258 SyntacticMatches, 1 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=1487, Invalid=9643, Unknown=0, NotChecked=0, Total=11130 [2019-01-12 11:25:36,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4378 states. [2019-01-12 11:25:39,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4378 to 4182. [2019-01-12 11:25:39,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4182 states. [2019-01-12 11:25:39,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4182 states to 4182 states and 4282 transitions. [2019-01-12 11:25:39,526 INFO L78 Accepts]: Start accepts. Automaton has 4182 states and 4282 transitions. Word has length 307 [2019-01-12 11:25:39,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:39,526 INFO L480 AbstractCegarLoop]: Abstraction has 4182 states and 4282 transitions. [2019-01-12 11:25:39,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-01-12 11:25:39,527 INFO L276 IsEmpty]: Start isEmpty. Operand 4182 states and 4282 transitions. [2019-01-12 11:25:39,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-01-12 11:25:39,528 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:39,528 INFO L402 BasicCegarLoop]: trace histogram [102, 101, 52, 50, 1, 1, 1, 1, 1] [2019-01-12 11:25:39,529 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:39,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:39,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1782606915, now seen corresponding path program 32 times [2019-01-12 11:25:39,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:39,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:39,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:39,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:25:39,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:39,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:41,485 INFO L134 CoverageAnalysis]: Checked inductivity of 15453 backedges. 7903 proven. 7401 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-01-12 11:25:41,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:25:41,485 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:25:41,494 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 11:25:41,602 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 11:25:41,602 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:25:41,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:25:41,752 INFO L134 CoverageAnalysis]: Checked inductivity of 15453 backedges. 7903 proven. 7401 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-01-12 11:25:41,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:25:41,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 53 [2019-01-12 11:25:41,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-12 11:25:41,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-12 11:25:41,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-01-12 11:25:41,786 INFO L87 Difference]: Start difference. First operand 4182 states and 4282 transitions. Second operand 54 states. [2019-01-12 11:25:45,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:45,659 INFO L93 Difference]: Finished difference Result 8368 states and 8569 transitions. [2019-01-12 11:25:45,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-12 11:25:45,660 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 310 [2019-01-12 11:25:45,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:45,674 INFO L225 Difference]: With dead ends: 8368 [2019-01-12 11:25:45,674 INFO L226 Difference]: Without dead ends: 4185 [2019-01-12 11:25:45,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 360 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-01-12 11:25:45,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4185 states. [2019-01-12 11:25:48,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4185 to 4185. [2019-01-12 11:25:48,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4185 states. [2019-01-12 11:25:48,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4185 states to 4185 states and 4285 transitions. [2019-01-12 11:25:48,336 INFO L78 Accepts]: Start accepts. Automaton has 4185 states and 4285 transitions. Word has length 310 [2019-01-12 11:25:48,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:48,336 INFO L480 AbstractCegarLoop]: Abstraction has 4185 states and 4285 transitions. [2019-01-12 11:25:48,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-12 11:25:48,337 INFO L276 IsEmpty]: Start isEmpty. Operand 4185 states and 4285 transitions. [2019-01-12 11:25:48,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-01-12 11:25:48,339 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:48,339 INFO L402 BasicCegarLoop]: trace histogram [103, 102, 52, 51, 1, 1, 1, 1, 1] [2019-01-12 11:25:48,339 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:48,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:48,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1557402635, now seen corresponding path program 33 times [2019-01-12 11:25:48,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:48,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:48,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:48,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:25:48,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:48,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:50,747 INFO L134 CoverageAnalysis]: Checked inductivity of 15759 backedges. 11729 proven. 0 refuted. 0 times theorem prover too weak. 4030 trivial. 0 not checked. [2019-01-12 11:25:50,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:25:50,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2019-01-12 11:25:50,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-12 11:25:50,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-12 11:25:50,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-01-12 11:25:50,749 INFO L87 Difference]: Start difference. First operand 4185 states and 4285 transitions. Second operand 53 states. [2019-01-12 11:25:51,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:51,006 INFO L93 Difference]: Finished difference Result 4185 states and 4285 transitions. [2019-01-12 11:25:51,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-12 11:25:51,008 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 313 [2019-01-12 11:25:51,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:51,008 INFO L225 Difference]: With dead ends: 4185 [2019-01-12 11:25:51,008 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 11:25:51,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-01-12 11:25:51,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 11:25:51,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 11:25:51,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 11:25:51,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 11:25:51,013 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 313 [2019-01-12 11:25:51,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:51,013 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 11:25:51,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-12 11:25:51,013 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 11:25:51,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 11:25:51,018 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 11:25:56,527 WARN L181 SmtUtils]: Spent 5.49 s on a formula simplification. DAG size of input: 1519 DAG size of output: 1188 [2019-01-12 11:26:07,729 WARN L181 SmtUtils]: Spent 11.19 s on a formula simplification. DAG size of input: 1180 DAG size of output: 509 [2019-01-12 11:26:07,743 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 11:26:07,743 INFO L448 ceAbstractionStarter]: For program point L15(lines 15 19) no Hoare annotation was computed. [2019-01-12 11:26:07,743 INFO L448 ceAbstractionStarter]: For program point L15-2(lines 14 22) no Hoare annotation was computed. [2019-01-12 11:26:07,743 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-01-12 11:26:07,743 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 11:26:07,743 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 11:26:07,744 INFO L451 ceAbstractionStarter]: At program point L24(lines 10 25) the Hoare annotation is: true [2019-01-12 11:26:07,746 INFO L444 ceAbstractionStarter]: At program point L14-2(lines 14 22) the Hoare annotation is: (let ((.cse5 (<= 42 ULTIMATE.start_main_~y~0)) (.cse4 (<= ULTIMATE.start_main_~y~0 42)) (.cse8 (<= ULTIMATE.start_main_~y~0 5)) (.cse9 (<= 5 ULTIMATE.start_main_~y~0)) (.cse20 (<= ULTIMATE.start_main_~y~0 11)) (.cse21 (<= 11 ULTIMATE.start_main_~y~0)) (.cse13 (<= 25 ULTIMATE.start_main_~y~0)) (.cse12 (<= ULTIMATE.start_main_~y~0 25)) (.cse22 (<= ULTIMATE.start_main_~y~0 22)) (.cse23 (<= 22 ULTIMATE.start_main_~y~0)) (.cse48 (<= ULTIMATE.start_main_~y~0 1)) (.cse49 (<= 1 ULTIMATE.start_main_~y~0)) (.cse51 (<= 32 ULTIMATE.start_main_~y~0)) (.cse50 (<= ULTIMATE.start_main_~y~0 32)) (.cse34 (<= 38 ULTIMATE.start_main_~y~0)) (.cse35 (<= ULTIMATE.start_main_~y~0 38)) (.cse31 (<= 34 ULTIMATE.start_main_~y~0)) (.cse30 (<= ULTIMATE.start_main_~y~0 34)) (.cse14 (<= ULTIMATE.start_main_~y~0 46)) (.cse15 (<= 46 ULTIMATE.start_main_~y~0)) (.cse19 (<= 48 ULTIMATE.start_main_~y~0)) (.cse18 (<= ULTIMATE.start_main_~y~0 48)) (.cse25 (<= 3 ULTIMATE.start_main_~y~0)) (.cse24 (<= ULTIMATE.start_main_~y~0 3)) (.cse38 (<= 17 ULTIMATE.start_main_~y~0)) (.cse39 (<= ULTIMATE.start_main_~y~0 17)) (.cse45 (<= ULTIMATE.start_main_~y~0 14)) (.cse44 (<= 14 ULTIMATE.start_main_~y~0)) (.cse67 (<= 4 ULTIMATE.start_main_~y~0)) (.cse66 (<= ULTIMATE.start_main_~y~0 4)) (.cse42 (<= 30 ULTIMATE.start_main_~y~0)) (.cse43 (<= ULTIMATE.start_main_~y~0 30)) (.cse58 (<= 45 ULTIMATE.start_main_~y~0)) (.cse59 (<= ULTIMATE.start_main_~y~0 45)) (.cse73 (<= ULTIMATE.start_main_~y~0 31)) (.cse72 (<= 31 ULTIMATE.start_main_~y~0)) (.cse87 (<= 23 ULTIMATE.start_main_~y~0)) (.cse86 (<= ULTIMATE.start_main_~y~0 23)) (.cse16 (<= 7 ULTIMATE.start_main_~y~0)) (.cse17 (<= ULTIMATE.start_main_~y~0 7)) (.cse81 (<= ULTIMATE.start_main_~y~0 8)) (.cse80 (<= 8 ULTIMATE.start_main_~y~0)) (.cse32 (<= ULTIMATE.start_main_~y~0 13)) (.cse33 (<= 13 ULTIMATE.start_main_~y~0)) (.cse6 (<= 47 ULTIMATE.start_main_~y~0)) (.cse7 (<= ULTIMATE.start_main_~y~0 47)) (.cse90 (<= 29 ULTIMATE.start_main_~y~0)) (.cse91 (<= ULTIMATE.start_main_~y~0 29)) (.cse60 (<= 6 ULTIMATE.start_main_~y~0)) (.cse61 (<= ULTIMATE.start_main_~y~0 6)) (.cse40 (<= 33 ULTIMATE.start_main_~y~0)) (.cse41 (<= ULTIMATE.start_main_~y~0 33)) (.cse29 (<= 35 ULTIMATE.start_main_~y~0)) (.cse28 (<= ULTIMATE.start_main_~y~0 35)) (.cse65 (<= 43 ULTIMATE.start_main_~y~0)) (.cse64 (<= ULTIMATE.start_main_~y~0 43)) (.cse46 (<= 26 ULTIMATE.start_main_~y~0)) (.cse47 (<= ULTIMATE.start_main_~y~0 26)) (.cse2 (<= 12 ULTIMATE.start_main_~y~0)) (.cse3 (<= ULTIMATE.start_main_~y~0 12)) (.cse85 (<= ULTIMATE.start_main_~y~0 19)) (.cse84 (<= 19 ULTIMATE.start_main_~y~0)) (.cse96 (<= 36 ULTIMATE.start_main_~y~0)) (.cse97 (<= ULTIMATE.start_main_~y~0 36)) (.cse11 (<= ULTIMATE.start_main_~y~0 16)) (.cse10 (<= 16 ULTIMATE.start_main_~y~0)) (.cse1 (<= 41 ULTIMATE.start_main_~y~0)) (.cse0 (<= ULTIMATE.start_main_~y~0 41)) (.cse78 (<= ULTIMATE.start_main_~y~0 40)) (.cse79 (<= 40 ULTIMATE.start_main_~y~0)) (.cse37 (<= ULTIMATE.start_main_~y~0 24)) (.cse36 (<= 24 ULTIMATE.start_main_~y~0)) (.cse92 (<= ULTIMATE.start_main_~y~0 27)) (.cse93 (<= 27 ULTIMATE.start_main_~y~0)) (.cse70 (<= ULTIMATE.start_main_~y~0 9)) (.cse71 (<= 9 ULTIMATE.start_main_~y~0)) (.cse94 (<= 44 ULTIMATE.start_main_~y~0)) (.cse95 (<= ULTIMATE.start_main_~y~0 44)) (.cse26 (<= 10 ULTIMATE.start_main_~y~0)) (.cse27 (<= ULTIMATE.start_main_~y~0 10)) (.cse83 (<= ULTIMATE.start_main_~y~0 20)) (.cse82 (<= 20 ULTIMATE.start_main_~y~0)) (.cse69 (<= 37 ULTIMATE.start_main_~y~0)) (.cse68 (<= ULTIMATE.start_main_~y~0 37)) (.cse88 (<= 15 ULTIMATE.start_main_~y~0)) (.cse89 (<= ULTIMATE.start_main_~y~0 15)) (.cse76 (<= 2 ULTIMATE.start_main_~y~0)) (.cse77 (<= ULTIMATE.start_main_~y~0 2)) (.cse62 (<= ULTIMATE.start_main_~y~0 0)) (.cse63 (<= 0 ULTIMATE.start_main_~y~0)) (.cse99 (<= 18 ULTIMATE.start_main_~y~0)) (.cse98 (<= ULTIMATE.start_main_~y~0 18)) (.cse55 (<= 39 ULTIMATE.start_main_~y~0)) (.cse54 (<= ULTIMATE.start_main_~y~0 39)) (.cse52 (<= 49 ULTIMATE.start_main_~y~0)) (.cse53 (<= ULTIMATE.start_main_~y~0 49)) (.cse56 (<= ULTIMATE.start_main_~y~0 21)) (.cse57 (<= 21 ULTIMATE.start_main_~y~0)) (.cse75 (<= 28 ULTIMATE.start_main_~y~0)) (.cse74 (<= ULTIMATE.start_main_~y~0 28))) (or (and (<= 59 ULTIMATE.start_main_~x~0) .cse0 (<= ULTIMATE.start_main_~x~0 59) .cse1) (and (<= ULTIMATE.start_main_~x~0 88) .cse2 .cse3 (<= 88 ULTIMATE.start_main_~x~0)) (and (<= ULTIMATE.start_main_~x~0 58) (<= 58 ULTIMATE.start_main_~x~0) .cse4 .cse5) (and (<= ULTIMATE.start_main_~x~0 47) (<= 47 ULTIMATE.start_main_~x~0) .cse6 .cse7) (and .cse8 (<= 5 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 5) .cse9) (and (<= ULTIMATE.start_main_~x~0 16) .cse10 .cse11 (<= 16 ULTIMATE.start_main_~x~0)) (and .cse12 .cse13 (<= 75 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 75)) (and .cse14 (<= ULTIMATE.start_main_~x~0 46) .cse15 (<= 46 ULTIMATE.start_main_~x~0)) (and (<= 7 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 7) .cse16 .cse17) (and (<= ULTIMATE.start_main_~x~0 48) (<= 48 ULTIMATE.start_main_~x~0) .cse18 .cse19) (and .cse20 (<= ULTIMATE.start_main_~x~0 11) (<= 11 ULTIMATE.start_main_~x~0) .cse21) (and .cse22 .cse23 (<= ULTIMATE.start_main_~x~0 78) (<= 78 ULTIMATE.start_main_~x~0)) (and (<= ULTIMATE.start_main_~x~0 3) .cse24 (<= 3 ULTIMATE.start_main_~x~0) .cse25) (and (<= ULTIMATE.start_main_~x~0 90) (<= 90 ULTIMATE.start_main_~x~0) .cse26 .cse27) (and (<= ULTIMATE.start_main_~x~0 35) .cse28 .cse29 (<= 35 ULTIMATE.start_main_~x~0)) (and (<= ULTIMATE.start_main_~x~0 34) .cse30 .cse31 (<= 34 ULTIMATE.start_main_~x~0)) (and (<= ULTIMATE.start_main_~x~0 42) (<= 42 ULTIMATE.start_main_~x~0) .cse5 .cse4) (and .cse32 (<= ULTIMATE.start_main_~x~0 87) .cse33 (<= 87 ULTIMATE.start_main_~x~0)) (and (<= 62 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 62) .cse34 .cse35) (and (<= 24 ULTIMATE.start_main_~x~0) .cse36 .cse37 (<= ULTIMATE.start_main_~x~0 24)) (and .cse8 .cse9 (<= ULTIMATE.start_main_~x~0 95) (<= 95 ULTIMATE.start_main_~x~0)) (and (<= ULTIMATE.start_main_~x~0 83) .cse38 (<= 83 ULTIMATE.start_main_~x~0) .cse39) (and .cse20 (<= 89 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 89) .cse21) (and (<= ULTIMATE.start_main_~x~0 67) (<= 67 ULTIMATE.start_main_~x~0) .cse40 .cse41) (and .cse42 (<= ULTIMATE.start_main_~x~0 30) (<= 30 ULTIMATE.start_main_~x~0) .cse43) (and (<= ULTIMATE.start_main_~x~0 25) (<= 25 ULTIMATE.start_main_~x~0) .cse13 .cse12) (and .cse44 (<= 86 ULTIMATE.start_main_~x~0) .cse45 (<= ULTIMATE.start_main_~x~0 86)) (and .cse46 (<= 26 ULTIMATE.start_main_~x~0) .cse47 (<= ULTIMATE.start_main_~x~0 26)) (and .cse48 (<= 1 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 1) .cse49) (and (<= 32 ULTIMATE.start_main_~x~0) .cse50 .cse51 (<= ULTIMATE.start_main_~x~0 32)) (and (<= ULTIMATE.start_main_~x~0 49) (<= 49 ULTIMATE.start_main_~x~0) .cse52 .cse53) (and (<= ULTIMATE.start_main_~x~0 61) .cse54 .cse55 (<= 61 ULTIMATE.start_main_~x~0)) (and .cse56 (<= ULTIMATE.start_main_~x~0 79) (<= 79 ULTIMATE.start_main_~x~0) .cse57) (and (<= 55 ULTIMATE.start_main_~x~0) .cse58 .cse59 (<= ULTIMATE.start_main_~x~0 55)) (and (<= 6 ULTIMATE.start_main_~x~0) .cse60 (<= ULTIMATE.start_main_~x~0 6) .cse61) (and .cse22 (<= 22 ULTIMATE.start_main_~x~0) .cse23 (<= ULTIMATE.start_main_~x~0 22)) (and .cse48 .cse49 (<= 99 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 99)) (and .cse51 (<= ULTIMATE.start_main_~x~0 68) .cse50 (<= 68 ULTIMATE.start_main_~x~0)) (and .cse62 (<= ULTIMATE.start_main_~x~0 0) (<= 0 ULTIMATE.start_main_~x~0) .cse63) (and (<= ULTIMATE.start_main_~x~0 38) .cse34 (<= 38 ULTIMATE.start_main_~x~0) .cse35) (and (<= 66 ULTIMATE.start_main_~x~0) .cse31 .cse30 (<= ULTIMATE.start_main_~x~0 66)) (and (<= 43 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 43) .cse64 .cse65) (and .cse14 .cse15 (<= 54 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 54)) (and .cse66 .cse67 (<= ULTIMATE.start_main_~x~0 96) (<= 96 ULTIMATE.start_main_~x~0)) (and .cse19 (<= 52 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 52) .cse18) (and (<= 97 ULTIMATE.start_main_~x~0) .cse25 (<= ULTIMATE.start_main_~x~0 97) .cse24) (and .cse68 (<= 63 ULTIMATE.start_main_~x~0) .cse69 (<= ULTIMATE.start_main_~x~0 63)) (and .cse38 (<= 17 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 17) .cse39) (and .cse70 .cse71 (<= ULTIMATE.start_main_~x~0 9) (<= 9 ULTIMATE.start_main_~x~0)) (and .cse72 .cse73 (<= 69 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 69)) (and .cse45 (<= 14 ULTIMATE.start_main_~x~0) .cse44 (<= ULTIMATE.start_main_~x~0 14)) (and .cse74 .cse75 (<= 72 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 72)) (and .cse67 (<= ULTIMATE.start_main_~x~0 4) .cse66 (<= 4 ULTIMATE.start_main_~x~0)) (and .cse76 .cse77 (<= ULTIMATE.start_main_~x~0 2) (<= 2 ULTIMATE.start_main_~x~0)) (and (<= ULTIMATE.start_main_~x~0 50) (<= 50 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~y~0 50) (<= 50 ULTIMATE.start_main_~y~0)) (and .cse78 (<= ULTIMATE.start_main_~x~0 60) (<= 60 ULTIMATE.start_main_~x~0) .cse79) (and (<= ULTIMATE.start_main_~x~0 8) .cse80 .cse81 (<= 8 ULTIMATE.start_main_~x~0)) (and (<= ULTIMATE.start_main_~x~0 20) .cse82 .cse83 (<= 20 ULTIMATE.start_main_~x~0)) (and .cse84 (<= ULTIMATE.start_main_~x~0 81) (<= 81 ULTIMATE.start_main_~x~0) .cse85) (and (<= ULTIMATE.start_main_~x~0 70) .cse42 .cse43 (<= 70 ULTIMATE.start_main_~x~0)) (and (<= ULTIMATE.start_main_~x~0 77) (<= 77 ULTIMATE.start_main_~x~0) .cse86 .cse87) (and (<= ULTIMATE.start_main_~x~0 15) .cse88 (<= 15 ULTIMATE.start_main_~x~0) .cse89) (and .cse58 (<= 45 ULTIMATE.start_main_~x~0) .cse59 (<= ULTIMATE.start_main_~x~0 45)) (and (<= 31 ULTIMATE.start_main_~x~0) .cse73 (<= ULTIMATE.start_main_~x~0 31) .cse72) (and .cse87 (<= 23 ULTIMATE.start_main_~x~0) .cse86 (<= ULTIMATE.start_main_~x~0 23)) (and (<= 29 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 29) .cse90 .cse91) (and .cse92 (<= ULTIMATE.start_main_~x~0 27) (<= 27 ULTIMATE.start_main_~x~0) .cse93) (and (<= 93 ULTIMATE.start_main_~x~0) .cse16 (<= ULTIMATE.start_main_~x~0 93) .cse17) (and (<= ULTIMATE.start_main_~x~0 92) (<= 92 ULTIMATE.start_main_~x~0) .cse81 .cse80) (and .cse32 .cse33 (<= ULTIMATE.start_main_~x~0 13) (<= 13 ULTIMATE.start_main_~x~0)) (and .cse6 (<= ULTIMATE.start_main_~x~0 53) (<= 53 ULTIMATE.start_main_~x~0) .cse7) (and .cse90 (<= 71 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 71) .cse91) (and (<= ULTIMATE.start_main_~x~0 94) .cse60 (<= 94 ULTIMATE.start_main_~x~0) .cse61) (and (<= 33 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 33) .cse40 .cse41) (and .cse29 .cse28 (<= ULTIMATE.start_main_~x~0 65) (<= 65 ULTIMATE.start_main_~x~0)) (and (<= ULTIMATE.start_main_~x~0 57) (<= 57 ULTIMATE.start_main_~x~0) .cse65 .cse64) (and .cse94 .cse95 (<= 44 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 44)) (and .cse46 (<= ULTIMATE.start_main_~x~0 74) .cse47 (<= 74 ULTIMATE.start_main_~x~0)) (and (<= ULTIMATE.start_main_~x~0 12) .cse2 (<= 12 ULTIMATE.start_main_~x~0) .cse3) (and (<= 19 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 19) .cse85 .cse84) (and (<= ULTIMATE.start_main_~x~0 36) (<= 36 ULTIMATE.start_main_~x~0) .cse96 .cse97) (and .cse96 (<= ULTIMATE.start_main_~x~0 64) (<= 64 ULTIMATE.start_main_~x~0) .cse97) (and (<= 84 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 84) .cse11 .cse10) (and (<= ULTIMATE.start_main_~x~0 41) .cse1 .cse0 (<= 41 ULTIMATE.start_main_~x~0)) (and .cse78 (<= 40 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 40) .cse79) (and (<= ULTIMATE.start_main_~x~0 76) (<= 76 ULTIMATE.start_main_~x~0) .cse37 .cse36) (and .cse98 (<= 82 ULTIMATE.start_main_~x~0) .cse99 (<= ULTIMATE.start_main_~x~0 82)) (and (<= 73 ULTIMATE.start_main_~x~0) .cse92 (<= ULTIMATE.start_main_~x~0 73) .cse93) (and .cse70 (<= 91 ULTIMATE.start_main_~x~0) .cse71 (<= ULTIMATE.start_main_~x~0 91)) (and (<= 56 ULTIMATE.start_main_~x~0) .cse94 (<= ULTIMATE.start_main_~x~0 56) .cse95) (and .cse26 (<= 10 ULTIMATE.start_main_~x~0) .cse27 (<= ULTIMATE.start_main_~x~0 10)) (and .cse83 (<= ULTIMATE.start_main_~x~0 80) .cse82 (<= 80 ULTIMATE.start_main_~x~0)) (and (<= 37 ULTIMATE.start_main_~x~0) .cse69 (<= ULTIMATE.start_main_~x~0 37) .cse68) (and (<= ULTIMATE.start_main_~x~0 85) (<= 85 ULTIMATE.start_main_~x~0) .cse88 .cse89) (and .cse76 .cse77 (<= 98 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 98)) (and .cse62 (<= 100 ULTIMATE.start_main_~x~0) .cse63 (<= ULTIMATE.start_main_~x~0 100)) (and .cse99 (<= 18 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 18) .cse98) (and .cse55 (<= ULTIMATE.start_main_~x~0 39) (<= 39 ULTIMATE.start_main_~x~0) .cse54) (and (<= ULTIMATE.start_main_~x~0 51) .cse52 (<= 51 ULTIMATE.start_main_~x~0) .cse53) (and .cse56 (<= 21 ULTIMATE.start_main_~x~0) .cse57 (<= ULTIMATE.start_main_~x~0 21)) (and (<= 28 ULTIMATE.start_main_~x~0) .cse75 .cse74 (<= ULTIMATE.start_main_~x~0 28)))) [2019-01-12 11:26:07,746 INFO L448 ceAbstractionStarter]: For program point L14-3(lines 14 22) no Hoare annotation was computed. [2019-01-12 11:26:07,746 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-01-12 11:26:07,746 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-01-12 11:26:07,746 INFO L451 ceAbstractionStarter]: At program point L4-2(lines 3 8) the Hoare annotation is: true [2019-01-12 11:26:07,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 11:26:07 BoogieIcfgContainer [2019-01-12 11:26:07,808 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 11:26:07,808 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 11:26:07,809 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 11:26:07,809 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 11:26:07,809 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:24:41" (3/4) ... [2019-01-12 11:26:07,816 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 11:26:07,828 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 11:26:07,828 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 11:26:07,872 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 11:26:07,872 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 11:26:07,873 INFO L168 Benchmark]: Toolchain (without parser) took 86844.15 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 902.3 MB). Free memory was 946.0 MB in the beginning and 1.6 GB in the end (delta: -648.7 MB). Peak memory consumption was 253.6 MB. Max. memory is 11.5 GB. [2019-01-12 11:26:07,875 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 11:26:07,876 INFO L168 Benchmark]: CACSL2BoogieTranslator took 283.22 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-12 11:26:07,876 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.74 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 11:26:07,877 INFO L168 Benchmark]: Boogie Preprocessor took 17.53 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 11:26:07,880 INFO L168 Benchmark]: RCFGBuilder took 294.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -185.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-01-12 11:26:07,880 INFO L168 Benchmark]: TraceAbstraction took 86146.12 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 759.7 MB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -474.1 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-01-12 11:26:07,881 INFO L168 Benchmark]: Witness Printer took 64.12 ms. Allocated memory is still 1.9 GB. Free memory is still 1.6 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 11:26:07,887 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 283.22 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.2 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 33.74 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.53 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 294.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -185.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 86146.12 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 759.7 MB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -474.1 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 64.12 ms. Allocated memory is still 1.9 GB. Free memory is still 1.6 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((59 <= x && y <= 41) && x <= 59) && 41 <= y) || (((x <= 88 && 12 <= y) && y <= 12) && 88 <= x)) || (((x <= 58 && 58 <= x) && y <= 42) && 42 <= y)) || (((x <= 47 && 47 <= x) && 47 <= y) && y <= 47)) || (((y <= 5 && 5 <= x) && x <= 5) && 5 <= y)) || (((x <= 16 && 16 <= y) && y <= 16) && 16 <= x)) || (((y <= 25 && 25 <= y) && 75 <= x) && x <= 75)) || (((y <= 46 && x <= 46) && 46 <= y) && 46 <= x)) || (((7 <= x && x <= 7) && 7 <= y) && y <= 7)) || (((x <= 48 && 48 <= x) && y <= 48) && 48 <= y)) || (((y <= 11 && x <= 11) && 11 <= x) && 11 <= y)) || (((y <= 22 && 22 <= y) && x <= 78) && 78 <= x)) || (((x <= 3 && y <= 3) && 3 <= x) && 3 <= y)) || (((x <= 90 && 90 <= x) && 10 <= y) && y <= 10)) || (((x <= 35 && y <= 35) && 35 <= y) && 35 <= x)) || (((x <= 34 && y <= 34) && 34 <= y) && 34 <= x)) || (((x <= 42 && 42 <= x) && 42 <= y) && y <= 42)) || (((y <= 13 && x <= 87) && 13 <= y) && 87 <= x)) || (((62 <= x && x <= 62) && 38 <= y) && y <= 38)) || (((24 <= x && 24 <= y) && y <= 24) && x <= 24)) || (((y <= 5 && 5 <= y) && x <= 95) && 95 <= x)) || (((x <= 83 && 17 <= y) && 83 <= x) && y <= 17)) || (((y <= 11 && 89 <= x) && x <= 89) && 11 <= y)) || (((x <= 67 && 67 <= x) && 33 <= y) && y <= 33)) || (((30 <= y && x <= 30) && 30 <= x) && y <= 30)) || (((x <= 25 && 25 <= x) && 25 <= y) && y <= 25)) || (((14 <= y && 86 <= x) && y <= 14) && x <= 86)) || (((26 <= y && 26 <= x) && y <= 26) && x <= 26)) || (((y <= 1 && 1 <= x) && x <= 1) && 1 <= y)) || (((32 <= x && y <= 32) && 32 <= y) && x <= 32)) || (((x <= 49 && 49 <= x) && 49 <= y) && y <= 49)) || (((x <= 61 && y <= 39) && 39 <= y) && 61 <= x)) || (((y <= 21 && x <= 79) && 79 <= x) && 21 <= y)) || (((55 <= x && 45 <= y) && y <= 45) && x <= 55)) || (((6 <= x && 6 <= y) && x <= 6) && y <= 6)) || (((y <= 22 && 22 <= x) && 22 <= y) && x <= 22)) || (((y <= 1 && 1 <= y) && 99 <= x) && x <= 99)) || (((32 <= y && x <= 68) && y <= 32) && 68 <= x)) || (((y <= 0 && x <= 0) && 0 <= x) && 0 <= y)) || (((x <= 38 && 38 <= y) && 38 <= x) && y <= 38)) || (((66 <= x && 34 <= y) && y <= 34) && x <= 66)) || (((43 <= x && x <= 43) && y <= 43) && 43 <= y)) || (((y <= 46 && 46 <= y) && 54 <= x) && x <= 54)) || (((y <= 4 && 4 <= y) && x <= 96) && 96 <= x)) || (((48 <= y && 52 <= x) && x <= 52) && y <= 48)) || (((97 <= x && 3 <= y) && x <= 97) && y <= 3)) || (((y <= 37 && 63 <= x) && 37 <= y) && x <= 63)) || (((17 <= y && 17 <= x) && x <= 17) && y <= 17)) || (((y <= 9 && 9 <= y) && x <= 9) && 9 <= x)) || (((31 <= y && y <= 31) && 69 <= x) && x <= 69)) || (((y <= 14 && 14 <= x) && 14 <= y) && x <= 14)) || (((y <= 28 && 28 <= y) && 72 <= x) && x <= 72)) || (((4 <= y && x <= 4) && y <= 4) && 4 <= x)) || (((2 <= y && y <= 2) && x <= 2) && 2 <= x)) || (((x <= 50 && 50 <= x) && y <= 50) && 50 <= y)) || (((y <= 40 && x <= 60) && 60 <= x) && 40 <= y)) || (((x <= 8 && 8 <= y) && y <= 8) && 8 <= x)) || (((x <= 20 && 20 <= y) && y <= 20) && 20 <= x)) || (((19 <= y && x <= 81) && 81 <= x) && y <= 19)) || (((x <= 70 && 30 <= y) && y <= 30) && 70 <= x)) || (((x <= 77 && 77 <= x) && y <= 23) && 23 <= y)) || (((x <= 15 && 15 <= y) && 15 <= x) && y <= 15)) || (((45 <= y && 45 <= x) && y <= 45) && x <= 45)) || (((31 <= x && y <= 31) && x <= 31) && 31 <= y)) || (((23 <= y && 23 <= x) && y <= 23) && x <= 23)) || (((29 <= x && x <= 29) && 29 <= y) && y <= 29)) || (((y <= 27 && x <= 27) && 27 <= x) && 27 <= y)) || (((93 <= x && 7 <= y) && x <= 93) && y <= 7)) || (((x <= 92 && 92 <= x) && y <= 8) && 8 <= y)) || (((y <= 13 && 13 <= y) && x <= 13) && 13 <= x)) || (((47 <= y && x <= 53) && 53 <= x) && y <= 47)) || (((29 <= y && 71 <= x) && x <= 71) && y <= 29)) || (((x <= 94 && 6 <= y) && 94 <= x) && y <= 6)) || (((33 <= x && x <= 33) && 33 <= y) && y <= 33)) || (((35 <= y && y <= 35) && x <= 65) && 65 <= x)) || (((x <= 57 && 57 <= x) && 43 <= y) && y <= 43)) || (((44 <= y && y <= 44) && 44 <= x) && x <= 44)) || (((26 <= y && x <= 74) && y <= 26) && 74 <= x)) || (((x <= 12 && 12 <= y) && 12 <= x) && y <= 12)) || (((19 <= x && x <= 19) && y <= 19) && 19 <= y)) || (((x <= 36 && 36 <= x) && 36 <= y) && y <= 36)) || (((36 <= y && x <= 64) && 64 <= x) && y <= 36)) || (((84 <= x && x <= 84) && y <= 16) && 16 <= y)) || (((x <= 41 && 41 <= y) && y <= 41) && 41 <= x)) || (((y <= 40 && 40 <= x) && x <= 40) && 40 <= y)) || (((x <= 76 && 76 <= x) && y <= 24) && 24 <= y)) || (((y <= 18 && 82 <= x) && 18 <= y) && x <= 82)) || (((73 <= x && y <= 27) && x <= 73) && 27 <= y)) || (((y <= 9 && 91 <= x) && 9 <= y) && x <= 91)) || (((56 <= x && 44 <= y) && x <= 56) && y <= 44)) || (((10 <= y && 10 <= x) && y <= 10) && x <= 10)) || (((y <= 20 && x <= 80) && 20 <= y) && 80 <= x)) || (((37 <= x && 37 <= y) && x <= 37) && y <= 37)) || (((x <= 85 && 85 <= x) && 15 <= y) && y <= 15)) || (((2 <= y && y <= 2) && 98 <= x) && x <= 98)) || (((y <= 0 && 100 <= x) && 0 <= y) && x <= 100)) || (((18 <= y && 18 <= x) && x <= 18) && y <= 18)) || (((39 <= y && x <= 39) && 39 <= x) && y <= 39)) || (((x <= 51 && 49 <= y) && 51 <= x) && y <= 49)) || (((y <= 21 && 21 <= x) && 21 <= y) && x <= 21)) || (((28 <= x && 28 <= y) && y <= 28) && x <= 28) - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 12 locations, 1 error locations. SAFE Result, 86.0s OverallTime, 36 OverallIterations, 103 TraceHistogramMax, 27.1s AutomataDifference, 0.0s DeadEndRemovalTime, 16.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 612 SDtfs, 880 SDslu, 13910 SDs, 0 SdLazy, 14531 SolverSat, 1615 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4787 GetRequests, 3641 SyntacticMatches, 1 SemanticMatches, 1145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7380 ImplicationChecksByTransitivity, 31.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4185occurred in iteration=35, 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: 6.1s AutomataMinimizationTime, 36 MinimizatonAttempts, 2701 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 106 NumberOfFragments, 1316 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1431570 FormulaSimplificationTreeSizeReduction, 5.5s HoareSimplificationTime, 3 FomulaSimplificationsInter, 524600 FormulaSimplificationTreeSizeReductionInter, 11.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 30.7s InterpolantComputationTime, 7752 NumberOfCodeBlocks, 7731 NumberOfCodeBlocksAsserted, 598 NumberOfCheckSat, 7684 ConstructedInterpolants, 0 QuantifiedInterpolants, 3818368 SizeOfPredicates, 34 NumberOfNonLiveVariables, 8661 ConjunctsInSsa, 1014 ConjunctsInUnsatCore, 68 InterpolantComputations, 4 PerfectInterpolantSequences, 129592/222381 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...