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_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 17:36:31,158 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 17:36:31,159 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 17:36:31,171 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 17:36:31,171 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 17:36:31,172 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 17:36:31,173 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 17:36:31,174 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 17:36:31,176 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 17:36:31,176 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 17:36:31,177 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 17:36:31,177 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 17:36:31,178 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 17:36:31,179 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 17:36:31,179 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 17:36:31,181 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 17:36:31,183 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 17:36:31,184 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 17:36:31,185 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 17:36:31,186 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 17:36:31,188 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 17:36:31,188 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 17:36:31,188 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 17:36:31,189 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 17:36:31,189 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 17:36:31,190 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 17:36:31,191 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 17:36:31,191 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 17:36:31,191 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 17:36:31,191 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 17:36:31,191 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 17:36:31,192 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-04 17:36:31,200 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 17:36:31,200 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 17:36:31,201 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 17:36:31,201 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 17:36:31,202 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 17:36:31,202 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 17:36:31,202 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 17:36:31,202 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 17:36:31,202 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 17:36:31,203 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 17:36:31,203 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 17:36:31,203 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 17:36:31,203 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 17:36:31,203 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 17:36:31,203 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 17:36:31,203 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 17:36:31,204 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 17:36:31,204 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 17:36:31,204 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 17:36:31,204 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 17:36:31,204 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 17:36:31,204 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 17:36:31,205 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 17:36:31,205 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 17:36:31,231 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 17:36:31,239 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 17:36:31,242 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 17:36:31,243 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 17:36:31,243 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 17:36:31,243 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-02-04 17:36:31,407 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 17:36:31,409 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 17:36:31,409 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 17:36:31,409 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 17:36:31,413 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 17:36:31,414 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:36:31" (1/1) ... [2018-02-04 17:36:31,415 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@520aea50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:36:31, skipping insertion in model container [2018-02-04 17:36:31,415 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:36:31" (1/1) ... [2018-02-04 17:36:31,429 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:36:31,457 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:36:31,547 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:36:31,559 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:36:31,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:36:31 WrapperNode [2018-02-04 17:36:31,563 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 17:36:31,564 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 17:36:31,564 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 17:36:31,564 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 17:36:31,576 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:36:31" (1/1) ... [2018-02-04 17:36:31,576 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:36:31" (1/1) ... [2018-02-04 17:36:31,585 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:36:31" (1/1) ... [2018-02-04 17:36:31,585 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:36:31" (1/1) ... [2018-02-04 17:36:31,587 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:36:31" (1/1) ... [2018-02-04 17:36:31,589 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:36:31" (1/1) ... [2018-02-04 17:36:31,590 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:36:31" (1/1) ... [2018-02-04 17:36:31,591 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 17:36:31,591 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 17:36:31,591 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 17:36:31,591 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 17:36:31,592 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:36:31" (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 17:36:31,626 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 17:36:31,627 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 17:36:31,627 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrpbrk [2018-02-04 17:36:31,627 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 17:36:31,627 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 17:36:31,627 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 17:36:31,627 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 17:36:31,627 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 17:36:31,627 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 17:36:31,627 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 17:36:31,627 INFO L128 BoogieDeclarations]: Found specification of procedure cstrpbrk [2018-02-04 17:36:31,627 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 17:36:31,628 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 17:36:31,628 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 17:36:31,755 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 17:36:31,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:36:31 BoogieIcfgContainer [2018-02-04 17:36:31,755 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 17:36:31,756 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 17:36:31,756 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 17:36:31,757 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 17:36:31,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 05:36:31" (1/3) ... [2018-02-04 17:36:31,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38e8afdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:36:31, skipping insertion in model container [2018-02-04 17:36:31,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:36:31" (2/3) ... [2018-02-04 17:36:31,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38e8afdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:36:31, skipping insertion in model container [2018-02-04 17:36:31,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:36:31" (3/3) ... [2018-02-04 17:36:31,760 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-02-04 17:36:31,764 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 17:36:31,768 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-04 17:36:31,797 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 17:36:31,798 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 17:36:31,798 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 17:36:31,798 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 17:36:31,798 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 17:36:31,798 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 17:36:31,798 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 17:36:31,798 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 17:36:31,799 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 17:36:31,810 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2018-02-04 17:36:31,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 17:36:31,819 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:36:31,820 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:36:31,820 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:36:31,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1526501255, now seen corresponding path program 1 times [2018-02-04 17:36:31,826 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:36:31,827 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:36:31,862 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:31,862 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:36:31,862 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:31,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:36:31,908 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:36:31,923 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:36:31,923 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:36:31,923 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:36:31,924 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:36:31,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:36:31,962 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:36:31,990 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 17:36:31,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:32,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:36:32,056 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 17:36:32,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 12 treesize of output 11 [2018-02-04 17:36:32,076 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:32,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:36:32,089 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-02-04 17:36:32,097 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 17:36:32,099 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:36:32,099 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 17:36:32,100 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 17:36:32,107 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 17:36:32,108 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 17:36:32,109 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 4 states. [2018-02-04 17:36:32,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:36:32,172 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-02-04 17:36:32,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 17:36:32,173 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-04 17:36:32,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:36:32,181 INFO L225 Difference]: With dead ends: 46 [2018-02-04 17:36:32,181 INFO L226 Difference]: Without dead ends: 43 [2018-02-04 17:36:32,182 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 1 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 17:36:32,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-02-04 17:36:32,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-02-04 17:36:32,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-04 17:36:32,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-02-04 17:36:32,204 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 13 [2018-02-04 17:36:32,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:36:32,205 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-02-04 17:36:32,205 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 17:36:32,205 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-02-04 17:36:32,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 17:36:32,205 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:36:32,205 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:36:32,205 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:36:32,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1526501254, now seen corresponding path program 1 times [2018-02-04 17:36:32,206 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:36:32,206 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:36:32,207 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:32,207 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:36:32,207 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:32,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:36:32,218 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:36:32,227 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:36:32,227 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:36:32,227 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:36:32,228 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:36:32,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:36:32,251 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:36:32,275 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 17:36:32,275 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:32,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:36:32,293 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-02-04 17:36:32,320 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:36:32,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 12 treesize of output 14 [2018-02-04 17:36:32,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:32,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:36:32,329 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:17 [2018-02-04 17:36:32,345 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 17:36:32,345 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:36:32,346 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 17:36:32,346 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 17:36:32,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 17:36:32,347 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-02-04 17:36:32,347 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 7 states. [2018-02-04 17:36:32,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:36:32,419 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2018-02-04 17:36:32,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 17:36:32,420 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-02-04 17:36:32,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:36:32,422 INFO L225 Difference]: With dead ends: 77 [2018-02-04 17:36:32,422 INFO L226 Difference]: Without dead ends: 77 [2018-02-04 17:36:32,423 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-02-04 17:36:32,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-04 17:36:32,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 49. [2018-02-04 17:36:32,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 17:36:32,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-02-04 17:36:32,432 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 13 [2018-02-04 17:36:32,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:36:32,432 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-02-04 17:36:32,432 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 17:36:32,432 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-02-04 17:36:32,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 17:36:32,433 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:36:32,433 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:36:32,433 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:36:32,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1469242952, now seen corresponding path program 1 times [2018-02-04 17:36:32,434 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:36:32,434 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:36:32,435 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:32,435 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:36:32,435 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:32,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:36:32,445 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:36:32,452 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:36:32,452 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:36:32,452 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:36:32,453 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:36:32,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:36:32,477 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:36:32,490 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 17:36:32,490 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:32,495 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 17:36:32,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:32,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:36:32,501 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-02-04 17:36:32,518 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:36:32,519 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:36:32,520 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 17:36:32,521 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:32,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-04 17:36:32,528 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:32,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:36:32,533 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-02-04 17:36:32,544 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 17:36:32,544 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:36:32,544 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 17:36:32,545 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 17:36:32,545 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 17:36:32,545 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-04 17:36:32,545 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 6 states. [2018-02-04 17:36:32,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:36:32,630 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2018-02-04 17:36:32,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:36:32,630 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-02-04 17:36:32,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:36:32,631 INFO L225 Difference]: With dead ends: 65 [2018-02-04 17:36:32,631 INFO L226 Difference]: Without dead ends: 65 [2018-02-04 17:36:32,631 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 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 17:36:32,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-04 17:36:32,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 49. [2018-02-04 17:36:32,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 17:36:32,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-02-04 17:36:32,636 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 13 [2018-02-04 17:36:32,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:36:32,636 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-02-04 17:36:32,636 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 17:36:32,636 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-02-04 17:36:32,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 17:36:32,637 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:36:32,637 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:36:32,637 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:36:32,637 INFO L82 PathProgramCache]: Analyzing trace with hash 248506108, now seen corresponding path program 1 times [2018-02-04 17:36:32,637 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:36:32,637 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:36:32,638 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:32,638 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:36:32,638 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:32,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:36:32,648 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:36:32,652 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:36:32,652 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:36:32,653 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:36:32,653 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:36:32,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:36:32,672 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:36:32,679 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 17:36:32,679 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:32,688 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 17:36:32,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:32,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:36:32,695 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-02-04 17:36:32,712 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:36:32,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-04 17:36:32,713 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:32,723 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:36:32,724 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:36:32,724 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 17:36:32,725 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:32,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:36:32,730 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-02-04 17:36:32,738 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 17:36:32,738 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:36:32,738 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 17:36:32,738 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 17:36:32,739 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 17:36:32,739 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-04 17:36:32,739 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 6 states. [2018-02-04 17:36:32,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:36:32,783 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-02-04 17:36:32,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:36:32,783 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-02-04 17:36:32,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:36:32,784 INFO L225 Difference]: With dead ends: 48 [2018-02-04 17:36:32,784 INFO L226 Difference]: Without dead ends: 48 [2018-02-04 17:36:32,784 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 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 17:36:32,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-04 17:36:32,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2018-02-04 17:36:32,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-04 17:36:32,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-02-04 17:36:32,786 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 13 [2018-02-04 17:36:32,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:36:32,786 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-02-04 17:36:32,786 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 17:36:32,786 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-02-04 17:36:32,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 17:36:32,787 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:36:32,787 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:36:32,787 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:36:32,787 INFO L82 PathProgramCache]: Analyzing trace with hash -76898612, now seen corresponding path program 1 times [2018-02-04 17:36:32,787 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:36:32,787 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:36:32,788 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:32,788 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:36:32,788 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:32,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:36:32,794 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:36:32,813 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 17:36:32,813 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:36:32,813 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 17:36:32,813 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 17:36:32,813 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 17:36:32,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 17:36:32,814 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 4 states. [2018-02-04 17:36:32,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:36:32,838 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-02-04 17:36:32,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 17:36:32,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 17:36:32,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:36:32,839 INFO L225 Difference]: With dead ends: 41 [2018-02-04 17:36:32,839 INFO L226 Difference]: Without dead ends: 41 [2018-02-04 17:36:32,839 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 17:36:32,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-02-04 17:36:32,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-02-04 17:36:32,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-04 17:36:32,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-02-04 17:36:32,842 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 14 [2018-02-04 17:36:32,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:36:32,842 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-02-04 17:36:32,842 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 17:36:32,842 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-02-04 17:36:32,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 17:36:32,843 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:36:32,843 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:36:32,843 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:36:32,843 INFO L82 PathProgramCache]: Analyzing trace with hash -76898611, now seen corresponding path program 1 times [2018-02-04 17:36:32,843 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:36:32,843 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:36:32,844 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:32,844 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:36:32,844 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:32,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:36:32,852 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:36:32,902 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 17:36:32,902 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:36:32,902 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:36:32,902 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:36:32,902 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:36:32,903 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:36:32,903 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 5 states. [2018-02-04 17:36:32,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:36:32,930 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-02-04 17:36:32,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:36:32,930 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-04 17:36:32,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:36:32,930 INFO L225 Difference]: With dead ends: 40 [2018-02-04 17:36:32,930 INFO L226 Difference]: Without dead ends: 40 [2018-02-04 17:36:32,930 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 17:36:32,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-04 17:36:32,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-02-04 17:36:32,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-04 17:36:32,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-02-04 17:36:32,933 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 14 [2018-02-04 17:36:32,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:36:32,933 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-02-04 17:36:32,933 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:36:32,933 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-02-04 17:36:32,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 17:36:32,934 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:36:32,934 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:36:32,934 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:36:32,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1821085779, now seen corresponding path program 1 times [2018-02-04 17:36:32,934 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:36:32,934 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:36:32,935 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:32,935 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:36:32,935 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:32,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:36:32,942 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:36:32,969 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 17:36:32,969 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:36:32,969 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 17:36:32,970 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 17:36:32,970 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 17:36:32,970 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 17:36:32,970 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 6 states. [2018-02-04 17:36:33,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:36:33,010 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-02-04 17:36:33,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:36:33,010 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 17:36:33,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:36:33,011 INFO L225 Difference]: With dead ends: 39 [2018-02-04 17:36:33,011 INFO L226 Difference]: Without dead ends: 39 [2018-02-04 17:36:33,011 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-04 17:36:33,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-02-04 17:36:33,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-02-04 17:36:33,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-02-04 17:36:33,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-02-04 17:36:33,013 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 19 [2018-02-04 17:36:33,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:36:33,014 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-02-04 17:36:33,014 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 17:36:33,014 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-02-04 17:36:33,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 17:36:33,014 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:36:33,014 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:36:33,014 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:36:33,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1821085778, now seen corresponding path program 1 times [2018-02-04 17:36:33,015 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:36:33,015 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:36:33,015 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:33,015 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:36:33,015 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:33,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:36:33,023 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:36:33,118 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 17:36:33,118 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:36:33,118 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 17:36:33,118 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 17:36:33,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 17:36:33,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 17:36:33,119 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 9 states. [2018-02-04 17:36:33,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:36:33,200 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-02-04 17:36:33,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 17:36:33,200 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-02-04 17:36:33,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:36:33,201 INFO L225 Difference]: With dead ends: 44 [2018-02-04 17:36:33,201 INFO L226 Difference]: Without dead ends: 44 [2018-02-04 17:36:33,201 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-02-04 17:36:33,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-04 17:36:33,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2018-02-04 17:36:33,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-04 17:36:33,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-02-04 17:36:33,203 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 19 [2018-02-04 17:36:33,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:36:33,204 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-02-04 17:36:33,204 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 17:36:33,204 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-02-04 17:36:33,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 17:36:33,204 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:36:33,205 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] [2018-02-04 17:36:33,205 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:36:33,205 INFO L82 PathProgramCache]: Analyzing trace with hash -551391085, now seen corresponding path program 1 times [2018-02-04 17:36:33,205 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:36:33,205 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:36:33,206 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:33,206 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:36:33,206 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:33,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:36:33,213 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:36:33,244 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 17:36:33,245 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:36:33,245 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 17:36:33,245 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 17:36:33,245 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 17:36:33,245 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 17:36:33,245 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 7 states. [2018-02-04 17:36:33,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:36:33,340 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-02-04 17:36:33,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 17:36:33,340 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-02-04 17:36:33,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:36:33,341 INFO L225 Difference]: With dead ends: 46 [2018-02-04 17:36:33,341 INFO L226 Difference]: Without dead ends: 46 [2018-02-04 17:36:33,342 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-02-04 17:36:33,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-04 17:36:33,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2018-02-04 17:36:33,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-04 17:36:33,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-02-04 17:36:33,344 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 23 [2018-02-04 17:36:33,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:36:33,344 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-02-04 17:36:33,344 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 17:36:33,344 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-02-04 17:36:33,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 17:36:33,345 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:36:33,345 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] [2018-02-04 17:36:33,345 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:36:33,345 INFO L82 PathProgramCache]: Analyzing trace with hash -551391084, now seen corresponding path program 1 times [2018-02-04 17:36:33,345 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:36:33,345 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:36:33,346 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:33,346 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:36:33,346 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:33,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:36:33,354 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:36:33,433 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 17:36:33,433 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:36:33,433 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 17:36:33,433 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 17:36:33,433 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 17:36:33,433 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-04 17:36:33,434 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 10 states. [2018-02-04 17:36:33,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:36:33,535 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2018-02-04 17:36:33,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 17:36:33,535 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-02-04 17:36:33,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:36:33,536 INFO L225 Difference]: With dead ends: 45 [2018-02-04 17:36:33,536 INFO L226 Difference]: Without dead ends: 45 [2018-02-04 17:36:33,536 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-02-04 17:36:33,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-04 17:36:33,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-02-04 17:36:33,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-04 17:36:33,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-02-04 17:36:33,539 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 23 [2018-02-04 17:36:33,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:36:33,539 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-02-04 17:36:33,539 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 17:36:33,539 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-02-04 17:36:33,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 17:36:33,540 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:36:33,540 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:36:33,540 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:36:33,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1601452084, now seen corresponding path program 1 times [2018-02-04 17:36:33,540 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:36:33,540 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:36:33,541 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:33,541 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:36:33,541 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:33,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:36:33,552 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:36:33,555 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:36:33,556 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:36:33,556 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:36:33,556 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:36:33,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:36:33,590 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:36:33,598 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 17:36:33,598 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:33,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:36:33,602 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-02-04 17:36:33,615 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:36:33,615 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:36:33,616 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 17:36:33,616 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:33,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:36:33,619 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-02-04 17:36:33,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 17:36:33,636 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 17:36:33,636 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:33,637 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:36:33,643 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 17:36:33,643 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-02-04 17:36:33,657 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 17:36:33,660 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 17:36:33,660 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:33,664 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:36:33,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 17:36:33,670 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:36 [2018-02-04 17:36:33,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-02-04 17:36:33,740 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 8 treesize of output 1 [2018-02-04 17:36:33,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:33,746 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:36:33,747 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 0 case distinctions, treesize of input 14 treesize of output 10 [2018-02-04 17:36:33,747 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:33,749 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:36:33,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:36:33,755 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:49, output treesize:8 [2018-02-04 17:36:33,779 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:36:33,779 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:36:33,779 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-02-04 17:36:33,780 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 17:36:33,780 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 17:36:33,780 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-02-04 17:36:33,780 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 14 states. [2018-02-04 17:36:34,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:36:34,109 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-02-04 17:36:34,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 17:36:34,109 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2018-02-04 17:36:34,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:36:34,110 INFO L225 Difference]: With dead ends: 67 [2018-02-04 17:36:34,110 INFO L226 Difference]: Without dead ends: 67 [2018-02-04 17:36:34,110 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=532, Unknown=0, NotChecked=0, Total=650 [2018-02-04 17:36:34,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-04 17:36:34,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 60. [2018-02-04 17:36:34,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 17:36:34,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-02-04 17:36:34,113 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 28 [2018-02-04 17:36:34,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:36:34,113 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-02-04 17:36:34,113 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 17:36:34,113 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-02-04 17:36:34,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 17:36:34,113 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:36:34,113 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:36:34,114 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:36:34,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1820306802, now seen corresponding path program 1 times [2018-02-04 17:36:34,114 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:36:34,114 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:36:34,114 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:34,114 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:36:34,115 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:34,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:36:34,124 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:36:34,127 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:36:34,127 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:36:34,127 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:36:34,128 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:36:34,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:36:34,155 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:36:34,158 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 17:36:34,159 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:34,164 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 17:36:34,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:34,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:36:34,169 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 17:36:34,184 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:36:34,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-04 17:36:34,186 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:34,196 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:36:34,196 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:36:34,197 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 17:36:34,197 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:34,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:36:34,203 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-02-04 17:36:34,227 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 16 treesize of output 13 [2018-02-04 17:36:34,229 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 17:36:34,229 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:34,231 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:36:34,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:36:34,238 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-02-04 17:36:34,260 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 29 treesize of output 30 [2018-02-04 17:36:34,263 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 17:36:34,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:34,268 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:36:34,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 17:36:34,276 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:39 [2018-02-04 17:36:34,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2018-02-04 17:36:34,375 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 10 treesize of output 1 [2018-02-04 17:36:34,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:34,385 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 18 treesize of output 15 [2018-02-04 17:36:34,385 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 17:36:34,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:36:34,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:36:34,395 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:56, output treesize:54 [2018-02-04 17:36:34,511 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:36:34,511 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:36:34,511 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 17:36:34,511 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 17:36:34,511 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 17:36:34,512 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2018-02-04 17:36:34,512 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 15 states. [2018-02-04 17:36:35,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:36:35,248 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2018-02-04 17:36:35,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 17:36:35,248 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-02-04 17:36:35,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:36:35,249 INFO L225 Difference]: With dead ends: 80 [2018-02-04 17:36:35,249 INFO L226 Difference]: Without dead ends: 80 [2018-02-04 17:36:35,249 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=121, Invalid=691, Unknown=0, NotChecked=0, Total=812 [2018-02-04 17:36:35,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-04 17:36:35,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 72. [2018-02-04 17:36:35,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-04 17:36:35,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2018-02-04 17:36:35,252 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 28 [2018-02-04 17:36:35,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:36:35,252 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2018-02-04 17:36:35,252 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 17:36:35,252 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2018-02-04 17:36:35,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 17:36:35,253 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:36:35,253 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] [2018-02-04 17:36:35,253 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:36:35,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1820393708, now seen corresponding path program 1 times [2018-02-04 17:36:35,253 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:36:35,253 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:36:35,254 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:35,254 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:36:35,254 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:35,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:36:35,261 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:36:35,372 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 17:36:35,372 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:36:35,372 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-04 17:36:35,372 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 17:36:35,373 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 17:36:35,373 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-02-04 17:36:35,373 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand 12 states. [2018-02-04 17:36:35,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:36:35,578 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2018-02-04 17:36:35,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 17:36:35,578 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-02-04 17:36:35,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:36:35,579 INFO L225 Difference]: With dead ends: 135 [2018-02-04 17:36:35,579 INFO L226 Difference]: Without dead ends: 135 [2018-02-04 17:36:35,579 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2018-02-04 17:36:35,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-02-04 17:36:35,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 104. [2018-02-04 17:36:35,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-02-04 17:36:35,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 116 transitions. [2018-02-04 17:36:35,583 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 116 transitions. Word has length 28 [2018-02-04 17:36:35,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:36:35,583 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 116 transitions. [2018-02-04 17:36:35,583 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 17:36:35,583 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2018-02-04 17:36:35,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 17:36:35,584 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:36:35,584 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] [2018-02-04 17:36:35,584 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:36:35,585 INFO L82 PathProgramCache]: Analyzing trace with hash -2051871762, now seen corresponding path program 1 times [2018-02-04 17:36:35,585 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:36:35,585 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:36:35,585 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:35,586 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:36:35,586 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:35,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:36:35,593 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:36:35,757 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 17:36:35,757 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:36:35,757 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:36:35,758 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:36:35,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:36:35,781 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:36:35,787 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 17:36:35,787 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:35,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:36:35,790 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 17:36:35,825 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 17:36:35,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-02-04 17:36:35,839 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:35,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:36:35,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:36:35,844 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-02-04 17:36:35,946 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 22 treesize of output 18 [2018-02-04 17:36:35,951 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 18 treesize of output 15 [2018-02-04 17:36:35,951 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:36:35,954 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:36:35,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:36:35,962 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:54 [2018-02-04 17:36:36,055 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 17:36:36,056 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:36:36,056 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 24 [2018-02-04 17:36:36,056 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 17:36:36,056 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 17:36:36,056 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2018-02-04 17:36:36,056 INFO L87 Difference]: Start difference. First operand 104 states and 116 transitions. Second operand 25 states. [2018-02-04 17:36:36,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:36:36,694 INFO L93 Difference]: Finished difference Result 135 states and 154 transitions. [2018-02-04 17:36:36,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 17:36:36,694 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 28 [2018-02-04 17:36:36,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:36:36,695 INFO L225 Difference]: With dead ends: 135 [2018-02-04 17:36:36,695 INFO L226 Difference]: Without dead ends: 135 [2018-02-04 17:36:36,695 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=182, Invalid=1150, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 17:36:36,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-02-04 17:36:36,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 114. [2018-02-04 17:36:36,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-04 17:36:36,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 130 transitions. [2018-02-04 17:36:36,698 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 130 transitions. Word has length 28 [2018-02-04 17:36:36,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:36:36,698 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 130 transitions. [2018-02-04 17:36:36,698 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 17:36:36,698 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 130 transitions. [2018-02-04 17:36:36,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 17:36:36,699 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:36:36,699 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] [2018-02-04 17:36:36,699 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:36:36,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1662272263, now seen corresponding path program 1 times [2018-02-04 17:36:36,699 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:36:36,699 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:36:36,699 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:36,699 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:36:36,699 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:36,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:36:36,704 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:36:36,705 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:36:36,705 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:36:36,705 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:36:36,705 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:36:36,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:36:36,715 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:36:36,738 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:36:36,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-02-04 17:36:36,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-02-04 17:36:36,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:36,745 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:36:36,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 17:36:36,748 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-02-04 17:36:36,773 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc6.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc6.base| 1))) (and (= 0 (select .cse0 |c_main_#t~malloc7.base|)) (= 0 (select |c_old(#valid)| |main_#t~malloc6.base|)) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc7.base| 1) |main_#t~malloc6.base| 0))))) is different from true [2018-02-04 17:36:36,776 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc7.base| Int) (|main_#t~malloc6.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc6.base| 1))) (and (= 0 (select .cse0 |main_#t~malloc7.base|)) (= 0 (select |c_old(#valid)| |main_#t~malloc6.base|)) (= (store (store (store .cse0 |main_#t~malloc7.base| 1) |main_#t~malloc6.base| 0) |main_#t~malloc7.base| 0) |c_#valid|)))) is different from true [2018-02-04 17:36:36,778 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 17:36:36,778 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:36:36,778 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 17:36:36,778 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 17:36:36,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 17:36:36,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=22, Unknown=2, NotChecked=18, Total=56 [2018-02-04 17:36:36,779 INFO L87 Difference]: Start difference. First operand 114 states and 130 transitions. Second operand 8 states. [2018-02-04 17:36:36,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:36:36,836 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2018-02-04 17:36:36,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 17:36:36,836 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-02-04 17:36:36,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:36:36,837 INFO L225 Difference]: With dead ends: 113 [2018-02-04 17:36:36,837 INFO L226 Difference]: Without dead ends: 84 [2018-02-04 17:36:36,837 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=30, Unknown=2, NotChecked=22, Total=72 [2018-02-04 17:36:36,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-04 17:36:36,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-02-04 17:36:36,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-04 17:36:36,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2018-02-04 17:36:36,840 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 30 [2018-02-04 17:36:36,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:36:36,840 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2018-02-04 17:36:36,840 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 17:36:36,840 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2018-02-04 17:36:36,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 17:36:36,841 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:36:36,841 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-04 17:36:36,841 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:36:36,841 INFO L82 PathProgramCache]: Analyzing trace with hash -795993964, now seen corresponding path program 2 times [2018-02-04 17:36:36,842 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:36:36,842 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:36:36,842 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:36,842 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:36:36,842 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:36,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:36:36,850 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:36:37,053 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:36:37,054 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:36:37,054 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:36:37,054 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:36:37,085 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:36:37,085 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:36:37,100 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:36:37,108 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 17:36:37,108 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:37,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:36:37,111 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 17:36:37,132 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 17:36:37,140 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 17:36:37,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:37,142 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:36:37,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:36:37,146 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-02-04 17:36:37,276 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 17:36:37,280 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 17:36:37,281 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:36:37,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:36:37,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:36:37,287 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:30 [2018-02-04 17:36:37,354 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:36:37,355 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:36:37,355 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2018-02-04 17:36:37,355 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 17:36:37,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 17:36:37,356 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=630, Unknown=0, NotChecked=0, Total=702 [2018-02-04 17:36:37,356 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand 27 states. [2018-02-04 17:36:37,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:36:37,791 INFO L93 Difference]: Finished difference Result 119 states and 130 transitions. [2018-02-04 17:36:37,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 17:36:37,792 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 33 [2018-02-04 17:36:37,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:36:37,792 INFO L225 Difference]: With dead ends: 119 [2018-02-04 17:36:37,792 INFO L226 Difference]: Without dead ends: 119 [2018-02-04 17:36:37,793 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=241, Invalid=1565, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 17:36:37,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-04 17:36:37,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 94. [2018-02-04 17:36:37,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-04 17:36:37,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2018-02-04 17:36:37,796 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 33 [2018-02-04 17:36:37,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:36:37,796 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2018-02-04 17:36:37,796 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 17:36:37,796 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2018-02-04 17:36:37,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 17:36:37,797 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:36:37,797 INFO L351 BasicCegarLoop]: trace histogram [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 17:36:37,797 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:36:37,797 INFO L82 PathProgramCache]: Analyzing trace with hash 184039152, now seen corresponding path program 2 times [2018-02-04 17:36:37,797 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:36:37,798 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:36:37,798 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:37,798 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:36:37,798 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:37,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:36:37,806 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:36:37,817 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:36:37,817 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:36:37,817 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:36:37,817 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:36:37,842 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:36:37,842 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:36:37,846 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:36:37,861 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 17:36:37,862 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:37,869 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 17:36:37,869 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:37,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:36:37,876 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:20 [2018-02-04 17:36:37,896 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:36:37,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-04 17:36:37,897 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:37,919 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:36:37,919 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:36:37,919 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 17:36:37,920 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:37,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:36:37,925 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2018-02-04 17:36:37,947 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 16 treesize of output 13 [2018-02-04 17:36:37,949 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 17:36:37,949 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:37,950 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:36:37,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:36:37,956 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2018-02-04 17:36:37,970 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 24 treesize of output 25 [2018-02-04 17:36:37,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 17:36:37,972 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:37,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:36:37,983 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 17:36:37,984 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-02-04 17:36:38,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-02-04 17:36:38,122 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 5 treesize of output 1 [2018-02-04 17:36:38,122 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:38,129 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 17 treesize of output 14 [2018-02-04 17:36:38,130 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 17:36:38,132 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:36:38,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:36:38,140 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:56, output treesize:48 [2018-02-04 17:36:38,267 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:36:38,268 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:36:38,268 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 17:36:38,268 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 17:36:38,268 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 17:36:38,268 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2018-02-04 17:36:38,268 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand 20 states. [2018-02-04 17:36:38,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:36:38,933 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2018-02-04 17:36:38,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 17:36:38,933 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 37 [2018-02-04 17:36:38,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:36:38,933 INFO L225 Difference]: With dead ends: 106 [2018-02-04 17:36:38,933 INFO L226 Difference]: Without dead ends: 106 [2018-02-04 17:36:38,934 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=145, Invalid=977, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 17:36:38,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-02-04 17:36:38,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 103. [2018-02-04 17:36:38,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-04 17:36:38,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 112 transitions. [2018-02-04 17:36:38,935 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 112 transitions. Word has length 37 [2018-02-04 17:36:38,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:36:38,936 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 112 transitions. [2018-02-04 17:36:38,936 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 17:36:38,936 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 112 transitions. [2018-02-04 17:36:38,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 17:36:38,937 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:36:38,937 INFO L351 BasicCegarLoop]: trace histogram [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 17:36:38,937 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:36:38,937 INFO L82 PathProgramCache]: Analyzing trace with hash 206671406, now seen corresponding path program 1 times [2018-02-04 17:36:38,937 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:36:38,937 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:36:38,938 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:38,938 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:36:38,938 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:38,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:36:38,945 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:36:38,947 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:36:38,947 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:36:38,947 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:36:38,948 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:36:38,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:36:38,969 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:36:38,992 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 17:36:38,992 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:39,031 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 17:36:39,031 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:39,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:36:39,035 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 17:36:39,047 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:36:39,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-04 17:36:39,048 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:39,055 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:36:39,055 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:36:39,056 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 17:36:39,056 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:39,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:36:39,060 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-02-04 17:36:39,076 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 16 treesize of output 13 [2018-02-04 17:36:39,077 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 17:36:39,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:39,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:36:39,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:36:39,083 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:25 [2018-02-04 17:36:39,097 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 29 treesize of output 30 [2018-02-04 17:36:39,108 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 17:36:39,108 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:39,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:36:39,119 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 17:36:39,119 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:32 [2018-02-04 17:36:39,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-02-04 17:36:39,251 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 10 treesize of output 1 [2018-02-04 17:36:39,251 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:39,257 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 17:36:39,258 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 17:36:39,259 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:36:39,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:36:39,264 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:43, output treesize:38 [2018-02-04 17:36:39,342 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:36:39,342 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:36:39,342 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 17:36:39,342 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 17:36:39,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 17:36:39,343 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2018-02-04 17:36:39,343 INFO L87 Difference]: Start difference. First operand 103 states and 112 transitions. Second operand 18 states. [2018-02-04 17:36:39,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:36:39,836 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2018-02-04 17:36:39,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 17:36:39,836 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 37 [2018-02-04 17:36:39,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:36:39,837 INFO L225 Difference]: With dead ends: 131 [2018-02-04 17:36:39,837 INFO L226 Difference]: Without dead ends: 131 [2018-02-04 17:36:39,837 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=118, Invalid=812, Unknown=0, NotChecked=0, Total=930 [2018-02-04 17:36:39,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-02-04 17:36:39,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 125. [2018-02-04 17:36:39,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-04 17:36:39,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 138 transitions. [2018-02-04 17:36:39,839 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 138 transitions. Word has length 37 [2018-02-04 17:36:39,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:36:39,839 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 138 transitions. [2018-02-04 17:36:39,839 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 17:36:39,839 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 138 transitions. [2018-02-04 17:36:39,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 17:36:39,840 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:36:39,840 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:36:39,840 INFO L371 AbstractCegarLoop]: === Iteration 19 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:36:39,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1192420270, now seen corresponding path program 3 times [2018-02-04 17:36:39,840 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:36:39,841 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:36:39,841 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:39,841 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:36:39,841 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:39,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:36:39,846 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:36:39,978 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 17:36:39,978 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:36:39,978 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:36:39,979 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:36:40,010 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-04 17:36:40,010 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:36:40,013 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:36:40,017 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 17:36:40,017 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:40,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:36:40,020 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 17:36:40,028 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 17:36:40,030 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 17:36:40,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:40,032 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:36:40,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:36:40,035 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-02-04 17:36:40,126 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 17:36:40,130 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 17:36:40,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:36:40,133 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:36:40,137 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:36:40,137 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:30 [2018-02-04 17:36:40,202 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 17:36:40,202 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:36:40,202 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 22 [2018-02-04 17:36:40,202 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 17:36:40,202 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 17:36:40,202 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2018-02-04 17:36:40,203 INFO L87 Difference]: Start difference. First operand 125 states and 138 transitions. Second operand 23 states. [2018-02-04 17:36:41,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:36:41,217 INFO L93 Difference]: Finished difference Result 187 states and 204 transitions. [2018-02-04 17:36:41,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 17:36:41,218 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 38 [2018-02-04 17:36:41,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:36:41,219 INFO L225 Difference]: With dead ends: 187 [2018-02-04 17:36:41,219 INFO L226 Difference]: Without dead ends: 187 [2018-02-04 17:36:41,219 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=404, Invalid=2046, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 17:36:41,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-02-04 17:36:41,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 88. [2018-02-04 17:36:41,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-04 17:36:41,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2018-02-04 17:36:41,222 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 38 [2018-02-04 17:36:41,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:36:41,223 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2018-02-04 17:36:41,223 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 17:36:41,223 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2018-02-04 17:36:41,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 17:36:41,223 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:36:41,223 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:36:41,224 INFO L371 AbstractCegarLoop]: === Iteration 20 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:36:41,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1120961742, now seen corresponding path program 3 times [2018-02-04 17:36:41,224 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:36:41,224 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:36:41,225 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:41,225 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:36:41,225 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:41,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:36:41,234 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:36:41,248 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:36:41,248 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:36:41,248 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:36:41,249 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:36:41,279 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-04 17:36:41,279 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:36:41,283 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:36:41,294 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 17:36:41,295 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:41,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:36:41,299 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-02-04 17:36:41,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-02-04 17:36:41,322 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 17:36:41,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:36:41,333 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:33 [2018-02-04 17:36:41,372 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 29 treesize of output 26 [2018-02-04 17:36:41,374 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 17:36:41,374 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:41,381 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:36:41,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 25 [2018-02-04 17:36:41,424 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 17:36:41,425 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:41,430 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:36:41,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 17:36:41,454 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:58, output treesize:50 [2018-02-04 17:36:41,482 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 45 treesize of output 40 [2018-02-04 17:36:41,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 22 treesize of output 23 [2018-02-04 17:36:41,485 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:41,492 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:36:41,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 55 [2018-02-04 17:36:41,523 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 48 treesize of output 47 [2018-02-04 17:36:41,523 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:41,533 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:36:41,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 17:36:41,546 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:93, output treesize:85 [2018-02-04 17:36:41,671 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:36:41,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-02-04 17:36:41,674 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 10 treesize of output 1 [2018-02-04 17:36:41,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:41,681 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 17:36:41,681 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 17:36:41,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:36:41,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 17:36:41,691 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:54, output treesize:50 [2018-02-04 17:36:41,786 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:36:41,786 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:36:41,786 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 17:36:41,786 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 17:36:41,786 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 17:36:41,786 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-02-04 17:36:41,787 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand 18 states. [2018-02-04 17:36:42,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:36:42,402 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2018-02-04 17:36:42,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 17:36:42,405 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 46 [2018-02-04 17:36:42,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:36:42,405 INFO L225 Difference]: With dead ends: 100 [2018-02-04 17:36:42,405 INFO L226 Difference]: Without dead ends: 100 [2018-02-04 17:36:42,406 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=108, Invalid=762, Unknown=0, NotChecked=0, Total=870 [2018-02-04 17:36:42,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-02-04 17:36:42,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2018-02-04 17:36:42,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-02-04 17:36:42,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2018-02-04 17:36:42,408 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 46 [2018-02-04 17:36:42,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:36:42,408 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2018-02-04 17:36:42,408 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 17:36:42,408 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2018-02-04 17:36:42,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 17:36:42,409 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:36:42,409 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:36:42,409 INFO L371 AbstractCegarLoop]: === Iteration 21 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:36:42,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1328638388, now seen corresponding path program 2 times [2018-02-04 17:36:42,409 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:36:42,409 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:36:42,410 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:42,410 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:36:42,410 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:36:42,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:36:42,418 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:36:42,430 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:36:42,430 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:36:42,430 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:36:42,431 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:36:42,451 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:36:42,452 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:36:42,455 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:36:42,459 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 17:36:42,459 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:42,465 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 17:36:42,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:42,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:36:42,470 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 17:36:42,483 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:36:42,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-04 17:36:42,484 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:42,493 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:36:42,493 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:36:42,494 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 17:36:42,494 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:42,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:36:42,499 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-02-04 17:36:42,516 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 15 treesize of output 12 [2018-02-04 17:36:42,517 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 17:36:42,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:42,518 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:36:42,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:36:42,521 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-02-04 17:36:42,540 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 28 treesize of output 29 [2018-02-04 17:36:42,542 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 17:36:42,542 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:42,547 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:36:42,551 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 17:36:42,551 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-02-04 17:36:42,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2018-02-04 17:36:42,636 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 17 treesize of output 14 [2018-02-04 17:36:42,636 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:36:42,644 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 10 treesize of output 1 [2018-02-04 17:36:42,644 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:36:42,647 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:36:42,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:36:42,655 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:45, output treesize:40 [2018-02-04 17:36:42,791 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-02-04 17:36:42,791 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:36:42,792 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 17:36:42,792 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 17:36:42,792 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 17:36:42,792 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2018-02-04 17:36:42,792 INFO L87 Difference]: Start difference. First operand 97 states and 102 transitions. Second operand 16 states. [2018-02-04 17:36:43,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:36:43,542 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2018-02-04 17:36:43,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 17:36:43,542 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 46 [2018-02-04 17:36:43,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:36:43,542 INFO L225 Difference]: With dead ends: 96 [2018-02-04 17:36:43,543 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 17:36:43,543 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=141, Invalid=671, Unknown=0, NotChecked=0, Total=812 [2018-02-04 17:36:43,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 17:36:43,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 17:36:43,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 17:36:43,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 17:36:43,543 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2018-02-04 17:36:43,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:36:43,544 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 17:36:43,544 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 17:36:43,544 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 17:36:43,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 17:36:43,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 05:36:43 BoogieIcfgContainer [2018-02-04 17:36:43,548 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 17:36:43,548 INFO L168 Benchmark]: Toolchain (without parser) took 12140.65 ms. Allocated memory was 403.2 MB in the beginning and 820.0 MB in the end (delta: 416.8 MB). Free memory was 357.2 MB in the beginning and 626.5 MB in the end (delta: -269.3 MB). Peak memory consumption was 147.6 MB. Max. memory is 5.3 GB. [2018-02-04 17:36:43,550 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 403.2 MB. Free memory is still 365.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 17:36:43,550 INFO L168 Benchmark]: CACSL2BoogieTranslator took 154.18 ms. Allocated memory is still 403.2 MB. Free memory was 357.2 MB in the beginning and 346.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 17:36:43,550 INFO L168 Benchmark]: Boogie Preprocessor took 27.04 ms. Allocated memory is still 403.2 MB. Free memory was 346.7 MB in the beginning and 344.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 17:36:43,550 INFO L168 Benchmark]: RCFGBuilder took 164.49 ms. Allocated memory is still 403.2 MB. Free memory was 344.0 MB in the beginning and 324.2 MB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 5.3 GB. [2018-02-04 17:36:43,550 INFO L168 Benchmark]: TraceAbstraction took 11792.17 ms. Allocated memory was 403.2 MB in the beginning and 820.0 MB in the end (delta: 416.8 MB). Free memory was 324.2 MB in the beginning and 626.5 MB in the end (delta: -302.3 MB). Peak memory consumption was 114.5 MB. Max. memory is 5.3 GB. [2018-02-04 17:36:43,551 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.10 ms. Allocated memory is still 403.2 MB. Free memory is still 365.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 154.18 ms. Allocated memory is still 403.2 MB. Free memory was 357.2 MB in the beginning and 346.7 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.04 ms. Allocated memory is still 403.2 MB. Free memory was 346.7 MB in the beginning and 344.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 164.49 ms. Allocated memory is still 403.2 MB. Free memory was 344.0 MB in the beginning and 324.2 MB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 11792.17 ms. Allocated memory was 403.2 MB in the beginning and 820.0 MB in the end (delta: 416.8 MB). Free memory was 324.2 MB in the beginning and 626.5 MB in the end (delta: -302.3 MB). Peak memory consumption was 114.5 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: 552]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 47 locations, 9 error locations. SAFE Result, 11.7s OverallTime, 21 OverallIterations, 4 TraceHistogramMax, 6.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 708 SDtfs, 1236 SDslu, 3973 SDs, 0 SdLazy, 3632 SolverSat, 287 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 642 GetRequests, 252 SyntacticMatches, 7 SemanticMatches, 383 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1814 ImplicationChecksByTransitivity, 6.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125occurred in iteration=18, 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, 21 MinimizatonAttempts, 262 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 946 NumberOfCodeBlocks, 946 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 618 ConstructedInterpolants, 122 QuantifiedInterpolants, 291012 SizeOfPredicates, 159 NumberOfNonLiveVariables, 1912 ConjunctsInSsa, 509 ConjunctsInUnsatCore, 24 InterpolantComputations, 13 PerfectInterpolantSequences, 27/174 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/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_17-36-43-557.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_17-36-43-557.csv Received shutdown request...