java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/reducercommutativity/sep_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a-m [2018-01-30 00:57:32,416 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 00:57:32,417 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 00:57:32,430 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 00:57:32,430 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 00:57:32,431 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 00:57:32,431 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 00:57:32,432 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 00:57:32,433 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 00:57:32,433 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 00:57:32,434 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 00:57:32,434 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 00:57:32,434 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 00:57:32,435 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 00:57:32,435 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 00:57:32,437 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 00:57:32,438 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 00:57:32,438 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 00:57:32,439 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 00:57:32,440 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 00:57:32,441 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 00:57:32,441 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 00:57:32,441 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 00:57:32,442 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 00:57:32,442 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 00:57:32,443 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 00:57:32,443 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 00:57:32,443 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 00:57:32,443 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 00:57:32,444 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 00:57:32,444 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 00:57:32,444 INFO L98 SettingsManager]: Beginning loading settings from /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-30 00:57:32,449 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 00:57:32,449 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 00:57:32,449 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 00:57:32,449 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 00:57:32,449 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 00:57:32,450 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 00:57:32,450 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 00:57:32,450 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 00:57:32,450 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 00:57:32,450 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 00:57:32,450 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 00:57:32,450 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 00:57:32,451 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-30 00:57:32,451 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 00:57:32,451 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-30 00:57:32,451 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 00:57:32,451 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-30 00:57:32,451 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-30 00:57:32,451 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 00:57:32,451 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 00:57:32,451 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 00:57:32,451 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 00:57:32,451 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 00:57:32,452 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 00:57:32,452 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 00:57:32,452 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 00:57:32,452 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 00:57:32,452 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 00:57:32,452 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 00:57:32,452 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 00:57:32,452 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 00:57:32,452 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 00:57:32,453 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 00:57:32,453 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 00:57:32,471 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 00:57:32,477 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 00:57:32,479 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 00:57:32,479 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 00:57:32,480 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 00:57:32,480 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/sep_true-unreach-call_true-termination.i [2018-01-30 00:57:32,543 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 00:57:32,543 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-30 00:57:32,544 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 00:57:32,544 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 00:57:32,548 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 00:57:32,548 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:57:32" (1/1) ... [2018-01-30 00:57:32,550 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47a007bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:57:32, skipping insertion in model container [2018-01-30 00:57:32,550 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:57:32" (1/1) ... [2018-01-30 00:57:32,559 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:57:32,568 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:57:32,662 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:57:32,678 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:57:32,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:57:32 WrapperNode [2018-01-30 00:57:32,682 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 00:57:32,684 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 00:57:32,684 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 00:57:32,684 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 00:57:32,692 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:57:32" (1/1) ... [2018-01-30 00:57:32,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:57:32" (1/1) ... [2018-01-30 00:57:32,698 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:57:32" (1/1) ... [2018-01-30 00:57:32,698 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:57:32" (1/1) ... [2018-01-30 00:57:32,700 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:57:32" (1/1) ... [2018-01-30 00:57:32,702 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:57:32" (1/1) ... [2018-01-30 00:57:32,703 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:57:32" (1/1) ... [2018-01-30 00:57:32,704 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 00:57:32,704 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 00:57:32,704 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 00:57:32,704 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 00:57:32,705 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:57:32" (1/1) ... No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 00:57:32,757 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 00:57:32,757 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 00:57:32,757 INFO L136 BoogieDeclarations]: Found implementation of procedure sep [2018-01-30 00:57:32,757 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 00:57:32,758 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-30 00:57:32,758 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-30 00:57:32,758 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-30 00:57:32,758 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-30 00:57:32,758 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-30 00:57:32,758 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-30 00:57:32,758 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 00:57:32,758 INFO L128 BoogieDeclarations]: Found specification of procedure sep [2018-01-30 00:57:32,758 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 00:57:32,758 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 00:57:32,758 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 00:57:33,171 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 00:57:33,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:57:33 BoogieIcfgContainer [2018-01-30 00:57:33,172 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 00:57:33,172 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 00:57:33,172 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 00:57:33,174 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 00:57:33,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 12:57:32" (1/3) ... [2018-01-30 00:57:33,175 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32b287d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:57:33, skipping insertion in model container [2018-01-30 00:57:33,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:57:32" (2/3) ... [2018-01-30 00:57:33,175 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32b287d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:57:33, skipping insertion in model container [2018-01-30 00:57:33,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:57:33" (3/3) ... [2018-01-30 00:57:33,176 INFO L107 eAbstractionObserver]: Analyzing ICFG sep_true-unreach-call_true-termination.i [2018-01-30 00:57:33,181 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 00:57:33,187 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-01-30 00:57:33,211 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 00:57:33,211 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 00:57:33,211 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 00:57:33,211 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 00:57:33,211 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 00:57:33,211 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 00:57:33,211 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 00:57:33,212 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 00:57:33,212 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 00:57:33,221 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states. [2018-01-30 00:57:33,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-01-30 00:57:33,226 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:57:33,226 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:57:33,227 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0AssertViolation]=== [2018-01-30 00:57:33,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1370314010, now seen corresponding path program 1 times [2018-01-30 00:57:33,230 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:57:33,230 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:57:33,258 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:57:33,258 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:57:33,259 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:57:33,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:57:33,290 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:57:33,338 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-30 00:57:33,340 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:57:33,340 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:57:33,347 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:57:33,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:57:33,394 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:57:33,404 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-01-30 00:57:33,422 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 00:57:33,422 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2018-01-30 00:57:33,424 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-30 00:57:33,431 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-30 00:57:33,431 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-30 00:57:33,432 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 2 states. [2018-01-30 00:57:33,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:57:33,448 INFO L93 Difference]: Finished difference Result 141 states and 158 transitions. [2018-01-30 00:57:33,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-30 00:57:33,449 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 64 [2018-01-30 00:57:33,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:57:33,454 INFO L225 Difference]: With dead ends: 141 [2018-01-30 00:57:33,454 INFO L226 Difference]: Without dead ends: 72 [2018-01-30 00:57:33,457 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-30 00:57:33,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-01-30 00:57:33,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-01-30 00:57:33,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-30 00:57:33,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2018-01-30 00:57:33,546 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 64 [2018-01-30 00:57:33,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:57:33,546 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2018-01-30 00:57:33,546 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-30 00:57:33,546 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-01-30 00:57:33,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-30 00:57:33,548 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:57:33,548 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:57:33,548 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0AssertViolation]=== [2018-01-30 00:57:33,548 INFO L82 PathProgramCache]: Analyzing trace with hash -964116597, now seen corresponding path program 1 times [2018-01-30 00:57:33,549 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:57:33,549 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:57:33,549 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:57:33,549 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:57:33,549 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:57:33,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:57:33,572 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:57:33,699 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-01-30 00:57:33,699 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:57:33,699 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:57:33,712 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:57:33,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:57:33,748 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:57:33,829 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-01-30 00:57:33,846 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 00:57:33,846 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2018-01-30 00:57:33,847 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:57:33,847 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:57:33,847 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:57:33,848 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 6 states. [2018-01-30 00:57:34,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:57:34,093 INFO L93 Difference]: Finished difference Result 141 states and 153 transitions. [2018-01-30 00:57:34,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 00:57:34,093 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-01-30 00:57:34,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:57:34,094 INFO L225 Difference]: With dead ends: 141 [2018-01-30 00:57:34,094 INFO L226 Difference]: Without dead ends: 86 [2018-01-30 00:57:34,095 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:57:34,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-30 00:57:34,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 74. [2018-01-30 00:57:34,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-30 00:57:34,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2018-01-30 00:57:34,100 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 68 [2018-01-30 00:57:34,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:57:34,100 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2018-01-30 00:57:34,100 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:57:34,101 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2018-01-30 00:57:34,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-01-30 00:57:34,102 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:57:34,102 INFO L350 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:57:34,102 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0AssertViolation]=== [2018-01-30 00:57:34,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1313868403, now seen corresponding path program 1 times [2018-01-30 00:57:34,102 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:57:34,103 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:57:34,103 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:57:34,103 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:57:34,103 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:57:34,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:57:34,137 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:57:34,290 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-01-30 00:57:34,290 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:57:34,290 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:57:34,295 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:57:34,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:57:34,360 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:57:34,512 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 40 proven. 2 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-01-30 00:57:34,529 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:57:34,529 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2018-01-30 00:57:34,529 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-30 00:57:34,529 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-30 00:57:34,529 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-01-30 00:57:34,530 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 10 states. [2018-01-30 00:57:34,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:57:34,953 INFO L93 Difference]: Finished difference Result 158 states and 171 transitions. [2018-01-30 00:57:34,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 00:57:34,953 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 101 [2018-01-30 00:57:34,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:57:34,954 INFO L225 Difference]: With dead ends: 158 [2018-01-30 00:57:34,954 INFO L226 Difference]: Without dead ends: 101 [2018-01-30 00:57:34,954 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 98 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-01-30 00:57:34,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-01-30 00:57:34,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 89. [2018-01-30 00:57:34,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-30 00:57:34,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2018-01-30 00:57:34,959 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 101 [2018-01-30 00:57:34,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:57:34,959 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2018-01-30 00:57:34,959 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-30 00:57:34,959 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2018-01-30 00:57:34,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-01-30 00:57:34,961 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:57:34,962 INFO L350 BasicCegarLoop]: trace histogram [9, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:57:34,962 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0AssertViolation]=== [2018-01-30 00:57:34,962 INFO L82 PathProgramCache]: Analyzing trace with hash -420395509, now seen corresponding path program 2 times [2018-01-30 00:57:34,962 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:57:34,962 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:57:34,962 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:57:34,963 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:57:34,963 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:57:34,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:57:34,982 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:57:35,063 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-01-30 00:57:35,063 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:57:35,063 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:57:35,063 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 00:57:35,063 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 00:57:35,064 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:57:35,064 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand 4 states. [2018-01-30 00:57:35,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:57:35,121 INFO L93 Difference]: Finished difference Result 142 states and 150 transitions. [2018-01-30 00:57:35,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 00:57:35,121 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2018-01-30 00:57:35,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:57:35,122 INFO L225 Difference]: With dead ends: 142 [2018-01-30 00:57:35,122 INFO L226 Difference]: Without dead ends: 96 [2018-01-30 00:57:35,123 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:57:35,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-01-30 00:57:35,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2018-01-30 00:57:35,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-01-30 00:57:35,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2018-01-30 00:57:35,128 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 134 [2018-01-30 00:57:35,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:57:35,130 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2018-01-30 00:57:35,130 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 00:57:35,130 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2018-01-30 00:57:35,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-01-30 00:57:35,132 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:57:35,132 INFO L350 BasicCegarLoop]: trace histogram [9, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:57:35,132 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0AssertViolation]=== [2018-01-30 00:57:35,132 INFO L82 PathProgramCache]: Analyzing trace with hash -510616702, now seen corresponding path program 1 times [2018-01-30 00:57:35,132 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:57:35,132 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:57:35,133 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:57:35,133 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:57:35,133 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:57:35,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:57:35,174 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:57:35,879 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-01-30 00:57:35,879 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:57:35,879 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:57:35,886 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:57:35,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:57:35,926 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:57:36,277 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-01-30 00:57:36,294 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:57:36,294 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 16 [2018-01-30 00:57:36,295 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-30 00:57:36,295 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-30 00:57:36,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-01-30 00:57:36,295 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand 16 states. [2018-01-30 00:57:36,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:57:36,569 INFO L93 Difference]: Finished difference Result 188 states and 203 transitions. [2018-01-30 00:57:36,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-30 00:57:36,569 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 142 [2018-01-30 00:57:36,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:57:36,571 INFO L225 Difference]: With dead ends: 188 [2018-01-30 00:57:36,572 INFO L226 Difference]: Without dead ends: 182 [2018-01-30 00:57:36,572 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 136 SyntacticMatches, 17 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2018-01-30 00:57:36,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-01-30 00:57:36,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 140. [2018-01-30 00:57:36,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-01-30 00:57:36,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 153 transitions. [2018-01-30 00:57:36,585 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 153 transitions. Word has length 142 [2018-01-30 00:57:36,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:57:36,585 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 153 transitions. [2018-01-30 00:57:36,585 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-30 00:57:36,585 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 153 transitions. [2018-01-30 00:57:36,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-01-30 00:57:36,587 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:57:36,587 INFO L350 BasicCegarLoop]: trace histogram [9, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:57:36,587 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0AssertViolation]=== [2018-01-30 00:57:36,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1301827512, now seen corresponding path program 1 times [2018-01-30 00:57:36,588 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:57:36,588 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:57:36,588 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:57:36,588 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:57:36,588 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:57:36,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:57:36,628 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:57:37,372 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 63 proven. 108 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-01-30 00:57:37,373 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:57:37,373 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:57:37,382 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:57:37,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:57:37,414 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:57:37,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-30 00:57:37,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 00:57:37,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:57:37,591 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:57:37,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:57:37,597 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:10 [2018-01-30 00:57:37,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-01-30 00:57:37,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2018-01-30 00:57:37,759 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:57:37,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:57:37,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:57:37,764 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:22 [2018-01-30 00:57:37,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-30 00:57:37,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-30 00:57:37,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:57:37,862 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:57:37,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 00:57:37,956 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:40 [2018-01-30 00:57:38,519 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 14 proven. 182 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-01-30 00:57:38,552 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:57:38,553 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 26] total 39 [2018-01-30 00:57:38,553 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-01-30 00:57:38,553 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-01-30 00:57:38,554 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1314, Unknown=0, NotChecked=0, Total=1482 [2018-01-30 00:57:38,554 INFO L87 Difference]: Start difference. First operand 140 states and 153 transitions. Second operand 39 states. [2018-01-30 00:57:44,485 WARN L146 SmtUtils]: Spent 271ms on a formula simplification. DAG size of input: 56 DAG size of output 36 [2018-01-30 00:57:45,304 WARN L146 SmtUtils]: Spent 150ms on a formula simplification. DAG size of input: 62 DAG size of output 46 [2018-01-30 00:57:45,815 WARN L146 SmtUtils]: Spent 369ms on a formula simplification. DAG size of input: 69 DAG size of output 40 [2018-01-30 00:57:46,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:57:46,092 INFO L93 Difference]: Finished difference Result 697 states and 769 transitions. [2018-01-30 00:57:46,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-01-30 00:57:46,092 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 142 [2018-01-30 00:57:46,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:57:46,095 INFO L225 Difference]: With dead ends: 697 [2018-01-30 00:57:46,095 INFO L226 Difference]: Without dead ends: 561 [2018-01-30 00:57:46,101 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 144 SyntacticMatches, 10 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9121 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=3560, Invalid=22522, Unknown=0, NotChecked=0, Total=26082 [2018-01-30 00:57:46,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-01-30 00:57:46,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 409. [2018-01-30 00:57:46,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-01-30 00:57:46,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 452 transitions. [2018-01-30 00:57:46,118 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 452 transitions. Word has length 142 [2018-01-30 00:57:46,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:57:46,119 INFO L432 AbstractCegarLoop]: Abstraction has 409 states and 452 transitions. [2018-01-30 00:57:46,119 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-01-30 00:57:46,119 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 452 transitions. [2018-01-30 00:57:46,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-01-30 00:57:46,120 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:57:46,121 INFO L350 BasicCegarLoop]: trace histogram [9, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:57:46,121 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0AssertViolation]=== [2018-01-30 00:57:46,121 INFO L82 PathProgramCache]: Analyzing trace with hash -928321796, now seen corresponding path program 2 times [2018-01-30 00:57:46,121 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:57:46,121 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:57:46,121 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:57:46,122 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:57:46,122 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:57:46,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:57:46,167 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:57:49,131 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 49 proven. 129 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-01-30 00:57:49,131 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:57:49,131 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:57:49,136 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 00:57:49,145 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:57:49,161 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:57:49,164 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:57:49,167 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:57:49,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-01-30 00:57:49,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2018-01-30 00:57:49,282 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:57:49,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:57:49,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:57:49,286 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:13 [2018-01-30 00:57:49,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-30 00:57:49,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 00:57:49,344 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:57:49,345 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:57:49,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:57:49,349 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-01-30 00:57:49,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-01-30 00:57:49,500 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:57:49,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 32 [2018-01-30 00:57:49,502 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:57:49,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:57:49,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:57:49,510 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-01-30 00:57:49,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2018-01-30 00:57:49,548 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:57:49,549 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:57:49,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 61 [2018-01-30 00:57:49,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-30 00:57:49,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:57:49,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:57:49,583 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:44 [2018-01-30 00:57:49,945 WARN L146 SmtUtils]: Spent 198ms on a formula simplification. DAG size of input: 24 DAG size of output 19 [2018-01-30 00:57:49,999 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 1 proven. 177 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-01-30 00:57:50,016 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:57:50,017 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 39 [2018-01-30 00:57:50,017 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-01-30 00:57:50,017 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-01-30 00:57:50,017 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1318, Unknown=1, NotChecked=0, Total=1482 [2018-01-30 00:57:50,018 INFO L87 Difference]: Start difference. First operand 409 states and 452 transitions. Second operand 39 states. [2018-01-30 00:57:52,529 WARN L146 SmtUtils]: Spent 373ms on a formula simplification. DAG size of input: 68 DAG size of output 54 [2018-01-30 00:57:54,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:57:54,171 INFO L93 Difference]: Finished difference Result 1539 states and 1684 transitions. [2018-01-30 00:57:54,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-01-30 00:57:54,171 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 142 [2018-01-30 00:57:54,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:57:54,174 INFO L225 Difference]: With dead ends: 1539 [2018-01-30 00:57:54,174 INFO L226 Difference]: Without dead ends: 1111 [2018-01-30 00:57:54,177 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 145 SyntacticMatches, 16 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3688 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=1125, Invalid=9586, Unknown=1, NotChecked=0, Total=10712 [2018-01-30 00:57:54,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states. [2018-01-30 00:57:54,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 832. [2018-01-30 00:57:54,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 832 states. [2018-01-30 00:57:54,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 915 transitions. [2018-01-30 00:57:54,205 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 915 transitions. Word has length 142 [2018-01-30 00:57:54,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:57:54,205 INFO L432 AbstractCegarLoop]: Abstraction has 832 states and 915 transitions. [2018-01-30 00:57:54,205 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-01-30 00:57:54,205 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 915 transitions. [2018-01-30 00:57:54,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-01-30 00:57:54,207 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:57:54,207 INFO L350 BasicCegarLoop]: trace histogram [9, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:57:54,207 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0AssertViolation]=== [2018-01-30 00:57:54,207 INFO L82 PathProgramCache]: Analyzing trace with hash 591164616, now seen corresponding path program 3 times [2018-01-30 00:57:54,207 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:57:54,207 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:57:54,208 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:57:54,208 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:57:54,208 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:57:54,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:57:54,225 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:57:54,613 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 8 DAG size of output 7 [2018-01-30 00:57:55,168 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 42 proven. 142 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-01-30 00:57:55,169 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:57:55,169 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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 [2018-01-30 00:57:55,175 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 00:57:55,186 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:57:55,190 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:57:55,196 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:57:55,202 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:57:55,205 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:57:55,208 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:57:55,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-01-30 00:57:55,460 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:57:55,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 44 [2018-01-30 00:57:55,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-30 00:57:55,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:57:55,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-30 00:57:55,489 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:62 [2018-01-30 00:57:55,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 42 [2018-01-30 00:57:55,665 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:57:55,756 INFO L303 Elim1Store]: Index analysis took 189 ms [2018-01-30 00:57:55,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 31 treesize of output 63 [2018-01-30 00:57:55,814 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-01-30 00:57:55,831 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:57:55,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-01-30 00:57:55,861 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:57:55,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-01-30 00:57:55,863 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:57:55,867 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:57:55,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-01-30 00:57:55,887 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:88, output treesize:65 [2018-01-30 00:57:56,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 68 [2018-01-30 00:57:56,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 60 [2018-01-30 00:57:56,402 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:57:56,434 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:57:56,434 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:57:56,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 53 [2018-01-30 00:57:56,436 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 00:57:56,463 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:57:56,464 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:57:56,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 49 [2018-01-30 00:57:56,465 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:57:56,477 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:57:56,527 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:57:56,528 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:57:56,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 43 [2018-01-30 00:57:56,540 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 21 [2018-01-30 00:57:56,541 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-30 00:57:56,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-01-30 00:57:56,549 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-30 00:57:56,553 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:57:56,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-01-30 00:57:56,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-01-30 00:57:56,574 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-30 00:57:56,576 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:57:56,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 15 dim-0 vars, 6 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:57:56,613 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 21 variables, input treesize:270, output treesize:22 [2018-01-30 00:57:56,948 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 16 proven. 178 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-01-30 00:57:56,965 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:57:56,966 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 27] total 49 [2018-01-30 00:57:56,966 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-01-30 00:57:56,966 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-01-30 00:57:56,966 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=2179, Unknown=0, NotChecked=0, Total=2352 [2018-01-30 00:57:56,967 INFO L87 Difference]: Start difference. First operand 832 states and 915 transitions. Second operand 49 states. [2018-01-30 00:58:00,528 WARN L146 SmtUtils]: Spent 162ms on a formula simplification. DAG size of input: 70 DAG size of output 49 [2018-01-30 00:58:25,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:58:25,948 INFO L93 Difference]: Finished difference Result 4022 states and 4396 transitions. [2018-01-30 00:58:25,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 342 states. [2018-01-30 00:58:25,948 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 142 [2018-01-30 00:58:25,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:58:25,956 INFO L225 Difference]: With dead ends: 4022 [2018-01-30 00:58:25,956 INFO L226 Difference]: Without dead ends: 3414 [2018-01-30 00:58:25,967 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 167 SyntacticMatches, 6 SemanticMatches, 379 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60528 ImplicationChecksByTransitivity, 26.5s TimeCoverageRelationStatistics Valid=12155, Invalid=132625, Unknown=0, NotChecked=0, Total=144780 [2018-01-30 00:58:25,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3414 states. [2018-01-30 00:58:26,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3414 to 1983. [2018-01-30 00:58:26,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1983 states. [2018-01-30 00:58:26,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1983 states to 1983 states and 2157 transitions. [2018-01-30 00:58:26,033 INFO L78 Accepts]: Start accepts. Automaton has 1983 states and 2157 transitions. Word has length 142 [2018-01-30 00:58:26,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:58:26,033 INFO L432 AbstractCegarLoop]: Abstraction has 1983 states and 2157 transitions. [2018-01-30 00:58:26,033 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-01-30 00:58:26,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1983 states and 2157 transitions. [2018-01-30 00:58:26,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-01-30 00:58:26,036 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:58:26,036 INFO L350 BasicCegarLoop]: trace histogram [9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:58:26,036 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0AssertViolation]=== [2018-01-30 00:58:26,036 INFO L82 PathProgramCache]: Analyzing trace with hash -135347884, now seen corresponding path program 4 times [2018-01-30 00:58:26,036 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:58:26,036 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:58:26,037 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:58:26,037 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:58:26,037 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:58:26,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:58:26,048 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:58:26,346 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-01-30 00:58:26,347 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:58:26,347 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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 [2018-01-30 00:58:26,351 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 00:58:26,374 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:58:26,376 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:58:26,747 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-01-30 00:58:26,767 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:58:26,767 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-01-30 00:58:26,767 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-30 00:58:26,767 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-30 00:58:26,768 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-01-30 00:58:26,768 INFO L87 Difference]: Start difference. First operand 1983 states and 2157 transitions. Second operand 17 states. [2018-01-30 00:58:27,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:58:27,040 INFO L93 Difference]: Finished difference Result 3868 states and 4404 transitions. [2018-01-30 00:58:27,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-30 00:58:27,049 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 142 [2018-01-30 00:58:27,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:58:27,058 INFO L225 Difference]: With dead ends: 3868 [2018-01-30 00:58:27,058 INFO L226 Difference]: Without dead ends: 3862 [2018-01-30 00:58:27,060 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 131 SyntacticMatches, 21 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=722, Unknown=0, NotChecked=0, Total=812 [2018-01-30 00:58:27,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3862 states. [2018-01-30 00:58:27,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3862 to 2955. [2018-01-30 00:58:27,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2955 states. [2018-01-30 00:58:27,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2955 states to 2955 states and 3302 transitions. [2018-01-30 00:58:27,179 INFO L78 Accepts]: Start accepts. Automaton has 2955 states and 3302 transitions. Word has length 142 [2018-01-30 00:58:27,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:58:27,179 INFO L432 AbstractCegarLoop]: Abstraction has 2955 states and 3302 transitions. [2018-01-30 00:58:27,179 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-30 00:58:27,179 INFO L276 IsEmpty]: Start isEmpty. Operand 2955 states and 3302 transitions. [2018-01-30 00:58:27,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-01-30 00:58:27,183 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:58:27,183 INFO L350 BasicCegarLoop]: trace histogram [9, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:58:27,183 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0AssertViolation]=== [2018-01-30 00:58:27,183 INFO L82 PathProgramCache]: Analyzing trace with hash 650533500, now seen corresponding path program 5 times [2018-01-30 00:58:27,183 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:58:27,183 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:58:27,184 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:58:27,184 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:58:27,184 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:58:27,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:58:27,203 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:58:27,813 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-01-30 00:58:27,814 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:58:27,814 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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 [2018-01-30 00:58:27,839 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 00:58:27,845 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:58:27,847 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:58:27,852 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:58:27,858 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:58:27,870 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:58:27,875 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:58:27,877 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:58:28,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-01-30 00:58:28,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-01-30 00:58:28,041 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:58:28,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:58:28,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:58:28,046 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:15 [2018-01-30 00:58:28,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-30 00:58:28,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 00:58:28,083 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:58:28,084 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:58:28,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:58:28,089 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-01-30 00:58:28,403 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 118 proven. 72 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-01-30 00:58:28,421 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:58:28,421 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 25] total 41 [2018-01-30 00:58:28,422 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-01-30 00:58:28,422 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-01-30 00:58:28,422 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1491, Unknown=0, NotChecked=0, Total=1640 [2018-01-30 00:58:28,422 INFO L87 Difference]: Start difference. First operand 2955 states and 3302 transitions. Second operand 41 states. [2018-01-30 00:58:31,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:58:31,167 INFO L93 Difference]: Finished difference Result 5723 states and 6345 transitions. [2018-01-30 00:58:31,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-01-30 00:58:31,174 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 142 [2018-01-30 00:58:31,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:58:31,181 INFO L225 Difference]: With dead ends: 5723 [2018-01-30 00:58:31,181 INFO L226 Difference]: Without dead ends: 3606 [2018-01-30 00:58:31,184 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 133 SyntacticMatches, 5 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4299 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1248, Invalid=10962, Unknown=0, NotChecked=0, Total=12210 [2018-01-30 00:58:31,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3606 states. [2018-01-30 00:58:31,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3606 to 2754. [2018-01-30 00:58:31,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2754 states. [2018-01-30 00:58:31,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2754 states to 2754 states and 3048 transitions. [2018-01-30 00:58:31,269 INFO L78 Accepts]: Start accepts. Automaton has 2754 states and 3048 transitions. Word has length 142 [2018-01-30 00:58:31,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:58:31,269 INFO L432 AbstractCegarLoop]: Abstraction has 2754 states and 3048 transitions. [2018-01-30 00:58:31,269 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-01-30 00:58:31,269 INFO L276 IsEmpty]: Start isEmpty. Operand 2754 states and 3048 transitions. [2018-01-30 00:58:31,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-01-30 00:58:31,273 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:58:31,273 INFO L350 BasicCegarLoop]: trace histogram [9, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:58:31,273 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0AssertViolation]=== [2018-01-30 00:58:31,273 INFO L82 PathProgramCache]: Analyzing trace with hash 83903094, now seen corresponding path program 6 times [2018-01-30 00:58:31,273 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:58:31,273 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:58:31,273 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:58:31,274 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:58:31,274 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:58:31,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:58:31,288 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:58:31,994 WARN L146 SmtUtils]: Spent 329ms on a formula simplification. DAG size of input: 20 DAG size of output 12 [2018-01-30 00:58:32,655 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 28 proven. 158 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-01-30 00:58:32,655 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:58:32,655 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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 [2018-01-30 00:58:32,661 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-30 00:58:32,669 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:58:32,672 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:58:32,675 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:58:32,678 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:58:32,684 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:58:32,686 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:58:32,688 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:58:32,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-01-30 00:58:32,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-01-30 00:58:32,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:58:32,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:58:32,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-01-30 00:58:32,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-01-30 00:58:32,825 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:58:32,828 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:58:32,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:58:32,836 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:49, output treesize:27 [2018-01-30 00:58:32,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 22 [2018-01-30 00:58:32,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 00:58:32,885 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:58:32,889 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:58:32,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 24 [2018-01-30 00:58:32,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 00:58:32,902 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:58:32,905 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:58:32,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:58:32,914 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:39 [2018-01-30 00:58:33,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2018-01-30 00:58:33,140 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:58:33,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 31 [2018-01-30 00:58:33,141 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:58:33,145 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:58:33,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2018-01-30 00:58:33,160 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:58:33,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 31 [2018-01-30 00:58:33,161 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:58:33,165 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:58:33,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:58:33,177 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:73, output treesize:65 [2018-01-30 00:58:33,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 38 [2018-01-30 00:58:33,217 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:58:33,217 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:58:33,218 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:58:33,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 63 [2018-01-30 00:58:33,220 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:58:33,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:58:33,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2018-01-30 00:58:33,243 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:58:33,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2018-01-30 00:58:33,245 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:58:33,291 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:58:33,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:58:33,302 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:89, output treesize:42 [2018-01-30 00:58:33,586 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 1 proven. 169 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-01-30 00:58:33,603 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:58:33,603 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 22] total 45 [2018-01-30 00:58:33,603 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-01-30 00:58:33,603 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-01-30 00:58:33,604 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1768, Unknown=0, NotChecked=0, Total=1980 [2018-01-30 00:58:33,604 INFO L87 Difference]: Start difference. First operand 2754 states and 3048 transitions. Second operand 45 states. [2018-01-30 00:58:36,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:58:36,392 INFO L93 Difference]: Finished difference Result 4543 states and 5019 transitions. [2018-01-30 00:58:36,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-01-30 00:58:36,393 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 142 [2018-01-30 00:58:36,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:58:36,404 INFO L225 Difference]: With dead ends: 4543 [2018-01-30 00:58:36,404 INFO L226 Difference]: Without dead ends: 3968 [2018-01-30 00:58:36,407 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 137 SyntacticMatches, 10 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3182 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1002, Invalid=8118, Unknown=0, NotChecked=0, Total=9120 [2018-01-30 00:58:36,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3968 states. [2018-01-30 00:58:36,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3968 to 3351. [2018-01-30 00:58:36,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3351 states. [2018-01-30 00:58:36,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3351 states to 3351 states and 3695 transitions. [2018-01-30 00:58:36,528 INFO L78 Accepts]: Start accepts. Automaton has 3351 states and 3695 transitions. Word has length 142 [2018-01-30 00:58:36,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:58:36,529 INFO L432 AbstractCegarLoop]: Abstraction has 3351 states and 3695 transitions. [2018-01-30 00:58:36,529 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-01-30 00:58:36,531 INFO L276 IsEmpty]: Start isEmpty. Operand 3351 states and 3695 transitions. [2018-01-30 00:58:36,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-01-30 00:58:36,534 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:58:36,534 INFO L350 BasicCegarLoop]: trace histogram [9, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:58:36,534 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0AssertViolation]=== [2018-01-30 00:58:36,534 INFO L82 PathProgramCache]: Analyzing trace with hash 41466818, now seen corresponding path program 1 times [2018-01-30 00:58:36,535 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:58:36,535 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:58:36,535 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:58:36,535 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:58:36,535 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:58:36,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:58:36,557 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:58:37,056 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 4 proven. 135 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-01-30 00:58:37,057 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:58:37,057 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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 [2018-01-30 00:58:37,062 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:58:37,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:58:37,086 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:58:37,203 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-01-30 00:58:37,220 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:58:37,220 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 18 [2018-01-30 00:58:37,221 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-30 00:58:37,221 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-30 00:58:37,221 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-01-30 00:58:37,221 INFO L87 Difference]: Start difference. First operand 3351 states and 3695 transitions. Second operand 18 states. [2018-01-30 00:58:37,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:58:37,444 INFO L93 Difference]: Finished difference Result 3618 states and 3990 transitions. [2018-01-30 00:58:37,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-30 00:58:37,450 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 142 [2018-01-30 00:58:37,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:58:37,457 INFO L225 Difference]: With dead ends: 3618 [2018-01-30 00:58:37,457 INFO L226 Difference]: Without dead ends: 3612 [2018-01-30 00:58:37,458 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 138 SyntacticMatches, 14 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2018-01-30 00:58:37,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3612 states. [2018-01-30 00:58:37,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3612 to 3394. [2018-01-30 00:58:37,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3394 states. [2018-01-30 00:58:37,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3394 states to 3394 states and 3744 transitions. [2018-01-30 00:58:37,556 INFO L78 Accepts]: Start accepts. Automaton has 3394 states and 3744 transitions. Word has length 142 [2018-01-30 00:58:37,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:58:37,556 INFO L432 AbstractCegarLoop]: Abstraction has 3394 states and 3744 transitions. [2018-01-30 00:58:37,556 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-30 00:58:37,556 INFO L276 IsEmpty]: Start isEmpty. Operand 3394 states and 3744 transitions. [2018-01-30 00:58:37,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-01-30 00:58:37,560 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:58:37,560 INFO L350 BasicCegarLoop]: trace histogram [9, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:58:37,560 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0AssertViolation]=== [2018-01-30 00:58:37,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1492442483, now seen corresponding path program 7 times [2018-01-30 00:58:37,560 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:58:37,560 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:58:37,561 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:58:37,561 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:58:37,561 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:58:37,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:58:37,567 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:58:37,764 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 98 proven. 23 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-01-30 00:58:37,764 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:58:37,764 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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 [2018-01-30 00:58:37,769 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:58:37,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:58:37,789 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:58:37,832 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 119 proven. 69 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-01-30 00:58:37,850 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:58:37,850 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 17 [2018-01-30 00:58:37,850 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-30 00:58:37,850 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-30 00:58:37,850 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-01-30 00:58:37,850 INFO L87 Difference]: Start difference. First operand 3394 states and 3744 transitions. Second operand 17 states. [2018-01-30 00:58:38,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:58:38,230 INFO L93 Difference]: Finished difference Result 4139 states and 4542 transitions. [2018-01-30 00:58:38,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-30 00:58:38,230 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 150 [2018-01-30 00:58:38,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:58:38,235 INFO L225 Difference]: With dead ends: 4139 [2018-01-30 00:58:38,235 INFO L226 Difference]: Without dead ends: 3524 [2018-01-30 00:58:38,237 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=255, Invalid=1385, Unknown=0, NotChecked=0, Total=1640 [2018-01-30 00:58:38,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3524 states. [2018-01-30 00:58:38,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3524 to 2777. [2018-01-30 00:58:38,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2777 states. [2018-01-30 00:58:38,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2777 states to 2777 states and 3019 transitions. [2018-01-30 00:58:38,318 INFO L78 Accepts]: Start accepts. Automaton has 2777 states and 3019 transitions. Word has length 150 [2018-01-30 00:58:38,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:58:38,318 INFO L432 AbstractCegarLoop]: Abstraction has 2777 states and 3019 transitions. [2018-01-30 00:58:38,318 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-30 00:58:38,318 INFO L276 IsEmpty]: Start isEmpty. Operand 2777 states and 3019 transitions. [2018-01-30 00:58:38,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-01-30 00:58:38,322 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:58:38,323 INFO L350 BasicCegarLoop]: trace histogram [10, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:58:38,323 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0AssertViolation]=== [2018-01-30 00:58:38,323 INFO L82 PathProgramCache]: Analyzing trace with hash 2101074982, now seen corresponding path program 2 times [2018-01-30 00:58:38,323 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:58:38,323 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:58:38,323 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:58:38,323 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:58:38,323 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:58:38,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:58:38,333 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:58:38,874 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 165 proven. 38 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-01-30 00:58:38,874 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:58:38,874 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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 [2018-01-30 00:58:38,879 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 00:58:38,887 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:58:38,897 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:58:38,899 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:58:38,901 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:58:38,998 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 153 proven. 123 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-01-30 00:58:39,016 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:58:39,016 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2018-01-30 00:58:39,016 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-30 00:58:39,016 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-30 00:58:39,016 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2018-01-30 00:58:39,016 INFO L87 Difference]: Start difference. First operand 2777 states and 3019 transitions. Second operand 22 states. [2018-01-30 00:58:39,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:58:39,438 INFO L93 Difference]: Finished difference Result 3168 states and 3428 transitions. [2018-01-30 00:58:39,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-01-30 00:58:39,438 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 153 [2018-01-30 00:58:39,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:58:39,440 INFO L225 Difference]: With dead ends: 3168 [2018-01-30 00:58:39,441 INFO L226 Difference]: Without dead ends: 1494 [2018-01-30 00:58:39,443 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 150 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 638 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=340, Invalid=2416, Unknown=0, NotChecked=0, Total=2756 [2018-01-30 00:58:39,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2018-01-30 00:58:39,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 791. [2018-01-30 00:58:39,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2018-01-30 00:58:39,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 857 transitions. [2018-01-30 00:58:39,470 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 857 transitions. Word has length 153 [2018-01-30 00:58:39,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:58:39,470 INFO L432 AbstractCegarLoop]: Abstraction has 791 states and 857 transitions. [2018-01-30 00:58:39,470 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-30 00:58:39,470 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 857 transitions. [2018-01-30 00:58:39,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-01-30 00:58:39,472 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:58:39,472 INFO L350 BasicCegarLoop]: trace histogram [12, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:58:39,472 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0AssertViolation]=== [2018-01-30 00:58:39,472 INFO L82 PathProgramCache]: Analyzing trace with hash 387140165, now seen corresponding path program 3 times [2018-01-30 00:58:39,472 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:58:39,472 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:58:39,473 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:58:39,473 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:58:39,473 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:58:39,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:58:39,485 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:58:40,199 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2018-01-30 00:58:40,199 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:58:40,199 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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 [2018-01-30 00:58:40,207 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 00:58:40,217 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:58:40,221 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:58:40,226 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:58:40,233 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:58:40,243 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:58:40,254 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:58:40,266 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:58:40,268 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:58:41,529 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2018-01-30 00:58:41,549 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:58:41,549 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 18 [2018-01-30 00:58:41,549 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-30 00:58:41,549 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-30 00:58:41,549 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-01-30 00:58:41,550 INFO L87 Difference]: Start difference. First operand 791 states and 857 transitions. Second operand 18 states. [2018-01-30 00:58:41,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:58:41,776 INFO L93 Difference]: Finished difference Result 1005 states and 1093 transitions. [2018-01-30 00:58:41,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-30 00:58:41,776 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 183 [2018-01-30 00:58:41,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:58:41,778 INFO L225 Difference]: With dead ends: 1005 [2018-01-30 00:58:41,778 INFO L226 Difference]: Without dead ends: 999 [2018-01-30 00:58:41,778 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 181 SyntacticMatches, 17 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=86, Invalid=670, Unknown=0, NotChecked=0, Total=756 [2018-01-30 00:58:41,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2018-01-30 00:58:41,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 876. [2018-01-30 00:58:41,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 876 states. [2018-01-30 00:58:41,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 956 transitions. [2018-01-30 00:58:41,806 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 956 transitions. Word has length 183 [2018-01-30 00:58:41,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:58:41,806 INFO L432 AbstractCegarLoop]: Abstraction has 876 states and 956 transitions. [2018-01-30 00:58:41,806 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-30 00:58:41,806 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 956 transitions. [2018-01-30 00:58:41,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-01-30 00:58:41,808 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:58:41,808 INFO L350 BasicCegarLoop]: trace histogram [12, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:58:41,808 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0AssertViolation]=== [2018-01-30 00:58:41,808 INFO L82 PathProgramCache]: Analyzing trace with hash -404070645, now seen corresponding path program 8 times [2018-01-30 00:58:41,809 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:58:41,809 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:58:41,809 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:58:41,809 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:58:41,809 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:58:41,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:58:41,831 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:58:42,640 WARN L146 SmtUtils]: Spent 327ms on a formula simplification. DAG size of input: 13 DAG size of output 12 Received shutdown request... [2018-01-30 00:58:43,243 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-30 00:58:43,246 WARN L185 ceAbstractionStarter]: Timeout [2018-01-30 00:58:43,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 12:58:43 BoogieIcfgContainer [2018-01-30 00:58:43,246 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 00:58:43,246 INFO L168 Benchmark]: Toolchain (without parser) took 70703.36 ms. Allocated memory was 149.4 MB in the beginning and 803.7 MB in the end (delta: 654.3 MB). Free memory was 113.2 MB in the beginning and 415.6 MB in the end (delta: -302.5 MB). Peak memory consumption was 351.8 MB. Max. memory is 5.3 GB. [2018-01-30 00:58:43,247 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 149.4 MB. Free memory is still 117.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 00:58:43,247 INFO L168 Benchmark]: CACSL2BoogieTranslator took 139.26 ms. Allocated memory is still 149.4 MB. Free memory was 113.0 MB in the beginning and 104.3 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 5.3 GB. [2018-01-30 00:58:43,247 INFO L168 Benchmark]: Boogie Preprocessor took 20.52 ms. Allocated memory is still 149.4 MB. Free memory was 104.3 MB in the beginning and 102.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 5.3 GB. [2018-01-30 00:58:43,247 INFO L168 Benchmark]: RCFGBuilder took 467.49 ms. Allocated memory is still 149.4 MB. Free memory was 102.6 MB in the beginning and 84.0 MB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 5.3 GB. [2018-01-30 00:58:43,247 INFO L168 Benchmark]: TraceAbstraction took 70073.72 ms. Allocated memory was 149.4 MB in the beginning and 803.7 MB in the end (delta: 654.3 MB). Free memory was 83.8 MB in the beginning and 415.6 MB in the end (delta: -331.9 MB). Peak memory consumption was 322.4 MB. Max. memory is 5.3 GB. [2018-01-30 00:58:43,248 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09 ms. Allocated memory is still 149.4 MB. Free memory is still 117.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 139.26 ms. Allocated memory is still 149.4 MB. Free memory was 113.0 MB in the beginning and 104.3 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 20.52 ms. Allocated memory is still 149.4 MB. Free memory was 104.3 MB in the beginning and 102.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 467.49 ms. Allocated memory is still 149.4 MB. Free memory was 102.6 MB in the beginning and 84.0 MB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 70073.72 ms. Allocated memory was 149.4 MB in the beginning and 803.7 MB in the end (delta: 654.3 MB). Free memory was 83.8 MB in the beginning and 415.6 MB in the end (delta: -331.9 MB). Peak memory consumption was 322.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 42]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 42). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 12, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 20 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 79 locations, 1 error locations. TIMEOUT Result, 70.0s OverallTime, 16 OverallIterations, 12 TraceHistogramMax, 48.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1956 SDtfs, 5999 SDslu, 25419 SDs, 0 SdLazy, 14698 SolverSat, 759 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3017 GetRequests, 1845 SyntacticMatches, 121 SemanticMatches, 1051 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82188 ImplicationChecksByTransitivity, 50.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3394occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 15 MinimizatonAttempts, 6100 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 17.3s InterpolantComputationTime, 3844 NumberOfCodeBlocks, 3833 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 3815 ConstructedInterpolants, 228 QuantifiedInterpolants, 5251657 SizeOfPredicates, 210 NumberOfNonLiveVariables, 3463 ConjunctsInSsa, 487 ConjunctsInUnsatCore, 29 InterpolantComputations, 3 PerfectInterpolantSequences, 2531/5805 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sep_true-unreach-call_true-termination.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-30_00-58-43-252.csv Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sep_true-unreach-call_true-termination.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_00-58-43-252.csv Completed graceful shutdown