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/cav18-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-26d9e06-m [2018-02-02 08:52:55,655 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 08:52:55,656 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 08:52:55,668 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 08:52:55,669 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 08:52:55,669 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 08:52:55,670 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 08:52:55,672 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 08:52:55,673 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 08:52:55,674 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 08:52:55,674 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 08:52:55,674 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 08:52:55,675 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 08:52:55,676 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 08:52:55,677 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 08:52:55,678 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 08:52:55,680 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 08:52:55,682 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 08:52:55,683 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 08:52:55,684 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 08:52:55,686 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 08:52:55,686 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 08:52:55,686 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 08:52:55,687 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 08:52:55,688 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 08:52:55,688 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 08:52:55,689 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 08:52:55,689 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 08:52:55,689 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 08:52:55,690 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 08:52:55,690 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 08:52:55,690 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-02 08:52:55,700 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 08:52:55,701 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 08:52:55,702 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 08:52:55,702 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 08:52:55,702 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 08:52:55,702 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 08:52:55,703 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 08:52:55,703 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 08:52:55,703 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 08:52:55,703 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 08:52:55,703 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 08:52:55,703 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 08:52:55,704 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 08:52:55,704 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 08:52:55,704 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 08:52:55,704 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 08:52:55,704 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 08:52:55,704 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 08:52:55,705 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 08:52:55,705 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 08:52:55,705 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 08:52:55,705 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 08:52:55,705 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 08:52:55,705 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 08:52:55,706 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 08:52:55,739 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 08:52:55,750 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 08:52:55,753 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 08:52:55,754 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 08:52:55,755 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 08:52:55,755 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-02 08:52:55,922 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 08:52:55,924 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 08:52:55,924 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 08:52:55,924 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 08:52:55,930 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 08:52:55,931 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:52:55" (1/1) ... [2018-02-02 08:52:55,934 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14bcd178 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:52:55, skipping insertion in model container [2018-02-02 08:52:55,934 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:52:55" (1/1) ... [2018-02-02 08:52:55,944 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 08:52:55,972 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 08:52:56,069 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 08:52:56,083 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 08:52:56,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:52:56 WrapperNode [2018-02-02 08:52:56,088 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 08:52:56,088 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 08:52:56,088 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 08:52:56,088 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 08:52:56,097 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:52:56" (1/1) ... [2018-02-02 08:52:56,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:52:56" (1/1) ... [2018-02-02 08:52:56,106 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:52:56" (1/1) ... [2018-02-02 08:52:56,106 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:52:56" (1/1) ... [2018-02-02 08:52:56,109 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:52:56" (1/1) ... [2018-02-02 08:52:56,111 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:52:56" (1/1) ... [2018-02-02 08:52:56,112 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:52:56" (1/1) ... [2018-02-02 08:52:56,113 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 08:52:56,113 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 08:52:56,113 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 08:52:56,113 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 08:52:56,114 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:52:56" (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-02 08:52:56,148 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 08:52:56,148 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 08:52:56,148 INFO L136 BoogieDeclarations]: Found implementation of procedure Sum [2018-02-02 08:52:56,148 INFO L136 BoogieDeclarations]: Found implementation of procedure Sum2 [2018-02-02 08:52:56,148 INFO L136 BoogieDeclarations]: Found implementation of procedure dummy_abort [2018-02-02 08:52:56,148 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 08:52:56,148 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 08:52:56,148 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 08:52:56,148 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 08:52:56,149 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 08:52:56,149 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 08:52:56,149 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-02-02 08:52:56,149 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-02-02 08:52:56,149 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-02-02 08:52:56,149 INFO L128 BoogieDeclarations]: Found specification of procedure Sum [2018-02-02 08:52:56,149 INFO L128 BoogieDeclarations]: Found specification of procedure Sum2 [2018-02-02 08:52:56,149 INFO L128 BoogieDeclarations]: Found specification of procedure dummy_abort [2018-02-02 08:52:56,149 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 08:52:56,149 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 08:52:56,149 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 08:52:56,240 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-02 08:52:56,346 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 08:52:56,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:52:56 BoogieIcfgContainer [2018-02-02 08:52:56,347 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 08:52:56,348 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 08:52:56,348 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 08:52:56,350 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 08:52:56,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 08:52:55" (1/3) ... [2018-02-02 08:52:56,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d99ad55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:52:56, skipping insertion in model container [2018-02-02 08:52:56,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:52:56" (2/3) ... [2018-02-02 08:52:56,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d99ad55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:52:56, skipping insertion in model container [2018-02-02 08:52:56,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:52:56" (3/3) ... [2018-02-02 08:52:56,352 INFO L107 eAbstractionObserver]: Analyzing ICFG 20051113-1.c_false-valid-memtrack.i [2018-02-02 08:52:56,357 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 08:52:56,363 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 25 error locations. [2018-02-02 08:52:56,393 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 08:52:56,393 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 08:52:56,393 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 08:52:56,394 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 08:52:56,394 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 08:52:56,394 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 08:52:56,394 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 08:52:56,394 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 08:52:56,395 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 08:52:56,407 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2018-02-02 08:52:56,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 08:52:56,415 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:52:56,416 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:52:56,416 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-02 08:52:56,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1274877597, now seen corresponding path program 1 times [2018-02-02 08:52:56,421 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:52:56,421 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:52:56,452 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:52:56,453 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:52:56,453 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:52:56,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:52:56,485 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:52:56,531 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-02 08:52:56,533 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:52:56,533 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 08:52:56,534 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 08:52:56,543 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 08:52:56,543 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 08:52:56,545 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 4 states. [2018-02-02 08:52:56,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:52:56,721 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2018-02-02 08:52:56,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 08:52:56,722 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 08:52:56,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:52:56,728 INFO L225 Difference]: With dead ends: 72 [2018-02-02 08:52:56,728 INFO L226 Difference]: Without dead ends: 69 [2018-02-02 08:52:56,729 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-02 08:52:56,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-02 08:52:56,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-02-02 08:52:56,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-02 08:52:56,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2018-02-02 08:52:56,760 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 8 [2018-02-02 08:52:56,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:52:56,760 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2018-02-02 08:52:56,761 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 08:52:56,761 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2018-02-02 08:52:56,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 08:52:56,761 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:52:56,761 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:52:56,762 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-02 08:52:56,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1274877596, now seen corresponding path program 1 times [2018-02-02 08:52:56,762 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:52:56,762 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:52:56,763 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:52:56,763 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:52:56,764 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:52:56,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:52:56,777 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:52:56,838 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-02 08:52:56,838 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:52:56,839 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 08:52:56,840 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 08:52:56,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 08:52:56,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 08:52:56,841 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand 4 states. [2018-02-02 08:52:56,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:52:56,927 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2018-02-02 08:52:56,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 08:52:56,927 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 08:52:56,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:52:56,928 INFO L225 Difference]: With dead ends: 61 [2018-02-02 08:52:56,928 INFO L226 Difference]: Without dead ends: 61 [2018-02-02 08:52:56,929 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-02 08:52:56,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-02-02 08:52:56,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-02-02 08:52:56,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-02 08:52:56,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2018-02-02 08:52:56,935 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 8 [2018-02-02 08:52:56,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:52:56,935 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2018-02-02 08:52:56,935 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 08:52:56,935 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2018-02-02 08:52:56,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 08:52:56,936 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:52:56,936 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-02 08:52:56,936 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-02 08:52:56,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1852712777, now seen corresponding path program 1 times [2018-02-02 08:52:56,936 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:52:56,937 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:52:56,937 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:52:56,937 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:52:56,937 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:52:56,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:52:56,957 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:52:57,008 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-02 08:52:57,009 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:52:57,009 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 08:52:57,009 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 08:52:57,009 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 08:52:57,010 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 08:52:57,010 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand 5 states. [2018-02-02 08:52:57,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:52:57,094 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2018-02-02 08:52:57,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 08:52:57,095 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-02-02 08:52:57,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:52:57,096 INFO L225 Difference]: With dead ends: 59 [2018-02-02 08:52:57,096 INFO L226 Difference]: Without dead ends: 59 [2018-02-02 08:52:57,096 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-02 08:52:57,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-02 08:52:57,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-02-02 08:52:57,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-02-02 08:52:57,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2018-02-02 08:52:57,101 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 25 [2018-02-02 08:52:57,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:52:57,101 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2018-02-02 08:52:57,101 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 08:52:57,102 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2018-02-02 08:52:57,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 08:52:57,102 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:52:57,102 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-02 08:52:57,102 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-02 08:52:57,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1852712776, now seen corresponding path program 1 times [2018-02-02 08:52:57,103 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:52:57,103 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:52:57,104 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:52:57,104 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:52:57,104 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:52:57,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:52:57,121 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:52:57,191 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-02 08:52:57,191 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:52:57,192 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 08:52:57,192 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 08:52:57,192 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 08:52:57,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 08:52:57,193 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand 6 states. [2018-02-02 08:52:57,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:52:57,271 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2018-02-02 08:52:57,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 08:52:57,271 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-02-02 08:52:57,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:52:57,272 INFO L225 Difference]: With dead ends: 58 [2018-02-02 08:52:57,272 INFO L226 Difference]: Without dead ends: 58 [2018-02-02 08:52:57,272 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-02 08:52:57,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-02 08:52:57,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-02-02 08:52:57,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-02 08:52:57,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2018-02-02 08:52:57,275 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 25 [2018-02-02 08:52:57,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:52:57,275 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2018-02-02 08:52:57,275 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 08:52:57,275 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2018-02-02 08:52:57,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 08:52:57,276 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:52:57,276 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-02 08:52:57,276 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-02 08:52:57,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1954449657, now seen corresponding path program 1 times [2018-02-02 08:52:57,276 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:52:57,276 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:52:57,277 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:52:57,277 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:52:57,277 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:52:57,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:52:57,296 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:52:57,490 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-02 08:52:57,490 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:52:57,491 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 08:52:57,491 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 08:52:57,491 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 08:52:57,491 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 08:52:57,491 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand 9 states. [2018-02-02 08:52:57,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:52:57,705 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-02-02 08:52:57,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 08:52:57,705 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2018-02-02 08:52:57,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:52:57,706 INFO L225 Difference]: With dead ends: 64 [2018-02-02 08:52:57,706 INFO L226 Difference]: Without dead ends: 64 [2018-02-02 08:52:57,706 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-02 08:52:57,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-02 08:52:57,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2018-02-02 08:52:57,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-02 08:52:57,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2018-02-02 08:52:57,711 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 27 [2018-02-02 08:52:57,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:52:57,711 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2018-02-02 08:52:57,711 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 08:52:57,711 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2018-02-02 08:52:57,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 08:52:57,712 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:52:57,712 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-02 08:52:57,712 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-02 08:52:57,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1339860797, now seen corresponding path program 1 times [2018-02-02 08:52:57,712 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:52:57,712 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:52:57,713 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:52:57,713 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:52:57,713 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:52:57,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:52:57,728 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:52:57,834 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-02 08:52:57,834 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:52:57,834 INFO L209 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) [2018-02-02 08:52:57,842 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 08:52:57,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:52:57,873 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:52:57,914 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-02 08:52:57,940 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 08:52:57,940 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2018-02-02 08:52:57,940 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 08:52:57,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 08:52:57,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-02 08:52:57,941 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand 9 states. [2018-02-02 08:52:58,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:52:58,091 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2018-02-02 08:52:58,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 08:52:58,092 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-02-02 08:52:58,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:52:58,093 INFO L225 Difference]: With dead ends: 76 [2018-02-02 08:52:58,093 INFO L226 Difference]: Without dead ends: 74 [2018-02-02 08:52:58,094 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-02-02 08:52:58,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-02 08:52:58,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 69. [2018-02-02 08:52:58,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-02 08:52:58,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2018-02-02 08:52:58,098 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 33 [2018-02-02 08:52:58,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:52:58,098 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2018-02-02 08:52:58,098 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 08:52:58,098 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2018-02-02 08:52:58,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 08:52:58,098 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:52:58,099 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-02 08:52:58,099 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-02 08:52:58,099 INFO L82 PathProgramCache]: Analyzing trace with hash 919563422, now seen corresponding path program 1 times [2018-02-02 08:52:58,099 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:52:58,099 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:52:58,099 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:52:58,100 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:52:58,100 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:52:58,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:52:58,113 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:52:58,138 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-02 08:52:58,139 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:52:58,139 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 08:52:58,139 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 08:52:58,139 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 08:52:58,139 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 08:52:58,140 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand 5 states. [2018-02-02 08:52:58,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:52:58,186 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2018-02-02 08:52:58,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 08:52:58,187 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-02-02 08:52:58,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:52:58,188 INFO L225 Difference]: With dead ends: 67 [2018-02-02 08:52:58,188 INFO L226 Difference]: Without dead ends: 67 [2018-02-02 08:52:58,188 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-02 08:52:58,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-02 08:52:58,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-02-02 08:52:58,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-02 08:52:58,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-02-02 08:52:58,193 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 41 [2018-02-02 08:52:58,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:52:58,193 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-02-02 08:52:58,193 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 08:52:58,193 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-02-02 08:52:58,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 08:52:58,194 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:52:58,194 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-02 08:52:58,195 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-02 08:52:58,195 INFO L82 PathProgramCache]: Analyzing trace with hash 919563423, now seen corresponding path program 1 times [2018-02-02 08:52:58,195 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:52:58,195 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:52:58,196 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:52:58,196 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:52:58,196 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:52:58,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:52:58,213 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:52:58,277 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-02 08:52:58,277 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:52:58,277 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 08:52:58,278 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 08:52:58,278 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 08:52:58,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 08:52:58,278 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 6 states. [2018-02-02 08:52:58,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:52:58,355 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2018-02-02 08:52:58,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 08:52:58,356 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-02-02 08:52:58,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:52:58,357 INFO L225 Difference]: With dead ends: 66 [2018-02-02 08:52:58,357 INFO L226 Difference]: Without dead ends: 66 [2018-02-02 08:52:58,357 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-02 08:52:58,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-02 08:52:58,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-02-02 08:52:58,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-02 08:52:58,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2018-02-02 08:52:58,361 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 41 [2018-02-02 08:52:58,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:52:58,361 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2018-02-02 08:52:58,361 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 08:52:58,361 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2018-02-02 08:52:58,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 08:52:58,362 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:52:58,362 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-02 08:52:58,362 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-02 08:52:58,363 INFO L82 PathProgramCache]: Analyzing trace with hash -435672114, now seen corresponding path program 1 times [2018-02-02 08:52:58,363 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:52:58,363 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:52:58,363 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:52:58,363 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:52:58,364 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:52:58,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:52:58,375 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:52:58,510 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-02 08:52:58,510 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:52:58,510 INFO L209 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-02 08:52:58,517 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:52:58,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:52:58,540 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:52:58,567 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-02 08:52:58,595 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:52:58,595 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 11 [2018-02-02 08:52:58,596 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 08:52:58,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 08:52:58,596 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-02-02 08:52:58,596 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand 11 states. [2018-02-02 08:52:58,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:52:58,847 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2018-02-02 08:52:58,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 08:52:58,847 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 40 [2018-02-02 08:52:58,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:52:58,848 INFO L225 Difference]: With dead ends: 83 [2018-02-02 08:52:58,848 INFO L226 Difference]: Without dead ends: 81 [2018-02-02 08:52:58,848 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-02 08:52:58,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-02 08:52:58,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 73. [2018-02-02 08:52:58,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-02 08:52:58,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2018-02-02 08:52:58,853 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 40 [2018-02-02 08:52:58,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:52:58,854 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2018-02-02 08:52:58,854 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 08:52:58,854 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2018-02-02 08:52:58,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 08:52:58,855 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:52:58,855 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-02 08:52:58,855 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-02 08:52:58,855 INFO L82 PathProgramCache]: Analyzing trace with hash 2111534509, now seen corresponding path program 1 times [2018-02-02 08:52:58,855 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:52:58,855 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:52:58,856 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:52:58,856 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:52:58,856 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:52:58,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:52:58,867 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:52:59,036 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-02 08:52:59,036 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:52:59,037 INFO L209 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-02 08:52:59,042 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:52:59,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:52:59,062 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:52:59,095 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-02 08:52:59,116 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:52:59,116 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 16 [2018-02-02 08:52:59,116 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 08:52:59,116 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 08:52:59,116 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-02-02 08:52:59,116 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand 16 states. [2018-02-02 08:52:59,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:52:59,276 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2018-02-02 08:52:59,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 08:52:59,276 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 44 [2018-02-02 08:52:59,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:52:59,277 INFO L225 Difference]: With dead ends: 85 [2018-02-02 08:52:59,277 INFO L226 Difference]: Without dead ends: 83 [2018-02-02 08:52:59,277 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 41 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2018-02-02 08:52:59,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-02 08:52:59,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 78. [2018-02-02 08:52:59,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-02 08:52:59,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2018-02-02 08:52:59,280 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 44 [2018-02-02 08:52:59,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:52:59,280 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2018-02-02 08:52:59,281 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 08:52:59,281 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2018-02-02 08:52:59,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 08:52:59,282 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:52:59,282 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-02 08:52:59,282 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-02 08:52:59,282 INFO L82 PathProgramCache]: Analyzing trace with hash -763701070, now seen corresponding path program 2 times [2018-02-02 08:52:59,282 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:52:59,282 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:52:59,283 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:52:59,283 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:52:59,283 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:52:59,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:52:59,294 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:52:59,546 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-02 08:52:59,547 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:52:59,547 INFO L209 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-02 08:52:59,552 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 08:52:59,560 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:52:59,571 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:52:59,572 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:52:59,574 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:52:59,645 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-02 08:52:59,662 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:52:59,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 19 [2018-02-02 08:52:59,663 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 08:52:59,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 08:52:59,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-02-02 08:52:59,663 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand 19 states. [2018-02-02 08:52:59,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:52:59,939 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2018-02-02 08:52:59,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 08:52:59,939 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48 [2018-02-02 08:52:59,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:52:59,939 INFO L225 Difference]: With dead ends: 79 [2018-02-02 08:52:59,939 INFO L226 Difference]: Without dead ends: 77 [2018-02-02 08:52:59,940 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-02 08:52:59,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-02 08:52:59,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-02-02 08:52:59,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-02 08:52:59,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2018-02-02 08:52:59,942 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 48 [2018-02-02 08:52:59,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:52:59,942 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2018-02-02 08:52:59,942 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 08:52:59,942 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2018-02-02 08:52:59,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 08:52:59,943 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:52:59,943 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-02 08:52:59,943 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-02 08:52:59,943 INFO L82 PathProgramCache]: Analyzing trace with hash 2106198684, now seen corresponding path program 1 times [2018-02-02 08:52:59,943 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:52:59,943 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:52:59,944 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:52:59,944 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:52:59,944 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:52:59,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:52:59,953 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:52:59,997 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-02 08:52:59,998 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:52:59,998 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 08:52:59,998 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 08:52:59,998 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 08:52:59,998 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 08:52:59,999 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 5 states. [2018-02-02 08:53:00,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:53:00,014 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2018-02-02 08:53:00,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 08:53:00,015 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-02-02 08:53:00,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:53:00,016 INFO L225 Difference]: With dead ends: 83 [2018-02-02 08:53:00,016 INFO L226 Difference]: Without dead ends: 83 [2018-02-02 08:53:00,016 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-02 08:53:00,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-02 08:53:00,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2018-02-02 08:53:00,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-02 08:53:00,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2018-02-02 08:53:00,019 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 52 [2018-02-02 08:53:00,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:53:00,019 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2018-02-02 08:53:00,019 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 08:53:00,019 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2018-02-02 08:53:00,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 08:53:00,020 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:53:00,020 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-02 08:53:00,020 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-02 08:53:00,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1604645521, now seen corresponding path program 1 times [2018-02-02 08:53:00,021 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:53:00,021 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:53:00,021 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:53:00,021 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:53:00,022 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:53:00,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:53:00,031 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:53:00,315 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-02 08:53:00,316 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:53:00,316 INFO L209 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-02 08:53:00,325 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:53:00,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:53:00,350 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:53:00,407 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-02 08:53:00,439 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:53:00,439 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 19 [2018-02-02 08:53:00,439 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 08:53:00,439 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 08:53:00,440 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2018-02-02 08:53:00,440 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand 19 states. [2018-02-02 08:53:00,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:53:00,930 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2018-02-02 08:53:00,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 08:53:00,931 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 52 [2018-02-02 08:53:00,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:53:00,932 INFO L225 Difference]: With dead ends: 86 [2018-02-02 08:53:00,932 INFO L226 Difference]: Without dead ends: 84 [2018-02-02 08:53:00,932 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-02 08:53:00,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-02 08:53:00,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2018-02-02 08:53:00,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-02 08:53:00,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2018-02-02 08:53:00,936 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 52 [2018-02-02 08:53:00,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:53:00,936 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2018-02-02 08:53:00,936 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 08:53:00,936 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2018-02-02 08:53:00,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 08:53:00,940 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:53:00,940 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-02 08:53:00,940 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-02 08:53:00,940 INFO L82 PathProgramCache]: Analyzing trace with hash -544800124, now seen corresponding path program 1 times [2018-02-02 08:53:00,940 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:53:00,940 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:53:00,941 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:53:00,941 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:53:00,941 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:53:00,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:53:00,954 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:53:01,103 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-02 08:53:01,103 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:53:01,103 INFO L209 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-02 08:53:01,111 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:53:01,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:53:01,139 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:53:01,207 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-02 08:53:01,225 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:53:01,226 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-02-02 08:53:01,226 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 08:53:01,226 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 08:53:01,226 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-02-02 08:53:01,227 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 16 states. [2018-02-02 08:53:01,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:53:01,402 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2018-02-02 08:53:01,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 08:53:01,403 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2018-02-02 08:53:01,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:53:01,403 INFO L225 Difference]: With dead ends: 85 [2018-02-02 08:53:01,404 INFO L226 Difference]: Without dead ends: 80 [2018-02-02 08:53:01,405 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-02 08:53:01,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-02 08:53:01,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2018-02-02 08:53:01,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-02 08:53:01,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2018-02-02 08:53:01,412 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 56 [2018-02-02 08:53:01,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:53:01,412 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2018-02-02 08:53:01,412 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 08:53:01,412 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2018-02-02 08:53:01,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 08:53:01,414 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:53:01,414 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-02 08:53:01,414 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-02 08:53:01,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1454707584, now seen corresponding path program 1 times [2018-02-02 08:53:01,414 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:53:01,414 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:53:01,415 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:53:01,415 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:53:01,415 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:53:01,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:53:01,427 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:53:01,583 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-02 08:53:01,583 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:53:01,583 INFO L209 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-02 08:53:01,591 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:53:01,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:53:01,622 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:53:01,705 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-02 08:53:01,726 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:53:01,726 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2018-02-02 08:53:01,726 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 08:53:01,726 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 08:53:01,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2018-02-02 08:53:01,727 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand 17 states. [2018-02-02 08:53:01,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:53:01,890 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2018-02-02 08:53:01,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 08:53:01,890 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 60 [2018-02-02 08:53:01,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:53:01,891 INFO L225 Difference]: With dead ends: 92 [2018-02-02 08:53:01,891 INFO L226 Difference]: Without dead ends: 87 [2018-02-02 08:53:01,891 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-02 08:53:01,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-02-02 08:53:01,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2018-02-02 08:53:01,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-02 08:53:01,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2018-02-02 08:53:01,893 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 60 [2018-02-02 08:53:01,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:53:01,893 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2018-02-02 08:53:01,893 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 08:53:01,893 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2018-02-02 08:53:01,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 08:53:01,893 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:53:01,894 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-02 08:53:01,894 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-02 08:53:01,894 INFO L82 PathProgramCache]: Analyzing trace with hash -374403177, now seen corresponding path program 2 times [2018-02-02 08:53:01,894 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:53:01,894 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:53:01,894 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:53:01,894 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:53:01,894 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:53:01,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:53:01,902 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:53:02,031 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-02 08:53:02,031 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:53:02,031 INFO L209 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-02 08:53:02,036 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 08:53:02,050 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:53:02,076 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:53:02,081 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:53:02,084 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:53:02,181 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-02 08:53:02,199 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:53:02,200 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2018-02-02 08:53:02,200 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 08:53:02,200 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 08:53:02,200 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2018-02-02 08:53:02,200 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand 19 states. [2018-02-02 08:53:02,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:53:02,393 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2018-02-02 08:53:02,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 08:53:02,393 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2018-02-02 08:53:02,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:53:02,394 INFO L225 Difference]: With dead ends: 90 [2018-02-02 08:53:02,394 INFO L226 Difference]: Without dead ends: 85 [2018-02-02 08:53:02,394 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 61 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2018-02-02 08:53:02,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-02 08:53:02,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-02-02 08:53:02,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-02-02 08:53:02,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2018-02-02 08:53:02,396 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 67 [2018-02-02 08:53:02,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:53:02,396 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2018-02-02 08:53:02,396 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 08:53:02,396 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2018-02-02 08:53:02,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-02 08:53:02,396 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:53:02,397 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-02 08:53:02,397 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-02 08:53:02,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1696068192, now seen corresponding path program 3 times [2018-02-02 08:53:02,397 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:53:02,397 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:53:02,397 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:53:02,397 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:53:02,397 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:53:02,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:53:02,408 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:53:02,543 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-02 08:53:02,543 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:53:02,543 INFO L209 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-02 08:53:02,549 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 08:53:02,559 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:53:02,569 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:53:02,578 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:53:02,579 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:53:02,582 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:53:02,617 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-02 08:53:02,618 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-02 08:53:02,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:53:02,619 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:53:02,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:53:02,622 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-02-02 08:53:02,636 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-02 08:53:02,640 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,641 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,643 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-02 08:53:02,644 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:53:02,649 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:53:02,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:53:02,653 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-02-02 08:53:02,672 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-02 08:53:02,679 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,679 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,680 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,681 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,681 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,682 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,683 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-02 08:53:02,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:53:02,691 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:53:02,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:53:02,695 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-02-02 08:53:02,714 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-02 08:53:02,716 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,719 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,719 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,720 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,720 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,721 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,721 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,722 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,723 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,723 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,724 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,724 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,725 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-02 08:53:02,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:53:02,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:53:02,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:53:02,747 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-02-02 08:53:02,775 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-02 08:53:02,778 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,778 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,779 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,779 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,780 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,780 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,782 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,783 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,783 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,783 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,784 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,785 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,785 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,786 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,786 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,787 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,787 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-02 08:53:02,788 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:53:02,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:53:02,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:53:02,820 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-02-02 08:53:02,844 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-02 08:53:02,860 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,860 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,861 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,862 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,863 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,863 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,864 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,865 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,866 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,866 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,867 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,868 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,869 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,869 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,870 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,871 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,872 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,873 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,873 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,874 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,875 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,876 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-02 08:53:02,877 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:53:02,911 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:53:02,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:53:02,919 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:60, output treesize:56 [2018-02-02 08:53:02,957 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-02 08:53:02,961 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,961 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,962 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,962 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,963 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,964 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,964 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,965 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,965 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,966 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,966 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,967 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,968 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,968 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,969 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,969 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,970 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,970 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,971 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,972 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,972 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,973 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,973 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,974 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,974 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,975 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,976 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:53:02,977 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-02 08:53:02,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:53:03,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:53:03,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:53:03,043 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:69, output treesize:65 [2018-02-02 08:53:03,336 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-02 08:53:03,343 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:53:03,344 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-02 08:53:03,344 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:121, output treesize:1 [2018-02-02 08:53:03,371 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-02 08:53:03,402 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:53:03,403 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17] total 28 [2018-02-02 08:53:03,403 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 08:53:03,403 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 08:53:03,403 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2018-02-02 08:53:03,403 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand 28 states. [2018-02-02 08:53:03,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:53:03,964 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2018-02-02 08:53:03,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 08:53:03,964 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 74 [2018-02-02 08:53:03,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:53:03,964 INFO L225 Difference]: With dead ends: 100 [2018-02-02 08:53:03,964 INFO L226 Difference]: Without dead ends: 94 [2018-02-02 08:53:03,965 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-02 08:53:03,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-02 08:53:03,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2018-02-02 08:53:03,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-02-02 08:53:03,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2018-02-02 08:53:03,967 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 74 [2018-02-02 08:53:03,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:53:03,967 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2018-02-02 08:53:03,967 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 08:53:03,967 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2018-02-02 08:53:03,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-02 08:53:03,967 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:53:03,967 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-02 08:53:03,967 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-02 08:53:03,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1151371872, now seen corresponding path program 4 times [2018-02-02 08:53:03,968 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:53:03,968 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:53:03,968 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:53:03,968 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:53:03,968 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:53:03,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:53:03,979 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:53:04,067 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-02 08:53:04,067 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:53:04,067 INFO L209 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-02 08:53:04,074 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 08:53:04,098 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:53:04,100 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:53:04,151 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-02 08:53:04,167 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:53:04,168 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-02-02 08:53:04,168 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 08:53:04,168 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 08:53:04,168 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=279, Unknown=0, NotChecked=0, Total=462 [2018-02-02 08:53:04,168 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand 22 states. [2018-02-02 08:53:04,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:53:04,189 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2018-02-02 08:53:04,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 08:53:04,190 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 86 [2018-02-02 08:53:04,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:53:04,190 INFO L225 Difference]: With dead ends: 94 [2018-02-02 08:53:04,190 INFO L226 Difference]: Without dead ends: 92 [2018-02-02 08:53:04,190 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-02 08:53:04,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-02 08:53:04,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-02-02 08:53:04,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-02 08:53:04,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2018-02-02 08:53:04,192 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 86 [2018-02-02 08:53:04,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:53:04,192 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2018-02-02 08:53:04,192 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 08:53:04,193 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2018-02-02 08:53:04,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 08:53:04,193 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:53:04,193 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-02 08:53:04,193 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-02 08:53:04,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1429474957, now seen corresponding path program 5 times [2018-02-02 08:53:04,194 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:53:04,194 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:53:04,194 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:53:04,194 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:53:04,195 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:53:04,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:53:04,204 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:53:04,308 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-02 08:53:04,309 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:53:04,309 INFO L209 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-02 08:53:04,316 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 08:53:04,326 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:53:04,328 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:53:04,332 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:53:04,339 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:53:04,349 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:53:04,367 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:53:04,370 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:53:04,373 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:53:04,460 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-02 08:53:04,477 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:53:04,477 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-02-02 08:53:04,478 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 08:53:04,478 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 08:53:04,478 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=334, Unknown=0, NotChecked=0, Total=552 [2018-02-02 08:53:04,478 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand 24 states. [2018-02-02 08:53:04,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:53:04,522 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2018-02-02 08:53:04,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 08:53:04,522 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 87 [2018-02-02 08:53:04,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:53:04,522 INFO L225 Difference]: With dead ends: 95 [2018-02-02 08:53:04,522 INFO L226 Difference]: Without dead ends: 93 [2018-02-02 08:53:04,523 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-02 08:53:04,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-02 08:53:04,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-02-02 08:53:04,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-02 08:53:04,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2018-02-02 08:53:04,525 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 87 [2018-02-02 08:53:04,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:53:04,525 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2018-02-02 08:53:04,525 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 08:53:04,525 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2018-02-02 08:53:04,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-02-02 08:53:04,526 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:53:04,526 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-02 08:53:04,526 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-02 08:53:04,527 INFO L82 PathProgramCache]: Analyzing trace with hash 168651968, now seen corresponding path program 6 times [2018-02-02 08:53:04,527 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:53:04,527 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:53:04,528 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:53:04,528 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:53:04,528 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:53:04,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:53:04,542 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:53:04,664 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-02 08:53:04,664 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:53:04,664 INFO L209 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-02 08:53:04,668 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-02 08:53:04,679 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:53:04,688 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:53:04,695 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:53:04,718 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:53:04,785 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:53:04,821 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:53:04,822 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:53:04,825 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:53:04,883 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-02 08:53:05,005 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:53:05,005 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2018-02-02 08:53:05,006 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 08:53:05,006 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 08:53:05,006 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=394, Unknown=0, NotChecked=0, Total=650 [2018-02-02 08:53:05,006 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand 26 states. [2018-02-02 08:53:05,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:53:05,033 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2018-02-02 08:53:05,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 08:53:05,034 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 88 [2018-02-02 08:53:05,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:53:05,034 INFO L225 Difference]: With dead ends: 96 [2018-02-02 08:53:05,034 INFO L226 Difference]: Without dead ends: 94 [2018-02-02 08:53:05,034 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-02 08:53:05,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-02 08:53:05,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-02-02 08:53:05,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-02 08:53:05,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2018-02-02 08:53:05,037 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 88 [2018-02-02 08:53:05,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:53:05,037 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2018-02-02 08:53:05,037 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 08:53:05,037 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2018-02-02 08:53:05,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-02 08:53:05,038 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:53:05,038 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-02 08:53:05,038 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-02 08:53:05,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1829020909, now seen corresponding path program 7 times [2018-02-02 08:53:05,039 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:53:05,039 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:53:05,039 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:53:05,039 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:53:05,039 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:53:05,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:53:05,052 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:53:05,190 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-02 08:53:05,190 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:53:05,190 INFO L209 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-02 08:53:05,197 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:53:05,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:53:05,234 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:53:05,327 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-02 08:53:05,348 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:53:05,348 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2018-02-02 08:53:05,348 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 08:53:05,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 08:53:05,348 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=459, Unknown=0, NotChecked=0, Total=756 [2018-02-02 08:53:05,348 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand 28 states. [2018-02-02 08:53:05,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:53:05,376 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2018-02-02 08:53:05,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 08:53:05,376 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 89 [2018-02-02 08:53:05,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:53:05,376 INFO L225 Difference]: With dead ends: 97 [2018-02-02 08:53:05,376 INFO L226 Difference]: Without dead ends: 95 [2018-02-02 08:53:05,377 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=313, Invalid=499, Unknown=0, NotChecked=0, Total=812 [2018-02-02 08:53:05,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-02 08:53:05,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-02-02 08:53:05,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-02 08:53:05,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2018-02-02 08:53:05,379 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 89 [2018-02-02 08:53:05,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:53:05,379 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2018-02-02 08:53:05,379 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 08:53:05,379 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-02-02 08:53:05,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-02-02 08:53:05,379 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:53:05,380 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-02 08:53:05,380 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-02 08:53:05,380 INFO L82 PathProgramCache]: Analyzing trace with hash 667629344, now seen corresponding path program 8 times [2018-02-02 08:53:05,380 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:53:05,380 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:53:05,380 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:53:05,380 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:53:05,380 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:53:05,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:53:05,390 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:53:05,529 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-02 08:53:05,529 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:53:05,529 INFO L209 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-02 08:53:05,550 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 08:53:05,563 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:53:05,578 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:53:05,580 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:53:05,582 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:53:05,688 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-02 08:53:05,707 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:53:05,707 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2018-02-02 08:53:05,710 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 08:53:05,711 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 08:53:05,711 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=529, Unknown=0, NotChecked=0, Total=870 [2018-02-02 08:53:05,711 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 30 states. [2018-02-02 08:53:05,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:53:05,940 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2018-02-02 08:53:05,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 08:53:05,955 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 90 [2018-02-02 08:53:05,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:53:05,955 INFO L225 Difference]: With dead ends: 98 [2018-02-02 08:53:05,955 INFO L226 Difference]: Without dead ends: 96 [2018-02-02 08:53:05,956 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=358, Invalid=572, Unknown=0, NotChecked=0, Total=930 [2018-02-02 08:53:05,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-02 08:53:05,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-02-02 08:53:05,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-02 08:53:05,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2018-02-02 08:53:05,958 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 90 [2018-02-02 08:53:05,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:53:05,958 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2018-02-02 08:53:05,959 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 08:53:05,959 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-02-02 08:53:05,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-02-02 08:53:05,959 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:53:05,959 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-02 08:53:05,959 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-02 08:53:05,960 INFO L82 PathProgramCache]: Analyzing trace with hash 754375859, now seen corresponding path program 9 times [2018-02-02 08:53:05,960 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:53:05,960 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:53:05,960 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:53:05,960 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:53:05,960 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:53:05,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:53:05,974 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:53:06,141 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-02 08:53:06,141 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:53:06,141 INFO L209 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-02 08:53:06,152 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 08:53:06,171 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:53:06,187 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:53:06,206 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:53:06,221 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:53:06,318 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:53:06,357 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:53:06,479 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:53:06,577 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:53:06,578 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:53:06,581 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:53:06,683 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-02 08:53:06,714 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:53:06,714 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2018-02-02 08:53:06,715 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-02 08:53:06,715 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-02 08:53:06,715 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=388, Invalid=604, Unknown=0, NotChecked=0, Total=992 [2018-02-02 08:53:06,716 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand 32 states. [2018-02-02 08:53:06,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:53:06,752 INFO L93 Difference]: Finished difference Result 99 states and 103 transitions. [2018-02-02 08:53:06,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 08:53:06,752 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 91 [2018-02-02 08:53:06,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:53:06,752 INFO L225 Difference]: With dead ends: 99 [2018-02-02 08:53:06,752 INFO L226 Difference]: Without dead ends: 97 [2018-02-02 08:53:06,753 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=406, Invalid=650, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 08:53:06,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-02 08:53:06,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-02-02 08:53:06,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-02-02 08:53:06,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 101 transitions. [2018-02-02 08:53:06,755 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 101 transitions. Word has length 91 [2018-02-02 08:53:06,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:53:06,756 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 101 transitions. [2018-02-02 08:53:06,756 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-02 08:53:06,756 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2018-02-02 08:53:06,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-02 08:53:06,756 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:53:06,756 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-02 08:53:06,757 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-02 08:53:06,757 INFO L82 PathProgramCache]: Analyzing trace with hash -851449472, now seen corresponding path program 10 times [2018-02-02 08:53:06,757 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:53:06,757 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:53:06,758 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:53:06,758 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:53:06,758 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:53:06,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:53:06,776 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:53:06,905 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-02 08:53:06,905 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:53:06,905 INFO L209 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-02 08:53:06,909 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 08:53:06,963 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:53:06,966 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:53:07,045 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-02 08:53:07,062 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:53:07,062 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2018-02-02 08:53:07,063 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-02 08:53:07,063 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-02 08:53:07,063 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=438, Invalid=684, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 08:53:07,063 INFO L87 Difference]: Start difference. First operand 97 states and 101 transitions. Second operand 34 states. [2018-02-02 08:53:07,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:53:07,104 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2018-02-02 08:53:07,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 08:53:07,104 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 92 [2018-02-02 08:53:07,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:53:07,104 INFO L225 Difference]: With dead ends: 100 [2018-02-02 08:53:07,104 INFO L226 Difference]: Without dead ends: 98 [2018-02-02 08:53:07,105 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-02 08:53:07,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-02-02 08:53:07,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-02-02 08:53:07,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-02-02 08:53:07,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 102 transitions. [2018-02-02 08:53:07,106 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 102 transitions. Word has length 92 [2018-02-02 08:53:07,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:53:07,106 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 102 transitions. [2018-02-02 08:53:07,106 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-02 08:53:07,106 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2018-02-02 08:53:07,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-02 08:53:07,107 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:53:07,107 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-02 08:53:07,107 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-02 08:53:07,107 INFO L82 PathProgramCache]: Analyzing trace with hash 907572819, now seen corresponding path program 11 times [2018-02-02 08:53:07,107 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:53:07,107 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:53:07,108 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:53:07,108 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:53:07,108 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:53:07,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:53:07,117 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:53:07,288 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-02 08:53:07,289 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:53:07,289 INFO L209 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-02 08:53:07,296 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 08:53:07,306 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:53:07,307 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:53:07,309 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:53:07,312 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:53:07,317 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:53:07,326 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:53:07,337 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:53:07,361 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:53:07,375 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:53:07,377 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:53:07,379 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:53:07,503 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-02 08:53:07,557 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:53:07,557 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2018-02-02 08:53:07,557 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-02 08:53:07,557 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-02 08:53:07,558 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=491, Invalid=769, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 08:53:07,558 INFO L87 Difference]: Start difference. First operand 98 states and 102 transitions. Second operand 36 states. [2018-02-02 08:53:07,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:53:07,616 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2018-02-02 08:53:07,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 08:53:07,617 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 93 [2018-02-02 08:53:07,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:53:07,618 INFO L225 Difference]: With dead ends: 101 [2018-02-02 08:53:07,618 INFO L226 Difference]: Without dead ends: 99 [2018-02-02 08:53:07,619 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-02 08:53:07,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-02-02 08:53:07,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-02-02 08:53:07,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-02 08:53:07,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2018-02-02 08:53:07,620 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 93 [2018-02-02 08:53:07,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:53:07,620 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2018-02-02 08:53:07,620 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-02 08:53:07,620 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2018-02-02 08:53:07,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-02 08:53:07,621 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:53:07,621 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-02 08:53:07,621 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-02 08:53:07,621 INFO L82 PathProgramCache]: Analyzing trace with hash -397311008, now seen corresponding path program 12 times [2018-02-02 08:53:07,621 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:53:07,621 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:53:07,622 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:53:07,622 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:53:07,622 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:53:07,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:53:07,635 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:53:07,863 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-02 08:53:07,863 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:53:07,863 INFO L209 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-02 08:53:07,868 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-02 08:53:07,878 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:53:07,884 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:53:07,890 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:53:07,916 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:53:07,943 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:53:08,070 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:53:08,239 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:53:08,581 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:53:09,092 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:53:09,094 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:53:09,097 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:53:09,207 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-02 08:53:09,226 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:53:09,226 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2018-02-02 08:53:09,226 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-02 08:53:09,226 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-02 08:53:09,227 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=547, Invalid=859, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 08:53:09,227 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand 38 states. [2018-02-02 08:53:09,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:53:09,271 INFO L93 Difference]: Finished difference Result 102 states and 106 transitions. [2018-02-02 08:53:09,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 08:53:09,271 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 94 [2018-02-02 08:53:09,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:53:09,271 INFO L225 Difference]: With dead ends: 102 [2018-02-02 08:53:09,272 INFO L226 Difference]: Without dead ends: 100 [2018-02-02 08:53:09,272 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-02 08:53:09,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-02-02 08:53:09,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-02-02 08:53:09,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-02-02 08:53:09,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 104 transitions. [2018-02-02 08:53:09,274 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 104 transitions. Word has length 94 [2018-02-02 08:53:09,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:53:09,274 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 104 transitions. [2018-02-02 08:53:09,274 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-02 08:53:09,274 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 104 transitions. [2018-02-02 08:53:09,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-02-02 08:53:09,274 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:53:09,274 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-02 08:53:09,274 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-02 08:53:09,275 INFO L82 PathProgramCache]: Analyzing trace with hash 2100963315, now seen corresponding path program 13 times [2018-02-02 08:53:09,275 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:53:09,275 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:53:09,275 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:53:09,275 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:53:09,275 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:53:09,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:53:09,289 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:53:09,551 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-02 08:53:09,551 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:53:09,551 INFO L209 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-02 08:53:09,555 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:53:09,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:53:09,575 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:53:09,697 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-02 08:53:09,727 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:53:09,727 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2018-02-02 08:53:09,727 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-02 08:53:09,728 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-02 08:53:09,728 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=606, Invalid=954, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 08:53:09,728 INFO L87 Difference]: Start difference. First operand 100 states and 104 transitions. Second operand 40 states. [2018-02-02 08:53:09,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:53:09,764 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2018-02-02 08:53:09,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 08:53:09,764 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 95 [2018-02-02 08:53:09,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:53:09,764 INFO L225 Difference]: With dead ends: 103 [2018-02-02 08:53:09,765 INFO L226 Difference]: Without dead ends: 101 [2018-02-02 08:53:09,765 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-02 08:53:09,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-02-02 08:53:09,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-02-02 08:53:09,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-02-02 08:53:09,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2018-02-02 08:53:09,766 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 95 [2018-02-02 08:53:09,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:53:09,767 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2018-02-02 08:53:09,767 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-02 08:53:09,767 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2018-02-02 08:53:09,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-02-02 08:53:09,767 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:53:09,767 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-02 08:53:09,767 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-02 08:53:09,767 INFO L82 PathProgramCache]: Analyzing trace with hash -2056911296, now seen corresponding path program 14 times [2018-02-02 08:53:09,767 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:53:09,767 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:53:09,768 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:53:09,768 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:53:09,768 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:53:09,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:53:09,777 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:53:09,983 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-02 08:53:10,063 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:53:10,063 INFO L209 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-02 08:53:10,069 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 08:53:10,088 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:53:10,108 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:53:10,112 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:53:10,115 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:53:10,261 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-02 08:53:10,277 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:53:10,278 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 42 [2018-02-02 08:53:10,278 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-02 08:53:10,278 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-02 08:53:10,279 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=668, Invalid=1054, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 08:53:10,279 INFO L87 Difference]: Start difference. First operand 101 states and 105 transitions. Second operand 42 states. [2018-02-02 08:53:10,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:53:10,318 INFO L93 Difference]: Finished difference Result 104 states and 108 transitions. [2018-02-02 08:53:10,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 08:53:10,319 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 96 [2018-02-02 08:53:10,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:53:10,319 INFO L225 Difference]: With dead ends: 104 [2018-02-02 08:53:10,319 INFO L226 Difference]: Without dead ends: 102 [2018-02-02 08:53:10,320 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-02 08:53:10,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-02-02 08:53:10,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-02-02 08:53:10,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-02-02 08:53:10,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 106 transitions. [2018-02-02 08:53:10,322 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 106 transitions. Word has length 96 [2018-02-02 08:53:10,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:53:10,322 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 106 transitions. [2018-02-02 08:53:10,322 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-02 08:53:10,322 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 106 transitions. [2018-02-02 08:53:10,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-02-02 08:53:10,323 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:53:10,323 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-02 08:53:10,323 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-02 08:53:10,324 INFO L82 PathProgramCache]: Analyzing trace with hash -2102005357, now seen corresponding path program 15 times [2018-02-02 08:53:10,324 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:53:10,324 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:53:10,324 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:53:10,324 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:53:10,324 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:53:10,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:53:10,339 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:53:10,583 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-02 08:53:10,584 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:53:10,584 INFO L209 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-02 08:53:10,588 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 08:53:10,627 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:53:10,637 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:53:10,647 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:53:10,660 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:53:10,683 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:53:10,709 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:53:10,750 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:53:10,866 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:53:11,089 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:53:11,527 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:53:12,085 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:53:12,087 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:53:12,093 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:53:12,245 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-02 08:53:12,268 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:53:12,268 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 44 [2018-02-02 08:53:12,269 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-02 08:53:12,269 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-02 08:53:12,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=733, Invalid=1159, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 08:53:12,270 INFO L87 Difference]: Start difference. First operand 102 states and 106 transitions. Second operand 44 states. [2018-02-02 08:53:12,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:53:12,315 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2018-02-02 08:53:12,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 08:53:12,315 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 97 [2018-02-02 08:53:12,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:53:12,316 INFO L225 Difference]: With dead ends: 105 [2018-02-02 08:53:12,316 INFO L226 Difference]: Without dead ends: 103 [2018-02-02 08:53:12,316 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-02 08:53:12,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-02-02 08:53:12,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-02-02 08:53:12,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-02 08:53:12,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2018-02-02 08:53:12,327 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 97 [2018-02-02 08:53:12,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:53:12,327 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2018-02-02 08:53:12,327 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-02 08:53:12,327 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2018-02-02 08:53:12,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-02-02 08:53:12,328 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:53:12,328 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-02 08:53:12,328 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-02 08:53:12,328 INFO L82 PathProgramCache]: Analyzing trace with hash 795046048, now seen corresponding path program 16 times [2018-02-02 08:53:12,328 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:53:12,328 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:53:12,329 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:53:12,329 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:53:12,329 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:53:12,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:53:12,344 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:53:12,616 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-02 08:53:12,616 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:53:12,616 INFO L209 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-02 08:53:12,624 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 08:53:13,142 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:53:13,146 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:53:13,312 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-02 08:53:13,330 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:53:13,330 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2018-02-02 08:53:13,330 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-02 08:53:13,331 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-02 08:53:13,331 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=801, Invalid=1269, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 08:53:13,331 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand 46 states. [2018-02-02 08:53:13,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:53:13,400 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2018-02-02 08:53:13,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 08:53:13,400 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 98 [2018-02-02 08:53:13,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:53:13,401 INFO L225 Difference]: With dead ends: 106 [2018-02-02 08:53:13,401 INFO L226 Difference]: Without dead ends: 104 [2018-02-02 08:53:13,401 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-02 08:53:13,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-02 08:53:13,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-02-02 08:53:13,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-02-02 08:53:13,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 108 transitions. [2018-02-02 08:53:13,403 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 108 transitions. Word has length 98 [2018-02-02 08:53:13,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:53:13,403 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 108 transitions. [2018-02-02 08:53:13,403 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-02 08:53:13,403 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2018-02-02 08:53:13,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-02-02 08:53:13,403 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:53:13,403 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-02 08:53:13,403 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-02 08:53:13,403 INFO L82 PathProgramCache]: Analyzing trace with hash 409326387, now seen corresponding path program 17 times [2018-02-02 08:53:13,404 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:53:13,404 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:53:13,404 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:53:13,404 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:53:13,404 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:53:13,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:53:13,413 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:53:13,668 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-02 08:53:13,668 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:53:13,669 INFO L209 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-02 08:53:13,673 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 08:53:13,680 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:53:13,681 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:53:13,682 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:53:13,684 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:53:13,687 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:53:13,690 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:53:13,698 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:53:13,706 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:53:13,716 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:53:13,734 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:53:13,771 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:53:13,835 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:53:13,838 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:53:13,841 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:53:14,018 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-02 08:53:14,035 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:53:14,036 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-02-02 08:53:14,036 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-02 08:53:14,036 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-02 08:53:14,036 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=872, Invalid=1384, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 08:53:14,037 INFO L87 Difference]: Start difference. First operand 104 states and 108 transitions. Second operand 48 states. [2018-02-02 08:53:14,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:53:14,088 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2018-02-02 08:53:14,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 08:53:14,089 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 99 [2018-02-02 08:53:14,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:53:14,089 INFO L225 Difference]: With dead ends: 107 [2018-02-02 08:53:14,089 INFO L226 Difference]: Without dead ends: 105 [2018-02-02 08:53:14,090 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-02 08:53:14,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-02 08:53:14,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-02-02 08:53:14,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-02 08:53:14,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2018-02-02 08:53:14,092 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 99 [2018-02-02 08:53:14,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:53:14,092 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2018-02-02 08:53:14,092 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-02-02 08:53:14,092 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2018-02-02 08:53:14,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-02-02 08:53:14,093 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:53:14,093 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-02 08:53:14,093 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-02 08:53:14,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1336918784, now seen corresponding path program 18 times [2018-02-02 08:53:14,093 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:53:14,093 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:53:14,094 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:53:14,094 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:53:14,094 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:53:14,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:53:14,109 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:53:14,393 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-02 08:53:14,394 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:53:14,394 INFO L209 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-02 08:53:14,398 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-02 08:53:14,412 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:53:14,420 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:53:14,432 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:53:14,456 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:53:14,480 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:53:14,607 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:53:14,797 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:53:15,527 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:53:16,095 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:53:16,785 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:53:17,511 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:53:18,718 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:53:18,721 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:53:18,728 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:53:18,906 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-02 08:53:18,928 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:53:18,928 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2018-02-02 08:53:18,928 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-02 08:53:18,928 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-02 08:53:18,929 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=925, Invalid=1525, Unknown=0, NotChecked=0, Total=2450 [2018-02-02 08:53:18,929 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand 50 states. [2018-02-02 08:53:19,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:53:19,003 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2018-02-02 08:53:19,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 08:53:19,003 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 100 [2018-02-02 08:53:19,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:53:19,004 INFO L225 Difference]: With dead ends: 108 [2018-02-02 08:53:19,004 INFO L226 Difference]: Without dead ends: 106 [2018-02-02 08:53:19,004 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1145 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1001, Invalid=1651, Unknown=0, NotChecked=0, Total=2652 [2018-02-02 08:53:19,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-02-02 08:53:19,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-02-02 08:53:19,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-02-02 08:53:19,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 110 transitions. [2018-02-02 08:53:19,007 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 110 transitions. Word has length 100 [2018-02-02 08:53:19,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:53:19,007 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 110 transitions. [2018-02-02 08:53:19,007 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-02 08:53:19,007 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2018-02-02 08:53:19,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-02-02 08:53:19,007 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:53:19,008 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-02 08:53:19,008 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-02 08:53:19,008 INFO L82 PathProgramCache]: Analyzing trace with hash 27512019, now seen corresponding path program 19 times [2018-02-02 08:53:19,008 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:53:19,008 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:53:19,008 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:53:19,008 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:53:19,009 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:53:19,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:53:19,018 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:53:19,356 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-02 08:53:19,356 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:53:19,356 INFO L209 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-02 08:53:19,360 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:53:19,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:53:19,385 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:53:19,662 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-02 08:53:19,695 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:53:19,696 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2018-02-02 08:53:19,696 INFO L409 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-02-02 08:53:19,696 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-02-02 08:53:19,697 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1001, Invalid=1651, Unknown=0, NotChecked=0, Total=2652 [2018-02-02 08:53:19,697 INFO L87 Difference]: Start difference. First operand 106 states and 110 transitions. Second operand 52 states. [2018-02-02 08:53:19,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:53:19,822 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2018-02-02 08:53:19,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 08:53:19,822 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 101 [2018-02-02 08:53:19,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:53:19,823 INFO L225 Difference]: With dead ends: 109 [2018-02-02 08:53:19,823 INFO L226 Difference]: Without dead ends: 107 [2018-02-02 08:53:19,823 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1243 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1080, Invalid=1782, Unknown=0, NotChecked=0, Total=2862 [2018-02-02 08:53:19,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-02-02 08:53:19,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-02-02 08:53:19,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-02-02 08:53:19,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2018-02-02 08:53:19,825 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 101 [2018-02-02 08:53:19,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:53:19,825 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2018-02-02 08:53:19,825 INFO L433 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-02-02 08:53:19,825 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2018-02-02 08:53:19,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-02-02 08:53:19,826 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:53:19,826 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-02 08:53:19,826 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-02 08:53:19,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1909392032, now seen corresponding path program 20 times [2018-02-02 08:53:19,826 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:53:19,826 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:53:19,826 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:53:19,827 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:53:19,827 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:53:19,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:53:19,835 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:53:20,157 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-02 08:53:20,158 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:53:20,158 INFO L209 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-02 08:53:20,163 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 08:53:20,182 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:53:20,207 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:53:20,210 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:53:20,213 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:53:20,453 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-02 08:53:20,471 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:53:20,471 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 54 [2018-02-02 08:53:20,471 INFO L409 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-02-02 08:53:20,471 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-02-02 08:53:20,472 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1080, Invalid=1782, Unknown=0, NotChecked=0, Total=2862 [2018-02-02 08:53:20,472 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 54 states. [2018-02-02 08:53:20,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:53:20,533 INFO L93 Difference]: Finished difference Result 110 states and 114 transitions. [2018-02-02 08:53:20,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 08:53:20,534 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 102 [2018-02-02 08:53:20,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:53:20,535 INFO L225 Difference]: With dead ends: 110 [2018-02-02 08:53:20,535 INFO L226 Difference]: Without dead ends: 108 [2018-02-02 08:53:20,535 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1345 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1162, Invalid=1918, Unknown=0, NotChecked=0, Total=3080 [2018-02-02 08:53:20,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-02-02 08:53:20,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-02-02 08:53:20,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-02 08:53:20,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 112 transitions. [2018-02-02 08:53:20,537 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 112 transitions. Word has length 102 [2018-02-02 08:53:20,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:53:20,538 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 112 transitions. [2018-02-02 08:53:20,538 INFO L433 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-02-02 08:53:20,538 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2018-02-02 08:53:20,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-02-02 08:53:20,539 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:53:20,539 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-02 08:53:20,539 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-02 08:53:20,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1823875469, now seen corresponding path program 21 times [2018-02-02 08:53:20,539 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:53:20,539 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:53:20,540 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:53:20,540 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:53:20,540 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:53:20,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:53:20,555 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:53:20,886 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-02 08:53:20,886 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:53:20,886 INFO L209 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-02 08:53:20,891 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 08:53:20,907 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:53:20,916 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:53:20,928 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:53:20,952 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:53:20,978 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:53:21,000 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:53:21,101 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:53:21,136 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:53:21,369 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:53:21,749 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:53:22,313 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:53:23,160 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:53:23,831 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:53:25,861 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:53:25,866 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:53:25,875 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:53:26,131 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-02 08:53:26,152 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:53:26,153 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 56 [2018-02-02 08:53:26,153 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-02-02 08:53:26,153 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-02-02 08:53:26,154 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1162, Invalid=1918, Unknown=0, NotChecked=0, Total=3080 [2018-02-02 08:53:26,154 INFO L87 Difference]: Start difference. First operand 108 states and 112 transitions. Second operand 56 states. [2018-02-02 08:53:26,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:53:26,230 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2018-02-02 08:53:26,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 08:53:26,231 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 103 [2018-02-02 08:53:26,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:53:26,231 INFO L225 Difference]: With dead ends: 111 [2018-02-02 08:53:26,231 INFO L226 Difference]: Without dead ends: 109 [2018-02-02 08:53:26,232 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1451 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1247, Invalid=2059, Unknown=0, NotChecked=0, Total=3306 [2018-02-02 08:53:26,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-02-02 08:53:26,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-02-02 08:53:26,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-02 08:53:26,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 113 transitions. [2018-02-02 08:53:26,233 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 113 transitions. Word has length 103 [2018-02-02 08:53:26,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:53:26,234 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 113 transitions. [2018-02-02 08:53:26,234 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-02-02 08:53:26,234 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2018-02-02 08:53:26,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-02-02 08:53:26,234 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:53:26,234 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-02 08:53:26,234 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-02 08:53:26,234 INFO L82 PathProgramCache]: Analyzing trace with hash 827137984, now seen corresponding path program 22 times [2018-02-02 08:53:26,234 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:53:26,234 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:53:26,235 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:53:26,235 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:53:26,235 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:53:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:53:26,244 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:53:26,719 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-02 08:53:26,720 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:53:26,720 INFO L209 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-02 08:53:26,726 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 08:53:27,327 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:53:27,439 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:53:27,686 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-02 08:53:27,705 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:53:27,705 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 58 [2018-02-02 08:53:27,705 INFO L409 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-02-02 08:53:27,706 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-02-02 08:53:27,706 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1247, Invalid=2059, Unknown=0, NotChecked=0, Total=3306 [2018-02-02 08:53:27,706 INFO L87 Difference]: Start difference. First operand 109 states and 113 transitions. Second operand 58 states. [2018-02-02 08:53:27,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:53:27,763 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2018-02-02 08:53:27,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 08:53:27,764 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 104 [2018-02-02 08:53:27,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:53:27,764 INFO L225 Difference]: With dead ends: 112 [2018-02-02 08:53:27,764 INFO L226 Difference]: Without dead ends: 110 [2018-02-02 08:53:27,765 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1561 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1335, Invalid=2205, Unknown=0, NotChecked=0, Total=3540 [2018-02-02 08:53:27,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-02-02 08:53:27,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-02-02 08:53:27,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-02-02 08:53:27,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 114 transitions. [2018-02-02 08:53:27,767 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 114 transitions. Word has length 104 [2018-02-02 08:53:27,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:53:27,767 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 114 transitions. [2018-02-02 08:53:27,767 INFO L433 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-02-02 08:53:27,767 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 114 transitions. [2018-02-02 08:53:27,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-02-02 08:53:27,767 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:53:27,768 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-02 08:53:27,768 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-02 08:53:27,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1404176403, now seen corresponding path program 23 times [2018-02-02 08:53:27,768 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:53:27,768 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:53:27,769 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:53:27,769 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:53:27,769 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:53:27,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:53:27,782 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:53:28,123 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-02 08:53:28,123 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:53:28,123 INFO L209 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-02 08:53:28,127 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 08:53:28,140 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:53:28,141 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:53:28,142 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:53:28,144 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:53:28,147 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:53:28,150 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:53:28,157 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:53:28,167 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:53:28,176 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:53:28,201 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:53:28,223 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:53:28,241 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:53:28,276 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:53:28,320 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:53:28,381 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:53:28,384 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:53:28,388 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:53:28,613 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-02 08:53:28,631 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:53:28,631 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 60 [2018-02-02 08:53:28,631 INFO L409 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-02-02 08:53:28,632 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-02-02 08:53:28,632 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1335, Invalid=2205, Unknown=0, NotChecked=0, Total=3540 [2018-02-02 08:53:28,632 INFO L87 Difference]: Start difference. First operand 110 states and 114 transitions. Second operand 60 states. [2018-02-02 08:53:28,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:53:28,696 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2018-02-02 08:53:28,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 08:53:28,697 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 105 [2018-02-02 08:53:28,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:53:28,698 INFO L225 Difference]: With dead ends: 113 [2018-02-02 08:53:28,698 INFO L226 Difference]: Without dead ends: 111 [2018-02-02 08:53:28,699 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1675 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1426, Invalid=2356, Unknown=0, NotChecked=0, Total=3782 [2018-02-02 08:53:28,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-02 08:53:28,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-02-02 08:53:28,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-02-02 08:53:28,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2018-02-02 08:53:28,701 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 105 [2018-02-02 08:53:28,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:53:28,701 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2018-02-02 08:53:28,702 INFO L433 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-02-02 08:53:28,702 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2018-02-02 08:53:28,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-02-02 08:53:28,703 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:53:28,703 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-02 08:53:28,703 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-02 08:53:28,703 INFO L82 PathProgramCache]: Analyzing trace with hash 2112498208, now seen corresponding path program 24 times [2018-02-02 08:53:28,703 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:53:28,703 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:53:28,704 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:53:28,704 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:53:28,704 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:53:28,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:53:28,718 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:53:29,094 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-02 08:53:29,094 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:53:29,094 INFO L209 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-02 08:53:29,098 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-02 08:53:29,110 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:53:29,117 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:53:29,134 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:53:29,154 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:53:29,164 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:53:29,199 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:53:29,217 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:53:29,272 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:53:29,341 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:53:29,406 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:53:29,552 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:53:30,058 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:53:30,820 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:53:32,318 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:53:35,666 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 08:53:35,670 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:53:35,681 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:53:35,956 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-02 08:53:35,978 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:53:35,978 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 62 [2018-02-02 08:53:35,979 INFO L409 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-02-02 08:53:35,979 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-02-02 08:53:35,979 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1426, Invalid=2356, Unknown=0, NotChecked=0, Total=3782 [2018-02-02 08:53:35,979 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand 62 states. [2018-02-02 08:53:36,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:53:36,204 INFO L93 Difference]: Finished difference Result 114 states and 118 transitions. [2018-02-02 08:53:36,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 08:53:36,205 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 106 [2018-02-02 08:53:36,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:53:36,205 INFO L225 Difference]: With dead ends: 114 [2018-02-02 08:53:36,205 INFO L226 Difference]: Without dead ends: 112 [2018-02-02 08:53:36,206 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-02 08:53:36,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-02 08:53:36,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-02-02 08:53:36,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-02 08:53:36,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 116 transitions. [2018-02-02 08:53:36,207 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 116 transitions. Word has length 106 [2018-02-02 08:53:36,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:53:36,207 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 116 transitions. [2018-02-02 08:53:36,207 INFO L433 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-02-02 08:53:36,207 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 116 transitions. [2018-02-02 08:53:36,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-02-02 08:53:36,208 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:53:36,208 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-02 08:53:36,208 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-02 08:53:36,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1699329613, now seen corresponding path program 25 times [2018-02-02 08:53:36,208 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:53:36,208 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:53:36,209 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:53:36,209 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:53:36,209 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:53:36,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:53:36,219 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:53:36,662 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-02 08:53:36,662 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:53:36,663 INFO L209 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-02 08:53:36,667 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:53:36,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:53:36,700 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:53:36,985 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-02 08:53:37,003 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:53:37,003 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 64 [2018-02-02 08:53:37,003 INFO L409 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-02-02 08:53:37,003 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-02-02 08:53:37,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1520, Invalid=2512, Unknown=0, NotChecked=0, Total=4032 [2018-02-02 08:53:37,004 INFO L87 Difference]: Start difference. First operand 112 states and 116 transitions. Second operand 64 states. [2018-02-02 08:53:37,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:53:37,090 INFO L93 Difference]: Finished difference Result 115 states and 119 transitions. [2018-02-02 08:53:37,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 08:53:37,099 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 107 [2018-02-02 08:53:37,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:53:37,100 INFO L225 Difference]: With dead ends: 115 [2018-02-02 08:53:37,100 INFO L226 Difference]: Without dead ends: 113 [2018-02-02 08:53:37,100 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1915 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1617, Invalid=2673, Unknown=0, NotChecked=0, Total=4290 [2018-02-02 08:53:37,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-02 08:53:37,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-02-02 08:53:37,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-02 08:53:37,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 117 transitions. [2018-02-02 08:53:37,103 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 117 transitions. Word has length 107 [2018-02-02 08:53:37,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:53:37,103 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 117 transitions. [2018-02-02 08:53:37,104 INFO L433 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-02-02 08:53:37,104 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2018-02-02 08:53:37,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-02-02 08:53:37,104 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:53:37,104 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-02 08:53:37,104 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-02 08:53:37,105 INFO L82 PathProgramCache]: Analyzing trace with hash 393092224, now seen corresponding path program 26 times [2018-02-02 08:53:37,105 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:53:37,105 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:53:37,105 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:53:37,105 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:53:37,106 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:53:37,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:53:37,126 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:53:37,526 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-02 08:53:37,526 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:53:37,526 INFO L209 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-02 08:53:37,531 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 08:53:37,544 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:53:37,560 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:53:37,563 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:53:37,565 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:53:37,863 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-02 08:53:37,882 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:53:37,882 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 66 [2018-02-02 08:53:37,883 INFO L409 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-02-02 08:53:37,883 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-02-02 08:53:37,883 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1617, Invalid=2673, Unknown=0, NotChecked=0, Total=4290 [2018-02-02 08:53:37,883 INFO L87 Difference]: Start difference. First operand 113 states and 117 transitions. Second operand 66 states. [2018-02-02 08:53:37,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:53:37,967 INFO L93 Difference]: Finished difference Result 116 states and 120 transitions. [2018-02-02 08:53:37,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 08:53:37,967 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 108 [2018-02-02 08:53:37,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:53:37,968 INFO L225 Difference]: With dead ends: 116 [2018-02-02 08:53:37,968 INFO L226 Difference]: Without dead ends: 114 [2018-02-02 08:53:37,968 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2041 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1717, Invalid=2839, Unknown=0, NotChecked=0, Total=4556 [2018-02-02 08:53:37,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-02-02 08:53:37,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-02-02 08:53:37,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-02 08:53:37,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 118 transitions. [2018-02-02 08:53:37,970 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 118 transitions. Word has length 108 [2018-02-02 08:53:37,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:53:37,970 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 118 transitions. [2018-02-02 08:53:37,970 INFO L433 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-02-02 08:53:37,970 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 118 transitions. [2018-02-02 08:53:37,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-02-02 08:53:37,970 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:53:37,970 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-02 08:53:37,970 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-02 08:53:37,970 INFO L82 PathProgramCache]: Analyzing trace with hash 833659731, now seen corresponding path program 27 times [2018-02-02 08:53:37,971 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:53:37,971 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:53:37,971 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:53:37,971 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:53:37,971 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:53:37,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:53:37,989 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:53:38,538 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-02 08:53:38,539 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:53:38,539 INFO L209 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-02 08:53:38,543 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 08:53:38,555 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:53:38,564 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:53:38,574 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:53:38,586 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:53:38,611 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:53:38,632 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:53:38,654 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:53:38,703 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:53:38,850 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:53:39,024 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:53:39,324 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:53:39,989 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:53:40,503 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:53:41,824 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:53:43,431 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:53:46,742 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:53:49,421 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:53:49,425 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:53:49,437 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:53:49,758 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-02 08:53:49,779 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:53:49,779 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 68 [2018-02-02 08:53:49,779 INFO L409 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-02-02 08:53:49,780 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-02-02 08:53:49,780 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1717, Invalid=2839, Unknown=0, NotChecked=0, Total=4556 [2018-02-02 08:53:49,780 INFO L87 Difference]: Start difference. First operand 114 states and 118 transitions. Second operand 68 states. [2018-02-02 08:53:49,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:53:49,858 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2018-02-02 08:53:49,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-02 08:53:49,859 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 109 [2018-02-02 08:53:49,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:53:49,859 INFO L225 Difference]: With dead ends: 117 [2018-02-02 08:53:49,859 INFO L226 Difference]: Without dead ends: 115 [2018-02-02 08:53:49,860 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2171 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1820, Invalid=3010, Unknown=0, NotChecked=0, Total=4830 [2018-02-02 08:53:49,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-02 08:53:49,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-02-02 08:53:49,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-02 08:53:49,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 119 transitions. [2018-02-02 08:53:49,862 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 119 transitions. Word has length 109 [2018-02-02 08:53:49,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:53:49,862 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 119 transitions. [2018-02-02 08:53:49,863 INFO L433 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-02-02 08:53:49,863 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2018-02-02 08:53:49,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-02-02 08:53:49,863 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:53:49,863 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-02 08:53:49,863 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-02 08:53:49,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1606350560, now seen corresponding path program 28 times [2018-02-02 08:53:49,864 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:53:49,864 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:53:49,864 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:53:49,864 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:53:49,865 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:53:49,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:53:49,881 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:53:50,365 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-02 08:53:50,365 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:53:50,366 INFO L209 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-02 08:53:50,370 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Received shutdown request... [2018-02-02 08:53:53,054 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:53:53,061 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:53:53,063 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-02-02 08:53:53,063 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 08:53:53,067 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 08:53:53,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 08:53:53 BoogieIcfgContainer [2018-02-02 08:53:53,067 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 08:53:53,068 INFO L168 Benchmark]: Toolchain (without parser) took 57145.05 ms. Allocated memory was 398.5 MB in the beginning and 1.0 GB in the end (delta: 618.7 MB). Free memory was 355.4 MB in the beginning and 734.5 MB in the end (delta: -379.2 MB). Peak memory consumption was 239.5 MB. Max. memory is 5.3 GB. [2018-02-02 08:53:53,069 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 398.5 MB. Free memory is still 362.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 08:53:53,069 INFO L168 Benchmark]: CACSL2BoogieTranslator took 163.77 ms. Allocated memory is still 398.5 MB. Free memory was 355.4 MB in the beginning and 344.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-02 08:53:53,069 INFO L168 Benchmark]: Boogie Preprocessor took 24.84 ms. Allocated memory is still 398.5 MB. Free memory was 344.8 MB in the beginning and 342.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 08:53:53,069 INFO L168 Benchmark]: RCFGBuilder took 233.85 ms. Allocated memory is still 398.5 MB. Free memory was 342.1 MB in the beginning and 318.8 MB in the end (delta: 23.4 MB). Peak memory consumption was 23.4 MB. Max. memory is 5.3 GB. [2018-02-02 08:53:53,070 INFO L168 Benchmark]: TraceAbstraction took 56719.67 ms. Allocated memory was 398.5 MB in the beginning and 1.0 GB in the end (delta: 618.7 MB). Free memory was 317.5 MB in the beginning and 734.5 MB in the end (delta: -417.1 MB). Peak memory consumption was 201.6 MB. Max. memory is 5.3 GB. [2018-02-02 08:53:53,071 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 398.5 MB. Free memory is still 362.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 163.77 ms. Allocated memory is still 398.5 MB. Free memory was 355.4 MB in the beginning and 344.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 24.84 ms. Allocated memory is still 398.5 MB. Free memory was 344.8 MB in the beginning and 342.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 233.85 ms. Allocated memory is still 398.5 MB. Free memory was 342.1 MB in the beginning and 318.8 MB in the end (delta: 23.4 MB). Peak memory consumption was 23.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 56719.67 ms. Allocated memory was 398.5 MB in the beginning and 1.0 GB in the end (delta: 618.7 MB). Free memory was 317.5 MB in the beginning and 734.5 MB in the end (delta: -417.1 MB). Peak memory consumption was 201.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 111 with TraceHistMax 32, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 662). Cancelled while BasicCegarLoop was analyzing trace of length 111 with TraceHistMax 32, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 662). Cancelled while BasicCegarLoop was analyzing trace of length 111 with TraceHistMax 32, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 111 with TraceHistMax 32, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was analyzing trace of length 111 with TraceHistMax 32, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was analyzing trace of length 111 with TraceHistMax 32, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 111 with TraceHistMax 32, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 111 with TraceHistMax 32, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 674). Cancelled while BasicCegarLoop was analyzing trace of length 111 with TraceHistMax 32, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 678). Cancelled while BasicCegarLoop was analyzing trace of length 111 with TraceHistMax 32, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was analyzing trace of length 111 with TraceHistMax 32, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 670]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 670). Cancelled while BasicCegarLoop was analyzing trace of length 111 with TraceHistMax 32, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 676). Cancelled while BasicCegarLoop was analyzing trace of length 111 with TraceHistMax 32, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was analyzing trace of length 111 with TraceHistMax 32, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 673). Cancelled while BasicCegarLoop was analyzing trace of length 111 with TraceHistMax 32, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 675). Cancelled while BasicCegarLoop was analyzing trace of length 111 with TraceHistMax 32, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was analyzing trace of length 111 with TraceHistMax 32, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 676). Cancelled while BasicCegarLoop was analyzing trace of length 111 with TraceHistMax 32, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was analyzing trace of length 111 with TraceHistMax 32, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 679). Cancelled while BasicCegarLoop was analyzing trace of length 111 with TraceHistMax 32, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 673). Cancelled while BasicCegarLoop was analyzing trace of length 111 with TraceHistMax 32, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 674). Cancelled while BasicCegarLoop was analyzing trace of length 111 with TraceHistMax 32, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 678). Cancelled while BasicCegarLoop was analyzing trace of length 111 with TraceHistMax 32, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 675). Cancelled while BasicCegarLoop was analyzing trace of length 111 with TraceHistMax 32, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 679). Cancelled while BasicCegarLoop was analyzing trace of length 111 with TraceHistMax 32, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 80 locations, 25 error locations. TIMEOUT Result, 56.6s OverallTime, 42 OverallIterations, 32 TraceHistogramMax, 5.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2146 SDtfs, 757 SDslu, 35877 SDs, 0 SdLazy, 5554 SolverSat, 448 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3650 GetRequests, 2284 SyntacticMatches, 57 SemanticMatches, 1309 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25051 ImplicationChecksByTransitivity, 12.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 41 MinimizatonAttempts, 33 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 32.6s SatisfiabilityAnalysisTime, 14.0s InterpolantComputationTime, 5855 NumberOfCodeBlocks, 5851 NumberOfCodeBlocksAsserted, 208 NumberOfCheckSat, 5781 ConstructedInterpolants, 19 QuantifiedInterpolants, 1245965 SizeOfPredicates, 38 NumberOfNonLiveVariables, 10254 ConjunctsInSsa, 620 ConjunctsInUnsatCore, 74 InterpolantComputations, 9 PerfectInterpolantSequences, 2909/13809 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_08-53-53-077.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_08-53-53-077.csv Completed graceful shutdown