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/cstrpbrk-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 17:24:18,867 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 17:24:18,868 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 17:24:18,880 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 17:24:18,880 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 17:24:18,881 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 17:24:18,882 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 17:24:18,884 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 17:24:18,885 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 17:24:18,886 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 17:24:18,886 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 17:24:18,887 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 17:24:18,887 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 17:24:18,888 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 17:24:18,889 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 17:24:18,891 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 17:24:18,893 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 17:24:18,894 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 17:24:18,895 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 17:24:18,896 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 17:24:18,898 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 17:24:18,898 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 17:24:18,898 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 17:24:18,899 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 17:24:18,900 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 17:24:18,901 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 17:24:18,901 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 17:24:18,902 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 17:24:18,902 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 17:24:18,902 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 17:24:18,903 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 17:24:18,903 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:24:18,913 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 17:24:18,913 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 17:24:18,914 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 17:24:18,914 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 17:24:18,914 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 17:24:18,914 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 17:24:18,915 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 17:24:18,915 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 17:24:18,915 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 17:24:18,915 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 17:24:18,915 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 17:24:18,915 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 17:24:18,915 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 17:24:18,916 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 17:24:18,916 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 17:24:18,916 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 17:24:18,916 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 17:24:18,916 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 17:24:18,916 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 17:24:18,916 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 17:24:18,917 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 17:24:18,917 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 17:24:18,917 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 17:24:18,917 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 17:24:18,945 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 17:24:18,955 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 17:24:18,959 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 17:24:18,960 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 17:24:18,960 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 17:24:18,961 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-02-04 17:24:19,121 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 17:24:19,122 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 17:24:19,123 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 17:24:19,123 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 17:24:19,128 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 17:24:19,128 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:24:19" (1/1) ... [2018-02-04 17:24:19,130 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c76d208 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:24:19, skipping insertion in model container [2018-02-04 17:24:19,130 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:24:19" (1/1) ... [2018-02-04 17:24:19,140 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:24:19,165 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:24:19,248 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:24:19,266 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:24:19,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:24:19 WrapperNode [2018-02-04 17:24:19,272 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 17:24:19,272 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 17:24:19,272 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 17:24:19,272 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 17:24:19,280 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:24:19" (1/1) ... [2018-02-04 17:24:19,280 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:24:19" (1/1) ... [2018-02-04 17:24:19,286 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:24:19" (1/1) ... [2018-02-04 17:24:19,287 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:24:19" (1/1) ... [2018-02-04 17:24:19,290 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:24:19" (1/1) ... [2018-02-04 17:24:19,291 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:24:19" (1/1) ... [2018-02-04 17:24:19,292 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:24:19" (1/1) ... [2018-02-04 17:24:19,293 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 17:24:19,293 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 17:24:19,293 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 17:24:19,293 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 17:24:19,294 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:24:19" (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:24:19,326 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 17:24:19,326 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 17:24:19,326 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrpbrk [2018-02-04 17:24:19,326 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 17:24:19,326 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 17:24:19,326 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 17:24:19,326 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 17:24:19,326 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 17:24:19,326 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 17:24:19,326 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 17:24:19,327 INFO L128 BoogieDeclarations]: Found specification of procedure cstrpbrk [2018-02-04 17:24:19,327 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 17:24:19,327 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 17:24:19,327 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 17:24:19,478 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 17:24:19,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:24:19 BoogieIcfgContainer [2018-02-04 17:24:19,479 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 17:24:19,479 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 17:24:19,479 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 17:24:19,481 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 17:24:19,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 05:24:19" (1/3) ... [2018-02-04 17:24:19,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3074f4d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:24:19, skipping insertion in model container [2018-02-04 17:24:19,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:24:19" (2/3) ... [2018-02-04 17:24:19,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3074f4d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:24:19, skipping insertion in model container [2018-02-04 17:24:19,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:24:19" (3/3) ... [2018-02-04 17:24:19,483 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-02-04 17:24:19,488 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 17:24:19,493 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-02-04 17:24:19,516 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 17:24:19,516 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 17:24:19,516 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 17:24:19,517 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 17:24:19,517 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 17:24:19,517 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 17:24:19,517 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 17:24:19,517 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 17:24:19,518 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 17:24:19,532 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-02-04 17:24:19,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 17:24:19,540 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:24:19,541 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:24:19,542 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:24:19,546 INFO L82 PathProgramCache]: Analyzing trace with hash -21044599, now seen corresponding path program 1 times [2018-02-04 17:24:19,547 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:24:19,548 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:24:19,591 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:24:19,592 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:24:19,592 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:24:19,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:24:19,643 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:24:19,657 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:24:19,657 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:24:19,657 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:24:19,658 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:24:19,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:24:19,700 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:24:19,784 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:24:19,786 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:24:19,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:24:19,796 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 17:24:19,815 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:24:19,816 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:24:19,818 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 17 treesize of output 21 [2018-02-04 17:24:19,818 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:24:19,832 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:24:19,832 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-02-04 17:24:19,845 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:24:19,846 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:24:19,846 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:24:19,847 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:24:19,855 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:24:19,855 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:24:19,857 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 5 states. [2018-02-04 17:24:19,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:24:19,981 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2018-02-04 17:24:19,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 17:24:19,983 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-02-04 17:24:19,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:24:19,991 INFO L225 Difference]: With dead ends: 57 [2018-02-04 17:24:19,991 INFO L226 Difference]: Without dead ends: 54 [2018-02-04 17:24:19,993 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-02-04 17:24:20,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-04 17:24:20,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-02-04 17:24:20,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 17:24:20,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-02-04 17:24:20,022 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 13 [2018-02-04 17:24:20,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:24:20,023 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-02-04 17:24:20,023 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:24:20,023 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-02-04 17:24:20,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 17:24:20,023 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:24:20,024 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:24:20,024 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:24:20,024 INFO L82 PathProgramCache]: Analyzing trace with hash -21044598, now seen corresponding path program 1 times [2018-02-04 17:24:20,024 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:24:20,024 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:24:20,025 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:24:20,025 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:24:20,025 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:24:20,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:24:20,038 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:24:20,043 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:24:20,043 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:24:20,043 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:24:20,044 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:24:20,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:24:20,069 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:24:20,096 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:24:20,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:24:20,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:24:20,110 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-02-04 17:24:20,149 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:24:20,150 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:24:20,150 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:24:20,159 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:24:20,159 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:17 [2018-02-04 17:24:20,180 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:24:20,180 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:24:20,180 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 17:24:20,181 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 17:24:20,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 17:24:20,181 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-02-04 17:24:20,182 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 7 states. [2018-02-04 17:24:20,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:24:20,242 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2018-02-04 17:24:20,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 17:24:20,242 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-02-04 17:24:20,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:24:20,244 INFO L225 Difference]: With dead ends: 88 [2018-02-04 17:24:20,244 INFO L226 Difference]: Without dead ends: 88 [2018-02-04 17:24:20,245 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:24:20,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-02-04 17:24:20,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 60. [2018-02-04 17:24:20,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 17:24:20,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2018-02-04 17:24:20,253 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 13 [2018-02-04 17:24:20,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:24:20,253 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2018-02-04 17:24:20,253 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 17:24:20,253 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2018-02-04 17:24:20,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 17:24:20,253 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:24:20,253 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:24:20,253 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:24:20,254 INFO L82 PathProgramCache]: Analyzing trace with hash 36213704, now seen corresponding path program 1 times [2018-02-04 17:24:20,254 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:24:20,254 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:24:20,254 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:24:20,254 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:24:20,254 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:24:20,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:24:20,263 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:24:20,267 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:24:20,267 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:24:20,267 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:24:20,268 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:24:20,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:24:20,294 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:24:20,309 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:24:20,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:24:20,320 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:24:20,320 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:24:20,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:24:20,326 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-02-04 17:24:20,350 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:24:20,351 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:24:20,352 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:24:20,352 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:24:20,363 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:24:20,364 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:24:20,371 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:24:20,372 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-02-04 17:24:20,380 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:24:20,380 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:24:20,380 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 17:24:20,380 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 17:24:20,380 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 17:24:20,381 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-04 17:24:20,381 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand 6 states. [2018-02-04 17:24:20,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:24:20,437 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2018-02-04 17:24:20,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:24:20,437 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-02-04 17:24:20,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:24:20,438 INFO L225 Difference]: With dead ends: 76 [2018-02-04 17:24:20,438 INFO L226 Difference]: Without dead ends: 76 [2018-02-04 17:24:20,438 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:24:20,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-04 17:24:20,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 60. [2018-02-04 17:24:20,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 17:24:20,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2018-02-04 17:24:20,443 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 13 [2018-02-04 17:24:20,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:24:20,443 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2018-02-04 17:24:20,443 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 17:24:20,443 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2018-02-04 17:24:20,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 17:24:20,444 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:24:20,444 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:24:20,444 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:24:20,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1753962764, now seen corresponding path program 1 times [2018-02-04 17:24:20,444 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:24:20,444 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:24:20,445 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:24:20,445 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:24:20,445 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:24:20,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:24:20,456 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:24:20,459 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:24:20,459 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:24:20,459 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:24:20,460 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:24:20,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:24:20,482 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:24:20,489 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:24:20,489 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:24:20,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:24:20,495 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:24:20,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:24:20,500 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-02-04 17:24:20,528 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:24:20,529 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:24:20,529 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:24:20,530 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:24:20,540 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:24:20,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:24:20,548 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:24:20,548 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-02-04 17:24:20,556 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:24:20,556 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:24:20,556 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 17:24:20,557 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 17:24:20,557 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 17:24:20,557 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-04 17:24:20,557 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand 6 states. [2018-02-04 17:24:20,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:24:20,632 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2018-02-04 17:24:20,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:24:20,632 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-02-04 17:24:20,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:24:20,633 INFO L225 Difference]: With dead ends: 59 [2018-02-04 17:24:20,633 INFO L226 Difference]: Without dead ends: 59 [2018-02-04 17:24:20,633 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:24:20,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-04 17:24:20,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2018-02-04 17:24:20,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-04 17:24:20,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2018-02-04 17:24:20,636 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 13 [2018-02-04 17:24:20,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:24:20,637 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-02-04 17:24:20,637 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 17:24:20,637 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2018-02-04 17:24:20,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 17:24:20,637 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:24:20,638 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:24:20,638 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:24:20,638 INFO L82 PathProgramCache]: Analyzing trace with hash -652382516, now seen corresponding path program 1 times [2018-02-04 17:24:20,638 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:24:20,638 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:24:20,639 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:24:20,639 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:24:20,639 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:24:20,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:24:20,650 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:24:20,672 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:24:20,672 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:24:20,672 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 17:24:20,672 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 17:24:20,672 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 17:24:20,673 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 17:24:20,673 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 4 states. [2018-02-04 17:24:20,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:24:20,709 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-02-04 17:24:20,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 17:24:20,710 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 17:24:20,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:24:20,710 INFO L225 Difference]: With dead ends: 52 [2018-02-04 17:24:20,710 INFO L226 Difference]: Without dead ends: 52 [2018-02-04 17:24:20,711 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:24:20,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-04 17:24:20,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-02-04 17:24:20,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 17:24:20,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-02-04 17:24:20,714 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 14 [2018-02-04 17:24:20,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:24:20,714 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-02-04 17:24:20,714 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 17:24:20,714 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-02-04 17:24:20,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 17:24:20,715 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:24:20,715 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:24:20,715 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:24:20,715 INFO L82 PathProgramCache]: Analyzing trace with hash -652382515, now seen corresponding path program 1 times [2018-02-04 17:24:20,715 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:24:20,715 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:24:20,716 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:24:20,716 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:24:20,716 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:24:20,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:24:20,724 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:24:20,782 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:24:20,782 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:24:20,782 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:24:20,782 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:24:20,782 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:24:20,782 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:24:20,783 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 5 states. [2018-02-04 17:24:20,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:24:20,801 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-02-04 17:24:20,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:24:20,801 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-04 17:24:20,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:24:20,801 INFO L225 Difference]: With dead ends: 51 [2018-02-04 17:24:20,802 INFO L226 Difference]: Without dead ends: 51 [2018-02-04 17:24:20,802 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:24:20,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-04 17:24:20,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-04 17:24:20,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 17:24:20,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-02-04 17:24:20,803 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 14 [2018-02-04 17:24:20,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:24:20,804 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-02-04 17:24:20,804 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:24:20,804 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-02-04 17:24:20,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 17:24:20,804 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:24:20,804 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:24:20,804 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:24:20,804 INFO L82 PathProgramCache]: Analyzing trace with hash 470787565, now seen corresponding path program 1 times [2018-02-04 17:24:20,804 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:24:20,804 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:24:20,805 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:24:20,805 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:24:20,805 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:24:20,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:24:20,810 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:24:20,828 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:24:20,828 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:24:20,828 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:24:20,829 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:24:20,829 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:24:20,829 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:24:20,829 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 5 states. [2018-02-04 17:24:20,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:24:20,868 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-02-04 17:24:20,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 17:24:20,868 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-04 17:24:20,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:24:20,869 INFO L225 Difference]: With dead ends: 49 [2018-02-04 17:24:20,869 INFO L226 Difference]: Without dead ends: 49 [2018-02-04 17:24:20,869 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 17:24:20,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-04 17:24:20,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-04 17:24:20,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 17:24:20,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-02-04 17:24:20,871 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 18 [2018-02-04 17:24:20,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:24:20,871 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-02-04 17:24:20,871 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:24:20,871 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-02-04 17:24:20,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 17:24:20,871 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:24:20,871 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:24:20,871 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:24:20,872 INFO L82 PathProgramCache]: Analyzing trace with hash 470787566, now seen corresponding path program 1 times [2018-02-04 17:24:20,872 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:24:20,872 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:24:20,872 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:24:20,872 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:24:20,873 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:24:20,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:24:20,880 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:24:20,940 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:24:20,940 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:24:20,940 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 17:24:20,941 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 17:24:20,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 17:24:20,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 17:24:20,941 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 8 states. [2018-02-04 17:24:21,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:24:21,029 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2018-02-04 17:24:21,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 17:24:21,029 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-02-04 17:24:21,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:24:21,031 INFO L225 Difference]: With dead ends: 73 [2018-02-04 17:24:21,031 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 17:24:21,031 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-02-04 17:24:21,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 17:24:21,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 53. [2018-02-04 17:24:21,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-04 17:24:21,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-02-04 17:24:21,033 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 18 [2018-02-04 17:24:21,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:24:21,034 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-02-04 17:24:21,034 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 17:24:21,034 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-02-04 17:24:21,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 17:24:21,034 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:24:21,034 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:24:21,034 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:24:21,034 INFO L82 PathProgramCache]: Analyzing trace with hash 947097224, now seen corresponding path program 1 times [2018-02-04 17:24:21,034 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:24:21,035 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:24:21,035 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:24:21,035 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:24:21,035 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:24:21,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:24:21,043 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:24:21,098 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:24:21,098 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:24:21,098 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 17:24:21,098 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 17:24:21,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 17:24:21,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 17:24:21,099 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 6 states. [2018-02-04 17:24:21,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:24:21,163 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2018-02-04 17:24:21,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:24:21,164 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-02-04 17:24:21,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:24:21,164 INFO L225 Difference]: With dead ends: 53 [2018-02-04 17:24:21,165 INFO L226 Difference]: Without dead ends: 53 [2018-02-04 17:24:21,165 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:24:21,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-04 17:24:21,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2018-02-04 17:24:21,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 17:24:21,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-02-04 17:24:21,168 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 23 [2018-02-04 17:24:21,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:24:21,168 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-02-04 17:24:21,168 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 17:24:21,168 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-02-04 17:24:21,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 17:24:21,169 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:24:21,169 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:24:21,169 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:24:21,169 INFO L82 PathProgramCache]: Analyzing trace with hash 947097225, now seen corresponding path program 1 times [2018-02-04 17:24:21,169 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:24:21,169 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:24:21,170 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:24:21,170 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:24:21,170 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:24:21,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:24:21,179 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:24:21,256 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:24:21,256 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:24:21,257 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 17:24:21,257 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 17:24:21,257 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 17:24:21,257 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-04 17:24:21,257 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 9 states. [2018-02-04 17:24:21,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:24:21,389 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2018-02-04 17:24:21,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 17:24:21,390 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-02-04 17:24:21,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:24:21,390 INFO L225 Difference]: With dead ends: 67 [2018-02-04 17:24:21,390 INFO L226 Difference]: Without dead ends: 67 [2018-02-04 17:24:21,391 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-02-04 17:24:21,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-04 17:24:21,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 58. [2018-02-04 17:24:21,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-04 17:24:21,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2018-02-04 17:24:21,394 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 23 [2018-02-04 17:24:21,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:24:21,394 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2018-02-04 17:24:21,395 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 17:24:21,395 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2018-02-04 17:24:21,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 17:24:21,395 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:24:21,395 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] [2018-02-04 17:24:21,395 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:24:21,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1236428998, now seen corresponding path program 1 times [2018-02-04 17:24:21,396 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:24:21,396 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:24:21,397 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:24:21,397 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:24:21,397 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:24:21,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:24:21,405 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:24:21,407 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:24:21,408 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:24:21,408 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:24:21,408 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:24:21,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:24:21,427 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:24:21,453 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:24:21,454 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:24:21,456 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:24:21,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:24:21,459 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:24:21,462 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:24:21,463 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-02-04 17:24:21,490 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true [2018-02-04 17:24:21,494 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true [2018-02-04 17:24:21,497 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:24:21,497 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:24:21,497 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 17:24:21,498 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 17:24:21,498 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 17:24:21,498 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=22, Unknown=2, NotChecked=18, Total=56 [2018-02-04 17:24:21,498 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 8 states. [2018-02-04 17:24:21,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:24:21,560 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2018-02-04 17:24:21,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 17:24:21,560 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-02-04 17:24:21,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:24:21,561 INFO L225 Difference]: With dead ends: 57 [2018-02-04 17:24:21,561 INFO L226 Difference]: Without dead ends: 48 [2018-02-04 17:24:21,561 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 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:24:21,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-04 17:24:21,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-02-04 17:24:21,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 17:24:21,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-02-04 17:24:21,564 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 28 [2018-02-04 17:24:21,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:24:21,564 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-02-04 17:24:21,564 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 17:24:21,564 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-02-04 17:24:21,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 17:24:21,564 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:24:21,564 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:24:21,564 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:24:21,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1333847614, now seen corresponding path program 1 times [2018-02-04 17:24:21,565 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:24:21,565 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:24:21,565 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:24:21,565 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:24:21,565 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:24:21,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:24:21,573 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:24:21,591 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:24:21,591 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:24:21,591 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 17:24:21,592 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 17:24:21,592 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 17:24:21,592 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 17:24:21,592 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 3 states. [2018-02-04 17:24:21,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:24:21,599 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-02-04 17:24:21,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 17:24:21,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-02-04 17:24:21,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:24:21,600 INFO L225 Difference]: With dead ends: 50 [2018-02-04 17:24:21,601 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 17:24:21,601 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 17:24:21,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 17:24:21,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-04 17:24:21,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 17:24:21,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-02-04 17:24:21,603 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 28 [2018-02-04 17:24:21,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:24:21,604 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-02-04 17:24:21,604 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 17:24:21,604 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-02-04 17:24:21,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 17:24:21,605 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:24:21,605 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:24:21,605 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:24:21,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1745742785, now seen corresponding path program 1 times [2018-02-04 17:24:21,605 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:24:21,605 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:24:21,606 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:24:21,606 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:24:21,606 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:24:21,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:24:21,619 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:24:21,623 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:24:21,623 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:24:21,623 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:24:21,624 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:24:21,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:24:21,658 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:24:21,664 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:24:21,665 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:24:21,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:24:21,669 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-02-04 17:24:21,688 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:24:21,688 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:24:21,689 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:24:21,689 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:24:21,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:24:21,693 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-02-04 17:24:21,713 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:24:21,715 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:24:21,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:24:21,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:24:21,722 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:24:21,722 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-02-04 17:24:21,738 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:24:21,741 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:24:21,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:24:21,745 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:24:21,755 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:24:21,755 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:36 [2018-02-04 17:24:21,822 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:24:21,824 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:24:21,824 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:24:21,829 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:24:21,829 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:24:21,829 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:24:21,832 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:24:21,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:24:21,839 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:49, output treesize:3 [2018-02-04 17:24:21,847 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 17:24:21,848 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:24:21,848 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-04 17:24:21,848 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 17:24:21,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 17:24:21,848 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-02-04 17:24:21,848 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 12 states. [2018-02-04 17:24:22,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:24:22,023 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2018-02-04 17:24:22,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 17:24:22,023 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2018-02-04 17:24:22,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:24:22,024 INFO L225 Difference]: With dead ends: 62 [2018-02-04 17:24:22,024 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 17:24:22,024 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2018-02-04 17:24:22,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 17:24:22,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-04 17:24:22,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 17:24:22,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-02-04 17:24:22,026 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 30 [2018-02-04 17:24:22,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:24:22,026 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-02-04 17:24:22,026 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 17:24:22,026 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-02-04 17:24:22,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 17:24:22,026 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:24:22,027 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:24:22,027 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:24:22,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1611729279, now seen corresponding path program 1 times [2018-02-04 17:24:22,027 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:24:22,027 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:24:22,028 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:24:22,028 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:24:22,028 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:24:22,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:24:22,039 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:24:22,126 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:24:22,127 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:24:22,127 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 17:24:22,127 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 17:24:22,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 17:24:22,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-04 17:24:22,128 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 11 states. [2018-02-04 17:24:22,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:24:22,230 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2018-02-04 17:24:22,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 17:24:22,231 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-02-04 17:24:22,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:24:22,231 INFO L225 Difference]: With dead ends: 77 [2018-02-04 17:24:22,231 INFO L226 Difference]: Without dead ends: 77 [2018-02-04 17:24:22,232 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-02-04 17:24:22,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-04 17:24:22,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2018-02-04 17:24:22,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-04 17:24:22,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2018-02-04 17:24:22,234 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 30 [2018-02-04 17:24:22,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:24:22,234 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2018-02-04 17:24:22,234 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 17:24:22,235 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2018-02-04 17:24:22,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 17:24:22,235 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:24:22,235 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:24:22,235 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:24:22,236 INFO L82 PathProgramCache]: Analyzing trace with hash -193709055, now seen corresponding path program 1 times [2018-02-04 17:24:22,236 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:24:22,236 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:24:22,236 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:24:22,236 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:24:22,236 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:24:22,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:24:22,245 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:24:22,410 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:24:22,410 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:24:22,410 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:24:22,411 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:24:22,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:24:22,435 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:24:22,447 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:24:22,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:24:22,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:24:22,451 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 17:24:22,485 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:24:22,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 13 treesize of output 12 [2018-02-04 17:24:22,490 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:24:22,492 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:24:22,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:24:22,497 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-02-04 17:24:22,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-02-04 17:24:22,618 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 16 treesize of output 13 [2018-02-04 17:24:22,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:24:22,621 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:24:22,629 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:24:22,629 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:54 [2018-02-04 17:24:22,735 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:24:22,735 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:24:22,735 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2018-02-04 17:24:22,735 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 17:24:22,735 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 17:24:22,735 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2018-02-04 17:24:22,736 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 22 states. [2018-02-04 17:24:23,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:24:23,359 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2018-02-04 17:24:23,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 17:24:23,359 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2018-02-04 17:24:23,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:24:23,360 INFO L225 Difference]: With dead ends: 103 [2018-02-04 17:24:23,361 INFO L226 Difference]: Without dead ends: 103 [2018-02-04 17:24:23,361 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=153, Invalid=839, Unknown=0, NotChecked=0, Total=992 [2018-02-04 17:24:23,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-02-04 17:24:23,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 82. [2018-02-04 17:24:23,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-04 17:24:23,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2018-02-04 17:24:23,364 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 30 [2018-02-04 17:24:23,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:24:23,364 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2018-02-04 17:24:23,364 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 17:24:23,365 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2018-02-04 17:24:23,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 17:24:23,365 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:24:23,365 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:24:23,365 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:24:23,366 INFO L82 PathProgramCache]: Analyzing trace with hash -276872451, now seen corresponding path program 1 times [2018-02-04 17:24:23,366 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:24:23,366 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:24:23,366 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:24:23,367 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:24:23,367 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:24:23,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:24:23,372 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:24:23,412 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:24:23,412 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:24:23,412 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 17:24:23,412 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 17:24:23,412 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 17:24:23,412 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-04 17:24:23,412 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand 10 states. [2018-02-04 17:24:23,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:24:23,495 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2018-02-04 17:24:23,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 17:24:23,496 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-02-04 17:24:23,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:24:23,496 INFO L225 Difference]: With dead ends: 82 [2018-02-04 17:24:23,496 INFO L226 Difference]: Without dead ends: 59 [2018-02-04 17:24:23,496 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-02-04 17:24:23,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-04 17:24:23,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2018-02-04 17:24:23,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-04 17:24:23,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-02-04 17:24:23,498 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 31 [2018-02-04 17:24:23,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:24:23,498 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-02-04 17:24:23,498 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 17:24:23,498 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-02-04 17:24:23,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 17:24:23,499 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:24:23,499 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:24:23,499 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:24:23,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1615321176, now seen corresponding path program 1 times [2018-02-04 17:24:23,499 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:24:23,499 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:24:23,500 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:24:23,500 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:24:23,500 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:24:23,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:24:23,509 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:24:23,512 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:24:23,512 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:24:23,512 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:24:23,513 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:24:23,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:24:23,533 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:24:23,556 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:24:23,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:24:23,561 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:24:23,561 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:24:23,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:24:23,565 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 17:24:23,577 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:24:23,578 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:24:23,578 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:24:23,585 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:24:23,585 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:24:23,586 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:24:23,586 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:24:23,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:24:23,590 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-02-04 17:24:23,628 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:24:23,630 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:24:23,631 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:24:23,632 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:24:23,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:24:23,640 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-02-04 17:24:23,663 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:24:23,666 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:24:23,666 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:24:23,671 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:24:23,679 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:24:23,680 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:39 [2018-02-04 17:24:25,953 WARN L143 SmtUtils]: Spent 2057ms on a formula simplification that was a NOOP. DAG size: 42 [2018-02-04 17:24:26,010 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 47 treesize of output 41 [2018-02-04 17:24:26,015 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 16 treesize of output 13 [2018-02-04 17:24:26,016 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:24:26,024 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 22 treesize of output 14 [2018-02-04 17:24:26,024 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:24:26,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:24:26,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:24:26,044 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:67, output treesize:62 [2018-02-04 17:24:26,117 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:24:26,118 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:24:26,118 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 17:24:26,118 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 17:24:26,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 17:24:26,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2018-02-04 17:24:26,119 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 20 states. [2018-02-04 17:24:28,879 WARN L146 SmtUtils]: Spent 2342ms on a formula simplification. DAG size of input: 75 DAG size of output 75 [2018-02-04 17:24:29,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:24:29,711 INFO L93 Difference]: Finished difference Result 124 states and 135 transitions. [2018-02-04 17:24:29,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 17:24:29,711 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 33 [2018-02-04 17:24:29,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:24:29,712 INFO L225 Difference]: With dead ends: 124 [2018-02-04 17:24:29,712 INFO L226 Difference]: Without dead ends: 124 [2018-02-04 17:24:29,712 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=227, Invalid=1179, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 17:24:29,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-04 17:24:29,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 87. [2018-02-04 17:24:29,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-04 17:24:29,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 98 transitions. [2018-02-04 17:24:29,715 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 98 transitions. Word has length 33 [2018-02-04 17:24:29,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:24:29,715 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 98 transitions. [2018-02-04 17:24:29,715 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 17:24:29,716 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 98 transitions. [2018-02-04 17:24:29,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 17:24:29,716 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:24:29,716 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:24:29,716 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:24:29,717 INFO L82 PathProgramCache]: Analyzing trace with hash 149792585, now seen corresponding path program 2 times [2018-02-04 17:24:29,717 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:24:29,717 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:24:29,717 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:24:29,717 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:24:29,718 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:24:29,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:24:29,728 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:24:29,908 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:24:29,909 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:24:29,909 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:24:29,909 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:24:29,933 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:24:29,933 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:24:29,937 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:24:29,941 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:24:29,941 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:24:29,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:24:29,944 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 17:24:29,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-04 17:24:29,958 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:24:29,958 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:24:29,959 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:24:29,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:24:29,962 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-02-04 17:24:30,029 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:24:30,034 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:24:30,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:24:30,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:24:30,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:24:30,040 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:20 [2018-02-04 17:24:30,103 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:24:30,103 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:24:30,104 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 21 [2018-02-04 17:24:30,104 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 17:24:30,104 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 17:24:30,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2018-02-04 17:24:30,104 INFO L87 Difference]: Start difference. First operand 87 states and 98 transitions. Second operand 22 states. [2018-02-04 17:24:30,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:24:30,394 INFO L93 Difference]: Finished difference Result 140 states and 154 transitions. [2018-02-04 17:24:30,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 17:24:30,394 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 37 [2018-02-04 17:24:30,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:24:30,395 INFO L225 Difference]: With dead ends: 140 [2018-02-04 17:24:30,395 INFO L226 Difference]: Without dead ends: 138 [2018-02-04 17:24:30,395 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 24 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=782, Unknown=0, NotChecked=0, Total=930 [2018-02-04 17:24:30,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-02-04 17:24:30,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 101. [2018-02-04 17:24:30,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-02-04 17:24:30,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2018-02-04 17:24:30,398 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 37 [2018-02-04 17:24:30,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:24:30,399 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2018-02-04 17:24:30,399 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 17:24:30,399 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2018-02-04 17:24:30,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 17:24:30,399 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:24:30,399 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:24:30,399 INFO L371 AbstractCegarLoop]: === Iteration 19 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:24:30,400 INFO L82 PathProgramCache]: Analyzing trace with hash -9798911, now seen corresponding path program 3 times [2018-02-04 17:24:30,400 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:24:30,400 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:24:30,400 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:24:30,400 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:24:30,400 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:24:30,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:24:30,409 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:24:30,527 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 17:24:30,527 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:24:30,527 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:24:30,528 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:24:30,550 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-04 17:24:30,550 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:24:30,552 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:24:30,560 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:24:30,561 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:24:30,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:24:30,564 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 17:24:30,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 17:24:30,573 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:24:30,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:24:30,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:24:30,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:24:30,576 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-02-04 17:24:30,598 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:24:30,604 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:24:30,605 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:24:30,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:24:30,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:24:30,614 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-02-04 17:24:30,666 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-04 17:24:30,667 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:24:30,667 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 15 [2018-02-04 17:24:30,667 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 17:24:30,667 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 17:24:30,667 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-02-04 17:24:30,668 INFO L87 Difference]: Start difference. First operand 101 states and 114 transitions. Second operand 16 states. [2018-02-04 17:24:31,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:24:31,022 INFO L93 Difference]: Finished difference Result 111 states and 120 transitions. [2018-02-04 17:24:31,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 17:24:31,022 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 44 [2018-02-04 17:24:31,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:24:31,023 INFO L225 Difference]: With dead ends: 111 [2018-02-04 17:24:31,023 INFO L226 Difference]: Without dead ends: 109 [2018-02-04 17:24:31,023 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=545, Unknown=0, NotChecked=0, Total=702 [2018-02-04 17:24:31,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-02-04 17:24:31,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 52. [2018-02-04 17:24:31,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 17:24:31,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2018-02-04 17:24:31,025 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 44 [2018-02-04 17:24:31,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:24:31,025 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2018-02-04 17:24:31,025 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 17:24:31,026 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-02-04 17:24:31,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 17:24:31,026 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:24:31,026 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:24:31,026 INFO L371 AbstractCegarLoop]: === Iteration 20 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:24:31,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1837728530, now seen corresponding path program 2 times [2018-02-04 17:24:31,026 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:24:31,027 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:24:31,027 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:24:31,027 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:24:31,027 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:24:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:24:31,038 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:24:31,041 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:24:31,041 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:24:31,041 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:24:31,042 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:24:31,067 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:24:31,067 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:24:31,070 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:24:31,078 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:24:31,078 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:24:31,084 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:24:31,084 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:24:31,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:24:31,090 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-02-04 17:24:31,108 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:24:31,109 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:24:31,109 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:24:31,120 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:24:31,121 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:24:31,121 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:24:31,121 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:24:31,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:24:31,127 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-02-04 17:24:31,151 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:24:31,153 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:24:31,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:24:31,155 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:24:31,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:24:31,161 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2018-02-04 17:24:31,177 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:24:31,179 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:24:31,179 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:24:31,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:24:31,191 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:24:31,191 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-02-04 17:24:31,292 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:24:31,297 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:24:31,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:24:31,309 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:24:31,309 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 17:24:31,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:24:31,334 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:24:31,335 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:53, output treesize:48 [2018-02-04 17:24:31,437 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:24:31,438 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:24:31,438 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 17:24:31,438 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 17:24:31,438 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 17:24:31,438 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-02-04 17:24:31,438 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 16 states. [2018-02-04 17:24:31,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:24:31,893 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-02-04 17:24:31,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 17:24:31,893 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 48 [2018-02-04 17:24:31,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:24:31,893 INFO L225 Difference]: With dead ends: 78 [2018-02-04 17:24:31,893 INFO L226 Difference]: Without dead ends: 78 [2018-02-04 17:24:31,894 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=591, Unknown=0, NotChecked=0, Total=702 [2018-02-04 17:24:31,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-04 17:24:31,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 67. [2018-02-04 17:24:31,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-04 17:24:31,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2018-02-04 17:24:31,895 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 48 [2018-02-04 17:24:31,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:24:31,895 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2018-02-04 17:24:31,895 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 17:24:31,895 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2018-02-04 17:24:31,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-04 17:24:31,895 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:24:31,896 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:24:31,896 INFO L371 AbstractCegarLoop]: === Iteration 21 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:24:31,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1675404904, now seen corresponding path program 3 times [2018-02-04 17:24:31,896 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:24:31,896 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:24:31,896 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:24:31,896 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:24:31,896 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:24:31,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:24:31,906 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:24:31,927 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:24:31,927 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:24:31,927 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:24:31,928 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:24:31,961 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-04 17:24:31,961 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:24:31,965 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:24:31,968 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:24:31,969 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:24:31,973 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:24:31,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:24:31,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:24:31,976 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 17:24:31,986 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:24:31,986 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:24:31,987 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:24:31,987 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:24:31,994 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:24:31,994 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:24:31,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:24:31,999 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-02-04 17:24:32,016 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:24:32,018 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:24:32,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:24:32,031 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:24:32,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:24:32,038 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-02-04 17:24:32,057 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:24:32,059 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:24:32,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:24:32,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:24:32,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:24:32,071 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2018-02-04 17:24:32,565 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 57 treesize of output 47 [2018-02-04 17:24:32,568 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:24:32,570 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:24:32,571 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:24:32,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 31 [2018-02-04 17:24:32,572 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:24:32,585 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:24:32,587 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:24:32,589 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:24:32,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 29 [2018-02-04 17:24:32,593 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 17:24:32,604 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:24:32,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 17:24:32,623 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:86, output treesize:84 [2018-02-04 17:24:32,794 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:24:32,795 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:24:32,795 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-04 17:24:32,795 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 17:24:32,795 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 17:24:32,795 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=635, Unknown=0, NotChecked=0, Total=702 [2018-02-04 17:24:32,795 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand 27 states. [2018-02-04 17:24:34,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:24:34,312 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2018-02-04 17:24:34,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 17:24:34,313 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 63 [2018-02-04 17:24:34,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:24:34,313 INFO L225 Difference]: With dead ends: 117 [2018-02-04 17:24:34,313 INFO L226 Difference]: Without dead ends: 117 [2018-02-04 17:24:34,314 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=259, Invalid=2191, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 17:24:34,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-02-04 17:24:34,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 89. [2018-02-04 17:24:34,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-04 17:24:34,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2018-02-04 17:24:34,315 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 63 [2018-02-04 17:24:34,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:24:34,316 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2018-02-04 17:24:34,316 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 17:24:34,316 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2018-02-04 17:24:34,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-04 17:24:34,316 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:24:34,316 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:24:34,316 INFO L371 AbstractCegarLoop]: === Iteration 22 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:24:34,317 INFO L82 PathProgramCache]: Analyzing trace with hash 899669712, now seen corresponding path program 1 times [2018-02-04 17:24:34,317 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:24:34,317 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:24:34,317 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:24:34,317 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:24:34,318 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:24:34,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:24:34,329 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:24:34,347 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:24:34,348 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:24:34,348 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:24:34,348 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:24:34,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:24:34,387 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:24:34,392 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:24:34,392 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:24:34,397 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:24:34,398 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:24:34,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:24:34,402 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 17:24:34,415 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:24:34,417 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:24:34,417 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:24:34,426 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:24:34,427 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:24:34,427 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:24:34,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:24:34,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:24:34,433 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-02-04 17:24:34,452 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:24:34,455 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:24:34,455 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:24:34,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:24:34,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:24:34,461 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-02-04 17:24:34,479 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:24:34,481 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:24:34,481 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:24:34,486 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:24:34,491 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:24:34,491 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-02-04 17:24:34,545 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:24:34,551 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:24:34,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:24:34,557 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:24:34,557 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:24:34,559 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:24:34,565 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:24:34,565 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:45, output treesize:42 [2018-02-04 17:24:34,634 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-02-04 17:24:34,634 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:24:34,634 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 17:24:34,634 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 17:24:34,634 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 17:24:34,634 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-02-04 17:24:34,635 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand 14 states. [2018-02-04 17:24:35,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:24:35,026 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2018-02-04 17:24:35,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 17:24:35,027 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 70 [2018-02-04 17:24:35,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:24:35,027 INFO L225 Difference]: With dead ends: 87 [2018-02-04 17:24:35,027 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 17:24:35,028 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=487, Unknown=0, NotChecked=0, Total=600 [2018-02-04 17:24:35,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 17:24:35,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 17:24:35,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 17:24:35,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 17:24:35,028 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 70 [2018-02-04 17:24:35,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:24:35,028 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 17:24:35,028 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 17:24:35,029 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 17:24:35,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 17:24:35,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 05:24:35 BoogieIcfgContainer [2018-02-04 17:24:35,033 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 17:24:35,033 INFO L168 Benchmark]: Toolchain (without parser) took 15911.75 ms. Allocated memory was 402.7 MB in the beginning and 779.6 MB in the end (delta: 377.0 MB). Free memory was 359.3 MB in the beginning and 690.2 MB in the end (delta: -330.9 MB). Peak memory consumption was 46.1 MB. Max. memory is 5.3 GB. [2018-02-04 17:24:35,034 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 402.7 MB. Free memory is still 364.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 17:24:35,034 INFO L168 Benchmark]: CACSL2BoogieTranslator took 149.12 ms. Allocated memory is still 402.7 MB. Free memory was 359.3 MB in the beginning and 348.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 17:24:35,034 INFO L168 Benchmark]: Boogie Preprocessor took 21.13 ms. Allocated memory is still 402.7 MB. Free memory was 348.8 MB in the beginning and 346.1 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:24:35,035 INFO L168 Benchmark]: RCFGBuilder took 185.45 ms. Allocated memory is still 402.7 MB. Free memory was 346.1 MB in the beginning and 326.3 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:24:35,035 INFO L168 Benchmark]: TraceAbstraction took 15553.66 ms. Allocated memory was 402.7 MB in the beginning and 779.6 MB in the end (delta: 377.0 MB). Free memory was 326.3 MB in the beginning and 690.2 MB in the end (delta: -363.9 MB). Peak memory consumption was 13.1 MB. Max. memory is 5.3 GB. [2018-02-04 17:24:35,036 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.22 ms. Allocated memory is still 402.7 MB. Free memory is still 364.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 149.12 ms. Allocated memory is still 402.7 MB. Free memory was 359.3 MB in the beginning and 348.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 21.13 ms. Allocated memory is still 402.7 MB. Free memory was 348.8 MB in the beginning and 346.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 185.45 ms. Allocated memory is still 402.7 MB. Free memory was 346.1 MB in the beginning and 326.3 MB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 15553.66 ms. Allocated memory was 402.7 MB in the beginning and 779.6 MB in the end (delta: 377.0 MB). Free memory was 326.3 MB in the beginning and 690.2 MB in the end (delta: -363.9 MB). Peak memory consumption was 13.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 58 locations, 15 error locations. SAFE Result, 15.5s OverallTime, 22 OverallIterations, 4 TraceHistogramMax, 8.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 857 SDtfs, 1879 SDslu, 3531 SDs, 0 SdLazy, 3895 SolverSat, 227 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 651 GetRequests, 308 SyntacticMatches, 12 SemanticMatches, 331 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1281 ImplicationChecksByTransitivity, 9.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=101occurred 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, 22 MinimizatonAttempts, 277 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 1069 NumberOfCodeBlocks, 1069 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 720 ConstructedInterpolants, 142 QuantifiedInterpolants, 498980 SizeOfPredicates, 127 NumberOfNonLiveVariables, 1809 ConjunctsInSsa, 400 ConjunctsInUnsatCore, 25 InterpolantComputations, 15 PerfectInterpolantSequences, 45/232 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/cstrpbrk-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_17-24-35-042.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrpbrk-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_17-24-35-042.csv Received shutdown request...