java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/array-memsafety/subseq-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 12:11:45,695 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 12:11:45,697 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 12:11:45,709 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 12:11:45,709 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 12:11:45,710 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 12:11:45,710 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 12:11:45,712 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 12:11:45,713 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 12:11:45,714 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 12:11:45,715 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 12:11:45,715 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 12:11:45,716 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 12:11:45,717 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 12:11:45,718 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 12:11:45,719 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 12:11:45,721 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 12:11:45,722 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 12:11:45,723 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 12:11:45,724 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 12:11:45,726 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 12:11:45,726 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 12:11:45,726 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 12:11:45,727 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 12:11:45,728 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 12:11:45,728 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 12:11:45,729 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 12:11:45,729 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 12:11:45,729 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 12:11:45,729 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 12:11:45,730 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 12:11:45,730 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-04 12:11:45,739 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 12:11:45,739 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 12:11:45,740 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 12:11:45,740 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 12:11:45,741 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 12:11:45,741 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 12:11:45,741 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 12:11:45,741 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 12:11:45,741 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 12:11:45,741 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 12:11:45,742 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 12:11:45,742 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 12:11:45,742 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 12:11:45,742 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 12:11:45,742 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 12:11:45,742 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 12:11:45,743 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 12:11:45,743 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 12:11:45,743 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 12:11:45,743 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 12:11:45,743 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 12:11:45,743 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 12:11:45,744 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 12:11:45,744 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 12:11:45,774 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 12:11:45,784 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 12:11:45,788 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 12:11:45,789 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 12:11:45,789 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 12:11:45,790 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/subseq-alloca_true-valid-memsafety_true-termination.i [2018-02-04 12:11:45,914 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 12:11:45,915 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 12:11:45,916 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 12:11:45,916 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 12:11:45,922 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 12:11:45,923 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:11:45" (1/1) ... [2018-02-04 12:11:45,925 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5208d2f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:11:45, skipping insertion in model container [2018-02-04 12:11:45,926 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:11:45" (1/1) ... [2018-02-04 12:11:45,937 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:11:45,973 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:11:46,068 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:11:46,084 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:11:46,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:11:46 WrapperNode [2018-02-04 12:11:46,089 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 12:11:46,089 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 12:11:46,090 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 12:11:46,090 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 12:11:46,101 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:11:46" (1/1) ... [2018-02-04 12:11:46,101 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:11:46" (1/1) ... [2018-02-04 12:11:46,109 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:11:46" (1/1) ... [2018-02-04 12:11:46,109 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:11:46" (1/1) ... [2018-02-04 12:11:46,112 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:11:46" (1/1) ... [2018-02-04 12:11:46,115 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:11:46" (1/1) ... [2018-02-04 12:11:46,116 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:11:46" (1/1) ... [2018-02-04 12:11:46,117 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 12:11:46,117 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 12:11:46,118 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 12:11:46,118 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 12:11:46,119 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:11:46" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 12:11:46,155 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 12:11:46,155 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 12:11:46,155 INFO L136 BoogieDeclarations]: Found implementation of procedure subseq [2018-02-04 12:11:46,155 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 12:11:46,155 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 12:11:46,155 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 12:11:46,156 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 12:11:46,156 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 12:11:46,156 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 12:11:46,156 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 12:11:46,156 INFO L128 BoogieDeclarations]: Found specification of procedure subseq [2018-02-04 12:11:46,156 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 12:11:46,156 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 12:11:46,156 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 12:11:46,410 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 12:11:46,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:11:46 BoogieIcfgContainer [2018-02-04 12:11:46,410 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 12:11:46,411 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 12:11:46,411 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 12:11:46,413 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 12:11:46,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 12:11:45" (1/3) ... [2018-02-04 12:11:46,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42aebcb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:11:46, skipping insertion in model container [2018-02-04 12:11:46,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:11:46" (2/3) ... [2018-02-04 12:11:46,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42aebcb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:11:46, skipping insertion in model container [2018-02-04 12:11:46,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:11:46" (3/3) ... [2018-02-04 12:11:46,415 INFO L107 eAbstractionObserver]: Analyzing ICFG subseq-alloca_true-valid-memsafety_true-termination.i [2018-02-04 12:11:46,421 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 12:11:46,425 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-02-04 12:11:46,457 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 12:11:46,458 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 12:11:46,458 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 12:11:46,458 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 12:11:46,458 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 12:11:46,458 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 12:11:46,458 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 12:11:46,458 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 12:11:46,459 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 12:11:46,470 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-02-04 12:11:46,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 12:11:46,489 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:11:46,490 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:11:46,490 INFO L371 AbstractCegarLoop]: === Iteration 1 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:11:46,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1068442526, now seen corresponding path program 1 times [2018-02-04 12:11:46,495 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:11:46,496 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:11:46,538 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:46,538 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:11:46,539 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:46,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:11:46,590 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:11:46,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:11:46,757 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:11:46,757 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:11:46,758 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:11:46,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:11:46,766 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:11:46,767 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 4 states. [2018-02-04 12:11:46,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:11:46,902 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-02-04 12:11:46,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 12:11:46,904 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-04 12:11:46,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:11:46,912 INFO L225 Difference]: With dead ends: 54 [2018-02-04 12:11:46,912 INFO L226 Difference]: Without dead ends: 51 [2018-02-04 12:11:46,914 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:11:46,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-04 12:11:46,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-04 12:11:46,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 12:11:46,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-02-04 12:11:46,945 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 13 [2018-02-04 12:11:46,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:11:46,945 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-02-04 12:11:46,945 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:11:46,945 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-02-04 12:11:46,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 12:11:46,946 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:11:46,946 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:11:46,946 INFO L371 AbstractCegarLoop]: === Iteration 2 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:11:46,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1068442527, now seen corresponding path program 1 times [2018-02-04 12:11:46,947 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:11:46,947 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:11:46,948 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:46,948 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:11:46,948 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:46,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:11:46,961 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:11:47,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:11:47,060 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:11:47,060 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 12:11:47,064 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 12:11:47,064 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 12:11:47,064 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:11:47,065 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 6 states. [2018-02-04 12:11:47,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:11:47,115 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-02-04 12:11:47,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:11:47,116 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-02-04 12:11:47,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:11:47,117 INFO L225 Difference]: With dead ends: 50 [2018-02-04 12:11:47,117 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 12:11:47,118 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-02-04 12:11:47,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 12:11:47,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-04 12:11:47,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 12:11:47,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-02-04 12:11:47,122 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 13 [2018-02-04 12:11:47,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:11:47,122 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-02-04 12:11:47,122 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 12:11:47,122 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-02-04 12:11:47,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 12:11:47,123 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:11:47,123 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:11:47,123 INFO L371 AbstractCegarLoop]: === Iteration 3 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:11:47,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1238020018, now seen corresponding path program 1 times [2018-02-04 12:11:47,124 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:11:47,124 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:11:47,124 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:47,125 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:11:47,125 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:47,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:11:47,136 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:11:47,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:11:47,156 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:11:47,156 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:11:47,156 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:11:47,156 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:11:47,156 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:11:47,156 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 4 states. [2018-02-04 12:11:47,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:11:47,190 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-02-04 12:11:47,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 12:11:47,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 12:11:47,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:11:47,191 INFO L225 Difference]: With dead ends: 49 [2018-02-04 12:11:47,191 INFO L226 Difference]: Without dead ends: 49 [2018-02-04 12:11:47,191 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:11:47,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-04 12:11:47,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-04 12:11:47,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 12:11:47,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-02-04 12:11:47,193 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 14 [2018-02-04 12:11:47,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:11:47,194 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-02-04 12:11:47,194 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:11:47,194 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-02-04 12:11:47,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 12:11:47,194 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:11:47,194 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:11:47,195 INFO L371 AbstractCegarLoop]: === Iteration 4 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:11:47,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1238020017, now seen corresponding path program 1 times [2018-02-04 12:11:47,195 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:11:47,195 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:11:47,195 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:47,195 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:11:47,196 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:47,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:11:47,203 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:11:47,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:11:47,269 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:11:47,269 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 12:11:47,270 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:11:47,270 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:11:47,270 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:11:47,270 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 5 states. [2018-02-04 12:11:47,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:11:47,397 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-02-04 12:11:47,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:11:47,398 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-04 12:11:47,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:11:47,399 INFO L225 Difference]: With dead ends: 48 [2018-02-04 12:11:47,399 INFO L226 Difference]: Without dead ends: 48 [2018-02-04 12:11:47,400 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:11:47,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-04 12:11:47,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-02-04 12:11:47,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 12:11:47,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-02-04 12:11:47,402 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 14 [2018-02-04 12:11:47,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:11:47,402 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2018-02-04 12:11:47,402 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:11:47,402 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-02-04 12:11:47,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 12:11:47,403 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:11:47,403 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:11:47,403 INFO L371 AbstractCegarLoop]: === Iteration 5 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:11:47,403 INFO L82 PathProgramCache]: Analyzing trace with hash -9248999, now seen corresponding path program 1 times [2018-02-04 12:11:47,403 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:11:47,403 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:11:47,403 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:47,404 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:11:47,404 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:47,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:11:47,411 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:11:47,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:11:47,439 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:11:47,440 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 12:11:47,440 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:11:47,440 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:11:47,440 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:11:47,440 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 5 states. [2018-02-04 12:11:47,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:11:47,511 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-02-04 12:11:47,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 12:11:47,511 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-04 12:11:47,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:11:47,512 INFO L225 Difference]: With dead ends: 46 [2018-02-04 12:11:47,512 INFO L226 Difference]: Without dead ends: 46 [2018-02-04 12:11:47,512 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:11:47,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-04 12:11:47,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-02-04 12:11:47,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-04 12:11:47,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2018-02-04 12:11:47,515 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 18 [2018-02-04 12:11:47,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:11:47,515 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2018-02-04 12:11:47,515 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:11:47,515 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2018-02-04 12:11:47,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 12:11:47,516 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:11:47,516 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:11:47,516 INFO L371 AbstractCegarLoop]: === Iteration 6 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:11:47,516 INFO L82 PathProgramCache]: Analyzing trace with hash -9248998, now seen corresponding path program 1 times [2018-02-04 12:11:47,516 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:11:47,516 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:11:47,517 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:47,517 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:11:47,517 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:47,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:11:47,526 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:11:47,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:11:47,594 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:11:47,594 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 12:11:47,594 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 12:11:47,595 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 12:11:47,595 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:11:47,595 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand 8 states. [2018-02-04 12:11:47,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:11:47,703 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2018-02-04 12:11:47,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 12:11:47,703 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-02-04 12:11:47,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:11:47,705 INFO L225 Difference]: With dead ends: 67 [2018-02-04 12:11:47,705 INFO L226 Difference]: Without dead ends: 67 [2018-02-04 12:11:47,706 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-02-04 12:11:47,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-04 12:11:47,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 57. [2018-02-04 12:11:47,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-04 12:11:47,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2018-02-04 12:11:47,708 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 18 [2018-02-04 12:11:47,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:11:47,708 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2018-02-04 12:11:47,708 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 12:11:47,708 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2018-02-04 12:11:47,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 12:11:47,710 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:11:47,710 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] [2018-02-04 12:11:47,710 INFO L371 AbstractCegarLoop]: === Iteration 7 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:11:47,710 INFO L82 PathProgramCache]: Analyzing trace with hash -659041035, now seen corresponding path program 1 times [2018-02-04 12:11:47,710 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:11:47,711 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:11:47,711 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:47,711 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:11:47,711 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:47,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:11:47,720 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:11:47,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:11:47,753 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:11:47,753 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 12:11:47,753 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:11:47,753 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:11:47,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:11:47,754 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand 5 states. [2018-02-04 12:11:47,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:11:47,801 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2018-02-04 12:11:47,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 12:11:47,802 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-02-04 12:11:47,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:11:47,802 INFO L225 Difference]: With dead ends: 54 [2018-02-04 12:11:47,802 INFO L226 Difference]: Without dead ends: 54 [2018-02-04 12:11:47,803 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:11:47,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-04 12:11:47,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-02-04 12:11:47,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 12:11:47,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2018-02-04 12:11:47,805 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 21 [2018-02-04 12:11:47,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:11:47,805 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2018-02-04 12:11:47,805 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:11:47,805 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2018-02-04 12:11:47,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 12:11:47,805 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:11:47,805 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] [2018-02-04 12:11:47,805 INFO L371 AbstractCegarLoop]: === Iteration 8 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:11:47,806 INFO L82 PathProgramCache]: Analyzing trace with hash -659041034, now seen corresponding path program 1 times [2018-02-04 12:11:47,806 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:11:47,806 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:11:47,806 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:47,806 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:11:47,806 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:47,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:11:47,814 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:11:47,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:11:47,917 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:11:47,917 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 12:11:47,917 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 12:11:47,917 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 12:11:47,918 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:11:47,918 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand 8 states. [2018-02-04 12:11:48,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:11:48,016 INFO L93 Difference]: Finished difference Result 70 states and 84 transitions. [2018-02-04 12:11:48,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 12:11:48,017 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-02-04 12:11:48,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:11:48,017 INFO L225 Difference]: With dead ends: 70 [2018-02-04 12:11:48,017 INFO L226 Difference]: Without dead ends: 70 [2018-02-04 12:11:48,017 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-04 12:11:48,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-04 12:11:48,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2018-02-04 12:11:48,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-04 12:11:48,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2018-02-04 12:11:48,021 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 21 [2018-02-04 12:11:48,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:11:48,022 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2018-02-04 12:11:48,022 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 12:11:48,022 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2018-02-04 12:11:48,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 12:11:48,022 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:11:48,022 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:11:48,022 INFO L371 AbstractCegarLoop]: === Iteration 9 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:11:48,023 INFO L82 PathProgramCache]: Analyzing trace with hash 753859844, now seen corresponding path program 1 times [2018-02-04 12:11:48,023 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:11:48,023 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:11:48,023 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:48,023 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:11:48,023 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:48,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:11:48,031 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:11:48,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:11:48,069 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:11:48,069 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:11:48,069 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 12:11:48,069 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 12:11:48,069 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:11:48,070 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. Second operand 3 states. [2018-02-04 12:11:48,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:11:48,075 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2018-02-04 12:11:48,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 12:11:48,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-02-04 12:11:48,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:11:48,077 INFO L225 Difference]: With dead ends: 67 [2018-02-04 12:11:48,077 INFO L226 Difference]: Without dead ends: 67 [2018-02-04 12:11:48,077 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:11:48,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-04 12:11:48,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-02-04 12:11:48,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-04 12:11:48,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2018-02-04 12:11:48,081 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 27 [2018-02-04 12:11:48,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:11:48,082 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2018-02-04 12:11:48,082 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 12:11:48,082 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2018-02-04 12:11:48,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 12:11:48,082 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:11:48,083 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:11:48,083 INFO L371 AbstractCegarLoop]: === Iteration 10 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:11:48,083 INFO L82 PathProgramCache]: Analyzing trace with hash 199156551, now seen corresponding path program 1 times [2018-02-04 12:11:48,083 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:11:48,083 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:11:48,084 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:48,084 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:11:48,084 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:48,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:11:48,098 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:11:48,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:11:48,354 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:11:48,354 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-02-04 12:11:48,354 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 12:11:48,354 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 12:11:48,354 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-02-04 12:11:48,354 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand 15 states. [2018-02-04 12:11:48,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:11:48,688 INFO L93 Difference]: Finished difference Result 112 states and 129 transitions. [2018-02-04 12:11:48,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 12:11:48,688 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2018-02-04 12:11:48,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:11:48,689 INFO L225 Difference]: With dead ends: 112 [2018-02-04 12:11:48,689 INFO L226 Difference]: Without dead ends: 112 [2018-02-04 12:11:48,690 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=620, Unknown=0, NotChecked=0, Total=756 [2018-02-04 12:11:48,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-04 12:11:48,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 102. [2018-02-04 12:11:48,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-02-04 12:11:48,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 123 transitions. [2018-02-04 12:11:48,695 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 123 transitions. Word has length 29 [2018-02-04 12:11:48,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:11:48,696 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 123 transitions. [2018-02-04 12:11:48,696 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 12:11:48,696 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 123 transitions. [2018-02-04 12:11:48,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 12:11:48,697 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:11:48,697 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:11:48,697 INFO L371 AbstractCegarLoop]: === Iteration 11 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:11:48,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1606281783, now seen corresponding path program 1 times [2018-02-04 12:11:48,698 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:11:48,698 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:11:48,698 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:48,699 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:11:48,699 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:48,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:11:48,712 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:11:48,992 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:11:48,993 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:11:48,993 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:11:48,999 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:11:49,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:11:49,032 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:11:49,075 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 6 treesize of output 5 [2018-02-04 12:11:49,077 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:11:49,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:11:49,090 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 12:11:49,129 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:11:49,129 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:11:49,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 12:11:49,133 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:11:49,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:11:49,140 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-02-04 12:11:49,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-02-04 12:11:49,174 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 11 treesize of output 10 [2018-02-04 12:11:49,174 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:11:49,176 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:11:49,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:11:49,181 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-02-04 12:11:49,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-02-04 12:11:49,213 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 11 treesize of output 10 [2018-02-04 12:11:49,213 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:11:49,217 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:11:49,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 12:11:49,223 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-02-04 12:11:50,061 WARN L143 SmtUtils]: Spent 540ms on a formula simplification that was a NOOP. DAG size: 43 [2018-02-04 12:11:50,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 53 [2018-02-04 12:11:50,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2018-02-04 12:11:50,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:11:50,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2018-02-04 12:11:50,209 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 12:11:50,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2018-02-04 12:11:50,245 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-04 12:11:50,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2018-02-04 12:11:50,297 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-02-04 12:11:50,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2018-02-04 12:11:50,375 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 12:11:50,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-02-04 12:11:50,380 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 12:11:50,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-02-04 12:11:50,471 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 12:11:50,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2018-02-04 12:11:50,473 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 12:11:50,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-02-04 12:11:50,517 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 12:11:50,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-02-04 12:11:50,518 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-04 12:11:50,551 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-02-04 12:11:50,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-02-04 12:11:50,593 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 8 variables, input treesize:63, output treesize:66 [2018-02-04 12:11:50,646 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:11:50,670 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:11:50,670 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 29 [2018-02-04 12:11:50,670 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 12:11:50,670 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 12:11:50,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=787, Unknown=0, NotChecked=0, Total=870 [2018-02-04 12:11:50,671 INFO L87 Difference]: Start difference. First operand 102 states and 123 transitions. Second operand 30 states. [2018-02-04 12:11:53,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:11:53,659 INFO L93 Difference]: Finished difference Result 109 states and 129 transitions. [2018-02-04 12:11:53,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 12:11:53,659 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2018-02-04 12:11:53,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:11:53,660 INFO L225 Difference]: With dead ends: 109 [2018-02-04 12:11:53,660 INFO L226 Difference]: Without dead ends: 109 [2018-02-04 12:11:53,661 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=330, Invalid=2220, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 12:11:53,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-02-04 12:11:53,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 89. [2018-02-04 12:11:53,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-04 12:11:53,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 105 transitions. [2018-02-04 12:11:53,672 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 105 transitions. Word has length 29 [2018-02-04 12:11:53,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:11:53,672 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 105 transitions. [2018-02-04 12:11:53,672 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 12:11:53,672 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 105 transitions. [2018-02-04 12:11:53,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 12:11:53,673 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:11:53,673 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, 1, 1, 1, 1] [2018-02-04 12:11:53,673 INFO L371 AbstractCegarLoop]: === Iteration 12 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:11:53,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1713594616, now seen corresponding path program 1 times [2018-02-04 12:11:53,674 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:11:53,674 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:11:53,674 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:53,674 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:11:53,675 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:53,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:11:53,685 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:11:53,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:11:53,748 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:11:53,748 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 12:11:53,749 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 12:11:53,749 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 12:11:53,749 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:11:53,749 INFO L87 Difference]: Start difference. First operand 89 states and 105 transitions. Second operand 6 states. [2018-02-04 12:11:53,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:11:53,842 INFO L93 Difference]: Finished difference Result 88 states and 104 transitions. [2018-02-04 12:11:53,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 12:11:53,842 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-02-04 12:11:53,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:11:53,843 INFO L225 Difference]: With dead ends: 88 [2018-02-04 12:11:53,843 INFO L226 Difference]: Without dead ends: 72 [2018-02-04 12:11:53,843 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:11:53,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-02-04 12:11:53,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2018-02-04 12:11:53,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-04 12:11:53,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2018-02-04 12:11:53,846 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 31 [2018-02-04 12:11:53,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:11:53,846 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2018-02-04 12:11:53,846 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 12:11:53,846 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2018-02-04 12:11:53,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 12:11:53,847 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:11:53,847 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 12:11:53,847 INFO L371 AbstractCegarLoop]: === Iteration 13 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:11:53,847 INFO L82 PathProgramCache]: Analyzing trace with hash -797033429, now seen corresponding path program 1 times [2018-02-04 12:11:53,847 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:11:53,848 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:11:53,848 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:53,848 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:11:53,848 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:53,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:11:53,857 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:11:53,988 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 12:11:53,988 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:11:53,988 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-04 12:11:53,988 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 12:11:53,988 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 12:11:53,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-02-04 12:11:53,989 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. Second operand 12 states. [2018-02-04 12:11:54,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:11:54,220 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-02-04 12:11:54,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 12:11:54,221 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2018-02-04 12:11:54,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:11:54,221 INFO L225 Difference]: With dead ends: 54 [2018-02-04 12:11:54,221 INFO L226 Difference]: Without dead ends: 41 [2018-02-04 12:11:54,221 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2018-02-04 12:11:54,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-02-04 12:11:54,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-02-04 12:11:54,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-04 12:11:54,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-02-04 12:11:54,223 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 32 [2018-02-04 12:11:54,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:11:54,224 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-02-04 12:11:54,224 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 12:11:54,224 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-02-04 12:11:54,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 12:11:54,225 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:11:54,225 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 12:11:54,225 INFO L371 AbstractCegarLoop]: === Iteration 14 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:11:54,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1784966119, now seen corresponding path program 1 times [2018-02-04 12:11:54,225 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:11:54,225 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:11:54,226 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:54,226 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:11:54,226 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:54,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:11:54,236 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:11:54,395 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:11:54,396 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:11:54,396 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:11:54,404 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:11:54,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:11:54,424 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:11:54,431 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 14 treesize of output 11 [2018-02-04 12:11:54,432 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 11 treesize of output 10 [2018-02-04 12:11:54,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:11:54,434 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:11:54,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:11:54,439 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-02-04 12:11:54,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-02-04 12:11:54,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-02-04 12:11:54,522 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:11:54,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:11:54,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:11:54,536 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-02-04 12:11:54,630 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:11:54,659 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:11:54,660 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2018-02-04 12:11:54,660 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 12:11:54,660 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 12:11:54,660 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-02-04 12:11:54,660 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 18 states. [2018-02-04 12:11:54,990 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 59 DAG size of output 43 [2018-02-04 12:11:55,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:11:55,141 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2018-02-04 12:11:55,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 12:11:55,141 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2018-02-04 12:11:55,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:11:55,142 INFO L225 Difference]: With dead ends: 56 [2018-02-04 12:11:55,142 INFO L226 Difference]: Without dead ends: 54 [2018-02-04 12:11:55,143 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=121, Invalid=581, Unknown=0, NotChecked=0, Total=702 [2018-02-04 12:11:55,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-04 12:11:55,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-02-04 12:11:55,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 12:11:55,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-02-04 12:11:55,147 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 32 [2018-02-04 12:11:55,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:11:55,147 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-02-04 12:11:55,147 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 12:11:55,147 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-02-04 12:11:55,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 12:11:55,148 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:11:55,148 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:11:55,148 INFO L371 AbstractCegarLoop]: === Iteration 15 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:11:55,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1498931688, now seen corresponding path program 2 times [2018-02-04 12:11:55,148 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:11:55,148 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:11:55,149 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:55,149 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:11:55,149 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:55,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:11:55,159 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:11:55,702 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:11:55,702 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:11:55,702 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:11:55,709 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:11:55,731 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:11:55,731 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:11:55,733 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:11:55,737 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 6 treesize of output 5 [2018-02-04 12:11:55,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:11:55,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:11:55,739 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 12:11:55,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-04 12:11:55,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-02-04 12:11:55,778 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:11:55,779 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:11:55,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:11:55,781 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-02-04 12:11:55,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 34 [2018-02-04 12:11:55,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-02-04 12:11:55,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:11:55,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 33 [2018-02-04 12:11:55,989 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-02-04 12:11:56,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2018-02-04 12:11:56,033 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-04 12:11:56,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-02-04 12:11:56,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-02-04 12:11:56,076 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:68 [2018-02-04 12:11:56,130 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:11:56,147 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:11:56,147 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 25 [2018-02-04 12:11:56,147 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 12:11:56,147 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 12:11:56,148 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2018-02-04 12:11:56,148 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 26 states. [2018-02-04 12:11:57,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:11:57,553 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2018-02-04 12:11:57,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 12:11:57,553 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 43 [2018-02-04 12:11:57,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:11:57,554 INFO L225 Difference]: With dead ends: 69 [2018-02-04 12:11:57,554 INFO L226 Difference]: Without dead ends: 66 [2018-02-04 12:11:57,554 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=473, Invalid=2607, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 12:11:57,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-04 12:11:57,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 51. [2018-02-04 12:11:57,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 12:11:57,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2018-02-04 12:11:57,555 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 43 [2018-02-04 12:11:57,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:11:57,556 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2018-02-04 12:11:57,556 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 12:11:57,556 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2018-02-04 12:11:57,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 12:11:57,556 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:11:57,556 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:11:57,556 INFO L371 AbstractCegarLoop]: === Iteration 16 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:11:57,556 INFO L82 PathProgramCache]: Analyzing trace with hash 276075674, now seen corresponding path program 1 times [2018-02-04 12:11:57,557 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:11:57,557 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:11:57,557 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:57,557 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:11:57,557 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:57,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:11:57,563 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:11:57,781 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:11:57,781 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:11:57,781 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:11:57,787 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:11:57,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:11:57,805 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:11:57,831 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 6 treesize of output 5 [2018-02-04 12:11:57,832 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:11:57,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:11:57,835 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 12:11:57,861 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 15 treesize of output 12 [2018-02-04 12:11:57,863 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 12 treesize of output 11 [2018-02-04 12:11:57,863 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:11:57,865 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:11:57,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:11:57,866 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-02-04 12:11:57,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-02-04 12:11:57,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 12:11:57,981 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:11:57,984 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:11:57,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:11:57,990 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-02-04 12:11:58,051 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:11:58,068 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:11:58,130 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 19 [2018-02-04 12:11:58,130 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 12:11:58,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 12:11:58,131 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2018-02-04 12:11:58,131 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 20 states. [2018-02-04 12:11:58,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:11:58,508 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-02-04 12:11:58,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 12:11:58,508 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 43 [2018-02-04 12:11:58,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:11:58,508 INFO L225 Difference]: With dead ends: 61 [2018-02-04 12:11:58,508 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 12:11:58,509 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=180, Invalid=812, Unknown=0, NotChecked=0, Total=992 [2018-02-04 12:11:58,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 12:11:58,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 12:11:58,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 12:11:58,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 12:11:58,509 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2018-02-04 12:11:58,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:11:58,509 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 12:11:58,509 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 12:11:58,509 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 12:11:58,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 12:11:58,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 12:11:58 BoogieIcfgContainer [2018-02-04 12:11:58,512 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 12:11:58,513 INFO L168 Benchmark]: Toolchain (without parser) took 12598.38 ms. Allocated memory was 403.7 MB in the beginning and 777.5 MB in the end (delta: 373.8 MB). Free memory was 361.7 MB in the beginning and 591.2 MB in the end (delta: -229.5 MB). Peak memory consumption was 144.3 MB. Max. memory is 5.3 GB. [2018-02-04 12:11:58,513 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 403.7 MB. Free memory is still 367.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 12:11:58,513 INFO L168 Benchmark]: CACSL2BoogieTranslator took 173.39 ms. Allocated memory is still 403.7 MB. Free memory was 360.4 MB in the beginning and 349.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 12:11:58,513 INFO L168 Benchmark]: Boogie Preprocessor took 27.69 ms. Allocated memory is still 403.7 MB. Free memory was 349.8 MB in the beginning and 348.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 12:11:58,514 INFO L168 Benchmark]: RCFGBuilder took 292.91 ms. Allocated memory is still 403.7 MB. Free memory was 348.5 MB in the beginning and 327.3 MB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 5.3 GB. [2018-02-04 12:11:58,514 INFO L168 Benchmark]: TraceAbstraction took 12101.25 ms. Allocated memory was 403.7 MB in the beginning and 777.5 MB in the end (delta: 373.8 MB). Free memory was 327.3 MB in the beginning and 591.2 MB in the end (delta: -263.9 MB). Peak memory consumption was 109.9 MB. Max. memory is 5.3 GB. [2018-02-04 12:11:58,515 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 403.7 MB. Free memory is still 367.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 173.39 ms. Allocated memory is still 403.7 MB. Free memory was 360.4 MB in the beginning and 349.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 27.69 ms. Allocated memory is still 403.7 MB. Free memory was 349.8 MB in the beginning and 348.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 292.91 ms. Allocated memory is still 403.7 MB. Free memory was 348.5 MB in the beginning and 327.3 MB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 12101.25 ms. Allocated memory was 403.7 MB in the beginning and 777.5 MB in the end (delta: 373.8 MB). Free memory was 327.3 MB in the beginning and 591.2 MB in the end (delta: -263.9 MB). Peak memory consumption was 109.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 553]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 55 locations, 15 error locations. SAFE Result, 12.0s OverallTime, 16 OverallIterations, 3 TraceHistogramMax, 6.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 578 SDtfs, 1106 SDslu, 2206 SDs, 0 SdLazy, 2587 SolverSat, 311 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 381 GetRequests, 123 SyntacticMatches, 9 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1681 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=10, 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.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 66 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 545 NumberOfCodeBlocks, 545 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 525 ConstructedInterpolants, 20 QuantifiedInterpolants, 173157 SizeOfPredicates, 41 NumberOfNonLiveVariables, 641 ConjunctsInSsa, 122 ConjunctsInUnsatCore, 20 InterpolantComputations, 12 PerfectInterpolantSequences, 23/107 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/subseq-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_12-11-58-519.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/subseq-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_12-11-58-519.csv Received shutdown request...