java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 17:32:48,753 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 17:32:48,754 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 17:32:48,766 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 17:32:48,766 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 17:32:48,767 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 17:32:48,768 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 17:32:48,769 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 17:32:48,770 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 17:32:48,771 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 17:32:48,772 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 17:32:48,772 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 17:32:48,773 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 17:32:48,774 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 17:32:48,774 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 17:32:48,776 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 17:32:48,777 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 17:32:48,779 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 17:32:48,780 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 17:32:48,781 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 17:32:48,782 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 17:32:48,783 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 17:32:48,783 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 17:32:48,783 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 17:32:48,784 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 17:32:48,785 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 17:32:48,785 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 17:32:48,785 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 17:32:48,786 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 17:32:48,786 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 17:32:48,786 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 17:32:48,786 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:32:48,794 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 17:32:48,795 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 17:32:48,795 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 17:32:48,795 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 17:32:48,796 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 17:32:48,796 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 17:32:48,796 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 17:32:48,796 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 17:32:48,796 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 17:32:48,796 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 17:32:48,796 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 17:32:48,796 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 17:32:48,796 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 17:32:48,797 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 17:32:48,797 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 17:32:48,797 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 17:32:48,797 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 17:32:48,797 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 17:32:48,797 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 17:32:48,797 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 17:32:48,797 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 17:32:48,798 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 17:32:48,798 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 17:32:48,798 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 17:32:48,826 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 17:32:48,838 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 17:32:48,841 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 17:32:48,842 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 17:32:48,843 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 17:32:48,843 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-02-04 17:32:48,979 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 17:32:48,980 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 17:32:48,980 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 17:32:48,980 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 17:32:48,984 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 17:32:48,984 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:32:48" (1/1) ... [2018-02-04 17:32:48,986 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a1f9c0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:32:48, skipping insertion in model container [2018-02-04 17:32:48,986 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:32:48" (1/1) ... [2018-02-04 17:32:48,995 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:32:49,022 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:32:49,104 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:32:49,116 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:32:49,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:32:49 WrapperNode [2018-02-04 17:32:49,121 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 17:32:49,121 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 17:32:49,121 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 17:32:49,121 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 17:32:49,130 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:32:49" (1/1) ... [2018-02-04 17:32:49,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:32:49" (1/1) ... [2018-02-04 17:32:49,138 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:32:49" (1/1) ... [2018-02-04 17:32:49,138 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:32:49" (1/1) ... [2018-02-04 17:32:49,140 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:32:49" (1/1) ... [2018-02-04 17:32:49,142 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:32:49" (1/1) ... [2018-02-04 17:32:49,143 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:32:49" (1/1) ... [2018-02-04 17:32:49,144 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 17:32:49,144 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 17:32:49,144 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 17:32:49,144 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 17:32:49,145 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:32:49" (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:32:49,177 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 17:32:49,177 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 17:32:49,177 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncat [2018-02-04 17:32:49,178 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 17:32:49,178 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 17:32:49,178 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 17:32:49,178 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 17:32:49,178 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 17:32:49,178 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 17:32:49,178 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 17:32:49,179 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncat [2018-02-04 17:32:49,179 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 17:32:49,179 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 17:32:49,179 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 17:32:49,326 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 17:32:49,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:32:49 BoogieIcfgContainer [2018-02-04 17:32:49,327 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 17:32:49,327 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 17:32:49,327 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 17:32:49,329 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 17:32:49,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 05:32:48" (1/3) ... [2018-02-04 17:32:49,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4024afc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:32:49, skipping insertion in model container [2018-02-04 17:32:49,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:32:49" (2/3) ... [2018-02-04 17:32:49,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4024afc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:32:49, skipping insertion in model container [2018-02-04 17:32:49,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:32:49" (3/3) ... [2018-02-04 17:32:49,331 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-02-04 17:32:49,336 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 17:32:49,340 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-02-04 17:32:49,374 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 17:32:49,374 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 17:32:49,374 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 17:32:49,374 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 17:32:49,374 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 17:32:49,375 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 17:32:49,375 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 17:32:49,375 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 17:32:49,376 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 17:32:49,387 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-02-04 17:32:49,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-04 17:32:49,394 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:32:49,395 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:32:49,395 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 17:32:49,399 INFO L82 PathProgramCache]: Analyzing trace with hash 2055638365, now seen corresponding path program 1 times [2018-02-04 17:32:49,401 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:32:49,401 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:32:49,434 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:49,434 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:32:49,434 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:49,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:32:49,481 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:32:49,521 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:32:49,523 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:32:49,523 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 17:32:49,524 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 17:32:49,532 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 17:32:49,532 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 17:32:49,534 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 3 states. [2018-02-04 17:32:49,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:32:49,595 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2018-02-04 17:32:49,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 17:32:49,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-02-04 17:32:49,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:32:49,653 INFO L225 Difference]: With dead ends: 55 [2018-02-04 17:32:49,653 INFO L226 Difference]: Without dead ends: 51 [2018-02-04 17:32:49,654 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:32:49,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-04 17:32:49,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-04 17:32:49,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 17:32:49,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-02-04 17:32:49,683 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 11 [2018-02-04 17:32:49,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:32:49,684 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-02-04 17:32:49,684 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 17:32:49,684 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-02-04 17:32:49,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 17:32:49,685 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:32:49,685 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:32:49,685 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 17:32:49,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1872133330, now seen corresponding path program 1 times [2018-02-04 17:32:49,685 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:32:49,685 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:32:49,686 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:49,686 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:32:49,687 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:49,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:32:49,696 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:32:49,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:32:49,754 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:32:49,754 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 17:32:49,755 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:32:49,755 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:32:49,755 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:32:49,756 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 5 states. [2018-02-04 17:32:49,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:32:49,812 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-02-04 17:32:49,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 17:32:49,813 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-04 17:32:49,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:32:49,814 INFO L225 Difference]: With dead ends: 54 [2018-02-04 17:32:49,814 INFO L226 Difference]: Without dead ends: 51 [2018-02-04 17:32:49,814 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-04 17:32:49,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-04 17:32:49,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-04 17:32:49,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 17:32:49,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-02-04 17:32:49,819 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 15 [2018-02-04 17:32:49,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:32:49,819 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-02-04 17:32:49,819 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:32:49,819 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-02-04 17:32:49,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 17:32:49,820 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:32:49,820 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:32:49,820 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 17:32:49,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1192074960, now seen corresponding path program 1 times [2018-02-04 17:32:49,821 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:32:49,821 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:32:49,822 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:49,822 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:32:49,822 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:49,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:32:49,842 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:32:49,849 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:32:49,850 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:32:49,850 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:32:49,850 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:32:49,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:32:49,883 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:32:49,909 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:32:49,910 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:49,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:32:49,912 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 17:32:49,923 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:32:49,924 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:32:49,926 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:32:49,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:49,931 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:32:49,931 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-02-04 17:32:49,948 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:32:49,949 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:32:49,949 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:32:49,949 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:32:49,949 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:32:49,949 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:32:49,949 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 5 states. [2018-02-04 17:32:50,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:32:50,021 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-02-04 17:32:50,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 17:32:50,021 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-04 17:32:50,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:32:50,022 INFO L225 Difference]: With dead ends: 50 [2018-02-04 17:32:50,022 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 17:32:50,023 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 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:32:50,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 17:32:50,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-04 17:32:50,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 17:32:50,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-02-04 17:32:50,027 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 15 [2018-02-04 17:32:50,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:32:50,027 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-02-04 17:32:50,027 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:32:50,027 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-02-04 17:32:50,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 17:32:50,028 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:32:50,028 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:32:50,028 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 17:32:50,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1192074959, now seen corresponding path program 1 times [2018-02-04 17:32:50,028 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:32:50,028 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:32:50,029 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:50,029 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:32:50,029 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:50,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:32:50,040 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:32:50,047 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:32:50,047 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:32:50,047 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:32:50,048 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:32:50,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:32:50,070 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:32:50,086 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:32:50,086 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:50,095 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:32:50,095 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:50,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:32:50,101 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:25 [2018-02-04 17:32:50,127 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:32:50,128 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:32:50,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-02-04 17:32:50,129 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:50,143 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:32:50,147 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:32:50,147 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:32:50,147 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:50,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:32:50,156 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:24 [2018-02-04 17:32:50,169 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:32:50,169 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:32:50,169 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 17:32:50,169 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 17:32:50,170 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 17:32:50,170 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-04 17:32:50,170 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 8 states. [2018-02-04 17:32:50,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:32:50,287 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-02-04 17:32:50,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 17:32:50,287 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-02-04 17:32:50,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:32:50,289 INFO L225 Difference]: With dead ends: 49 [2018-02-04 17:32:50,289 INFO L226 Difference]: Without dead ends: 49 [2018-02-04 17:32:50,289 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-02-04 17:32:50,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-04 17:32:50,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-04 17:32:50,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 17:32:50,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-02-04 17:32:50,293 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 15 [2018-02-04 17:32:50,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:32:50,293 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-02-04 17:32:50,293 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 17:32:50,294 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-02-04 17:32:50,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 17:32:50,294 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:32:50,294 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:32:50,294 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 17:32:50,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1700381909, now seen corresponding path program 1 times [2018-02-04 17:32:50,295 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:32:50,295 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:32:50,295 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:50,296 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:32:50,296 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:50,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:32:50,306 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:32:50,326 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:32:50,327 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:32:50,327 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 17:32:50,327 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 17:32:50,327 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 17:32:50,327 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 17:32:50,327 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 4 states. [2018-02-04 17:32:50,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:32:50,354 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-02-04 17:32:50,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 17:32:50,354 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-04 17:32:50,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:32:50,354 INFO L225 Difference]: With dead ends: 48 [2018-02-04 17:32:50,355 INFO L226 Difference]: Without dead ends: 48 [2018-02-04 17:32:50,355 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:32:50,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-04 17:32:50,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-02-04 17:32:50,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 17:32:50,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-02-04 17:32:50,358 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 16 [2018-02-04 17:32:50,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:32:50,358 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2018-02-04 17:32:50,358 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 17:32:50,359 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-02-04 17:32:50,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 17:32:50,359 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:32:50,359 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:32:50,359 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 17:32:50,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1700381910, now seen corresponding path program 1 times [2018-02-04 17:32:50,359 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:32:50,360 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:32:50,360 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:50,361 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:32:50,361 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:50,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:32:50,370 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:32:50,423 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:32:50,423 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:32:50,423 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:32:50,424 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:32:50,424 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:32:50,424 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:32:50,424 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 5 states. [2018-02-04 17:32:50,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:32:50,447 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-02-04 17:32:50,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:32:50,451 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-02-04 17:32:50,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:32:50,451 INFO L225 Difference]: With dead ends: 47 [2018-02-04 17:32:50,452 INFO L226 Difference]: Without dead ends: 47 [2018-02-04 17:32:50,452 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:32:50,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-04 17:32:50,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-02-04 17:32:50,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-04 17:32:50,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-02-04 17:32:50,455 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 16 [2018-02-04 17:32:50,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:32:50,455 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-02-04 17:32:50,456 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:32:50,456 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-02-04 17:32:50,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 17:32:50,456 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:32:50,456 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:32:50,456 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 17:32:50,457 INFO L82 PathProgramCache]: Analyzing trace with hash -275307336, now seen corresponding path program 1 times [2018-02-04 17:32:50,457 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:32:50,457 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:32:50,457 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:50,458 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:32:50,458 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:50,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:32:50,473 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:32:50,502 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:32:50,502 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:32:50,502 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 17:32:50,502 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 17:32:50,502 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 17:32:50,502 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 17:32:50,502 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 6 states. [2018-02-04 17:32:50,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:32:50,569 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-02-04 17:32:50,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:32:50,569 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-02-04 17:32:50,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:32:50,571 INFO L225 Difference]: With dead ends: 47 [2018-02-04 17:32:50,571 INFO L226 Difference]: Without dead ends: 47 [2018-02-04 17:32:50,571 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:32:50,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-04 17:32:50,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2018-02-04 17:32:50,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-02-04 17:32:50,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-02-04 17:32:50,573 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 21 [2018-02-04 17:32:50,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:32:50,574 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-02-04 17:32:50,574 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 17:32:50,574 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-02-04 17:32:50,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 17:32:50,574 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:32:50,574 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:32:50,574 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 17:32:50,574 INFO L82 PathProgramCache]: Analyzing trace with hash -275307335, now seen corresponding path program 1 times [2018-02-04 17:32:50,574 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:32:50,575 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:32:50,575 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:50,575 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:32:50,575 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:50,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:32:50,584 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:32:50,665 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:32:50,666 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:32:50,666 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 17:32:50,666 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 17:32:50,666 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 17:32:50,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-04 17:32:50,667 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 10 states. [2018-02-04 17:32:50,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:32:50,786 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2018-02-04 17:32:50,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 17:32:50,787 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-02-04 17:32:50,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:32:50,788 INFO L225 Difference]: With dead ends: 57 [2018-02-04 17:32:50,788 INFO L226 Difference]: Without dead ends: 57 [2018-02-04 17:32:50,788 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2018-02-04 17:32:50,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-04 17:32:50,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 52. [2018-02-04 17:32:50,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 17:32:50,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2018-02-04 17:32:50,791 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 21 [2018-02-04 17:32:50,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:32:50,792 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2018-02-04 17:32:50,792 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 17:32:50,792 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2018-02-04 17:32:50,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 17:32:50,792 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:32:50,793 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] [2018-02-04 17:32:50,793 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 17:32:50,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1706718631, now seen corresponding path program 1 times [2018-02-04 17:32:50,793 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:32:50,793 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:32:50,794 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:50,794 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:32:50,794 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:50,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:32:50,803 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:32:50,848 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:32:50,848 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:32:50,848 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 17:32:50,848 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 17:32:50,849 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 17:32:50,849 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 17:32:50,849 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand 7 states. [2018-02-04 17:32:50,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:32:50,944 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2018-02-04 17:32:50,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 17:32:50,945 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-02-04 17:32:50,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:32:50,946 INFO L225 Difference]: With dead ends: 54 [2018-02-04 17:32:50,946 INFO L226 Difference]: Without dead ends: 54 [2018-02-04 17:32:50,946 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-02-04 17:32:50,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-04 17:32:50,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-02-04 17:32:50,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 17:32:50,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2018-02-04 17:32:50,949 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 24 [2018-02-04 17:32:50,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:32:50,949 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2018-02-04 17:32:50,949 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 17:32:50,949 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2018-02-04 17:32:50,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 17:32:50,950 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:32:50,950 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] [2018-02-04 17:32:50,950 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 17:32:50,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1706718632, now seen corresponding path program 1 times [2018-02-04 17:32:50,950 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:32:50,950 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:32:50,951 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:50,951 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:32:50,951 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:50,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:32:50,960 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:32:51,045 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:32:51,045 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:32:51,046 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 17:32:51,046 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 17:32:51,046 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 17:32:51,046 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-04 17:32:51,046 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand 10 states. [2018-02-04 17:32:51,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:32:51,212 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2018-02-04 17:32:51,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 17:32:51,212 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-02-04 17:32:51,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:32:51,212 INFO L225 Difference]: With dead ends: 56 [2018-02-04 17:32:51,213 INFO L226 Difference]: Without dead ends: 56 [2018-02-04 17:32:51,213 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-02-04 17:32:51,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-02-04 17:32:51,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2018-02-04 17:32:51,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-04 17:32:51,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2018-02-04 17:32:51,215 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 24 [2018-02-04 17:32:51,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:32:51,215 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2018-02-04 17:32:51,215 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 17:32:51,215 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2018-02-04 17:32:51,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 17:32:51,215 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:32:51,215 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] [2018-02-04 17:32:51,215 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 17:32:51,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1706720075, now seen corresponding path program 1 times [2018-02-04 17:32:51,216 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:32:51,216 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:32:51,216 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:51,216 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:32:51,216 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:51,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:32:51,226 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:32:51,232 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:32:51,232 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:32:51,233 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:32:51,233 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:32:51,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:32:51,263 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:32:51,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:32:51,275 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:51,281 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:32:51,281 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:51,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:32:51,285 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-02-04 17:32:51,301 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:32:51,301 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:32:51,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-02-04 17:32:51,302 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:51,310 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:32:51,311 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:32:51,311 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:32:51,311 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:51,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:32:51,316 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:18 [2018-02-04 17:32:51,376 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:32:51,376 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:32:51,376 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 17:32:51,376 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 17:32:51,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 17:32:51,377 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-02-04 17:32:51,377 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 13 states. [2018-02-04 17:32:51,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:32:51,662 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2018-02-04 17:32:51,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 17:32:51,662 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-02-04 17:32:51,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:32:51,663 INFO L225 Difference]: With dead ends: 72 [2018-02-04 17:32:51,663 INFO L226 Difference]: Without dead ends: 72 [2018-02-04 17:32:51,663 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2018-02-04 17:32:51,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-02-04 17:32:51,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 64. [2018-02-04 17:32:51,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-04 17:32:51,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2018-02-04 17:32:51,667 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 24 [2018-02-04 17:32:51,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:32:51,668 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2018-02-04 17:32:51,668 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 17:32:51,668 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2018-02-04 17:32:51,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 17:32:51,668 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:32:51,668 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:32:51,669 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 17:32:51,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1074905977, now seen corresponding path program 2 times [2018-02-04 17:32:51,669 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:32:51,669 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:32:51,670 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:51,670 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:32:51,670 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:51,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:32:51,680 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:32:51,688 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:32:51,688 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:32:51,688 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:32:51,689 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:32:51,711 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:32:51,711 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:32:51,714 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:32:51,721 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:32:51,721 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:51,730 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:32:51,730 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:51,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:32:51,734 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-02-04 17:32:51,748 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:32:51,749 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:32:51,749 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:32:51,749 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:51,756 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:32:51,756 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:51,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:32:51,761 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-02-04 17:32:51,784 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 19 treesize of output 16 [2018-02-04 17:32:51,785 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 16 treesize of output 15 [2018-02-04 17:32:51,785 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:51,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:32:51,793 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:32:51,793 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-02-04 17:32:51,826 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 32 treesize of output 33 [2018-02-04 17:32:51,828 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:32:51,829 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:51,834 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:32:51,842 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:32:51,842 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:47 [2018-02-04 17:32:51,944 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 35 treesize of output 33 [2018-02-04 17:32:51,949 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 19 treesize of output 16 [2018-02-04 17:32:51,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:32:51,956 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:32:51,956 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:51,958 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:32:51,967 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:32:51,968 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:60, output treesize:35 [2018-02-04 17:32:52,022 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:32:52,023 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:32:52,023 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 17:32:52,023 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 17:32:52,024 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 17:32:52,024 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-02-04 17:32:52,024 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand 15 states. [2018-02-04 17:32:56,239 WARN L143 SmtUtils]: Spent 4032ms on a formula simplification that was a NOOP. DAG size: 51 [2018-02-04 17:33:02,282 WARN L143 SmtUtils]: Spent 6023ms on a formula simplification that was a NOOP. DAG size: 67 [2018-02-04 17:33:14,413 WARN L146 SmtUtils]: Spent 12087ms on a formula simplification. DAG size of input: 79 DAG size of output 76 [2018-02-04 17:33:20,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:33:20,268 INFO L93 Difference]: Finished difference Result 92 states and 107 transitions. [2018-02-04 17:33:20,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 17:33:20,268 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2018-02-04 17:33:20,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:33:20,268 INFO L225 Difference]: With dead ends: 92 [2018-02-04 17:33:20,268 INFO L226 Difference]: Without dead ends: 92 [2018-02-04 17:33:20,269 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 22.5s TimeCoverageRelationStatistics Valid=110, Invalid=540, Unknown=0, NotChecked=0, Total=650 [2018-02-04 17:33:20,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-04 17:33:20,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 67. [2018-02-04 17:33:20,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-04 17:33:20,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2018-02-04 17:33:20,271 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 27 [2018-02-04 17:33:20,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:33:20,271 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2018-02-04 17:33:20,272 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 17:33:20,272 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2018-02-04 17:33:20,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 17:33:20,272 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:33:20,272 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:33:20,272 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 17:33:20,272 INFO L82 PathProgramCache]: Analyzing trace with hash 94248296, now seen corresponding path program 1 times [2018-02-04 17:33:20,272 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:33:20,272 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:33:20,273 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:33:20,273 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:33:20,273 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:33:20,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:33:20,279 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:33:20,318 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:33:20,319 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:33:20,319 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 17:33:20,319 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:33:20,319 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:33:20,319 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:33:20,319 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand 5 states. [2018-02-04 17:33:20,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:33:20,381 INFO L93 Difference]: Finished difference Result 97 states and 112 transitions. [2018-02-04 17:33:20,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 17:33:20,382 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-02-04 17:33:20,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:33:20,383 INFO L225 Difference]: With dead ends: 97 [2018-02-04 17:33:20,383 INFO L226 Difference]: Without dead ends: 97 [2018-02-04 17:33:20,383 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 17:33:20,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-04 17:33:20,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 78. [2018-02-04 17:33:20,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-04 17:33:20,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 91 transitions. [2018-02-04 17:33:20,390 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 91 transitions. Word has length 28 [2018-02-04 17:33:20,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:33:20,390 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 91 transitions. [2018-02-04 17:33:20,391 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:33:20,391 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 91 transitions. [2018-02-04 17:33:20,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 17:33:20,391 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:33:20,391 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:33:20,391 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 17:33:20,392 INFO L82 PathProgramCache]: Analyzing trace with hash -723400154, now seen corresponding path program 1 times [2018-02-04 17:33:20,392 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:33:20,392 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:33:20,392 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:33:20,392 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:33:20,393 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:33:20,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:33:20,402 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:33:20,403 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:33:20,404 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:33:20,404 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:33:20,404 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:33:20,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:33:20,415 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:33:20,447 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:33:20,448 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:33:20,448 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 17:33:20,448 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 17:33:20,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 17:33:20,448 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-04 17:33:20,448 INFO L87 Difference]: Start difference. First operand 78 states and 91 transitions. Second operand 8 states. [2018-02-04 17:33:20,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:33:20,492 INFO L93 Difference]: Finished difference Result 90 states and 105 transitions. [2018-02-04 17:33:20,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 17:33:20,492 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-02-04 17:33:20,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:33:20,493 INFO L225 Difference]: With dead ends: 90 [2018-02-04 17:33:20,493 INFO L226 Difference]: Without dead ends: 87 [2018-02-04 17:33:20,493 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-04 17:33:20,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-02-04 17:33:20,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 67. [2018-02-04 17:33:20,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-04 17:33:20,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2018-02-04 17:33:20,496 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 28 [2018-02-04 17:33:20,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:33:20,496 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2018-02-04 17:33:20,496 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 17:33:20,496 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2018-02-04 17:33:20,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 17:33:20,497 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:33:20,497 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:33:20,497 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 17:33:20,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1208652779, now seen corresponding path program 1 times [2018-02-04 17:33:20,497 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:33:20,498 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:33:20,498 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:33:20,498 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:33:20,498 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:33:20,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:33:20,508 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:33:20,589 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:33:20,589 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:33:20,589 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 17:33:20,590 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 17:33:20,590 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 17:33:20,590 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-04 17:33:20,590 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand 7 states. [2018-02-04 17:33:20,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:33:20,665 INFO L93 Difference]: Finished difference Result 126 states and 143 transitions. [2018-02-04 17:33:20,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 17:33:20,665 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-02-04 17:33:20,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:33:20,666 INFO L225 Difference]: With dead ends: 126 [2018-02-04 17:33:20,666 INFO L226 Difference]: Without dead ends: 126 [2018-02-04 17:33:20,666 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-02-04 17:33:20,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-04 17:33:20,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 110. [2018-02-04 17:33:20,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-02-04 17:33:20,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 131 transitions. [2018-02-04 17:33:20,670 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 131 transitions. Word has length 30 [2018-02-04 17:33:20,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:33:20,670 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 131 transitions. [2018-02-04 17:33:20,670 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 17:33:20,670 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 131 transitions. [2018-02-04 17:33:20,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 17:33:20,671 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:33:20,671 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:33:20,671 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 17:33:20,671 INFO L82 PathProgramCache]: Analyzing trace with hash -752196469, now seen corresponding path program 3 times [2018-02-04 17:33:20,671 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:33:20,671 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:33:20,672 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:33:20,672 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:33:20,672 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:33:20,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:33:20,682 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:33:20,684 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:33:20,684 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:33:20,684 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:33:20,685 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:33:20,709 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-04 17:33:20,710 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:33:20,713 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:33:20,728 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:33:20,728 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:33:20,733 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:33:20,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:33:20,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:33:20,737 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-02-04 17:33:20,755 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:33:20,756 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:33:20,756 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:33:20,756 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:33:20,763 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:33:20,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:33:20,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:33:20,769 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-02-04 17:33:20,790 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:33:20,791 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:33:20,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:33:20,793 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:33:20,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:33:20,797 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-02-04 17:33:20,810 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:33:20,813 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:33:20,813 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:33:20,818 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:33:20,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 17:33:20,823 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2018-02-04 17:33:20,916 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:33:20,922 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:33:20,922 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:33:20,928 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:33:20,928 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:33:20,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:33:20,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:33:20,935 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2018-02-04 17:33:21,030 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:33:21,030 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:33:21,030 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 17:33:21,030 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 17:33:21,030 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 17:33:21,030 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-02-04 17:33:21,031 INFO L87 Difference]: Start difference. First operand 110 states and 131 transitions. Second operand 17 states. [2018-02-04 17:33:21,511 WARN L146 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 49 DAG size of output 41 [2018-02-04 17:33:21,712 WARN L146 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 50 DAG size of output 42 [2018-02-04 17:33:21,905 WARN L146 SmtUtils]: Spent 165ms on a formula simplification. DAG size of input: 59 DAG size of output 51 [2018-02-04 17:33:24,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:33:24,515 INFO L93 Difference]: Finished difference Result 139 states and 159 transitions. [2018-02-04 17:33:24,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 17:33:24,516 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2018-02-04 17:33:24,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:33:24,516 INFO L225 Difference]: With dead ends: 139 [2018-02-04 17:33:24,516 INFO L226 Difference]: Without dead ends: 139 [2018-02-04 17:33:24,517 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=127, Invalid=743, Unknown=0, NotChecked=0, Total=870 [2018-02-04 17:33:24,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-02-04 17:33:24,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 113. [2018-02-04 17:33:24,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-04 17:33:24,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 135 transitions. [2018-02-04 17:33:24,520 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 135 transitions. Word has length 30 [2018-02-04 17:33:24,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:33:24,520 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 135 transitions. [2018-02-04 17:33:24,520 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 17:33:24,520 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 135 transitions. [2018-02-04 17:33:24,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 17:33:24,521 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:33:24,521 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:33:24,521 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 17:33:24,521 INFO L82 PathProgramCache]: Analyzing trace with hash -989798061, now seen corresponding path program 1 times [2018-02-04 17:33:24,522 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:33:24,522 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:33:24,522 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:33:24,523 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:33:24,523 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:33:24,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:33:24,533 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:33:24,707 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:33:24,707 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:33:24,707 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:33:24,708 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:33:24,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:33:24,733 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:33:24,736 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:33:24,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:33:24,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:33:24,740 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 17:33:24,771 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:33:24,773 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:33:24,773 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:33:24,774 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:33:24,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:33:24,779 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-02-04 17:33:24,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-02-04 17:33:24,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-02-04 17:33:24,906 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:33:24,908 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:33:24,916 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:33:24,916 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:54 [2018-02-04 17:33:25,001 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:33:25,002 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:33:25,002 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2018-02-04 17:33:25,002 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 17:33:25,002 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 17:33:25,002 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=454, Unknown=0, NotChecked=0, Total=506 [2018-02-04 17:33:25,002 INFO L87 Difference]: Start difference. First operand 113 states and 135 transitions. Second operand 23 states. [2018-02-04 17:33:25,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:33:25,586 INFO L93 Difference]: Finished difference Result 136 states and 162 transitions. [2018-02-04 17:33:25,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 17:33:25,586 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 30 [2018-02-04 17:33:25,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:33:25,587 INFO L225 Difference]: With dead ends: 136 [2018-02-04 17:33:25,587 INFO L226 Difference]: Without dead ends: 136 [2018-02-04 17:33:25,588 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=126, Invalid=866, Unknown=0, NotChecked=0, Total=992 [2018-02-04 17:33:25,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-02-04 17:33:25,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 121. [2018-02-04 17:33:25,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-02-04 17:33:25,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 146 transitions. [2018-02-04 17:33:25,592 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 146 transitions. Word has length 30 [2018-02-04 17:33:25,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:33:25,593 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 146 transitions. [2018-02-04 17:33:25,593 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 17:33:25,593 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 146 transitions. [2018-02-04 17:33:25,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 17:33:25,593 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:33:25,593 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:33:25,593 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 17:33:25,593 INFO L82 PathProgramCache]: Analyzing trace with hash -533341751, now seen corresponding path program 1 times [2018-02-04 17:33:25,594 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:33:25,594 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:33:25,594 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:33:25,594 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:33:25,594 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:33:25,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:33:25,606 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:33:25,609 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:33:25,609 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:33:25,609 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:33:25,610 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:33:25,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:33:25,636 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:33:25,655 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:33:25,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:33:25,661 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:33:25,662 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:33:25,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:33:25,667 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-02-04 17:33:25,685 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:33:25,686 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:33:25,686 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:33:25,698 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:33:25,699 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:33:25,700 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:33:25,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:33:25,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:33:25,707 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-02-04 17:33:25,739 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 19 treesize of output 16 [2018-02-04 17:33:25,742 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 16 treesize of output 15 [2018-02-04 17:33:25,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:33:25,744 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:33:25,755 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:33:25,755 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-02-04 17:33:25,779 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 32 treesize of output 33 [2018-02-04 17:33:25,782 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:33:25,782 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:33:25,787 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:33:25,798 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:33:25,798 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:47 [2018-02-04 17:33:26,053 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 45 treesize of output 41 [2018-02-04 17:33:26,058 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:33:26,066 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 41 [2018-02-04 17:33:26,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:33:26,082 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:33:26,082 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:33:26,088 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:33:26,100 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:33:26,100 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:72, output treesize:49 [2018-02-04 17:33:26,176 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:33:26,176 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:33:26,176 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 17:33:26,176 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 17:33:26,176 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 17:33:26,177 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2018-02-04 17:33:26,177 INFO L87 Difference]: Start difference. First operand 121 states and 146 transitions. Second operand 18 states. [2018-02-04 17:33:30,418 WARN L143 SmtUtils]: Spent 4015ms on a formula simplification that was a NOOP. DAG size: 51 [2018-02-04 17:33:36,512 WARN L143 SmtUtils]: Spent 6037ms on a formula simplification that was a NOOP. DAG size: 67 [2018-02-04 17:33:41,187 WARN L146 SmtUtils]: Spent 4650ms on a formula simplification. DAG size of input: 71 DAG size of output 63 [2018-02-04 17:33:49,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:33:49,741 INFO L93 Difference]: Finished difference Result 162 states and 192 transitions. [2018-02-04 17:33:49,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 17:33:49,742 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 30 [2018-02-04 17:33:49,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:33:49,742 INFO L225 Difference]: With dead ends: 162 [2018-02-04 17:33:49,742 INFO L226 Difference]: Without dead ends: 162 [2018-02-04 17:33:49,743 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=119, Invalid=693, Unknown=0, NotChecked=0, Total=812 [2018-02-04 17:33:49,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-02-04 17:33:49,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 124. [2018-02-04 17:33:49,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-04 17:33:49,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 150 transitions. [2018-02-04 17:33:49,746 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 150 transitions. Word has length 30 [2018-02-04 17:33:49,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:33:49,746 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 150 transitions. [2018-02-04 17:33:49,746 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 17:33:49,746 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 150 transitions. [2018-02-04 17:33:49,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 17:33:49,747 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:33:49,747 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:33:49,747 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 17:33:49,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1840623047, now seen corresponding path program 4 times [2018-02-04 17:33:49,747 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:33:49,747 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:33:49,748 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:33:49,748 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:33:49,748 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:33:49,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:33:49,757 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:33:49,778 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:33:49,778 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:33:49,778 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:33:49,780 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:33:49,805 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:33:49,805 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:33:49,808 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:33:49,814 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:33:49,814 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:33:49,822 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:33:49,822 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:33:49,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:33:49,828 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-02-04 17:33:49,856 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:33:49,858 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:33:49,858 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:33:49,869 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:33:49,870 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:33:49,871 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:33:49,871 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:33:49,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:33:49,877 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-02-04 17:33:49,899 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:33:49,899 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:33:49,900 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:33:49,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:33:49,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:33:49,904 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-02-04 17:33:49,913 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:33:49,914 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:33:49,914 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:33:49,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:33:49,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 17:33:49,921 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2018-02-04 17:33:50,083 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:33:50,087 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:33:50,087 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:33:50,094 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:33:50,094 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 17:33:50,097 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:33:50,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:33:50,102 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:26 [2018-02-04 17:33:50,179 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:33:50,180 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:33:50,180 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 17:33:50,180 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 17:33:50,180 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 17:33:50,180 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2018-02-04 17:33:50,181 INFO L87 Difference]: Start difference. First operand 124 states and 150 transitions. Second operand 19 states. [2018-02-04 17:33:50,517 WARN L146 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 37 DAG size of output 33 [2018-02-04 17:33:50,784 WARN L146 SmtUtils]: Spent 251ms on a formula simplification. DAG size of input: 49 DAG size of output 41 [2018-02-04 17:33:53,034 WARN L146 SmtUtils]: Spent 2233ms on a formula simplification. DAG size of input: 50 DAG size of output 42 [2018-02-04 17:33:53,698 WARN L146 SmtUtils]: Spent 511ms on a formula simplification. DAG size of input: 51 DAG size of output 43 [2018-02-04 17:33:54,071 WARN L146 SmtUtils]: Spent 302ms on a formula simplification. DAG size of input: 51 DAG size of output 43 [2018-02-04 17:33:54,414 WARN L146 SmtUtils]: Spent 293ms on a formula simplification. DAG size of input: 59 DAG size of output 49 [2018-02-04 17:33:55,004 WARN L146 SmtUtils]: Spent 245ms on a formula simplification. DAG size of input: 47 DAG size of output 43 [2018-02-04 17:33:55,209 WARN L146 SmtUtils]: Spent 176ms on a formula simplification. DAG size of input: 48 DAG size of output 44 [2018-02-04 17:33:55,471 WARN L146 SmtUtils]: Spent 216ms on a formula simplification. DAG size of input: 46 DAG size of output 42 [2018-02-04 17:33:58,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:33:58,171 INFO L93 Difference]: Finished difference Result 156 states and 181 transitions. [2018-02-04 17:33:58,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 17:33:58,171 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 33 [2018-02-04 17:33:58,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:33:58,172 INFO L225 Difference]: With dead ends: 156 [2018-02-04 17:33:58,172 INFO L226 Difference]: Without dead ends: 156 [2018-02-04 17:33:58,172 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=152, Invalid=970, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 17:33:58,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-02-04 17:33:58,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 127. [2018-02-04 17:33:58,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-02-04 17:33:58,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 154 transitions. [2018-02-04 17:33:58,175 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 154 transitions. Word has length 33 [2018-02-04 17:33:58,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:33:58,176 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 154 transitions. [2018-02-04 17:33:58,176 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 17:33:58,176 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 154 transitions. [2018-02-04 17:33:58,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 17:33:58,176 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:33:58,176 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:33:58,177 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 17:33:58,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1700074437, now seen corresponding path program 2 times [2018-02-04 17:33:58,177 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:33:58,177 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:33:58,177 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:33:58,178 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:33:58,178 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:33:58,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:33:58,190 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:33:58,208 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:33:58,208 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:33:58,208 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:33:58,209 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:33:58,236 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:33:58,237 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:33:58,240 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:33:58,253 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:33:58,253 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:33:58,272 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:33:58,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:33:58,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:33:58,278 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-02-04 17:33:58,297 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:33:58,298 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:33:58,299 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:33:58,309 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:33:58,310 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:33:58,311 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:33:58,311 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:33:58,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:33:58,318 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-02-04 17:33:58,345 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 19 treesize of output 16 [2018-02-04 17:33:58,347 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 16 treesize of output 15 [2018-02-04 17:33:58,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:33:58,349 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:33:58,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:33:58,358 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2018-02-04 17:33:58,381 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 32 treesize of output 33 [2018-02-04 17:33:58,383 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:33:58,383 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:33:58,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:33:58,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 17:33:58,399 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:47 [2018-02-04 17:33:58,637 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 50 treesize of output 44 [2018-02-04 17:33:58,639 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:33:58,640 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:33:58,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 54 [2018-02-04 17:33:58,645 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:33:58,663 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:33:58,663 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:33:58,672 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:33:58,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 17:33:58,685 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:73, output treesize:99 [2018-02-04 17:33:58,762 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:33:58,762 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:33:58,763 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 17:33:58,763 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 17:33:58,763 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 17:33:58,763 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-02-04 17:33:58,763 INFO L87 Difference]: Start difference. First operand 127 states and 154 transitions. Second operand 19 states. [2018-02-04 17:34:02,832 WARN L146 SmtUtils]: Spent 3854ms on a formula simplification. DAG size of input: 49 DAG size of output 45 [2018-02-04 17:34:05,899 WARN L146 SmtUtils]: Spent 3048ms on a formula simplification. DAG size of input: 69 DAG size of output 61 [2018-02-04 17:34:07,324 WARN L146 SmtUtils]: Spent 1406ms on a formula simplification. DAG size of input: 72 DAG size of output 64 [2018-02-04 17:34:15,766 WARN L146 SmtUtils]: Spent 2349ms on a formula simplification. DAG size of input: 53 DAG size of output 49 [2018-02-04 17:34:17,909 WARN L146 SmtUtils]: Spent 2116ms on a formula simplification. DAG size of input: 56 DAG size of output 52 [2018-02-04 17:34:20,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:34:20,428 INFO L93 Difference]: Finished difference Result 174 states and 206 transitions. [2018-02-04 17:34:20,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 17:34:20,428 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 33 [2018-02-04 17:34:20,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:34:20,429 INFO L225 Difference]: With dead ends: 174 [2018-02-04 17:34:20,429 INFO L226 Difference]: Without dead ends: 174 [2018-02-04 17:34:20,429 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=128, Invalid=802, Unknown=0, NotChecked=0, Total=930 [2018-02-04 17:34:20,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-02-04 17:34:20,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 130. [2018-02-04 17:34:20,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-02-04 17:34:20,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 158 transitions. [2018-02-04 17:34:20,433 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 158 transitions. Word has length 33 [2018-02-04 17:34:20,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:34:20,433 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 158 transitions. [2018-02-04 17:34:20,433 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 17:34:20,434 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 158 transitions. [2018-02-04 17:34:20,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 17:34:20,434 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:34:20,434 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:34:20,434 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 17:34:20,434 INFO L82 PathProgramCache]: Analyzing trace with hash -608695935, now seen corresponding path program 1 times [2018-02-04 17:34:20,435 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:34:20,435 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:34:20,435 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:34:20,435 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:34:20,435 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:34:20,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:34:20,444 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:34:20,457 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:34:20,457 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:34:20,457 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:34:20,458 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:34:20,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:34:20,481 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:34:20,505 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:34:20,506 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:34:20,516 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:34:20,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:34:20,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:34:20,525 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:22 [2018-02-04 17:34:20,552 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:34:20,553 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:34:20,553 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:34:20,553 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:34:20,579 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:34:20,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-02-04 17:34:20,580 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:34:20,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:34:20,587 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:21 [2018-02-04 17:34:20,746 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:34:20,746 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:34:20,746 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 17:34:20,747 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 17:34:20,747 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 17:34:20,747 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-02-04 17:34:20,747 INFO L87 Difference]: Start difference. First operand 130 states and 158 transitions. Second operand 16 states. [2018-02-04 17:34:23,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:34:23,233 INFO L93 Difference]: Finished difference Result 197 states and 233 transitions. [2018-02-04 17:34:23,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 17:34:23,234 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 35 [2018-02-04 17:34:23,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:34:23,234 INFO L225 Difference]: With dead ends: 197 [2018-02-04 17:34:23,234 INFO L226 Difference]: Without dead ends: 197 [2018-02-04 17:34:23,235 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2018-02-04 17:34:23,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-02-04 17:34:23,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 144. [2018-02-04 17:34:23,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-02-04 17:34:23,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 177 transitions. [2018-02-04 17:34:23,237 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 177 transitions. Word has length 35 [2018-02-04 17:34:23,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:34:23,237 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 177 transitions. [2018-02-04 17:34:23,237 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 17:34:23,237 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 177 transitions. [2018-02-04 17:34:23,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 17:34:23,237 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:34:23,237 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:34:23,237 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 17:34:23,238 INFO L82 PathProgramCache]: Analyzing trace with hash -2119392517, now seen corresponding path program 1 times [2018-02-04 17:34:23,238 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:34:23,238 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:34:23,238 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:34:23,238 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:34:23,238 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:34:23,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:34:23,243 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:34:23,244 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:34:23,244 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:34:23,244 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:34:23,244 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:34:23,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:34:23,253 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:34:23,278 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:34:23,278 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:34:23,280 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:34:23,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:34:23,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:34:23,286 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:34:23,286 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-02-04 17:34:23,304 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc11.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc11.base|)) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc12.base| 1) |main_#t~malloc11.base| 0)) (= (select .cse0 |c_main_#t~malloc12.base|) 0)))) is different from true [2018-02-04 17:34:23,310 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc12.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc11.base| 1))) (and (= |c_#valid| (store (store (store .cse0 |main_#t~malloc12.base| 1) |main_#t~malloc11.base| 0) |main_#t~malloc12.base| 0)) (= 0 (select |c_old(#valid)| |main_#t~malloc11.base|)) (= (select .cse0 |main_#t~malloc12.base|) 0)))) is different from true [2018-02-04 17:34:23,313 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:34:23,313 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:34:23,313 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 17:34:23,314 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 17:34:23,314 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 17:34:23,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=22, Unknown=2, NotChecked=18, Total=56 [2018-02-04 17:34:23,314 INFO L87 Difference]: Start difference. First operand 144 states and 177 transitions. Second operand 8 states. [2018-02-04 17:34:23,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:34:23,413 INFO L93 Difference]: Finished difference Result 143 states and 176 transitions. [2018-02-04 17:34:23,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 17:34:23,415 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2018-02-04 17:34:23,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:34:23,415 INFO L225 Difference]: With dead ends: 143 [2018-02-04 17:34:23,415 INFO L226 Difference]: Without dead ends: 123 [2018-02-04 17:34:23,416 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 1 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:34:23,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-02-04 17:34:23,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2018-02-04 17:34:23,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-04 17:34:23,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 140 transitions. [2018-02-04 17:34:23,418 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 140 transitions. Word has length 36 [2018-02-04 17:34:23,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:34:23,418 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 140 transitions. [2018-02-04 17:34:23,419 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 17:34:23,419 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 140 transitions. [2018-02-04 17:34:23,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 17:34:23,419 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:34:23,419 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:34:23,419 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 17:34:23,419 INFO L82 PathProgramCache]: Analyzing trace with hash -153723445, now seen corresponding path program 5 times [2018-02-04 17:34:23,419 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:34:23,420 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:34:23,420 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:34:23,420 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:34:23,420 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:34:23,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:34:23,428 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:34:23,440 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:34:23,440 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:34:23,440 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:34:23,440 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:34:23,467 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-02-04 17:34:23,468 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:34:23,470 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:34:23,476 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:34:23,476 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:34:23,482 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:34:23,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:34:23,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:34:23,488 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-02-04 17:34:23,505 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:34:23,506 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:34:23,506 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-02-04 17:34:23,507 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:34:23,515 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:34:23,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:34:23,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:34:23,522 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-02-04 17:34:23,548 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:34:23,549 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:34:23,549 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:34:23,551 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:34:23,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:34:23,555 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-02-04 17:34:23,570 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:34:23,571 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:34:23,572 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:34:23,576 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:34:23,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 17:34:23,581 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-02-04 17:34:23,797 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:34:23,804 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:34:23,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:34:23,813 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:34:23,813 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:34:23,816 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:34:23,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:34:23,822 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2018-02-04 17:34:23,884 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 13 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 17:34:23,884 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:34:23,884 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 17:34:23,885 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 17:34:23,885 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 17:34:23,885 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2018-02-04 17:34:23,885 INFO L87 Difference]: Start difference. First operand 122 states and 140 transitions. Second operand 19 states. [2018-02-04 17:34:24,364 WARN L146 SmtUtils]: Spent 235ms on a formula simplification. DAG size of input: 33 DAG size of output 29 [2018-02-04 17:34:24,553 WARN L146 SmtUtils]: Spent 173ms on a formula simplification. DAG size of input: 43 DAG size of output 35 [2018-02-04 17:34:24,828 WARN L146 SmtUtils]: Spent 258ms on a formula simplification. DAG size of input: 45 DAG size of output 37 [2018-02-04 17:34:25,205 WARN L146 SmtUtils]: Spent 224ms on a formula simplification. DAG size of input: 46 DAG size of output 38 [2018-02-04 17:34:25,501 WARN L146 SmtUtils]: Spent 270ms on a formula simplification. DAG size of input: 46 DAG size of output 38 [2018-02-04 17:34:27,891 WARN L146 SmtUtils]: Spent 2368ms on a formula simplification. DAG size of input: 54 DAG size of output 46 [2018-02-04 17:34:28,537 WARN L146 SmtUtils]: Spent 629ms on a formula simplification. DAG size of input: 52 DAG size of output 42 [2018-02-04 17:34:28,897 WARN L146 SmtUtils]: Spent 341ms on a formula simplification. DAG size of input: 61 DAG size of output 50 [2018-02-04 17:34:31,121 WARN L146 SmtUtils]: Spent 2205ms on a formula simplification. DAG size of input: 58 DAG size of output 43 [2018-02-04 17:34:31,481 WARN L146 SmtUtils]: Spent 345ms on a formula simplification. DAG size of input: 66 DAG size of output 50 [2018-02-04 17:34:31,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:34:31,785 INFO L93 Difference]: Finished difference Result 124 states and 138 transitions. [2018-02-04 17:34:31,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 17:34:31,786 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-02-04 17:34:31,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:34:31,786 INFO L225 Difference]: With dead ends: 124 [2018-02-04 17:34:31,786 INFO L226 Difference]: Without dead ends: 84 [2018-02-04 17:34:31,787 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=222, Invalid=968, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 17:34:31,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-04 17:34:31,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-02-04 17:34:31,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-04 17:34:31,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 96 transitions. [2018-02-04 17:34:31,789 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 96 transitions. Word has length 36 [2018-02-04 17:34:31,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:34:31,789 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 96 transitions. [2018-02-04 17:34:31,789 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 17:34:31,789 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 96 transitions. [2018-02-04 17:34:31,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 17:34:31,789 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:34:31,789 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:34:31,789 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 17:34:31,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1689703552, now seen corresponding path program 2 times [2018-02-04 17:34:31,790 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:34:31,790 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:34:31,790 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:34:31,790 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:34:31,790 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:34:31,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:34:31,802 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:34:31,816 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:34:31,816 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:34:31,816 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:34:31,817 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:34:31,849 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:34:31,849 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:34:31,853 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:34:31,859 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:34:31,860 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:34:31,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:34:31,863 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 17:34:31,878 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:34:31,879 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:34:31,889 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:34:31,898 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:34:31,899 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:34:31,899 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:34:31,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:34:31,907 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2018-02-04 17:34:31,930 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:34:31,931 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:34:31,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:34:31,933 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:34:31,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:34:31,938 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-02-04 17:34:32,050 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 23 treesize of output 24 [2018-02-04 17:34:32,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 17:34:32,052 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:34:32,056 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:34:32,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:34:32,063 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:23 [2018-02-04 17:34:32,119 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 21 treesize of output 17 [2018-02-04 17:34:32,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-02-04 17:34:32,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:34:32,127 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:34:32,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:34:32,137 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:38 [2018-02-04 17:34:32,255 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:34:32,255 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:34:32,255 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 17:34:32,255 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 17:34:32,255 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 17:34:32,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2018-02-04 17:34:32,256 INFO L87 Difference]: Start difference. First operand 84 states and 96 transitions. Second operand 18 states. [2018-02-04 17:34:32,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:34:32,676 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2018-02-04 17:34:32,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 17:34:32,676 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 36 [2018-02-04 17:34:32,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:34:32,677 INFO L225 Difference]: With dead ends: 101 [2018-02-04 17:34:32,677 INFO L226 Difference]: Without dead ends: 101 [2018-02-04 17:34:32,677 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=106, Invalid=650, Unknown=0, NotChecked=0, Total=756 [2018-02-04 17:34:32,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-02-04 17:34:32,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 92. [2018-02-04 17:34:32,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-04 17:34:32,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 106 transitions. [2018-02-04 17:34:32,678 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 106 transitions. Word has length 36 [2018-02-04 17:34:32,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:34:32,678 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 106 transitions. [2018-02-04 17:34:32,678 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 17:34:32,678 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 106 transitions. [2018-02-04 17:34:32,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 17:34:32,679 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:34:32,679 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:34:32,679 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 17:34:32,679 INFO L82 PathProgramCache]: Analyzing trace with hash -663196535, now seen corresponding path program 3 times [2018-02-04 17:34:32,679 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:34:32,679 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:34:32,679 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:34:32,680 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:34:32,680 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:34:32,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:34:32,688 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:34:32,701 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:34:32,701 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:34:32,701 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:34:32,702 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:34:32,730 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-02-04 17:34:32,730 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:34:32,733 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:34:32,740 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:34:32,740 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:34:32,746 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:34:32,746 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:34:32,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:34:32,750 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-02-04 17:34:32,763 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:34:32,764 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:34:32,765 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:34:32,773 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:34:32,774 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:34:32,774 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:34:32,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:34:32,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:34:32,780 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-02-04 17:34:32,816 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 19 treesize of output 16 [2018-02-04 17:34:32,818 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 16 treesize of output 15 [2018-02-04 17:34:32,818 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:34:32,820 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:34:32,830 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:34:32,830 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-02-04 17:34:32,852 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 32 treesize of output 33 [2018-02-04 17:34:32,854 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:34:32,854 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:34:32,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:34:32,890 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:34:32,891 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:47 [2018-02-04 17:34:33,376 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 58 treesize of output 50 [2018-02-04 17:34:33,383 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:34:33,383 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:34:33,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 101 [2018-02-04 17:34:33,464 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-02-04 17:34:33,476 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 36 xjuncts. [2018-02-04 17:34:33,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:34:33,606 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:34:33,606 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:80, output treesize:75 [2018-02-04 17:34:33,783 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:34:33,784 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:34:33,784 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 17:34:33,784 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 17:34:33,784 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 17:34:33,784 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2018-02-04 17:34:33,784 INFO L87 Difference]: Start difference. First operand 92 states and 106 transitions. Second operand 22 states. [2018-02-04 17:34:34,331 WARN L146 SmtUtils]: Spent 299ms on a formula simplification. DAG size of input: 47 DAG size of output 43 [2018-02-04 17:34:37,736 WARN L146 SmtUtils]: Spent 3383ms on a formula simplification. DAG size of input: 62 DAG size of output 54 [2018-02-04 17:34:40,263 WARN L146 SmtUtils]: Spent 2508ms on a formula simplification. DAG size of input: 65 DAG size of output 57 [2018-02-04 17:34:48,371 WARN L146 SmtUtils]: Spent 367ms on a formula simplification. DAG size of input: 50 DAG size of output 46 [2018-02-04 17:34:48,583 WARN L146 SmtUtils]: Spent 187ms on a formula simplification. DAG size of input: 53 DAG size of output 49 [2018-02-04 17:34:54,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:34:54,081 INFO L93 Difference]: Finished difference Result 119 states and 136 transitions. [2018-02-04 17:34:54,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 17:34:54,082 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 36 [2018-02-04 17:34:54,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:34:54,082 INFO L225 Difference]: With dead ends: 119 [2018-02-04 17:34:54,083 INFO L226 Difference]: Without dead ends: 118 [2018-02-04 17:34:54,083 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=172, Invalid=1160, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 17:34:54,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-02-04 17:34:54,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 95. [2018-02-04 17:34:54,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-04 17:34:54,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 110 transitions. [2018-02-04 17:34:54,085 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 110 transitions. Word has length 36 [2018-02-04 17:34:54,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:34:54,086 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 110 transitions. [2018-02-04 17:34:54,086 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 17:34:54,086 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 110 transitions. [2018-02-04 17:34:54,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 17:34:54,086 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:34:54,086 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:34:54,086 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 17:34:54,086 INFO L82 PathProgramCache]: Analyzing trace with hash -601444785, now seen corresponding path program 1 times [2018-02-04 17:34:54,087 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:34:54,087 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:34:54,087 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:34:54,087 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:34:54,087 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:34:54,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:34:54,095 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:34:54,120 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:34:54,120 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:34:54,120 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:34:54,120 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:34:54,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:34:54,141 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:34:54,149 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:34:54,149 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:34:54,155 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:34:54,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:34:54,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:34:54,161 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-02-04 17:34:54,176 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:34:54,177 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:34:54,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-02-04 17:34:54,177 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:34:54,187 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:34:54,188 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:34:54,188 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:34:54,189 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:34:54,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:34:54,194 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:19 [2018-02-04 17:34:54,476 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:34:54,476 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:34:54,476 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 17:34:54,477 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 17:34:54,477 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 17:34:54,477 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2018-02-04 17:34:54,477 INFO L87 Difference]: Start difference. First operand 95 states and 110 transitions. Second operand 20 states. [2018-02-04 17:34:55,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:34:55,216 INFO L93 Difference]: Finished difference Result 115 states and 129 transitions. [2018-02-04 17:34:55,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 17:34:55,216 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2018-02-04 17:34:55,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:34:55,216 INFO L225 Difference]: With dead ends: 115 [2018-02-04 17:34:55,216 INFO L226 Difference]: Without dead ends: 114 [2018-02-04 17:34:55,217 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=161, Invalid=1099, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 17:34:55,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-02-04 17:34:55,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 95. [2018-02-04 17:34:55,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-04 17:34:55,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 110 transitions. [2018-02-04 17:34:55,218 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 110 transitions. Word has length 38 [2018-02-04 17:34:55,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:34:55,218 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 110 transitions. [2018-02-04 17:34:55,219 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 17:34:55,219 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 110 transitions. [2018-02-04 17:34:55,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 17:34:55,219 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:34:55,219 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:34:55,219 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 17:34:55,219 INFO L82 PathProgramCache]: Analyzing trace with hash -438410885, now seen corresponding path program 4 times [2018-02-04 17:34:55,219 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:34:55,219 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:34:55,220 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:34:55,220 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:34:55,220 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:34:55,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:34:55,227 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:34:55,237 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:34:55,237 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:34:55,238 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:34:55,238 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:34:55,254 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:34:55,254 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:34:55,256 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:34:55,260 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:34:55,260 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:34:55,265 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:34:55,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:34:55,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:34:55,270 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-02-04 17:34:55,283 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:34:55,283 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:34:55,284 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:34:55,284 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:34:55,291 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:34:55,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:34:55,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:34:55,296 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-02-04 17:34:55,332 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 19 treesize of output 16 [2018-02-04 17:34:55,333 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 16 treesize of output 15 [2018-02-04 17:34:55,334 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:34:55,335 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:34:55,345 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:34:55,345 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-02-04 17:34:55,365 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 32 treesize of output 33 [2018-02-04 17:34:55,368 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:34:55,368 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:34:55,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:34:55,383 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:34:55,383 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:47 [2018-02-04 17:34:56,473 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 69 treesize of output 59 [2018-02-04 17:34:56,476 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:34:56,476 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:34:56,489 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:34:56,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 45 treesize of output 167 [2018-02-04 17:34:56,529 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2018-02-04 17:34:56,777 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 544 xjuncts. [2018-02-04 17:35:00,452 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:35:00,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:35:00,502 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:114, output treesize:270 [2018-02-04 17:35:00,668 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:35:00,669 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:35:00,669 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 17:35:00,669 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 17:35:00,669 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 17:35:00,669 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2018-02-04 17:35:00,669 INFO L87 Difference]: Start difference. First operand 95 states and 110 transitions. Second operand 23 states. [2018-02-04 17:35:05,176 WARN L143 SmtUtils]: Spent 4031ms on a formula simplification that was a NOOP. DAG size: 51 [2018-02-04 17:35:11,267 WARN L143 SmtUtils]: Spent 6029ms on a formula simplification that was a NOOP. DAG size: 67 [2018-02-04 17:35:19,988 WARN L146 SmtUtils]: Spent 8136ms on a formula simplification. DAG size of input: 71 DAG size of output 67 [2018-02-04 17:35:26,225 WARN L143 SmtUtils]: Spent 4010ms on a formula simplification that was a NOOP. DAG size: 51 [2018-02-04 17:35:32,478 WARN L143 SmtUtils]: Spent 4017ms on a formula simplification that was a NOOP. DAG size: 57 [2018-02-04 17:35:36,883 WARN L143 SmtUtils]: Spent 4015ms on a formula simplification that was a NOOP. DAG size: 60 [2018-02-04 17:35:45,740 WARN L146 SmtUtils]: Spent 8035ms on a formula simplification. DAG size of input: 76 DAG size of output 65 [2018-02-04 17:35:54,208 WARN L146 SmtUtils]: Spent 8039ms on a formula simplification. DAG size of input: 89 DAG size of output 68 [2018-02-04 17:36:07,418 WARN L146 SmtUtils]: Spent 8046ms on a formula simplification. DAG size of input: 82 DAG size of output 71 [2018-02-04 17:36:15,566 WARN L146 SmtUtils]: Spent 8039ms on a formula simplification. DAG size of input: 95 DAG size of output 74 Received shutdown request... [2018-02-04 17:36:24,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 17:36:24,013 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 17:36:24,016 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 17:36:24,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 05:36:24 BoogieIcfgContainer [2018-02-04 17:36:24,016 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 17:36:24,016 INFO L168 Benchmark]: Toolchain (without parser) took 215037.32 ms. Allocated memory was 399.0 MB in the beginning and 821.6 MB in the end (delta: 422.6 MB). Free memory was 355.7 MB in the beginning and 588.1 MB in the end (delta: -232.4 MB). Peak memory consumption was 190.2 MB. Max. memory is 5.3 GB. [2018-02-04 17:36:24,017 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 399.0 MB. Free memory is still 360.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 17:36:24,018 INFO L168 Benchmark]: CACSL2BoogieTranslator took 140.54 ms. Allocated memory is still 399.0 MB. Free memory was 355.7 MB in the beginning and 345.1 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 17:36:24,018 INFO L168 Benchmark]: Boogie Preprocessor took 23.07 ms. Allocated memory is still 399.0 MB. Free memory was 345.1 MB in the beginning and 342.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 17:36:24,018 INFO L168 Benchmark]: RCFGBuilder took 182.71 ms. Allocated memory is still 399.0 MB. Free memory was 342.5 MB in the beginning and 322.6 MB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 5.3 GB. [2018-02-04 17:36:24,018 INFO L168 Benchmark]: TraceAbstraction took 214688.62 ms. Allocated memory was 399.0 MB in the beginning and 821.6 MB in the end (delta: 422.6 MB). Free memory was 320.0 MB in the beginning and 588.1 MB in the end (delta: -268.1 MB). Peak memory consumption was 154.4 MB. Max. memory is 5.3 GB. [2018-02-04 17:36:24,019 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.15 ms. Allocated memory is still 399.0 MB. Free memory is still 360.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 140.54 ms. Allocated memory is still 399.0 MB. Free memory was 355.7 MB in the beginning and 345.1 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 23.07 ms. Allocated memory is still 399.0 MB. Free memory was 345.1 MB in the beginning and 342.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 182.71 ms. Allocated memory is still 399.0 MB. Free memory was 342.5 MB in the beginning and 322.6 MB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 214688.62 ms. Allocated memory was 399.0 MB in the beginning and 821.6 MB in the end (delta: 422.6 MB). Free memory was 320.0 MB in the beginning and 588.1 MB in the end (delta: -268.1 MB). Peak memory consumption was 154.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 574). Cancelled while BasicCegarLoop was constructing difference of abstraction (95states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (95states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 574). Cancelled while BasicCegarLoop was constructing difference of abstraction (95states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (95states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 557]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 557). Cancelled while BasicCegarLoop was constructing difference of abstraction (95states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was constructing difference of abstraction (95states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (95states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was constructing difference of abstraction (95states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (95states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was constructing difference of abstraction (95states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (95states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was constructing difference of abstraction (95states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (95states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 54 locations, 13 error locations. TIMEOUT Result, 214.6s OverallTime, 27 OverallIterations, 7 TraceHistogramMax, 202.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1067 SDtfs, 1761 SDslu, 6125 SDs, 0 SdLazy, 6777 SolverSat, 406 SolverUnsat, 21 SolverUnknown, 0 SolverNotchecked, 58.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 771 GetRequests, 292 SyntacticMatches, 1 SemanticMatches, 477 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2404 ImplicationChecksByTransitivity, 141.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=21, 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, 26 MinimizatonAttempts, 359 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 11.5s InterpolantComputationTime, 1248 NumberOfCodeBlocks, 1248 NumberOfCodeBlocksAsserted, 62 NumberOfCheckSat, 729 ConstructedInterpolants, 166 QuantifiedInterpolants, 354070 SizeOfPredicates, 193 NumberOfNonLiveVariables, 2502 ConjunctsInSsa, 686 ConjunctsInUnsatCore, 28 InterpolantComputations, 14 PerfectInterpolantSequences, 17/259 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_17-36-24-024.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_17-36-24-024.csv Completed graceful shutdown