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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/memsafety/20051113-1.c_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 12:26:46,562 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 12:26:46,563 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 12:26:46,573 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 12:26:46,573 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 12:26:46,574 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 12:26:46,575 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 12:26:46,576 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 12:26:46,578 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 12:26:46,578 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 12:26:46,579 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 12:26:46,579 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 12:26:46,580 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 12:26:46,581 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 12:26:46,582 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 12:26:46,583 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 12:26:46,585 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 12:26:46,586 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 12:26:46,587 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 12:26:46,588 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 12:26:46,590 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 12:26:46,590 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 12:26:46,590 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 12:26:46,591 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 12:26:46,592 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 12:26:46,593 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 12:26:46,593 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 12:26:46,594 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 12:26:46,594 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 12:26:46,594 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 12:26:46,594 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 12:26:46,595 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-04 12:26:46,604 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 12:26:46,604 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 12:26:46,605 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 12:26:46,605 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 12:26:46,605 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 12:26:46,606 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 12:26:46,606 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 12:26:46,606 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 12:26:46,606 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 12:26:46,606 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 12:26:46,606 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 12:26:46,606 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 12:26:46,607 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 12:26:46,607 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 12:26:46,607 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 12:26:46,607 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 12:26:46,607 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 12:26:46,607 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 12:26:46,607 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 12:26:46,608 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 12:26:46,608 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 12:26:46,608 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 12:26:46,608 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 12:26:46,608 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 12:26:46,639 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 12:26:46,649 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 12:26:46,652 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 12:26:46,653 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 12:26:46,654 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 12:26:46,654 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/20051113-1.c_false-valid-memtrack.i [2018-02-04 12:26:46,786 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 12:26:46,787 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 12:26:46,788 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 12:26:46,788 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 12:26:46,793 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 12:26:46,794 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:26:46" (1/1) ... [2018-02-04 12:26:46,797 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3562dd62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:26:46, skipping insertion in model container [2018-02-04 12:26:46,797 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:26:46" (1/1) ... [2018-02-04 12:26:46,808 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:26:46,834 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:26:46,926 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:26:46,940 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:26:46,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:26:46 WrapperNode [2018-02-04 12:26:46,945 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 12:26:46,946 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 12:26:46,946 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 12:26:46,946 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 12:26:46,955 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:26:46" (1/1) ... [2018-02-04 12:26:46,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:26:46" (1/1) ... [2018-02-04 12:26:46,964 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:26:46" (1/1) ... [2018-02-04 12:26:46,964 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:26:46" (1/1) ... [2018-02-04 12:26:46,966 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:26:46" (1/1) ... [2018-02-04 12:26:46,968 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:26:46" (1/1) ... [2018-02-04 12:26:46,969 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:26:46" (1/1) ... [2018-02-04 12:26:46,970 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 12:26:46,970 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 12:26:46,970 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 12:26:46,970 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 12:26:46,971 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:26:46" (1/1) ... No working directory specified, using /home/ultimate/work/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-02-04 12:26:47,004 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 12:26:47,004 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 12:26:47,004 INFO L136 BoogieDeclarations]: Found implementation of procedure Sum [2018-02-04 12:26:47,004 INFO L136 BoogieDeclarations]: Found implementation of procedure Sum2 [2018-02-04 12:26:47,004 INFO L136 BoogieDeclarations]: Found implementation of procedure dummy_abort [2018-02-04 12:26:47,004 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 12:26:47,005 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 12:26:47,005 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 12:26:47,005 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 12:26:47,005 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 12:26:47,005 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 12:26:47,005 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-02-04 12:26:47,005 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-02-04 12:26:47,005 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-02-04 12:26:47,005 INFO L128 BoogieDeclarations]: Found specification of procedure Sum [2018-02-04 12:26:47,005 INFO L128 BoogieDeclarations]: Found specification of procedure Sum2 [2018-02-04 12:26:47,005 INFO L128 BoogieDeclarations]: Found specification of procedure dummy_abort [2018-02-04 12:26:47,005 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 12:26:47,005 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 12:26:47,006 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 12:26:47,098 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-04 12:26:47,199 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 12:26:47,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:26:47 BoogieIcfgContainer [2018-02-04 12:26:47,199 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 12:26:47,200 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 12:26:47,200 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 12:26:47,201 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 12:26:47,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 12:26:46" (1/3) ... [2018-02-04 12:26:47,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@654da88c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:26:47, skipping insertion in model container [2018-02-04 12:26:47,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:26:46" (2/3) ... [2018-02-04 12:26:47,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@654da88c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:26:47, skipping insertion in model container [2018-02-04 12:26:47,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:26:47" (3/3) ... [2018-02-04 12:26:47,204 INFO L107 eAbstractionObserver]: Analyzing ICFG 20051113-1.c_false-valid-memtrack.i [2018-02-04 12:26:47,209 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 12:26:47,214 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 25 error locations. [2018-02-04 12:26:47,244 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 12:26:47,244 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 12:26:47,244 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 12:26:47,244 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 12:26:47,245 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 12:26:47,245 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 12:26:47,245 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 12:26:47,245 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 12:26:47,246 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 12:26:47,257 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2018-02-04 12:26:47,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-04 12:26:47,265 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:26:47,266 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:26:47,266 INFO L371 AbstractCegarLoop]: === Iteration 1 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 12:26:47,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1274877597, now seen corresponding path program 1 times [2018-02-04 12:26:47,271 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:26:47,272 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:26:47,313 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:47,314 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:26:47,314 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:47,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:26:47,354 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:26:47,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:26:47,409 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:26:47,409 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:26:47,410 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:26:47,421 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:26:47,422 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:26:47,424 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 4 states. [2018-02-04 12:26:47,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:26:47,597 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2018-02-04 12:26:47,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 12:26:47,598 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-04 12:26:47,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:26:47,604 INFO L225 Difference]: With dead ends: 72 [2018-02-04 12:26:47,604 INFO L226 Difference]: Without dead ends: 69 [2018-02-04 12:26:47,605 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:26:47,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-04 12:26:47,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-02-04 12:26:47,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-04 12:26:47,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2018-02-04 12:26:47,636 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 8 [2018-02-04 12:26:47,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:26:47,636 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2018-02-04 12:26:47,636 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:26:47,636 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2018-02-04 12:26:47,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-04 12:26:47,636 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:26:47,636 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:26:47,637 INFO L371 AbstractCegarLoop]: === Iteration 2 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 12:26:47,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1274877596, now seen corresponding path program 1 times [2018-02-04 12:26:47,637 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:26:47,637 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:26:47,638 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:47,638 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:26:47,638 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:47,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:26:47,649 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:26:47,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:26:47,693 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:26:47,694 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:26:47,695 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:26:47,695 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:26:47,695 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:26:47,696 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand 4 states. [2018-02-04 12:26:47,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:26:47,776 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2018-02-04 12:26:47,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 12:26:47,777 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-04 12:26:47,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:26:47,778 INFO L225 Difference]: With dead ends: 61 [2018-02-04 12:26:47,778 INFO L226 Difference]: Without dead ends: 61 [2018-02-04 12:26:47,779 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:26:47,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-02-04 12:26:47,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-02-04 12:26:47,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-04 12:26:47,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2018-02-04 12:26:47,784 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 8 [2018-02-04 12:26:47,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:26:47,784 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2018-02-04 12:26:47,784 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:26:47,784 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2018-02-04 12:26:47,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 12:26:47,785 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:26:47,785 INFO L351 BasicCegarLoop]: trace histogram [1, 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-02-04 12:26:47,785 INFO L371 AbstractCegarLoop]: === Iteration 3 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 12:26:47,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1852712777, now seen corresponding path program 1 times [2018-02-04 12:26:47,785 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:26:47,785 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:26:47,786 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:47,786 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:26:47,786 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:47,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:26:47,807 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:26:47,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:26:47,851 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:26:47,851 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 12:26:47,851 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:26:47,851 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:26:47,851 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:26:47,852 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand 5 states. [2018-02-04 12:26:47,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:26:47,912 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2018-02-04 12:26:47,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 12:26:47,912 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-02-04 12:26:47,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:26:47,913 INFO L225 Difference]: With dead ends: 59 [2018-02-04 12:26:47,913 INFO L226 Difference]: Without dead ends: 59 [2018-02-04 12:26:47,914 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:26:47,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-04 12:26:47,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-02-04 12:26:47,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-02-04 12:26:47,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2018-02-04 12:26:47,918 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 25 [2018-02-04 12:26:47,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:26:47,918 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2018-02-04 12:26:47,918 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:26:47,919 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2018-02-04 12:26:47,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 12:26:47,919 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:26:47,919 INFO L351 BasicCegarLoop]: trace histogram [1, 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-02-04 12:26:47,919 INFO L371 AbstractCegarLoop]: === Iteration 4 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 12:26:47,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1852712776, now seen corresponding path program 1 times [2018-02-04 12:26:47,920 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:26:47,920 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:26:47,920 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:47,920 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:26:47,921 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:26:47,937 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:26:48,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:26:48,006 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:26:48,006 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 12:26:48,006 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 12:26:48,006 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 12:26:48,007 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:26:48,007 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand 6 states. [2018-02-04 12:26:48,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:26:48,121 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2018-02-04 12:26:48,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:26:48,122 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-02-04 12:26:48,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:26:48,122 INFO L225 Difference]: With dead ends: 58 [2018-02-04 12:26:48,122 INFO L226 Difference]: Without dead ends: 58 [2018-02-04 12:26:48,123 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:26:48,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-04 12:26:48,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-02-04 12:26:48,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-04 12:26:48,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2018-02-04 12:26:48,127 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 25 [2018-02-04 12:26:48,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:26:48,127 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2018-02-04 12:26:48,127 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 12:26:48,128 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2018-02-04 12:26:48,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 12:26:48,128 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:26:48,128 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 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-02-04 12:26:48,128 INFO L371 AbstractCegarLoop]: === Iteration 5 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 12:26:48,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1954449657, now seen corresponding path program 1 times [2018-02-04 12:26:48,129 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:26:48,129 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:26:48,130 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:48,130 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:26:48,130 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:48,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:26:48,149 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:26:48,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:26:48,344 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:26:48,344 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 12:26:48,345 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 12:26:48,345 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 12:26:48,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-04 12:26:48,345 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand 9 states. [2018-02-04 12:26:48,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:26:48,509 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-02-04 12:26:48,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 12:26:48,509 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2018-02-04 12:26:48,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:26:48,510 INFO L225 Difference]: With dead ends: 64 [2018-02-04 12:26:48,510 INFO L226 Difference]: Without dead ends: 64 [2018-02-04 12:26:48,510 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-02-04 12:26:48,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-04 12:26:48,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2018-02-04 12:26:48,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 12:26:48,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2018-02-04 12:26:48,513 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 27 [2018-02-04 12:26:48,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:26:48,513 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2018-02-04 12:26:48,513 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 12:26:48,513 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2018-02-04 12:26:48,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 12:26:48,514 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:26:48,514 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 12:26:48,514 INFO L371 AbstractCegarLoop]: === Iteration 6 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 12:26:48,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1339860797, now seen corresponding path program 1 times [2018-02-04 12:26:48,514 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:26:48,514 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:26:48,515 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:48,515 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:26:48,515 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:48,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:26:48,528 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:26:48,614 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:26:48,614 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:26:48,614 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 12:26:48,619 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:26:48,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:26:48,641 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:26:48,669 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 12:26:48,690 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 12:26:48,690 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2018-02-04 12:26:48,690 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 12:26:48,690 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 12:26:48,691 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-04 12:26:48,691 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand 9 states. [2018-02-04 12:26:48,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:26:48,892 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2018-02-04 12:26:48,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 12:26:48,892 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-02-04 12:26:48,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:26:48,894 INFO L225 Difference]: With dead ends: 76 [2018-02-04 12:26:48,894 INFO L226 Difference]: Without dead ends: 74 [2018-02-04 12:26:48,895 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-02-04 12:26:48,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-04 12:26:48,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 69. [2018-02-04 12:26:48,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-04 12:26:48,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2018-02-04 12:26:48,901 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 33 [2018-02-04 12:26:48,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:26:48,901 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2018-02-04 12:26:48,901 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 12:26:48,901 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2018-02-04 12:26:48,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 12:26:48,902 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:26:48,902 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 12:26:48,902 INFO L371 AbstractCegarLoop]: === Iteration 7 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 12:26:48,902 INFO L82 PathProgramCache]: Analyzing trace with hash 919563422, now seen corresponding path program 1 times [2018-02-04 12:26:48,903 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:26:48,903 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:26:48,903 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:48,904 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:26:48,904 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:48,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:26:48,919 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:26:48,956 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 12:26:48,956 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:26:48,956 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 12:26:48,956 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:26:48,956 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:26:48,956 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:26:48,957 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand 5 states. [2018-02-04 12:26:49,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:26:49,030 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2018-02-04 12:26:49,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 12:26:49,030 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-02-04 12:26:49,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:26:49,031 INFO L225 Difference]: With dead ends: 67 [2018-02-04 12:26:49,031 INFO L226 Difference]: Without dead ends: 67 [2018-02-04 12:26:49,031 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:26:49,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-04 12:26:49,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-02-04 12:26:49,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-04 12:26:49,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-02-04 12:26:49,035 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 41 [2018-02-04 12:26:49,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:26:49,035 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-02-04 12:26:49,035 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:26:49,035 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-02-04 12:26:49,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 12:26:49,036 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:26:49,036 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 12:26:49,036 INFO L371 AbstractCegarLoop]: === Iteration 8 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 12:26:49,036 INFO L82 PathProgramCache]: Analyzing trace with hash 919563423, now seen corresponding path program 1 times [2018-02-04 12:26:49,036 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:26:49,037 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:26:49,037 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:49,037 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:26:49,037 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:49,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:26:49,049 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:26:49,105 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 12:26:49,105 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:26:49,105 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 12:26:49,106 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 12:26:49,106 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 12:26:49,106 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:26:49,106 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 6 states. [2018-02-04 12:26:49,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:26:49,160 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2018-02-04 12:26:49,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:26:49,161 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-02-04 12:26:49,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:26:49,161 INFO L225 Difference]: With dead ends: 66 [2018-02-04 12:26:49,161 INFO L226 Difference]: Without dead ends: 66 [2018-02-04 12:26:49,162 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:26:49,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-04 12:26:49,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-02-04 12:26:49,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-04 12:26:49,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2018-02-04 12:26:49,164 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 41 [2018-02-04 12:26:49,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:26:49,164 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2018-02-04 12:26:49,165 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 12:26:49,165 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2018-02-04 12:26:49,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 12:26:49,165 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:26:49,165 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-02-04 12:26:49,165 INFO L371 AbstractCegarLoop]: === Iteration 9 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 12:26:49,165 INFO L82 PathProgramCache]: Analyzing trace with hash -435672114, now seen corresponding path program 1 times [2018-02-04 12:26:49,165 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:26:49,165 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:26:49,166 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:49,166 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:26:49,166 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:49,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:26:49,177 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:26:49,321 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 12:26:49,321 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:26:49,321 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 12:26:49,328 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:26:49,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:26:49,353 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:26:49,384 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-04 12:26:49,403 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:26:49,403 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 11 [2018-02-04 12:26:49,403 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 12:26:49,403 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 12:26:49,403 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-02-04 12:26:49,404 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand 11 states. [2018-02-04 12:26:49,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:26:49,652 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2018-02-04 12:26:49,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 12:26:49,652 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 40 [2018-02-04 12:26:49,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:26:49,653 INFO L225 Difference]: With dead ends: 83 [2018-02-04 12:26:49,653 INFO L226 Difference]: Without dead ends: 81 [2018-02-04 12:26:49,653 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-02-04 12:26:49,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-04 12:26:49,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 73. [2018-02-04 12:26:49,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-04 12:26:49,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2018-02-04 12:26:49,658 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 40 [2018-02-04 12:26:49,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:26:49,658 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2018-02-04 12:26:49,658 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 12:26:49,658 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2018-02-04 12:26:49,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 12:26:49,662 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:26:49,662 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 12:26:49,664 INFO L371 AbstractCegarLoop]: === Iteration 10 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 12:26:49,665 INFO L82 PathProgramCache]: Analyzing trace with hash 2111534509, now seen corresponding path program 1 times [2018-02-04 12:26:49,665 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:26:49,665 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:26:49,666 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:49,666 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:26:49,666 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:49,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:26:49,689 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:26:49,919 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 12:26:49,919 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:26:49,920 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 12:26:49,929 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:26:49,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:26:49,960 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:26:49,999 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 12:26:50,016 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:26:50,017 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 16 [2018-02-04 12:26:50,017 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 12:26:50,017 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 12:26:50,017 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-02-04 12:26:50,017 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand 16 states. [2018-02-04 12:26:50,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:26:50,182 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2018-02-04 12:26:50,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 12:26:50,184 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 44 [2018-02-04 12:26:50,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:26:50,184 INFO L225 Difference]: With dead ends: 85 [2018-02-04 12:26:50,184 INFO L226 Difference]: Without dead ends: 83 [2018-02-04 12:26:50,184 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 41 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2018-02-04 12:26:50,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-04 12:26:50,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 78. [2018-02-04 12:26:50,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-04 12:26:50,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2018-02-04 12:26:50,188 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 44 [2018-02-04 12:26:50,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:26:50,188 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2018-02-04 12:26:50,188 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 12:26:50,188 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2018-02-04 12:26:50,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 12:26:50,189 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:26:50,189 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 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] [2018-02-04 12:26:50,189 INFO L371 AbstractCegarLoop]: === Iteration 11 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 12:26:50,189 INFO L82 PathProgramCache]: Analyzing trace with hash -763701070, now seen corresponding path program 2 times [2018-02-04 12:26:50,189 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:26:50,190 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:26:50,190 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:50,190 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:26:50,191 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:50,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:26:50,201 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:26:50,406 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 17 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 12:26:50,406 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:26:50,406 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 12:26:50,411 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:26:50,428 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:26:50,429 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:26:50,430 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:26:50,481 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-02-04 12:26:50,499 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:26:50,499 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 19 [2018-02-04 12:26:50,499 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 12:26:50,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 12:26:50,499 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-02-04 12:26:50,499 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand 19 states. [2018-02-04 12:26:50,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:26:50,755 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2018-02-04 12:26:50,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 12:26:50,755 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48 [2018-02-04 12:26:50,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:26:50,756 INFO L225 Difference]: With dead ends: 79 [2018-02-04 12:26:50,756 INFO L226 Difference]: Without dead ends: 77 [2018-02-04 12:26:50,756 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 44 SyntacticMatches, 7 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=718, Unknown=0, NotChecked=0, Total=870 [2018-02-04 12:26:50,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-04 12:26:50,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-02-04 12:26:50,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 12:26:50,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2018-02-04 12:26:50,758 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 48 [2018-02-04 12:26:50,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:26:50,759 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2018-02-04 12:26:50,759 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 12:26:50,759 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2018-02-04 12:26:50,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 12:26:50,759 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:26:50,759 INFO L351 BasicCegarLoop]: trace histogram [4, 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] [2018-02-04 12:26:50,759 INFO L371 AbstractCegarLoop]: === Iteration 12 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 12:26:50,759 INFO L82 PathProgramCache]: Analyzing trace with hash 2106198684, now seen corresponding path program 1 times [2018-02-04 12:26:50,760 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:26:50,760 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:26:50,760 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:50,760 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:26:50,760 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:50,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:26:50,773 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:26:50,809 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-02-04 12:26:50,809 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:26:50,809 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 12:26:50,809 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:26:50,810 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:26:50,810 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:26:50,810 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 5 states. [2018-02-04 12:26:50,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:26:50,820 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2018-02-04 12:26:50,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 12:26:50,821 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-02-04 12:26:50,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:26:50,821 INFO L225 Difference]: With dead ends: 83 [2018-02-04 12:26:50,822 INFO L226 Difference]: Without dead ends: 83 [2018-02-04 12:26:50,822 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:26:50,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-04 12:26:50,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2018-02-04 12:26:50,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-04 12:26:50,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2018-02-04 12:26:50,824 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 52 [2018-02-04 12:26:50,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:26:50,825 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2018-02-04 12:26:50,825 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:26:50,825 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2018-02-04 12:26:50,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 12:26:50,825 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:26:50,825 INFO L351 BasicCegarLoop]: trace histogram [4, 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] [2018-02-04 12:26:50,825 INFO L371 AbstractCegarLoop]: === Iteration 13 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 12:26:50,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1604645521, now seen corresponding path program 1 times [2018-02-04 12:26:50,826 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:26:50,826 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:26:50,826 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:50,826 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:26:50,826 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:50,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:26:50,841 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:26:51,147 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-02-04 12:26:51,147 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:26:51,147 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 12:26:51,153 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:26:51,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:26:51,170 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:26:51,228 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 12:26:51,246 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:26:51,247 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 19 [2018-02-04 12:26:51,247 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 12:26:51,247 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 12:26:51,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2018-02-04 12:26:51,248 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand 19 states. [2018-02-04 12:26:51,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:26:51,615 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2018-02-04 12:26:51,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 12:26:51,615 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 52 [2018-02-04 12:26:51,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:26:51,616 INFO L225 Difference]: With dead ends: 86 [2018-02-04 12:26:51,616 INFO L226 Difference]: Without dead ends: 84 [2018-02-04 12:26:51,617 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2018-02-04 12:26:51,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-04 12:26:51,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2018-02-04 12:26:51,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 12:26:51,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2018-02-04 12:26:51,620 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 52 [2018-02-04 12:26:51,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:26:51,620 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2018-02-04 12:26:51,620 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 12:26:51,620 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2018-02-04 12:26:51,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 12:26:51,621 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:26:51,621 INFO L351 BasicCegarLoop]: trace histogram [5, 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] [2018-02-04 12:26:51,621 INFO L371 AbstractCegarLoop]: === Iteration 14 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 12:26:51,622 INFO L82 PathProgramCache]: Analyzing trace with hash -544800124, now seen corresponding path program 1 times [2018-02-04 12:26:51,622 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:26:51,622 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:26:51,626 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:51,626 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:26:51,626 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:51,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:26:51,636 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:26:51,794 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-02-04 12:26:51,794 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:26:51,795 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 12:26:51,804 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:26:51,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:26:51,825 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:26:51,887 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 12:26:51,912 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:26:51,912 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-02-04 12:26:51,913 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 12:26:51,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 12:26:51,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-02-04 12:26:51,913 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 16 states. [2018-02-04 12:26:52,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:26:52,131 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2018-02-04 12:26:52,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 12:26:52,131 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2018-02-04 12:26:52,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:26:52,132 INFO L225 Difference]: With dead ends: 85 [2018-02-04 12:26:52,132 INFO L226 Difference]: Without dead ends: 80 [2018-02-04 12:26:52,132 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 8 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2018-02-04 12:26:52,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-04 12:26:52,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2018-02-04 12:26:52,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 12:26:52,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2018-02-04 12:26:52,135 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 56 [2018-02-04 12:26:52,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:26:52,135 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2018-02-04 12:26:52,136 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 12:26:52,136 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2018-02-04 12:26:52,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-04 12:26:52,136 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:26:52,137 INFO L351 BasicCegarLoop]: trace histogram [6, 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-02-04 12:26:52,137 INFO L371 AbstractCegarLoop]: === Iteration 15 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 12:26:52,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1454707584, now seen corresponding path program 1 times [2018-02-04 12:26:52,137 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:26:52,137 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:26:52,138 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:52,138 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:26:52,138 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:52,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:26:52,150 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:26:52,303 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-04 12:26:52,303 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:26:52,303 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 12:26:52,312 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:26:52,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:26:52,342 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:26:52,405 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 12:26:52,425 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:26:52,425 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2018-02-04 12:26:52,425 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 12:26:52,426 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 12:26:52,426 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2018-02-04 12:26:52,426 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand 17 states. [2018-02-04 12:26:52,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:26:52,613 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2018-02-04 12:26:52,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 12:26:52,613 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 60 [2018-02-04 12:26:52,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:26:52,614 INFO L225 Difference]: With dead ends: 92 [2018-02-04 12:26:52,614 INFO L226 Difference]: Without dead ends: 87 [2018-02-04 12:26:52,615 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 53 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2018-02-04 12:26:52,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-02-04 12:26:52,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2018-02-04 12:26:52,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-04 12:26:52,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2018-02-04 12:26:52,617 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 60 [2018-02-04 12:26:52,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:26:52,617 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2018-02-04 12:26:52,617 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 12:26:52,617 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2018-02-04 12:26:52,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 12:26:52,618 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:26:52,619 INFO L351 BasicCegarLoop]: trace histogram [7, 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] [2018-02-04 12:26:52,619 INFO L371 AbstractCegarLoop]: === Iteration 16 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 12:26:52,619 INFO L82 PathProgramCache]: Analyzing trace with hash -374403177, now seen corresponding path program 2 times [2018-02-04 12:26:52,619 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:26:52,619 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:26:52,620 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:52,620 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:26:52,620 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:52,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:26:52,629 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:26:52,768 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-02-04 12:26:52,769 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:26:52,769 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 12:26:52,776 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:26:52,797 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:26:52,797 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:26:52,800 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:26:52,870 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-04 12:26:52,888 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:26:52,888 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2018-02-04 12:26:52,888 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 12:26:52,888 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 12:26:52,889 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2018-02-04 12:26:52,889 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand 19 states. [2018-02-04 12:26:53,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:26:53,085 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2018-02-04 12:26:53,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 12:26:53,085 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2018-02-04 12:26:53,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:26:53,086 INFO L225 Difference]: With dead ends: 90 [2018-02-04 12:26:53,086 INFO L226 Difference]: Without dead ends: 85 [2018-02-04 12:26:53,086 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 61 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2018-02-04 12:26:53,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-04 12:26:53,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-02-04 12:26:53,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-02-04 12:26:53,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2018-02-04 12:26:53,088 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 67 [2018-02-04 12:26:53,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:26:53,089 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2018-02-04 12:26:53,089 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 12:26:53,089 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2018-02-04 12:26:53,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-04 12:26:53,090 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:26:53,090 INFO L351 BasicCegarLoop]: trace histogram [8, 3, 3, 3, 3, 2, 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] [2018-02-04 12:26:53,090 INFO L371 AbstractCegarLoop]: === Iteration 17 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 12:26:53,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1696068192, now seen corresponding path program 3 times [2018-02-04 12:26:53,090 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:26:53,090 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:26:53,091 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:53,091 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:26:53,091 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:53,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:26:53,103 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:26:53,274 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-02-04 12:26:53,274 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:26:53,274 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 12:26:53,279 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 12:26:53,309 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-02-04 12:26:53,309 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:26:53,311 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:26:53,347 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 11 treesize of output 8 [2018-02-04 12:26:53,349 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 8 treesize of output 7 [2018-02-04 12:26:53,349 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:26:53,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:26:53,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:26:53,352 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-02-04 12:26:53,385 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 21 treesize of output 16 [2018-02-04 12:26:53,389 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,390 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 31 [2018-02-04 12:26:53,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:26:53,398 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:26:53,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:26:53,402 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-02-04 12:26:53,423 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-02-04 12:26:53,430 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,431 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,431 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,432 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,433 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,433 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 78 [2018-02-04 12:26:53,435 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:26:53,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:26:53,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:26:53,446 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-02-04 12:26:53,489 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 39 treesize of output 30 [2018-02-04 12:26:53,492 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,492 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,493 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,494 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,494 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,504 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,505 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,505 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,506 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,506 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,507 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,507 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 149 [2018-02-04 12:26:53,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:26:53,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:26:53,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:26:53,543 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-02-04 12:26:53,562 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 48 treesize of output 37 [2018-02-04 12:26:53,567 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,567 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,568 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,568 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,569 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,569 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,570 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,570 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,571 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,571 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,572 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,572 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,573 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,573 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,574 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,574 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 206 [2018-02-04 12:26:53,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:26:53,605 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:26:53,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:26:53,611 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-02-04 12:26:53,634 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 57 treesize of output 44 [2018-02-04 12:26:53,662 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,663 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,663 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,664 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,665 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,666 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,666 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,667 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,668 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,668 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,669 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,670 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,671 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,671 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,672 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,673 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,674 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,674 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,675 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,676 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,678 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 253 [2018-02-04 12:26:53,681 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:26:53,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:26:53,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:26:53,723 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:60, output treesize:56 [2018-02-04 12:26:53,748 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 66 treesize of output 51 [2018-02-04 12:26:53,765 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,765 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,766 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,767 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,768 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,769 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,769 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,770 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,771 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,771 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,772 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,773 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,773 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,774 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,775 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,775 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,776 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,777 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,777 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,778 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,779 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,780 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,780 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,781 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,782 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,783 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,783 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:53,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 27 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 308 [2018-02-04 12:26:53,786 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:26:53,839 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:26:53,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:26:53,849 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:69, output treesize:65 [2018-02-04 12:26:54,177 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 12:26:54,177 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:26:54,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:26:54,178 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:121, output treesize:1 [2018-02-04 12:26:54,194 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-02-04 12:26:54,215 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:26:54,216 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17] total 28 [2018-02-04 12:26:54,216 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 12:26:54,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 12:26:54,216 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2018-02-04 12:26:54,216 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand 28 states. [2018-02-04 12:26:54,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:26:54,902 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2018-02-04 12:26:54,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 12:26:54,902 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 74 [2018-02-04 12:26:54,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:26:54,902 INFO L225 Difference]: With dead ends: 100 [2018-02-04 12:26:54,903 INFO L226 Difference]: Without dead ends: 94 [2018-02-04 12:26:54,903 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 61 SyntacticMatches, 8 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=336, Invalid=2114, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 12:26:54,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-04 12:26:54,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2018-02-04 12:26:54,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-02-04 12:26:54,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2018-02-04 12:26:54,905 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 74 [2018-02-04 12:26:54,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:26:54,905 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2018-02-04 12:26:54,905 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 12:26:54,905 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2018-02-04 12:26:54,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-04 12:26:54,906 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:26:54,906 INFO L351 BasicCegarLoop]: trace histogram [8, 4, 4, 4, 4, 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] [2018-02-04 12:26:54,906 INFO L371 AbstractCegarLoop]: === Iteration 18 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 12:26:54,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1151371872, now seen corresponding path program 4 times [2018-02-04 12:26:54,906 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:26:54,906 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:26:54,906 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:54,906 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:26:54,907 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:54,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:26:54,920 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:26:55,014 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:26:55,014 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:26:55,014 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 12:26:55,025 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 12:26:55,055 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 12:26:55,055 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:26:55,057 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:26:55,114 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:26:55,141 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:26:55,141 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-02-04 12:26:55,141 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 12:26:55,141 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 12:26:55,141 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=279, Unknown=0, NotChecked=0, Total=462 [2018-02-04 12:26:55,141 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand 22 states. [2018-02-04 12:26:55,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:26:55,164 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2018-02-04 12:26:55,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 12:26:55,164 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 86 [2018-02-04 12:26:55,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:26:55,165 INFO L225 Difference]: With dead ends: 94 [2018-02-04 12:26:55,165 INFO L226 Difference]: Without dead ends: 92 [2018-02-04 12:26:55,165 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=196, Invalid=310, Unknown=0, NotChecked=0, Total=506 [2018-02-04 12:26:55,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-04 12:26:55,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-02-04 12:26:55,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-04 12:26:55,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2018-02-04 12:26:55,167 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 86 [2018-02-04 12:26:55,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:26:55,167 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2018-02-04 12:26:55,167 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 12:26:55,167 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2018-02-04 12:26:55,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-04 12:26:55,168 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:26:55,168 INFO L351 BasicCegarLoop]: trace histogram [9, 4, 4, 4, 4, 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] [2018-02-04 12:26:55,168 INFO L371 AbstractCegarLoop]: === Iteration 19 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 12:26:55,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1429474957, now seen corresponding path program 5 times [2018-02-04 12:26:55,169 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:26:55,169 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:26:55,169 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:55,169 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:26:55,169 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:55,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:26:55,186 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:26:55,297 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:26:55,297 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:26:55,297 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 12:26:55,304 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 12:26:55,336 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-02-04 12:26:55,337 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:26:55,339 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:26:55,405 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:26:55,435 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:26:55,436 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-02-04 12:26:55,436 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 12:26:55,436 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 12:26:55,436 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=334, Unknown=0, NotChecked=0, Total=552 [2018-02-04 12:26:55,437 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand 24 states. [2018-02-04 12:26:55,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:26:55,486 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2018-02-04 12:26:55,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 12:26:55,486 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 87 [2018-02-04 12:26:55,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:26:55,487 INFO L225 Difference]: With dead ends: 95 [2018-02-04 12:26:55,487 INFO L226 Difference]: Without dead ends: 93 [2018-02-04 12:26:55,487 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=232, Invalid=368, Unknown=0, NotChecked=0, Total=600 [2018-02-04 12:26:55,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-04 12:26:55,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-02-04 12:26:55,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-04 12:26:55,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2018-02-04 12:26:55,489 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 87 [2018-02-04 12:26:55,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:26:55,490 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2018-02-04 12:26:55,490 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 12:26:55,490 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2018-02-04 12:26:55,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-02-04 12:26:55,491 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:26:55,491 INFO L351 BasicCegarLoop]: trace histogram [10, 4, 4, 4, 4, 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] [2018-02-04 12:26:55,491 INFO L371 AbstractCegarLoop]: === Iteration 20 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 12:26:55,491 INFO L82 PathProgramCache]: Analyzing trace with hash 168651968, now seen corresponding path program 6 times [2018-02-04 12:26:55,491 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:26:55,491 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:26:55,492 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:55,492 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:26:55,492 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:55,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:26:55,506 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:26:55,625 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:26:55,625 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:26:55,625 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 12:26:55,632 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 12:26:55,869 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-02-04 12:26:55,869 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:26:55,872 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:26:55,985 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:26:56,028 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:26:56,028 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2018-02-04 12:26:56,029 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 12:26:56,029 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 12:26:56,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=394, Unknown=0, NotChecked=0, Total=650 [2018-02-04 12:26:56,029 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand 26 states. [2018-02-04 12:26:56,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:26:56,063 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2018-02-04 12:26:56,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 12:26:56,067 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 88 [2018-02-04 12:26:56,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:26:56,068 INFO L225 Difference]: With dead ends: 96 [2018-02-04 12:26:56,068 INFO L226 Difference]: Without dead ends: 94 [2018-02-04 12:26:56,068 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=271, Invalid=431, Unknown=0, NotChecked=0, Total=702 [2018-02-04 12:26:56,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-04 12:26:56,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-02-04 12:26:56,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-04 12:26:56,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2018-02-04 12:26:56,070 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 88 [2018-02-04 12:26:56,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:26:56,071 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2018-02-04 12:26:56,071 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 12:26:56,071 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2018-02-04 12:26:56,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-04 12:26:56,071 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:26:56,072 INFO L351 BasicCegarLoop]: trace histogram [11, 4, 4, 4, 4, 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] [2018-02-04 12:26:56,072 INFO L371 AbstractCegarLoop]: === Iteration 21 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 12:26:56,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1829020909, now seen corresponding path program 7 times [2018-02-04 12:26:56,072 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:26:56,072 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:26:56,073 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:56,073 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:26:56,073 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:56,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:26:56,089 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:26:56,236 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:26:56,236 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:26:56,236 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 12:26:56,241 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:26:56,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:26:56,267 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:26:56,470 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:26:56,487 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:26:56,487 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2018-02-04 12:26:56,487 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 12:26:56,488 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 12:26:56,488 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=459, Unknown=0, NotChecked=0, Total=756 [2018-02-04 12:26:56,488 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand 28 states. [2018-02-04 12:26:56,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:26:56,517 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2018-02-04 12:26:56,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 12:26:56,517 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 89 [2018-02-04 12:26:56,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:26:56,518 INFO L225 Difference]: With dead ends: 97 [2018-02-04 12:26:56,518 INFO L226 Difference]: Without dead ends: 95 [2018-02-04 12:26:56,518 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=313, Invalid=499, Unknown=0, NotChecked=0, Total=812 [2018-02-04 12:26:56,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-04 12:26:56,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-02-04 12:26:56,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-04 12:26:56,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2018-02-04 12:26:56,521 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 89 [2018-02-04 12:26:56,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:26:56,521 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2018-02-04 12:26:56,521 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 12:26:56,521 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-02-04 12:26:56,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-02-04 12:26:56,522 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:26:56,522 INFO L351 BasicCegarLoop]: trace histogram [12, 4, 4, 4, 4, 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] [2018-02-04 12:26:56,522 INFO L371 AbstractCegarLoop]: === Iteration 22 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 12:26:56,522 INFO L82 PathProgramCache]: Analyzing trace with hash 667629344, now seen corresponding path program 8 times [2018-02-04 12:26:56,522 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:26:56,522 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:26:56,523 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:56,523 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:26:56,523 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:56,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:26:56,536 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:26:56,675 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:26:56,675 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:26:56,675 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 12:26:56,680 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:26:56,715 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:26:56,715 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:26:56,717 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:26:56,812 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:26:56,829 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:26:56,829 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2018-02-04 12:26:56,830 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 12:26:56,830 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 12:26:56,830 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=529, Unknown=0, NotChecked=0, Total=870 [2018-02-04 12:26:56,830 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 30 states. [2018-02-04 12:26:56,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:26:56,858 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2018-02-04 12:26:56,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 12:26:56,860 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 90 [2018-02-04 12:26:56,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:26:56,860 INFO L225 Difference]: With dead ends: 98 [2018-02-04 12:26:56,860 INFO L226 Difference]: Without dead ends: 96 [2018-02-04 12:26:56,861 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=358, Invalid=572, Unknown=0, NotChecked=0, Total=930 [2018-02-04 12:26:56,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-04 12:26:56,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-02-04 12:26:56,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-04 12:26:56,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2018-02-04 12:26:56,862 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 90 [2018-02-04 12:26:56,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:26:56,862 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2018-02-04 12:26:56,863 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 12:26:56,863 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-02-04 12:26:56,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-02-04 12:26:56,863 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:26:56,863 INFO L351 BasicCegarLoop]: trace histogram [13, 4, 4, 4, 4, 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] [2018-02-04 12:26:56,863 INFO L371 AbstractCegarLoop]: === Iteration 23 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 12:26:56,863 INFO L82 PathProgramCache]: Analyzing trace with hash 754375859, now seen corresponding path program 9 times [2018-02-04 12:26:56,863 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:26:56,863 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:26:56,864 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:56,864 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:26:56,864 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:56,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:26:56,873 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:26:57,016 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:26:57,017 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:26:57,017 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:26:57,022 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 12:26:57,390 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-02-04 12:26:57,390 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:26:57,393 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:26:57,473 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:26:57,491 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:26:57,491 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2018-02-04 12:26:57,492 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-04 12:26:57,492 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-04 12:26:57,492 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=388, Invalid=604, Unknown=0, NotChecked=0, Total=992 [2018-02-04 12:26:57,492 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand 32 states. [2018-02-04 12:26:57,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:26:57,537 INFO L93 Difference]: Finished difference Result 99 states and 103 transitions. [2018-02-04 12:26:57,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 12:26:57,538 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 91 [2018-02-04 12:26:57,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:26:57,538 INFO L225 Difference]: With dead ends: 99 [2018-02-04 12:26:57,538 INFO L226 Difference]: Without dead ends: 97 [2018-02-04 12:26:57,538 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=406, Invalid=650, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 12:26:57,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-04 12:26:57,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-02-04 12:26:57,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-02-04 12:26:57,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 101 transitions. [2018-02-04 12:26:57,540 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 101 transitions. Word has length 91 [2018-02-04 12:26:57,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:26:57,541 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 101 transitions. [2018-02-04 12:26:57,541 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-04 12:26:57,541 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2018-02-04 12:26:57,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-04 12:26:57,541 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:26:57,541 INFO L351 BasicCegarLoop]: trace histogram [14, 4, 4, 4, 4, 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] [2018-02-04 12:26:57,541 INFO L371 AbstractCegarLoop]: === Iteration 24 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 12:26:57,541 INFO L82 PathProgramCache]: Analyzing trace with hash -851449472, now seen corresponding path program 10 times [2018-02-04 12:26:57,541 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:26:57,542 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:26:57,542 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:57,542 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:26:57,542 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:57,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:26:57,553 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:26:57,672 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:26:57,673 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:26:57,673 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:26:57,678 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 12:26:57,735 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 12:26:57,735 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:26:57,738 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:26:57,826 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:26:57,843 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:26:57,843 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2018-02-04 12:26:57,844 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-04 12:26:57,844 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-04 12:26:57,844 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=438, Invalid=684, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 12:26:57,844 INFO L87 Difference]: Start difference. First operand 97 states and 101 transitions. Second operand 34 states. [2018-02-04 12:26:57,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:26:57,868 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2018-02-04 12:26:57,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 12:26:57,869 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 92 [2018-02-04 12:26:57,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:26:57,869 INFO L225 Difference]: With dead ends: 100 [2018-02-04 12:26:57,869 INFO L226 Difference]: Without dead ends: 98 [2018-02-04 12:26:57,869 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=457, Invalid=733, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 12:26:57,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-02-04 12:26:57,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-02-04 12:26:57,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-02-04 12:26:57,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 102 transitions. [2018-02-04 12:26:57,872 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 102 transitions. Word has length 92 [2018-02-04 12:26:57,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:26:57,872 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 102 transitions. [2018-02-04 12:26:57,872 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-04 12:26:57,872 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2018-02-04 12:26:57,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-04 12:26:57,873 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:26:57,873 INFO L351 BasicCegarLoop]: trace histogram [15, 4, 4, 4, 4, 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] [2018-02-04 12:26:57,873 INFO L371 AbstractCegarLoop]: === Iteration 25 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 12:26:57,873 INFO L82 PathProgramCache]: Analyzing trace with hash 907572819, now seen corresponding path program 11 times [2018-02-04 12:26:57,873 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:26:57,873 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:26:57,874 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:57,874 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:26:57,874 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:57,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:26:57,888 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:26:58,060 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:26:58,060 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:26:58,060 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:26:58,066 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 12:26:58,133 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-02-04 12:26:58,133 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:26:58,135 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:26:58,257 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:26:58,274 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:26:58,274 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2018-02-04 12:26:58,275 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-04 12:26:58,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-04 12:26:58,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=491, Invalid=769, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 12:26:58,275 INFO L87 Difference]: Start difference. First operand 98 states and 102 transitions. Second operand 36 states. [2018-02-04 12:26:58,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:26:58,322 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2018-02-04 12:26:58,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 12:26:58,322 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 93 [2018-02-04 12:26:58,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:26:58,322 INFO L225 Difference]: With dead ends: 101 [2018-02-04 12:26:58,322 INFO L226 Difference]: Without dead ends: 99 [2018-02-04 12:26:58,323 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=511, Invalid=821, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 12:26:58,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-02-04 12:26:58,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-02-04 12:26:58,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-04 12:26:58,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2018-02-04 12:26:58,325 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 93 [2018-02-04 12:26:58,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:26:58,325 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2018-02-04 12:26:58,325 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-04 12:26:58,325 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2018-02-04 12:26:58,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-04 12:26:58,326 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:26:58,326 INFO L351 BasicCegarLoop]: trace histogram [16, 4, 4, 4, 4, 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] [2018-02-04 12:26:58,326 INFO L371 AbstractCegarLoop]: === Iteration 26 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 12:26:58,326 INFO L82 PathProgramCache]: Analyzing trace with hash -397311008, now seen corresponding path program 12 times [2018-02-04 12:26:58,326 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:26:58,326 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:26:58,326 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:58,327 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:26:58,327 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:58,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:26:58,335 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:26:58,511 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:26:58,511 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:26:58,511 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:26:58,520 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 12:26:59,683 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-02-04 12:26:59,683 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:26:59,687 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:26:59,793 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:26:59,823 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:26:59,824 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2018-02-04 12:26:59,824 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-04 12:26:59,824 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-04 12:26:59,824 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=547, Invalid=859, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 12:26:59,825 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand 38 states. [2018-02-04 12:26:59,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:26:59,868 INFO L93 Difference]: Finished difference Result 102 states and 106 transitions. [2018-02-04 12:26:59,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 12:26:59,868 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 94 [2018-02-04 12:26:59,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:26:59,868 INFO L225 Difference]: With dead ends: 102 [2018-02-04 12:26:59,868 INFO L226 Difference]: Without dead ends: 100 [2018-02-04 12:26:59,869 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=568, Invalid=914, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 12:26:59,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-02-04 12:26:59,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-02-04 12:26:59,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-02-04 12:26:59,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 104 transitions. [2018-02-04 12:26:59,870 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 104 transitions. Word has length 94 [2018-02-04 12:26:59,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:26:59,871 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 104 transitions. [2018-02-04 12:26:59,871 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-04 12:26:59,871 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 104 transitions. [2018-02-04 12:26:59,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-02-04 12:26:59,871 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:26:59,872 INFO L351 BasicCegarLoop]: trace histogram [17, 4, 4, 4, 4, 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] [2018-02-04 12:26:59,872 INFO L371 AbstractCegarLoop]: === Iteration 27 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 12:26:59,872 INFO L82 PathProgramCache]: Analyzing trace with hash 2100963315, now seen corresponding path program 13 times [2018-02-04 12:26:59,872 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:26:59,872 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:26:59,873 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:59,873 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:26:59,873 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:59,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:26:59,887 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:27:00,094 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:27:00,094 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:27:00,094 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:27:00,099 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:27:00,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:27:00,128 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:27:00,266 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:27:00,283 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:27:00,287 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2018-02-04 12:27:00,287 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-04 12:27:00,287 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-04 12:27:00,287 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=606, Invalid=954, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 12:27:00,288 INFO L87 Difference]: Start difference. First operand 100 states and 104 transitions. Second operand 40 states. [2018-02-04 12:27:00,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:27:00,325 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2018-02-04 12:27:00,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 12:27:00,325 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 95 [2018-02-04 12:27:00,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:27:00,326 INFO L225 Difference]: With dead ends: 103 [2018-02-04 12:27:00,326 INFO L226 Difference]: Without dead ends: 101 [2018-02-04 12:27:00,326 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 692 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=628, Invalid=1012, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 12:27:00,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-02-04 12:27:00,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-02-04 12:27:00,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-02-04 12:27:00,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2018-02-04 12:27:00,327 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 95 [2018-02-04 12:27:00,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:27:00,328 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2018-02-04 12:27:00,328 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-04 12:27:00,328 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2018-02-04 12:27:00,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-02-04 12:27:00,328 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:27:00,328 INFO L351 BasicCegarLoop]: trace histogram [18, 4, 4, 4, 4, 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] [2018-02-04 12:27:00,328 INFO L371 AbstractCegarLoop]: === Iteration 28 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 12:27:00,328 INFO L82 PathProgramCache]: Analyzing trace with hash -2056911296, now seen corresponding path program 14 times [2018-02-04 12:27:00,328 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:27:00,328 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:27:00,329 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:27:00,329 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:27:00,329 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:27:00,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:27:00,337 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:27:00,533 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:27:00,534 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:27:00,534 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:27:00,544 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:27:00,575 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:27:00,575 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:27:00,577 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:27:00,778 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:27:00,796 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:27:00,796 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 42 [2018-02-04 12:27:00,797 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-04 12:27:00,797 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-04 12:27:00,797 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=668, Invalid=1054, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 12:27:00,797 INFO L87 Difference]: Start difference. First operand 101 states and 105 transitions. Second operand 42 states. [2018-02-04 12:27:00,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:27:00,843 INFO L93 Difference]: Finished difference Result 104 states and 108 transitions. [2018-02-04 12:27:00,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 12:27:00,845 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 96 [2018-02-04 12:27:00,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:27:00,845 INFO L225 Difference]: With dead ends: 104 [2018-02-04 12:27:00,845 INFO L226 Difference]: Without dead ends: 102 [2018-02-04 12:27:00,846 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 769 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=691, Invalid=1115, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 12:27:00,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-02-04 12:27:00,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-02-04 12:27:00,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-02-04 12:27:00,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 106 transitions. [2018-02-04 12:27:00,848 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 106 transitions. Word has length 96 [2018-02-04 12:27:00,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:27:00,849 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 106 transitions. [2018-02-04 12:27:00,849 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-04 12:27:00,849 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 106 transitions. [2018-02-04 12:27:00,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-02-04 12:27:00,849 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:27:00,849 INFO L351 BasicCegarLoop]: trace histogram [19, 4, 4, 4, 4, 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] [2018-02-04 12:27:00,849 INFO L371 AbstractCegarLoop]: === Iteration 29 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 12:27:00,850 INFO L82 PathProgramCache]: Analyzing trace with hash -2102005357, now seen corresponding path program 15 times [2018-02-04 12:27:00,850 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:27:00,850 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:27:00,850 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:27:00,851 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:27:00,851 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:27:00,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:27:00,865 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:27:01,092 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:27:01,092 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:27:01,092 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:27:01,097 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 12:27:02,438 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-02-04 12:27:02,438 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:27:02,442 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:27:02,607 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:27:02,629 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:27:02,630 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 44 [2018-02-04 12:27:02,630 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-04 12:27:02,630 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-04 12:27:02,630 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=733, Invalid=1159, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 12:27:02,631 INFO L87 Difference]: Start difference. First operand 102 states and 106 transitions. Second operand 44 states. [2018-02-04 12:27:02,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:27:02,693 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2018-02-04 12:27:02,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 12:27:02,693 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 97 [2018-02-04 12:27:02,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:27:02,693 INFO L225 Difference]: With dead ends: 105 [2018-02-04 12:27:02,693 INFO L226 Difference]: Without dead ends: 103 [2018-02-04 12:27:02,694 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 850 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=757, Invalid=1223, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 12:27:02,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-02-04 12:27:02,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-02-04 12:27:02,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-04 12:27:02,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2018-02-04 12:27:02,696 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 97 [2018-02-04 12:27:02,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:27:02,696 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2018-02-04 12:27:02,696 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-04 12:27:02,697 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2018-02-04 12:27:02,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-02-04 12:27:02,697 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:27:02,697 INFO L351 BasicCegarLoop]: trace histogram [20, 4, 4, 4, 4, 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] [2018-02-04 12:27:02,697 INFO L371 AbstractCegarLoop]: === Iteration 30 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 12:27:02,697 INFO L82 PathProgramCache]: Analyzing trace with hash 795046048, now seen corresponding path program 16 times [2018-02-04 12:27:02,697 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:27:02,697 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:27:02,698 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:27:02,698 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:27:02,698 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:27:02,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:27:02,709 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:27:03,004 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:27:03,005 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:27:03,005 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:27:03,010 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 12:27:03,371 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 12:27:03,371 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:27:03,374 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:27:03,494 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:27:03,513 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:27:03,513 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2018-02-04 12:27:03,513 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-04 12:27:03,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-04 12:27:03,514 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=801, Invalid=1269, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 12:27:03,514 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand 46 states. [2018-02-04 12:27:03,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:27:03,563 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2018-02-04 12:27:03,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 12:27:03,564 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 98 [2018-02-04 12:27:03,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:27:03,564 INFO L225 Difference]: With dead ends: 106 [2018-02-04 12:27:03,564 INFO L226 Difference]: Without dead ends: 104 [2018-02-04 12:27:03,565 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 935 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=826, Invalid=1336, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 12:27:03,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-04 12:27:03,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-02-04 12:27:03,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-02-04 12:27:03,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 108 transitions. [2018-02-04 12:27:03,566 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 108 transitions. Word has length 98 [2018-02-04 12:27:03,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:27:03,566 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 108 transitions. [2018-02-04 12:27:03,567 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-04 12:27:03,567 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2018-02-04 12:27:03,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-02-04 12:27:03,567 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:27:03,567 INFO L351 BasicCegarLoop]: trace histogram [21, 4, 4, 4, 4, 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] [2018-02-04 12:27:03,567 INFO L371 AbstractCegarLoop]: === Iteration 31 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 12:27:03,567 INFO L82 PathProgramCache]: Analyzing trace with hash 409326387, now seen corresponding path program 17 times [2018-02-04 12:27:03,567 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:27:03,567 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:27:03,568 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:27:03,568 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:27:03,568 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:27:03,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:27:03,577 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:27:03,803 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:27:03,803 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:27:03,803 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:27:03,808 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 12:27:03,939 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-02-04 12:27:03,939 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:27:03,942 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:27:04,076 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:27:04,094 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:27:04,094 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-02-04 12:27:04,094 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-04 12:27:04,095 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-04 12:27:04,095 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=872, Invalid=1384, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 12:27:04,095 INFO L87 Difference]: Start difference. First operand 104 states and 108 transitions. Second operand 48 states. [2018-02-04 12:27:04,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:27:04,140 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2018-02-04 12:27:04,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 12:27:04,141 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 99 [2018-02-04 12:27:04,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:27:04,141 INFO L225 Difference]: With dead ends: 107 [2018-02-04 12:27:04,141 INFO L226 Difference]: Without dead ends: 105 [2018-02-04 12:27:04,141 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1024 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=898, Invalid=1454, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 12:27:04,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-04 12:27:04,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-02-04 12:27:04,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-04 12:27:04,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2018-02-04 12:27:04,143 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 99 [2018-02-04 12:27:04,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:27:04,143 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2018-02-04 12:27:04,143 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-02-04 12:27:04,143 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2018-02-04 12:27:04,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-02-04 12:27:04,144 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:27:04,144 INFO L351 BasicCegarLoop]: trace histogram [22, 4, 4, 4, 4, 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] [2018-02-04 12:27:04,144 INFO L371 AbstractCegarLoop]: === Iteration 32 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 12:27:04,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1336918784, now seen corresponding path program 18 times [2018-02-04 12:27:04,145 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:27:04,145 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:27:04,145 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:27:04,145 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:27:04,145 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:27:04,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:27:04,154 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:27:04,359 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:27:04,359 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:27:04,359 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:27:04,364 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 12:27:07,821 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2018-02-04 12:27:07,821 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:27:07,828 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:27:07,984 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:27:08,004 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:27:08,004 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2018-02-04 12:27:08,005 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-04 12:27:08,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-04 12:27:08,005 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=925, Invalid=1525, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 12:27:08,005 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand 50 states. [2018-02-04 12:27:08,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:27:08,057 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2018-02-04 12:27:08,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 12:27:08,057 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 100 [2018-02-04 12:27:08,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:27:08,058 INFO L225 Difference]: With dead ends: 108 [2018-02-04 12:27:08,058 INFO L226 Difference]: Without dead ends: 106 [2018-02-04 12:27:08,059 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1145 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1001, Invalid=1651, Unknown=0, NotChecked=0, Total=2652 [2018-02-04 12:27:08,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-02-04 12:27:08,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-02-04 12:27:08,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-02-04 12:27:08,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 110 transitions. [2018-02-04 12:27:08,061 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 110 transitions. Word has length 100 [2018-02-04 12:27:08,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:27:08,061 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 110 transitions. [2018-02-04 12:27:08,062 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-04 12:27:08,062 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2018-02-04 12:27:08,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-02-04 12:27:08,062 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:27:08,062 INFO L351 BasicCegarLoop]: trace histogram [23, 4, 4, 4, 4, 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] [2018-02-04 12:27:08,062 INFO L371 AbstractCegarLoop]: === Iteration 33 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 12:27:08,062 INFO L82 PathProgramCache]: Analyzing trace with hash 27512019, now seen corresponding path program 19 times [2018-02-04 12:27:08,062 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:27:08,062 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:27:08,063 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:27:08,063 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:27:08,063 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:27:08,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:27:08,073 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:27:08,333 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:27:08,333 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:27:08,334 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:27:08,338 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:27:08,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:27:08,364 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:27:08,811 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:27:08,837 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:27:08,838 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2018-02-04 12:27:08,838 INFO L409 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-02-04 12:27:08,838 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-02-04 12:27:08,839 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1001, Invalid=1651, Unknown=0, NotChecked=0, Total=2652 [2018-02-04 12:27:08,839 INFO L87 Difference]: Start difference. First operand 106 states and 110 transitions. Second operand 52 states. [2018-02-04 12:27:09,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:27:09,015 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2018-02-04 12:27:09,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 12:27:09,015 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 101 [2018-02-04 12:27:09,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:27:09,016 INFO L225 Difference]: With dead ends: 109 [2018-02-04 12:27:09,016 INFO L226 Difference]: Without dead ends: 107 [2018-02-04 12:27:09,017 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1243 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1080, Invalid=1782, Unknown=0, NotChecked=0, Total=2862 [2018-02-04 12:27:09,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-02-04 12:27:09,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-02-04 12:27:09,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-02-04 12:27:09,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2018-02-04 12:27:09,019 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 101 [2018-02-04 12:27:09,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:27:09,019 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2018-02-04 12:27:09,019 INFO L433 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-02-04 12:27:09,020 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2018-02-04 12:27:09,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-02-04 12:27:09,020 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:27:09,020 INFO L351 BasicCegarLoop]: trace histogram [24, 4, 4, 4, 4, 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] [2018-02-04 12:27:09,020 INFO L371 AbstractCegarLoop]: === Iteration 34 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 12:27:09,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1909392032, now seen corresponding path program 20 times [2018-02-04 12:27:09,021 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:27:09,021 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:27:09,021 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:27:09,021 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:27:09,021 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:27:09,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:27:09,035 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:27:09,348 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:27:09,349 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:27:09,349 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:27:09,359 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:27:09,393 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:27:09,393 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:27:09,395 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:27:09,843 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:27:09,864 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:27:09,864 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 54 [2018-02-04 12:27:09,864 INFO L409 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-02-04 12:27:09,864 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-02-04 12:27:09,865 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1080, Invalid=1782, Unknown=0, NotChecked=0, Total=2862 [2018-02-04 12:27:09,865 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 54 states. [2018-02-04 12:27:10,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:27:10,039 INFO L93 Difference]: Finished difference Result 110 states and 114 transitions. [2018-02-04 12:27:10,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 12:27:10,039 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 102 [2018-02-04 12:27:10,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:27:10,040 INFO L225 Difference]: With dead ends: 110 [2018-02-04 12:27:10,040 INFO L226 Difference]: Without dead ends: 108 [2018-02-04 12:27:10,040 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1345 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1162, Invalid=1918, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 12:27:10,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-02-04 12:27:10,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-02-04 12:27:10,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-04 12:27:10,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 112 transitions. [2018-02-04 12:27:10,043 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 112 transitions. Word has length 102 [2018-02-04 12:27:10,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:27:10,043 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 112 transitions. [2018-02-04 12:27:10,043 INFO L433 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-02-04 12:27:10,043 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2018-02-04 12:27:10,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-02-04 12:27:10,043 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:27:10,044 INFO L351 BasicCegarLoop]: trace histogram [25, 4, 4, 4, 4, 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] [2018-02-04 12:27:10,044 INFO L371 AbstractCegarLoop]: === Iteration 35 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 12:27:10,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1823875469, now seen corresponding path program 21 times [2018-02-04 12:27:10,044 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:27:10,044 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:27:10,045 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:27:10,045 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:27:10,045 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:27:10,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:27:10,060 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:27:10,367 WARN L143 SmtUtils]: Spent 188ms on a formula simplification that was a NOOP. DAG size: 8 [2018-02-04 12:27:10,669 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:27:10,669 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:27:10,852 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:27:10,858 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 12:27:15,212 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-02-04 12:27:15,212 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:27:15,221 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:27:15,408 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:27:15,431 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:27:15,431 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 56 [2018-02-04 12:27:15,431 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-02-04 12:27:15,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-02-04 12:27:15,432 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1162, Invalid=1918, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 12:27:15,432 INFO L87 Difference]: Start difference. First operand 108 states and 112 transitions. Second operand 56 states. [2018-02-04 12:27:15,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:27:15,493 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2018-02-04 12:27:15,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 12:27:15,493 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 103 [2018-02-04 12:27:15,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:27:15,494 INFO L225 Difference]: With dead ends: 111 [2018-02-04 12:27:15,494 INFO L226 Difference]: Without dead ends: 109 [2018-02-04 12:27:15,494 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1451 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1247, Invalid=2059, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 12:27:15,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-02-04 12:27:15,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-02-04 12:27:15,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-04 12:27:15,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 113 transitions. [2018-02-04 12:27:15,496 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 113 transitions. Word has length 103 [2018-02-04 12:27:15,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:27:15,496 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 113 transitions. [2018-02-04 12:27:15,496 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-02-04 12:27:15,496 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2018-02-04 12:27:15,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-02-04 12:27:15,497 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:27:15,497 INFO L351 BasicCegarLoop]: trace histogram [26, 4, 4, 4, 4, 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] [2018-02-04 12:27:15,497 INFO L371 AbstractCegarLoop]: === Iteration 36 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 12:27:15,497 INFO L82 PathProgramCache]: Analyzing trace with hash 827137984, now seen corresponding path program 22 times [2018-02-04 12:27:15,497 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:27:15,497 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:27:15,497 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:27:15,497 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:27:15,498 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:27:15,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:27:15,506 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:27:15,769 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:27:15,769 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:27:15,855 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:27:15,860 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 12:27:16,433 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 12:27:16,433 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:27:16,437 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:27:16,649 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:27:16,667 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:27:16,667 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 58 [2018-02-04 12:27:16,667 INFO L409 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-02-04 12:27:16,667 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-02-04 12:27:16,668 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1247, Invalid=2059, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 12:27:16,668 INFO L87 Difference]: Start difference. First operand 109 states and 113 transitions. Second operand 58 states. [2018-02-04 12:27:16,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:27:16,725 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2018-02-04 12:27:16,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 12:27:16,725 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 104 [2018-02-04 12:27:16,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:27:16,726 INFO L225 Difference]: With dead ends: 112 [2018-02-04 12:27:16,726 INFO L226 Difference]: Without dead ends: 110 [2018-02-04 12:27:16,726 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1561 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1335, Invalid=2205, Unknown=0, NotChecked=0, Total=3540 [2018-02-04 12:27:16,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-02-04 12:27:16,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-02-04 12:27:16,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-02-04 12:27:16,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 114 transitions. [2018-02-04 12:27:16,728 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 114 transitions. Word has length 104 [2018-02-04 12:27:16,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:27:16,728 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 114 transitions. [2018-02-04 12:27:16,728 INFO L433 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-02-04 12:27:16,728 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 114 transitions. [2018-02-04 12:27:16,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-02-04 12:27:16,728 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:27:16,728 INFO L351 BasicCegarLoop]: trace histogram [27, 4, 4, 4, 4, 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] [2018-02-04 12:27:16,728 INFO L371 AbstractCegarLoop]: === Iteration 37 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 12:27:16,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1404176403, now seen corresponding path program 23 times [2018-02-04 12:27:16,729 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:27:16,729 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:27:16,729 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:27:16,729 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:27:16,729 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:27:16,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:27:16,743 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:27:17,051 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:27:17,051 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:27:17,051 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:27:17,056 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 12:27:17,316 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2018-02-04 12:27:17,316 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:27:17,320 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:27:17,523 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:27:17,541 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:27:17,541 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 60 [2018-02-04 12:27:17,541 INFO L409 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-02-04 12:27:17,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-02-04 12:27:17,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1335, Invalid=2205, Unknown=0, NotChecked=0, Total=3540 [2018-02-04 12:27:17,542 INFO L87 Difference]: Start difference. First operand 110 states and 114 transitions. Second operand 60 states. [2018-02-04 12:27:17,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:27:17,605 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2018-02-04 12:27:17,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 12:27:17,623 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 105 [2018-02-04 12:27:17,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:27:17,623 INFO L225 Difference]: With dead ends: 113 [2018-02-04 12:27:17,623 INFO L226 Difference]: Without dead ends: 111 [2018-02-04 12:27:17,624 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1675 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1426, Invalid=2356, Unknown=0, NotChecked=0, Total=3782 [2018-02-04 12:27:17,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-04 12:27:17,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-02-04 12:27:17,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-02-04 12:27:17,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2018-02-04 12:27:17,626 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 105 [2018-02-04 12:27:17,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:27:17,627 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2018-02-04 12:27:17,627 INFO L433 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-02-04 12:27:17,627 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2018-02-04 12:27:17,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-02-04 12:27:17,627 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:27:17,627 INFO L351 BasicCegarLoop]: trace histogram [28, 4, 4, 4, 4, 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] [2018-02-04 12:27:17,627 INFO L371 AbstractCegarLoop]: === Iteration 38 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 12:27:17,628 INFO L82 PathProgramCache]: Analyzing trace with hash 2112498208, now seen corresponding path program 24 times [2018-02-04 12:27:17,628 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:27:17,628 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:27:17,628 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:27:17,628 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:27:17,629 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:27:17,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:27:17,643 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:27:18,034 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:27:18,035 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:27:18,035 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:27:18,040 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 12:27:23,760 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2018-02-04 12:27:23,760 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:27:23,767 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:27:24,024 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:27:24,045 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:27:24,045 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 62 [2018-02-04 12:27:24,045 INFO L409 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-02-04 12:27:24,046 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-02-04 12:27:24,046 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1426, Invalid=2356, Unknown=0, NotChecked=0, Total=3782 [2018-02-04 12:27:24,046 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand 62 states. [2018-02-04 12:27:24,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:27:24,202 INFO L93 Difference]: Finished difference Result 114 states and 118 transitions. [2018-02-04 12:27:24,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 12:27:24,202 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 106 [2018-02-04 12:27:24,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:27:24,203 INFO L225 Difference]: With dead ends: 114 [2018-02-04 12:27:24,203 INFO L226 Difference]: Without dead ends: 112 [2018-02-04 12:27:24,203 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1793 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1520, Invalid=2512, Unknown=0, NotChecked=0, Total=4032 [2018-02-04 12:27:24,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-04 12:27:24,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-02-04 12:27:24,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-04 12:27:24,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 116 transitions. [2018-02-04 12:27:24,205 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 116 transitions. Word has length 106 [2018-02-04 12:27:24,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:27:24,206 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 116 transitions. [2018-02-04 12:27:24,206 INFO L433 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-02-04 12:27:24,206 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 116 transitions. [2018-02-04 12:27:24,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-02-04 12:27:24,206 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:27:24,207 INFO L351 BasicCegarLoop]: trace histogram [29, 4, 4, 4, 4, 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] [2018-02-04 12:27:24,207 INFO L371 AbstractCegarLoop]: === Iteration 39 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 12:27:24,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1699329613, now seen corresponding path program 25 times [2018-02-04 12:27:24,207 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:27:24,207 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:27:24,207 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:27:24,207 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:27:24,207 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:27:24,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:27:24,217 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:27:24,568 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:27:24,568 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:27:24,568 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:27:24,573 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:27:24,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:27:24,604 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:27:24,894 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:27:24,911 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:27:24,911 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 64 [2018-02-04 12:27:24,911 INFO L409 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-02-04 12:27:24,911 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-02-04 12:27:24,912 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1520, Invalid=2512, Unknown=0, NotChecked=0, Total=4032 [2018-02-04 12:27:24,912 INFO L87 Difference]: Start difference. First operand 112 states and 116 transitions. Second operand 64 states. [2018-02-04 12:27:25,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:27:25,006 INFO L93 Difference]: Finished difference Result 115 states and 119 transitions. [2018-02-04 12:27:25,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 12:27:25,007 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 107 [2018-02-04 12:27:25,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:27:25,007 INFO L225 Difference]: With dead ends: 115 [2018-02-04 12:27:25,008 INFO L226 Difference]: Without dead ends: 113 [2018-02-04 12:27:25,008 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1915 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1617, Invalid=2673, Unknown=0, NotChecked=0, Total=4290 [2018-02-04 12:27:25,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-04 12:27:25,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-02-04 12:27:25,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-04 12:27:25,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 117 transitions. [2018-02-04 12:27:25,011 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 117 transitions. Word has length 107 [2018-02-04 12:27:25,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:27:25,011 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 117 transitions. [2018-02-04 12:27:25,011 INFO L433 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-02-04 12:27:25,011 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2018-02-04 12:27:25,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-02-04 12:27:25,012 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:27:25,012 INFO L351 BasicCegarLoop]: trace histogram [30, 4, 4, 4, 4, 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] [2018-02-04 12:27:25,012 INFO L371 AbstractCegarLoop]: === Iteration 40 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 12:27:25,012 INFO L82 PathProgramCache]: Analyzing trace with hash 393092224, now seen corresponding path program 26 times [2018-02-04 12:27:25,012 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:27:25,012 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:27:25,013 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:27:25,013 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:27:25,013 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:27:25,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:27:25,027 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:27:25,487 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:27:25,488 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:27:25,488 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:27:25,493 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:27:25,530 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:27:25,530 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:27:25,532 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:27:25,845 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:27:25,862 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:27:25,862 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 66 [2018-02-04 12:27:25,862 INFO L409 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-02-04 12:27:25,863 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-02-04 12:27:25,863 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1617, Invalid=2673, Unknown=0, NotChecked=0, Total=4290 [2018-02-04 12:27:25,863 INFO L87 Difference]: Start difference. First operand 113 states and 117 transitions. Second operand 66 states. [2018-02-04 12:27:25,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:27:25,937 INFO L93 Difference]: Finished difference Result 116 states and 120 transitions. [2018-02-04 12:27:25,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 12:27:25,937 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 108 [2018-02-04 12:27:25,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:27:25,937 INFO L225 Difference]: With dead ends: 116 [2018-02-04 12:27:25,937 INFO L226 Difference]: Without dead ends: 114 [2018-02-04 12:27:25,938 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2041 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1717, Invalid=2839, Unknown=0, NotChecked=0, Total=4556 [2018-02-04 12:27:25,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-02-04 12:27:25,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-02-04 12:27:25,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-04 12:27:25,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 118 transitions. [2018-02-04 12:27:25,939 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 118 transitions. Word has length 108 [2018-02-04 12:27:25,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:27:25,939 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 118 transitions. [2018-02-04 12:27:25,939 INFO L433 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-02-04 12:27:25,940 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 118 transitions. [2018-02-04 12:27:25,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-02-04 12:27:25,940 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:27:25,940 INFO L351 BasicCegarLoop]: trace histogram [31, 4, 4, 4, 4, 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] [2018-02-04 12:27:25,940 INFO L371 AbstractCegarLoop]: === Iteration 41 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 12:27:25,940 INFO L82 PathProgramCache]: Analyzing trace with hash 833659731, now seen corresponding path program 27 times [2018-02-04 12:27:25,940 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:27:25,940 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:27:25,941 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:27:25,941 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:27:25,941 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:27:25,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:27:25,950 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:27:26,403 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:27:26,404 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:27:26,404 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:27:26,408 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 12:27:36,435 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-02-04 12:27:36,436 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:27:36,449 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:27:36,736 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:27:36,771 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:27:36,771 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 68 [2018-02-04 12:27:36,772 INFO L409 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-02-04 12:27:36,772 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-02-04 12:27:36,773 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1717, Invalid=2839, Unknown=0, NotChecked=0, Total=4556 [2018-02-04 12:27:36,773 INFO L87 Difference]: Start difference. First operand 114 states and 118 transitions. Second operand 68 states. [2018-02-04 12:27:36,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:27:36,826 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2018-02-04 12:27:36,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 12:27:36,826 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 109 [2018-02-04 12:27:36,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:27:36,827 INFO L225 Difference]: With dead ends: 117 [2018-02-04 12:27:36,827 INFO L226 Difference]: Without dead ends: 115 [2018-02-04 12:27:36,827 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2171 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1820, Invalid=3010, Unknown=0, NotChecked=0, Total=4830 [2018-02-04 12:27:36,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-04 12:27:36,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-02-04 12:27:36,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-04 12:27:36,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 119 transitions. [2018-02-04 12:27:36,829 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 119 transitions. Word has length 109 [2018-02-04 12:27:36,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:27:36,829 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 119 transitions. [2018-02-04 12:27:36,829 INFO L433 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-02-04 12:27:36,829 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2018-02-04 12:27:36,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-02-04 12:27:36,830 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:27:36,830 INFO L351 BasicCegarLoop]: trace histogram [32, 4, 4, 4, 4, 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] [2018-02-04 12:27:36,830 INFO L371 AbstractCegarLoop]: === Iteration 42 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 12:27:36,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1606350560, now seen corresponding path program 28 times [2018-02-04 12:27:36,830 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:27:36,830 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:27:36,830 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:27:36,830 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:27:36,831 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:27:36,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:27:36,841 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:27:37,266 INFO L134 CoverageAnalysis]: Checked inductivity of 582 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:27:37,266 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:27:37,300 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:27:37,305 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 12:27:39,670 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 12:27:39,670 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:27:39,676 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:27:40,008 INFO L134 CoverageAnalysis]: Checked inductivity of 582 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:27:40,041 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:27:40,041 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 70 [2018-02-04 12:27:40,041 INFO L409 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-02-04 12:27:40,042 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-02-04 12:27:40,042 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1820, Invalid=3010, Unknown=0, NotChecked=0, Total=4830 [2018-02-04 12:27:40,042 INFO L87 Difference]: Start difference. First operand 115 states and 119 transitions. Second operand 70 states. [2018-02-04 12:27:40,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:27:40,127 INFO L93 Difference]: Finished difference Result 118 states and 122 transitions. [2018-02-04 12:27:40,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-04 12:27:40,127 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 110 [2018-02-04 12:27:40,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:27:40,127 INFO L225 Difference]: With dead ends: 118 [2018-02-04 12:27:40,128 INFO L226 Difference]: Without dead ends: 116 [2018-02-04 12:27:40,128 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2305 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1926, Invalid=3186, Unknown=0, NotChecked=0, Total=5112 [2018-02-04 12:27:40,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-04 12:27:40,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-02-04 12:27:40,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-04 12:27:40,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 120 transitions. [2018-02-04 12:27:40,129 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 120 transitions. Word has length 110 [2018-02-04 12:27:40,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:27:40,129 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 120 transitions. [2018-02-04 12:27:40,129 INFO L433 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-02-04 12:27:40,129 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 120 transitions. [2018-02-04 12:27:40,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-02-04 12:27:40,130 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:27:40,130 INFO L351 BasicCegarLoop]: trace histogram [33, 4, 4, 4, 4, 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] [2018-02-04 12:27:40,130 INFO L371 AbstractCegarLoop]: === Iteration 43 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 12:27:40,130 INFO L82 PathProgramCache]: Analyzing trace with hash -210037517, now seen corresponding path program 29 times [2018-02-04 12:27:40,130 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:27:40,130 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:27:40,130 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:27:40,130 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:27:40,130 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:27:40,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:27:40,140 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:27:40,552 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:27:40,552 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:27:40,553 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:27:40,557 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 12:27:40,968 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-02-04 12:27:40,968 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:27:40,973 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:27:41,345 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:27:41,364 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:27:41,364 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 72 [2018-02-04 12:27:41,364 INFO L409 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-02-04 12:27:41,364 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-02-04 12:27:41,365 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1926, Invalid=3186, Unknown=0, NotChecked=0, Total=5112 [2018-02-04 12:27:41,365 INFO L87 Difference]: Start difference. First operand 116 states and 120 transitions. Second operand 72 states. [2018-02-04 12:27:41,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:27:41,457 INFO L93 Difference]: Finished difference Result 119 states and 123 transitions. [2018-02-04 12:27:41,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 12:27:41,458 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 111 [2018-02-04 12:27:41,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:27:41,458 INFO L225 Difference]: With dead ends: 119 [2018-02-04 12:27:41,458 INFO L226 Difference]: Without dead ends: 117 [2018-02-04 12:27:41,459 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2443 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=2035, Invalid=3367, Unknown=0, NotChecked=0, Total=5402 [2018-02-04 12:27:41,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-02-04 12:27:41,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-02-04 12:27:41,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-04 12:27:41,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 121 transitions. [2018-02-04 12:27:41,461 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 121 transitions. Word has length 111 [2018-02-04 12:27:41,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:27:41,461 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 121 transitions. [2018-02-04 12:27:41,461 INFO L433 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-02-04 12:27:41,461 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2018-02-04 12:27:41,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-02-04 12:27:41,461 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:27:41,462 INFO L351 BasicCegarLoop]: trace histogram [34, 4, 4, 4, 4, 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] [2018-02-04 12:27:41,462 INFO L371 AbstractCegarLoop]: === Iteration 44 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 12:27:41,462 INFO L82 PathProgramCache]: Analyzing trace with hash -683493056, now seen corresponding path program 30 times [2018-02-04 12:27:41,462 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:27:41,462 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:27:41,462 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:27:41,462 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:27:41,463 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:27:41,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:27:41,475 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:27:41,881 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:27:41,881 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:27:41,881 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:27:41,885 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 12:28:21,634 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2018-02-04 12:28:21,634 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:28:21,660 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:28:22,004 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:28:22,031 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:28:22,031 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 74 [2018-02-04 12:28:22,032 INFO L409 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-02-04 12:28:22,032 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-02-04 12:28:22,032 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2035, Invalid=3367, Unknown=0, NotChecked=0, Total=5402 [2018-02-04 12:28:22,032 INFO L87 Difference]: Start difference. First operand 117 states and 121 transitions. Second operand 74 states. [2018-02-04 12:28:22,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:28:22,108 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2018-02-04 12:28:22,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 12:28:22,109 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 112 [2018-02-04 12:28:22,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:28:22,109 INFO L225 Difference]: With dead ends: 120 [2018-02-04 12:28:22,109 INFO L226 Difference]: Without dead ends: 118 [2018-02-04 12:28:22,109 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2585 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=2147, Invalid=3553, Unknown=0, NotChecked=0, Total=5700 [2018-02-04 12:28:22,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-02-04 12:28:22,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-02-04 12:28:22,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-02-04 12:28:22,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 122 transitions. [2018-02-04 12:28:22,112 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 122 transitions. Word has length 112 [2018-02-04 12:28:22,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:28:22,112 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 122 transitions. [2018-02-04 12:28:22,112 INFO L433 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-02-04 12:28:22,112 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 122 transitions. [2018-02-04 12:28:22,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-02-04 12:28:22,113 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:28:22,113 INFO L351 BasicCegarLoop]: trace histogram [35, 4, 4, 4, 4, 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] [2018-02-04 12:28:22,113 INFO L371 AbstractCegarLoop]: === Iteration 45 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 12:28:22,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1819254419, now seen corresponding path program 31 times [2018-02-04 12:28:22,113 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:28:22,113 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:28:22,113 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:28:22,113 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:28:22,113 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:28:22,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:28:22,127 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:28:22,532 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:28:22,532 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:28:22,532 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:28:22,538 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:28:22,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:28:22,563 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:28:22,875 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:28:22,891 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:28:22,892 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 76 [2018-02-04 12:28:22,892 INFO L409 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-02-04 12:28:22,892 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-02-04 12:28:22,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2147, Invalid=3553, Unknown=0, NotChecked=0, Total=5700 [2018-02-04 12:28:22,892 INFO L87 Difference]: Start difference. First operand 118 states and 122 transitions. Second operand 76 states. [2018-02-04 12:28:22,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:28:22,941 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2018-02-04 12:28:22,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-04 12:28:22,941 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 113 [2018-02-04 12:28:22,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:28:22,942 INFO L225 Difference]: With dead ends: 121 [2018-02-04 12:28:22,942 INFO L226 Difference]: Without dead ends: 119 [2018-02-04 12:28:22,942 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2731 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=2262, Invalid=3744, Unknown=0, NotChecked=0, Total=6006 [2018-02-04 12:28:22,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-04 12:28:22,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-02-04 12:28:22,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-04 12:28:22,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2018-02-04 12:28:22,943 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 113 [2018-02-04 12:28:22,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:28:22,943 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2018-02-04 12:28:22,943 INFO L433 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-02-04 12:28:22,943 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2018-02-04 12:28:22,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-02-04 12:28:22,944 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:28:22,944 INFO L351 BasicCegarLoop]: trace histogram [36, 4, 4, 4, 4, 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] [2018-02-04 12:28:22,944 INFO L371 AbstractCegarLoop]: === Iteration 46 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 12:28:22,944 INFO L82 PathProgramCache]: Analyzing trace with hash 2095014816, now seen corresponding path program 32 times [2018-02-04 12:28:22,944 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:28:22,944 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:28:22,945 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:28:22,945 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:28:22,945 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:28:22,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:28:22,955 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:28:23,351 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:28:23,351 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:28:23,351 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:28:23,356 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:28:23,385 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:28:23,385 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:28:23,387 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:28:23,729 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:28:23,747 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:28:23,747 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 78 [2018-02-04 12:28:23,747 INFO L409 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-02-04 12:28:23,747 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-02-04 12:28:23,748 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2262, Invalid=3744, Unknown=0, NotChecked=0, Total=6006 [2018-02-04 12:28:23,748 INFO L87 Difference]: Start difference. First operand 119 states and 123 transitions. Second operand 78 states. [2018-02-04 12:28:23,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:28:23,806 INFO L93 Difference]: Finished difference Result 122 states and 126 transitions. [2018-02-04 12:28:23,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 12:28:23,807 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 114 [2018-02-04 12:28:23,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:28:23,807 INFO L225 Difference]: With dead ends: 122 [2018-02-04 12:28:23,807 INFO L226 Difference]: Without dead ends: 120 [2018-02-04 12:28:23,808 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2881 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=2380, Invalid=3940, Unknown=0, NotChecked=0, Total=6320 [2018-02-04 12:28:23,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-04 12:28:23,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-02-04 12:28:23,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-02-04 12:28:23,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 124 transitions. [2018-02-04 12:28:23,810 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 124 transitions. Word has length 114 [2018-02-04 12:28:23,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:28:23,810 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 124 transitions. [2018-02-04 12:28:23,810 INFO L433 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-02-04 12:28:23,810 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 124 transitions. [2018-02-04 12:28:23,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-02-04 12:28:23,811 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:28:23,811 INFO L351 BasicCegarLoop]: trace histogram [37, 4, 4, 4, 4, 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] [2018-02-04 12:28:23,811 INFO L371 AbstractCegarLoop]: === Iteration 47 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 12:28:23,811 INFO L82 PathProgramCache]: Analyzing trace with hash 2053652531, now seen corresponding path program 33 times [2018-02-04 12:28:23,811 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:28:23,811 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:28:23,812 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:28:23,812 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:28:23,812 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:28:23,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:28:23,826 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:28:24,250 INFO L134 CoverageAnalysis]: Checked inductivity of 757 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:28:24,250 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:28:24,280 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:28:24,284 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 12:28:53,617 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-02-04 12:28:53,617 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:28:53,641 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:28:53,992 INFO L134 CoverageAnalysis]: Checked inductivity of 757 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:28:54,015 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:28:54,015 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 80 [2018-02-04 12:28:54,015 INFO L409 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-02-04 12:28:54,016 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-02-04 12:28:54,016 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2380, Invalid=3940, Unknown=0, NotChecked=0, Total=6320 [2018-02-04 12:28:54,016 INFO L87 Difference]: Start difference. First operand 120 states and 124 transitions. Second operand 80 states. [2018-02-04 12:28:54,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:28:54,090 INFO L93 Difference]: Finished difference Result 123 states and 127 transitions. [2018-02-04 12:28:54,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 12:28:54,090 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 115 [2018-02-04 12:28:54,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:28:54,091 INFO L225 Difference]: With dead ends: 123 [2018-02-04 12:28:54,091 INFO L226 Difference]: Without dead ends: 121 [2018-02-04 12:28:54,092 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3035 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=2501, Invalid=4141, Unknown=0, NotChecked=0, Total=6642 [2018-02-04 12:28:54,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-04 12:28:54,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-02-04 12:28:54,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-02-04 12:28:54,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 125 transitions. [2018-02-04 12:28:54,094 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 125 transitions. Word has length 115 [2018-02-04 12:28:54,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:28:54,094 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 125 transitions. [2018-02-04 12:28:54,095 INFO L433 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-02-04 12:28:54,095 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2018-02-04 12:28:54,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-02-04 12:28:54,095 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:28:54,095 INFO L351 BasicCegarLoop]: trace histogram [38, 4, 4, 4, 4, 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] [2018-02-04 12:28:54,095 INFO L371 AbstractCegarLoop]: === Iteration 48 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 12:28:54,096 INFO L82 PathProgramCache]: Analyzing trace with hash 771421696, now seen corresponding path program 34 times [2018-02-04 12:28:54,096 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:28:54,096 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:28:54,096 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:28:54,096 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:28:54,097 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:28:54,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:28:54,116 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:28:54,612 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:28:54,633 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:28:54,633 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:28:54,638 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 12:29:02,639 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 12:29:02,639 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:29:02,652 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:29:03,111 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:29:03,135 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:29:03,135 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 82 [2018-02-04 12:29:03,136 INFO L409 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-02-04 12:29:03,136 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-02-04 12:29:03,136 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2501, Invalid=4141, Unknown=0, NotChecked=0, Total=6642 [2018-02-04 12:29:03,137 INFO L87 Difference]: Start difference. First operand 121 states and 125 transitions. Second operand 82 states. [2018-02-04 12:29:03,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:29:03,212 INFO L93 Difference]: Finished difference Result 124 states and 128 transitions. [2018-02-04 12:29:03,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-04 12:29:03,212 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 116 [2018-02-04 12:29:03,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:29:03,213 INFO L225 Difference]: With dead ends: 124 [2018-02-04 12:29:03,213 INFO L226 Difference]: Without dead ends: 122 [2018-02-04 12:29:03,214 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3193 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2625, Invalid=4347, Unknown=0, NotChecked=0, Total=6972 [2018-02-04 12:29:03,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-02-04 12:29:03,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-02-04 12:29:03,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-04 12:29:03,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 126 transitions. [2018-02-04 12:29:03,216 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 126 transitions. Word has length 116 [2018-02-04 12:29:03,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:29:03,217 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 126 transitions. [2018-02-04 12:29:03,217 INFO L433 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-02-04 12:29:03,217 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 126 transitions. [2018-02-04 12:29:03,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-02-04 12:29:03,217 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:29:03,218 INFO L351 BasicCegarLoop]: trace histogram [39, 4, 4, 4, 4, 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] [2018-02-04 12:29:03,218 INFO L371 AbstractCegarLoop]: === Iteration 49 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 12:29:03,218 INFO L82 PathProgramCache]: Analyzing trace with hash -323028525, now seen corresponding path program 35 times [2018-02-04 12:29:03,218 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:29:03,218 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:29:03,219 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:29:03,219 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:29:03,219 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:29:03,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:29:03,233 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:29:03,780 INFO L134 CoverageAnalysis]: Checked inductivity of 834 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:29:03,781 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:29:03,781 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:29:03,785 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 12:29:04,637 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2018-02-04 12:29:04,637 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:29:04,642 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:29:05,049 INFO L134 CoverageAnalysis]: Checked inductivity of 834 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:29:05,070 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:29:05,070 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 84 [2018-02-04 12:29:05,070 INFO L409 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-02-04 12:29:05,071 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-02-04 12:29:05,071 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2625, Invalid=4347, Unknown=0, NotChecked=0, Total=6972 [2018-02-04 12:29:05,071 INFO L87 Difference]: Start difference. First operand 122 states and 126 transitions. Second operand 84 states. [2018-02-04 12:29:05,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:29:05,162 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2018-02-04 12:29:05,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-04 12:29:05,162 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 117 [2018-02-04 12:29:05,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:29:05,163 INFO L225 Difference]: With dead ends: 125 [2018-02-04 12:29:05,163 INFO L226 Difference]: Without dead ends: 123 [2018-02-04 12:29:05,163 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3355 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2752, Invalid=4558, Unknown=0, NotChecked=0, Total=7310 [2018-02-04 12:29:05,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-02-04 12:29:05,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-02-04 12:29:05,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-04 12:29:05,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 127 transitions. [2018-02-04 12:29:05,165 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 127 transitions. Word has length 117 [2018-02-04 12:29:05,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:29:05,165 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 127 transitions. [2018-02-04 12:29:05,165 INFO L433 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-02-04 12:29:05,165 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 127 transitions. [2018-02-04 12:29:05,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-02-04 12:29:05,165 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:29:05,165 INFO L351 BasicCegarLoop]: trace histogram [40, 4, 4, 4, 4, 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] [2018-02-04 12:29:05,165 INFO L371 AbstractCegarLoop]: === Iteration 50 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 12:29:05,165 INFO L82 PathProgramCache]: Analyzing trace with hash 108752992, now seen corresponding path program 36 times [2018-02-04 12:29:05,165 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:29:05,165 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:29:05,166 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:29:05,166 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:29:05,166 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:29:05,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:29:05,178 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:29:05,704 INFO L134 CoverageAnalysis]: Checked inductivity of 874 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:29:05,704 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:29:05,704 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:29:05,710 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 12:29:59,585 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2018-02-04 12:29:59,585 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:29:59,616 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:30:00,131 INFO L134 CoverageAnalysis]: Checked inductivity of 874 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:30:00,158 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:30:00,158 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 86 [2018-02-04 12:30:00,158 INFO L409 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-02-04 12:30:00,159 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-02-04 12:30:00,159 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2752, Invalid=4558, Unknown=0, NotChecked=0, Total=7310 [2018-02-04 12:30:00,159 INFO L87 Difference]: Start difference. First operand 123 states and 127 transitions. Second operand 86 states. [2018-02-04 12:30:00,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:30:00,238 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2018-02-04 12:30:00,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-04 12:30:00,238 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 118 [2018-02-04 12:30:00,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:30:00,239 INFO L225 Difference]: With dead ends: 126 [2018-02-04 12:30:00,239 INFO L226 Difference]: Without dead ends: 124 [2018-02-04 12:30:00,239 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3521 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2882, Invalid=4774, Unknown=0, NotChecked=0, Total=7656 [2018-02-04 12:30:00,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-04 12:30:00,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-02-04 12:30:00,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-04 12:30:00,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 128 transitions. [2018-02-04 12:30:00,241 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 128 transitions. Word has length 118 [2018-02-04 12:30:00,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:30:00,241 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 128 transitions. [2018-02-04 12:30:00,241 INFO L433 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-02-04 12:30:00,241 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 128 transitions. [2018-02-04 12:30:00,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-02-04 12:30:00,241 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:30:00,241 INFO L351 BasicCegarLoop]: trace histogram [41, 4, 4, 4, 4, 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] [2018-02-04 12:30:00,241 INFO L371 AbstractCegarLoop]: === Iteration 51 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 12:30:00,242 INFO L82 PathProgramCache]: Analyzing trace with hash 609078131, now seen corresponding path program 37 times [2018-02-04 12:30:00,242 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:30:00,242 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:30:00,242 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:00,242 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:30:00,242 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:00,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:30:00,258 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:30:01,086 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:30:01,086 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:30:01,086 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:30:01,091 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:30:01,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:30:01,126 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:30:01,921 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:30:01,938 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:30:01,938 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 88 [2018-02-04 12:30:01,939 INFO L409 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-02-04 12:30:01,939 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-02-04 12:30:01,939 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2882, Invalid=4774, Unknown=0, NotChecked=0, Total=7656 [2018-02-04 12:30:01,939 INFO L87 Difference]: Start difference. First operand 124 states and 128 transitions. Second operand 88 states. [2018-02-04 12:30:02,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:30:02,034 INFO L93 Difference]: Finished difference Result 127 states and 131 transitions. [2018-02-04 12:30:02,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-04 12:30:02,035 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 119 [2018-02-04 12:30:02,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:30:02,036 INFO L225 Difference]: With dead ends: 127 [2018-02-04 12:30:02,036 INFO L226 Difference]: Without dead ends: 125 [2018-02-04 12:30:02,036 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3691 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=3015, Invalid=4995, Unknown=0, NotChecked=0, Total=8010 [2018-02-04 12:30:02,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-04 12:30:02,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-02-04 12:30:02,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-04 12:30:02,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 129 transitions. [2018-02-04 12:30:02,037 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 129 transitions. Word has length 119 [2018-02-04 12:30:02,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:30:02,038 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 129 transitions. [2018-02-04 12:30:02,038 INFO L433 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-02-04 12:30:02,038 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2018-02-04 12:30:02,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-02-04 12:30:02,038 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:30:02,038 INFO L351 BasicCegarLoop]: trace histogram [42, 4, 4, 4, 4, 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] [2018-02-04 12:30:02,038 INFO L371 AbstractCegarLoop]: === Iteration 52 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 12:30:02,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1060711744, now seen corresponding path program 38 times [2018-02-04 12:30:02,038 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:30:02,038 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:30:02,039 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:02,039 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:30:02,039 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:02,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:30:02,057 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:30:02,834 INFO L134 CoverageAnalysis]: Checked inductivity of 957 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:30:02,834 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:30:02,834 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:30:02,839 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:30:02,877 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:30:02,877 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:30:02,880 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:30:03,423 INFO L134 CoverageAnalysis]: Checked inductivity of 957 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:30:03,440 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:30:03,440 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 90 [2018-02-04 12:30:03,440 INFO L409 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-02-04 12:30:03,441 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-02-04 12:30:03,441 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3015, Invalid=4995, Unknown=0, NotChecked=0, Total=8010 [2018-02-04 12:30:03,441 INFO L87 Difference]: Start difference. First operand 125 states and 129 transitions. Second operand 90 states. [2018-02-04 12:30:03,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:30:03,506 INFO L93 Difference]: Finished difference Result 128 states and 132 transitions. [2018-02-04 12:30:03,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-04 12:30:03,506 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 120 [2018-02-04 12:30:03,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:30:03,507 INFO L225 Difference]: With dead ends: 128 [2018-02-04 12:30:03,507 INFO L226 Difference]: Without dead ends: 126 [2018-02-04 12:30:03,507 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3865 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=3151, Invalid=5221, Unknown=0, NotChecked=0, Total=8372 [2018-02-04 12:30:03,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-04 12:30:03,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-02-04 12:30:03,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-04 12:30:03,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 130 transitions. [2018-02-04 12:30:03,509 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 130 transitions. Word has length 120 [2018-02-04 12:30:03,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:30:03,509 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 130 transitions. [2018-02-04 12:30:03,509 INFO L433 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-02-04 12:30:03,510 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 130 transitions. [2018-02-04 12:30:03,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-02-04 12:30:03,510 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:30:03,510 INFO L351 BasicCegarLoop]: trace histogram [43, 4, 4, 4, 4, 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] [2018-02-04 12:30:03,510 INFO L371 AbstractCegarLoop]: === Iteration 53 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 12:30:03,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1284590317, now seen corresponding path program 39 times [2018-02-04 12:30:03,511 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:30:03,511 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:30:03,511 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:03,511 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:30:03,511 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:30:03,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:30:03,533 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:30:04,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1000 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 12:30:04,227 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:30:04,227 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:30:04,231 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown