java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/memsafety-ext2/optional_data_creation_test04_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 13:11:36,718 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 13:11:36,719 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 13:11:36,730 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 13:11:36,730 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 13:11:36,731 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 13:11:36,731 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 13:11:36,732 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 13:11:36,734 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 13:11:36,734 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 13:11:36,735 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 13:11:36,735 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 13:11:36,736 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 13:11:36,737 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 13:11:36,738 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 13:11:36,739 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 13:11:36,741 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 13:11:36,742 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 13:11:36,743 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 13:11:36,744 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 13:11:36,746 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 13:11:36,746 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 13:11:36,746 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 13:11:36,747 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 13:11:36,748 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 13:11:36,749 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 13:11:36,749 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 13:11:36,750 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 13:11:36,750 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 13:11:36,750 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 13:11:36,750 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 13:11:36,751 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-04 13:11:36,760 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 13:11:36,760 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 13:11:36,761 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 13:11:36,761 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 13:11:36,761 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 13:11:36,761 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 13:11:36,761 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 13:11:36,762 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 13:11:36,762 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 13:11:36,762 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 13:11:36,762 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 13:11:36,762 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 13:11:36,762 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 13:11:36,762 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 13:11:36,763 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 13:11:36,763 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 13:11:36,763 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 13:11:36,763 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 13:11:36,763 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 13:11:36,763 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 13:11:36,763 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 13:11:36,764 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 13:11:36,764 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 13:11:36,764 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 13:11:36,789 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 13:11:36,799 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 13:11:36,802 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 13:11:36,804 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 13:11:36,804 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 13:11:36,805 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/optional_data_creation_test04_false-valid-memtrack.i [2018-02-04 13:11:36,954 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 13:11:36,956 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 13:11:36,956 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 13:11:36,956 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 13:11:36,962 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 13:11:36,962 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:11:36" (1/1) ... [2018-02-04 13:11:36,965 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63d59df9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:11:36, skipping insertion in model container [2018-02-04 13:11:36,965 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:11:36" (1/1) ... [2018-02-04 13:11:36,979 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 13:11:37,008 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 13:11:37,099 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 13:11:37,113 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 13:11:37,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:11:37 WrapperNode [2018-02-04 13:11:37,118 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 13:11:37,118 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 13:11:37,118 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 13:11:37,118 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 13:11:37,127 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:11:37" (1/1) ... [2018-02-04 13:11:37,127 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:11:37" (1/1) ... [2018-02-04 13:11:37,136 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:11:37" (1/1) ... [2018-02-04 13:11:37,136 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:11:37" (1/1) ... [2018-02-04 13:11:37,140 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:11:37" (1/1) ... [2018-02-04 13:11:37,142 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:11:37" (1/1) ... [2018-02-04 13:11:37,143 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:11:37" (1/1) ... [2018-02-04 13:11:37,145 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 13:11:37,145 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 13:11:37,145 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 13:11:37,145 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 13:11:37,146 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:11:37" (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 13:11:37,184 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 13:11:37,184 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 13:11:37,184 INFO L136 BoogieDeclarations]: Found implementation of procedure create_data [2018-02-04 13:11:37,184 INFO L136 BoogieDeclarations]: Found implementation of procedure freeData [2018-02-04 13:11:37,184 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-02-04 13:11:37,184 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 13:11:37,185 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 13:11:37,185 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 13:11:37,185 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 13:11:37,185 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 13:11:37,185 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 13:11:37,185 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 13:11:37,185 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 13:11:37,185 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 13:11:37,185 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 13:11:37,186 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 13:11:37,186 INFO L128 BoogieDeclarations]: Found specification of procedure create_data [2018-02-04 13:11:37,186 INFO L128 BoogieDeclarations]: Found specification of procedure freeData [2018-02-04 13:11:37,186 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-02-04 13:11:37,186 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 13:11:37,186 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 13:11:37,186 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 13:11:37,516 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 13:11:37,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:11:37 BoogieIcfgContainer [2018-02-04 13:11:37,516 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 13:11:37,517 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 13:11:37,517 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 13:11:37,519 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 13:11:37,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 01:11:36" (1/3) ... [2018-02-04 13:11:37,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1729951a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:11:37, skipping insertion in model container [2018-02-04 13:11:37,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:11:37" (2/3) ... [2018-02-04 13:11:37,520 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1729951a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:11:37, skipping insertion in model container [2018-02-04 13:11:37,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:11:37" (3/3) ... [2018-02-04 13:11:37,521 INFO L107 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04_false-valid-memtrack.i [2018-02-04 13:11:37,527 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 13:11:37,532 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 45 error locations. [2018-02-04 13:11:37,556 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 13:11:37,557 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 13:11:37,557 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 13:11:37,557 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 13:11:37,557 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 13:11:37,557 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 13:11:37,557 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 13:11:37,557 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 13:11:37,558 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 13:11:37,568 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states. [2018-02-04 13:11:37,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-04 13:11:37,577 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:11:37,578 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:11:37,578 INFO L371 AbstractCegarLoop]: === Iteration 1 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:11:37,581 INFO L82 PathProgramCache]: Analyzing trace with hash -548983798, now seen corresponding path program 1 times [2018-02-04 13:11:37,582 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:11:37,582 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:11:37,613 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:37,613 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:11:37,613 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:37,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:11:37,648 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:11:37,705 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 13:11:37,707 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:11:37,707 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 13:11:37,709 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 13:11:37,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 13:11:37,718 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 13:11:37,719 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 3 states. [2018-02-04 13:11:37,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:11:37,939 INFO L93 Difference]: Finished difference Result 123 states and 130 transitions. [2018-02-04 13:11:37,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 13:11:37,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-04 13:11:37,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:11:37,951 INFO L225 Difference]: With dead ends: 123 [2018-02-04 13:11:37,951 INFO L226 Difference]: Without dead ends: 120 [2018-02-04 13:11:37,953 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 13:11:37,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-04 13:11:37,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2018-02-04 13:11:37,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-04 13:11:37,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 124 transitions. [2018-02-04 13:11:37,993 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 124 transitions. Word has length 7 [2018-02-04 13:11:37,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:11:37,993 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 124 transitions. [2018-02-04 13:11:37,994 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 13:11:37,994 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 124 transitions. [2018-02-04 13:11:37,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-04 13:11:37,994 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:11:37,994 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:11:37,994 INFO L371 AbstractCegarLoop]: === Iteration 2 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:11:37,995 INFO L82 PathProgramCache]: Analyzing trace with hash -548983797, now seen corresponding path program 1 times [2018-02-04 13:11:37,995 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:11:37,995 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:11:37,996 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:37,996 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:11:37,996 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:38,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:11:38,011 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:11:38,047 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 13:11:38,047 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:11:38,047 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 13:11:38,049 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 13:11:38,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 13:11:38,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 13:11:38,049 INFO L87 Difference]: Start difference. First operand 117 states and 124 transitions. Second operand 3 states. [2018-02-04 13:11:38,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:11:38,127 INFO L93 Difference]: Finished difference Result 118 states and 126 transitions. [2018-02-04 13:11:38,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 13:11:38,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-04 13:11:38,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:11:38,129 INFO L225 Difference]: With dead ends: 118 [2018-02-04 13:11:38,129 INFO L226 Difference]: Without dead ends: 118 [2018-02-04 13:11:38,130 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 13:11:38,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-02-04 13:11:38,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2018-02-04 13:11:38,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-04 13:11:38,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2018-02-04 13:11:38,137 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 7 [2018-02-04 13:11:38,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:11:38,138 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2018-02-04 13:11:38,138 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 13:11:38,138 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2018-02-04 13:11:38,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 13:11:38,138 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:11:38,138 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:11:38,139 INFO L371 AbstractCegarLoop]: === Iteration 3 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:11:38,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1805977305, now seen corresponding path program 1 times [2018-02-04 13:11:38,139 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:11:38,139 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:11:38,140 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:38,140 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:11:38,140 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:38,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:11:38,159 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:11:38,215 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 13:11:38,215 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:11:38,215 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 13:11:38,216 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 13:11:38,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 13:11:38,216 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:11:38,216 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand 5 states. [2018-02-04 13:11:38,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:11:38,387 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2018-02-04 13:11:38,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 13:11:38,387 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-04 13:11:38,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:11:38,388 INFO L225 Difference]: With dead ends: 129 [2018-02-04 13:11:38,388 INFO L226 Difference]: Without dead ends: 129 [2018-02-04 13:11:38,389 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 13:11:38,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-02-04 13:11:38,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 122. [2018-02-04 13:11:38,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-04 13:11:38,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 131 transitions. [2018-02-04 13:11:38,395 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 131 transitions. Word has length 14 [2018-02-04 13:11:38,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:11:38,396 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 131 transitions. [2018-02-04 13:11:38,396 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 13:11:38,396 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 131 transitions. [2018-02-04 13:11:38,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 13:11:38,396 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:11:38,397 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:11:38,397 INFO L371 AbstractCegarLoop]: === Iteration 4 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:11:38,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1805977306, now seen corresponding path program 1 times [2018-02-04 13:11:38,397 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:11:38,397 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:11:38,398 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:38,398 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:11:38,398 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:38,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:11:38,411 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:11:38,500 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 13:11:38,500 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:11:38,500 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 13:11:38,500 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 13:11:38,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 13:11:38,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 13:11:38,501 INFO L87 Difference]: Start difference. First operand 122 states and 131 transitions. Second operand 7 states. [2018-02-04 13:11:38,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:11:38,732 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2018-02-04 13:11:38,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:11:38,733 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-02-04 13:11:38,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:11:38,734 INFO L225 Difference]: With dead ends: 127 [2018-02-04 13:11:38,735 INFO L226 Difference]: Without dead ends: 127 [2018-02-04 13:11:38,735 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-02-04 13:11:38,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-04 13:11:38,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 122. [2018-02-04 13:11:38,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-04 13:11:38,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2018-02-04 13:11:38,741 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 14 [2018-02-04 13:11:38,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:11:38,741 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2018-02-04 13:11:38,741 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 13:11:38,742 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2018-02-04 13:11:38,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 13:11:38,742 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:11:38,742 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:11:38,742 INFO L371 AbstractCegarLoop]: === Iteration 5 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:11:38,743 INFO L82 PathProgramCache]: Analyzing trace with hash 150721727, now seen corresponding path program 1 times [2018-02-04 13:11:38,743 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:11:38,743 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:11:38,744 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:38,744 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:11:38,744 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:38,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:11:38,754 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:11:38,786 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 13:11:38,786 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:11:38,787 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 13:11:38,787 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 13:11:38,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 13:11:38,787 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 13:11:38,787 INFO L87 Difference]: Start difference. First operand 122 states and 130 transitions. Second operand 4 states. [2018-02-04 13:11:38,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:11:38,870 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2018-02-04 13:11:38,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:11:38,870 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-04 13:11:38,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:11:38,871 INFO L225 Difference]: With dead ends: 121 [2018-02-04 13:11:38,871 INFO L226 Difference]: Without dead ends: 121 [2018-02-04 13:11:38,871 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 13:11:38,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-04 13:11:38,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-02-04 13:11:38,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-02-04 13:11:38,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2018-02-04 13:11:38,875 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 15 [2018-02-04 13:11:38,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:11:38,875 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2018-02-04 13:11:38,875 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 13:11:38,875 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2018-02-04 13:11:38,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 13:11:38,875 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:11:38,875 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:11:38,875 INFO L371 AbstractCegarLoop]: === Iteration 6 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:11:38,876 INFO L82 PathProgramCache]: Analyzing trace with hash 150721728, now seen corresponding path program 1 times [2018-02-04 13:11:38,876 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:11:38,876 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:11:38,876 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:38,876 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:11:38,876 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:38,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:11:38,885 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:11:38,922 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 13:11:38,922 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:11:38,922 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 13:11:38,922 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 13:11:38,922 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 13:11:38,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 13:11:38,922 INFO L87 Difference]: Start difference. First operand 121 states and 129 transitions. Second operand 4 states. [2018-02-04 13:11:38,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:11:38,977 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2018-02-04 13:11:38,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 13:11:38,978 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-04 13:11:38,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:11:38,978 INFO L225 Difference]: With dead ends: 120 [2018-02-04 13:11:38,978 INFO L226 Difference]: Without dead ends: 120 [2018-02-04 13:11:38,978 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 13:11:38,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-04 13:11:38,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-02-04 13:11:38,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-02-04 13:11:38,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2018-02-04 13:11:38,983 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 15 [2018-02-04 13:11:38,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:11:38,984 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2018-02-04 13:11:38,984 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 13:11:38,984 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2018-02-04 13:11:38,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 13:11:38,984 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:11:38,984 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] [2018-02-04 13:11:38,984 INFO L371 AbstractCegarLoop]: === Iteration 7 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:11:38,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1247099981, now seen corresponding path program 1 times [2018-02-04 13:11:38,984 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:11:38,985 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:11:38,985 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:38,985 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:11:38,985 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:38,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:11:38,996 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:11:39,022 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 13:11:39,022 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:11:39,023 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 13:11:39,023 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 13:11:39,023 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 13:11:39,023 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:11:39,023 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 5 states. [2018-02-04 13:11:39,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:11:39,108 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2018-02-04 13:11:39,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 13:11:39,109 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-02-04 13:11:39,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:11:39,109 INFO L225 Difference]: With dead ends: 135 [2018-02-04 13:11:39,109 INFO L226 Difference]: Without dead ends: 135 [2018-02-04 13:11:39,110 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 13:11:39,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-02-04 13:11:39,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 123. [2018-02-04 13:11:39,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-04 13:11:39,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 132 transitions. [2018-02-04 13:11:39,114 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 132 transitions. Word has length 22 [2018-02-04 13:11:39,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:11:39,115 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 132 transitions. [2018-02-04 13:11:39,115 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 13:11:39,115 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 132 transitions. [2018-02-04 13:11:39,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 13:11:39,115 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:11:39,116 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] [2018-02-04 13:11:39,116 INFO L371 AbstractCegarLoop]: === Iteration 8 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:11:39,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1247099982, now seen corresponding path program 1 times [2018-02-04 13:11:39,116 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:11:39,116 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:11:39,117 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:39,117 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:11:39,117 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:39,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:11:39,126 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:11:39,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 13:11:39,170 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:11:39,170 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 13:11:39,170 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 13:11:39,170 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 13:11:39,170 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:11:39,170 INFO L87 Difference]: Start difference. First operand 123 states and 132 transitions. Second operand 5 states. [2018-02-04 13:11:39,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:11:39,271 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2018-02-04 13:11:39,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:11:39,272 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-02-04 13:11:39,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:11:39,272 INFO L225 Difference]: With dead ends: 129 [2018-02-04 13:11:39,272 INFO L226 Difference]: Without dead ends: 129 [2018-02-04 13:11:39,272 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 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 13:11:39,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-02-04 13:11:39,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 123. [2018-02-04 13:11:39,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-04 13:11:39,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2018-02-04 13:11:39,275 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 22 [2018-02-04 13:11:39,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:11:39,275 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2018-02-04 13:11:39,275 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 13:11:39,275 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2018-02-04 13:11:39,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 13:11:39,276 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:11:39,276 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:11:39,276 INFO L371 AbstractCegarLoop]: === Iteration 9 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:11:39,276 INFO L82 PathProgramCache]: Analyzing trace with hash 4873111, now seen corresponding path program 1 times [2018-02-04 13:11:39,276 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:11:39,276 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:11:39,276 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:39,277 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:11:39,277 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:39,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:11:39,282 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:11:39,301 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 13:11:39,301 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:11:39,301 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 13:11:39,301 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 13:11:39,302 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 13:11:39,302 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 13:11:39,302 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand 4 states. [2018-02-04 13:11:39,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:11:39,369 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2018-02-04 13:11:39,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 13:11:39,369 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-02-04 13:11:39,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:11:39,370 INFO L225 Difference]: With dead ends: 119 [2018-02-04 13:11:39,370 INFO L226 Difference]: Without dead ends: 119 [2018-02-04 13:11:39,370 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 13:11:39,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-04 13:11:39,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-02-04 13:11:39,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-04 13:11:39,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2018-02-04 13:11:39,373 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 23 [2018-02-04 13:11:39,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:11:39,373 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions. [2018-02-04 13:11:39,373 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 13:11:39,373 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2018-02-04 13:11:39,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 13:11:39,373 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:11:39,373 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:11:39,373 INFO L371 AbstractCegarLoop]: === Iteration 10 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:11:39,374 INFO L82 PathProgramCache]: Analyzing trace with hash 4873112, now seen corresponding path program 1 times [2018-02-04 13:11:39,374 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:11:39,374 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:11:39,374 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:39,374 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:11:39,374 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:39,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:11:39,380 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:11:39,407 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 13:11:39,407 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:11:39,407 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 13:11:39,407 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 13:11:39,407 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 13:11:39,408 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 13:11:39,408 INFO L87 Difference]: Start difference. First operand 119 states and 127 transitions. Second operand 4 states. [2018-02-04 13:11:39,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:11:39,476 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2018-02-04 13:11:39,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 13:11:39,476 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-02-04 13:11:39,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:11:39,477 INFO L225 Difference]: With dead ends: 123 [2018-02-04 13:11:39,477 INFO L226 Difference]: Without dead ends: 123 [2018-02-04 13:11:39,477 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 13:11:39,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-02-04 13:11:39,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 120. [2018-02-04 13:11:39,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-02-04 13:11:39,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2018-02-04 13:11:39,479 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 23 [2018-02-04 13:11:39,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:11:39,479 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2018-02-04 13:11:39,479 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 13:11:39,479 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2018-02-04 13:11:39,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 13:11:39,480 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:11:39,480 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 13:11:39,480 INFO L371 AbstractCegarLoop]: === Iteration 11 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:11:39,480 INFO L82 PathProgramCache]: Analyzing trace with hash 167210254, now seen corresponding path program 1 times [2018-02-04 13:11:39,480 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:11:39,480 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:11:39,481 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:39,481 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:11:39,481 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:39,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:11:39,489 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:11:39,520 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 13:11:39,520 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:11:39,520 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 13:11:39,521 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 13:11:39,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 13:11:39,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 13:11:39,521 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 4 states. [2018-02-04 13:11:39,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:11:39,610 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2018-02-04 13:11:39,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 13:11:39,610 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-02-04 13:11:39,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:11:39,611 INFO L225 Difference]: With dead ends: 128 [2018-02-04 13:11:39,611 INFO L226 Difference]: Without dead ends: 128 [2018-02-04 13:11:39,611 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 13:11:39,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-02-04 13:11:39,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 122. [2018-02-04 13:11:39,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-04 13:11:39,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 131 transitions. [2018-02-04 13:11:39,613 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 131 transitions. Word has length 24 [2018-02-04 13:11:39,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:11:39,613 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 131 transitions. [2018-02-04 13:11:39,613 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 13:11:39,613 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 131 transitions. [2018-02-04 13:11:39,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 13:11:39,614 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:11:39,614 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 13:11:39,614 INFO L371 AbstractCegarLoop]: === Iteration 12 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:11:39,614 INFO L82 PathProgramCache]: Analyzing trace with hash 167210255, now seen corresponding path program 1 times [2018-02-04 13:11:39,614 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:11:39,614 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:11:39,615 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:39,615 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:11:39,615 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:39,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:11:39,621 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:11:39,664 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 13:11:39,664 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:11:39,664 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 13:11:39,665 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 13:11:39,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 13:11:39,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 13:11:39,665 INFO L87 Difference]: Start difference. First operand 122 states and 131 transitions. Second operand 7 states. [2018-02-04 13:11:39,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:11:39,823 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2018-02-04 13:11:39,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 13:11:39,823 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-02-04 13:11:39,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:11:39,824 INFO L225 Difference]: With dead ends: 122 [2018-02-04 13:11:39,824 INFO L226 Difference]: Without dead ends: 122 [2018-02-04 13:11:39,824 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-02-04 13:11:39,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-02-04 13:11:39,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-02-04 13:11:39,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-04 13:11:39,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2018-02-04 13:11:39,826 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 24 [2018-02-04 13:11:39,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:11:39,827 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2018-02-04 13:11:39,827 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 13:11:39,827 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2018-02-04 13:11:39,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 13:11:39,827 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:11:39,827 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 13:11:39,827 INFO L371 AbstractCegarLoop]: === Iteration 13 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:11:39,827 INFO L82 PathProgramCache]: Analyzing trace with hash 151037655, now seen corresponding path program 1 times [2018-02-04 13:11:39,827 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:11:39,827 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:11:39,828 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:39,828 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:11:39,828 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:39,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:11:39,834 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:11:39,861 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 13:11:39,861 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:11:39,861 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 13:11:39,861 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 13:11:39,862 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 13:11:39,862 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:11:39,862 INFO L87 Difference]: Start difference. First operand 122 states and 130 transitions. Second operand 5 states. [2018-02-04 13:11:39,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:11:39,946 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2018-02-04 13:11:39,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 13:11:39,948 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-02-04 13:11:39,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:11:39,948 INFO L225 Difference]: With dead ends: 119 [2018-02-04 13:11:39,948 INFO L226 Difference]: Without dead ends: 119 [2018-02-04 13:11:39,949 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-04 13:11:39,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-04 13:11:39,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2018-02-04 13:11:39,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-04 13:11:39,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 125 transitions. [2018-02-04 13:11:39,951 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 125 transitions. Word has length 24 [2018-02-04 13:11:39,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:11:39,952 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 125 transitions. [2018-02-04 13:11:39,952 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 13:11:39,952 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 125 transitions. [2018-02-04 13:11:39,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 13:11:39,952 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:11:39,953 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] [2018-02-04 13:11:39,953 INFO L371 AbstractCegarLoop]: === Iteration 14 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:11:39,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1118005000, now seen corresponding path program 1 times [2018-02-04 13:11:39,953 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:11:39,953 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:11:39,954 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:39,954 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:11:39,954 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:39,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:11:39,964 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:11:40,012 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 13:11:40,013 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:11:40,013 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 13:11:40,013 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 13:11:40,013 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 13:11:40,013 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-04 13:11:40,013 INFO L87 Difference]: Start difference. First operand 117 states and 125 transitions. Second operand 7 states. [2018-02-04 13:11:40,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:11:40,252 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2018-02-04 13:11:40,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 13:11:40,252 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-02-04 13:11:40,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:11:40,253 INFO L225 Difference]: With dead ends: 131 [2018-02-04 13:11:40,253 INFO L226 Difference]: Without dead ends: 131 [2018-02-04 13:11:40,253 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-02-04 13:11:40,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-02-04 13:11:40,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 123. [2018-02-04 13:11:40,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-04 13:11:40,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 132 transitions. [2018-02-04 13:11:40,255 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 132 transitions. Word has length 29 [2018-02-04 13:11:40,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:11:40,255 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 132 transitions. [2018-02-04 13:11:40,255 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 13:11:40,256 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 132 transitions. [2018-02-04 13:11:40,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 13:11:40,256 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:11:40,256 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] [2018-02-04 13:11:40,256 INFO L371 AbstractCegarLoop]: === Iteration 15 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:11:40,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1118005001, now seen corresponding path program 1 times [2018-02-04 13:11:40,256 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:11:40,256 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:11:40,257 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:40,257 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:11:40,257 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:40,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:11:40,263 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:11:40,309 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 13:11:40,309 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:11:40,309 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 13:11:40,309 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 13:11:40,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 13:11:40,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 13:11:40,310 INFO L87 Difference]: Start difference. First operand 123 states and 132 transitions. Second operand 7 states. [2018-02-04 13:11:40,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:11:40,488 INFO L93 Difference]: Finished difference Result 131 states and 141 transitions. [2018-02-04 13:11:40,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 13:11:40,488 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-02-04 13:11:40,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:11:40,489 INFO L225 Difference]: With dead ends: 131 [2018-02-04 13:11:40,489 INFO L226 Difference]: Without dead ends: 131 [2018-02-04 13:11:40,489 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-02-04 13:11:40,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-02-04 13:11:40,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 123. [2018-02-04 13:11:40,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-04 13:11:40,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2018-02-04 13:11:40,492 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 29 [2018-02-04 13:11:40,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:11:40,493 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2018-02-04 13:11:40,493 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 13:11:40,493 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2018-02-04 13:11:40,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 13:11:40,493 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:11:40,493 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:11:40,493 INFO L371 AbstractCegarLoop]: === Iteration 16 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:11:40,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1228344885, now seen corresponding path program 1 times [2018-02-04 13:11:40,493 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:11:40,493 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:11:40,494 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:40,494 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:11:40,494 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:40,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:11:40,502 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:11:40,523 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 13:11:40,523 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:11:40,523 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 13:11:40,524 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 13:11:40,524 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 13:11:40,524 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:11:40,524 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand 5 states. [2018-02-04 13:11:40,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:11:40,596 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2018-02-04 13:11:40,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 13:11:40,596 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-02-04 13:11:40,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:11:40,597 INFO L225 Difference]: With dead ends: 121 [2018-02-04 13:11:40,597 INFO L226 Difference]: Without dead ends: 121 [2018-02-04 13:11:40,597 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 13:11:40,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-04 13:11:40,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2018-02-04 13:11:40,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-04 13:11:40,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 126 transitions. [2018-02-04 13:11:40,600 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 126 transitions. Word has length 30 [2018-02-04 13:11:40,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:11:40,601 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 126 transitions. [2018-02-04 13:11:40,601 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 13:11:40,601 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 126 transitions. [2018-02-04 13:11:40,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 13:11:40,601 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:11:40,602 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:11:40,602 INFO L371 AbstractCegarLoop]: === Iteration 17 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:11:40,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1228344886, now seen corresponding path program 1 times [2018-02-04 13:11:40,602 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:11:40,602 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:11:40,603 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:40,603 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:11:40,603 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:40,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:11:40,611 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:11:40,689 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 13:11:40,689 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:11:40,689 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 13:11:40,690 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 13:11:40,690 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 13:11:40,690 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 13:11:40,690 INFO L87 Difference]: Start difference. First operand 119 states and 126 transitions. Second operand 6 states. [2018-02-04 13:11:40,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:11:40,783 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions. [2018-02-04 13:11:40,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 13:11:40,783 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-02-04 13:11:40,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:11:40,784 INFO L225 Difference]: With dead ends: 126 [2018-02-04 13:11:40,784 INFO L226 Difference]: Without dead ends: 126 [2018-02-04 13:11:40,784 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-04 13:11:40,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-04 13:11:40,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 119. [2018-02-04 13:11:40,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-04 13:11:40,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2018-02-04 13:11:40,787 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 30 [2018-02-04 13:11:40,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:11:40,787 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions. [2018-02-04 13:11:40,787 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 13:11:40,787 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2018-02-04 13:11:40,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 13:11:40,787 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:11:40,787 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:11:40,787 INFO L371 AbstractCegarLoop]: === Iteration 18 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:11:40,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1343765284, now seen corresponding path program 1 times [2018-02-04 13:11:40,788 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:11:40,788 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:11:40,788 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:40,788 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:11:40,788 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:40,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:11:40,795 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:11:40,822 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 13:11:40,823 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:11:40,823 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 13:11:40,823 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 13:11:40,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 13:11:40,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:11:40,823 INFO L87 Difference]: Start difference. First operand 119 states and 127 transitions. Second operand 5 states. [2018-02-04 13:11:40,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:11:40,910 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2018-02-04 13:11:40,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 13:11:40,910 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-02-04 13:11:40,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:11:40,911 INFO L225 Difference]: With dead ends: 130 [2018-02-04 13:11:40,911 INFO L226 Difference]: Without dead ends: 130 [2018-02-04 13:11:40,911 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-04 13:11:40,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-02-04 13:11:40,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 124. [2018-02-04 13:11:40,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-04 13:11:40,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2018-02-04 13:11:40,914 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 30 [2018-02-04 13:11:40,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:11:40,914 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2018-02-04 13:11:40,914 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 13:11:40,914 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2018-02-04 13:11:40,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 13:11:40,915 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:11:40,915 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:11:40,915 INFO L371 AbstractCegarLoop]: === Iteration 19 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:11:40,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1343765283, now seen corresponding path program 1 times [2018-02-04 13:11:40,915 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:11:40,915 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:11:40,916 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:40,916 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:11:40,916 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:40,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:11:40,925 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:11:40,986 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 13:11:40,986 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:11:40,986 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 13:11:40,986 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 13:11:40,986 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 13:11:40,986 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 13:11:40,986 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 6 states. [2018-02-04 13:11:41,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:11:41,092 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2018-02-04 13:11:41,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 13:11:41,092 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-02-04 13:11:41,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:11:41,093 INFO L225 Difference]: With dead ends: 125 [2018-02-04 13:11:41,093 INFO L226 Difference]: Without dead ends: 125 [2018-02-04 13:11:41,093 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-02-04 13:11:41,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-04 13:11:41,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2018-02-04 13:11:41,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-04 13:11:41,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2018-02-04 13:11:41,095 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 30 [2018-02-04 13:11:41,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:11:41,095 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2018-02-04 13:11:41,095 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 13:11:41,095 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2018-02-04 13:11:41,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 13:11:41,095 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:11:41,095 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:11:41,095 INFO L371 AbstractCegarLoop]: === Iteration 20 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:11:41,095 INFO L82 PathProgramCache]: Analyzing trace with hash 660985097, now seen corresponding path program 1 times [2018-02-04 13:11:41,096 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:11:41,096 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:11:41,096 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:41,096 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:11:41,096 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:41,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:11:41,102 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:11:41,177 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 13:11:41,177 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:11:41,177 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 13:11:41,177 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 13:11:41,177 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 13:11:41,177 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-04 13:11:41,178 INFO L87 Difference]: Start difference. First operand 124 states and 132 transitions. Second operand 8 states. [2018-02-04 13:11:41,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:11:41,427 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2018-02-04 13:11:41,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 13:11:41,428 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-02-04 13:11:41,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:11:41,428 INFO L225 Difference]: With dead ends: 134 [2018-02-04 13:11:41,428 INFO L226 Difference]: Without dead ends: 134 [2018-02-04 13:11:41,429 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-02-04 13:11:41,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-02-04 13:11:41,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 126. [2018-02-04 13:11:41,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-04 13:11:41,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 135 transitions. [2018-02-04 13:11:41,432 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 135 transitions. Word has length 31 [2018-02-04 13:11:41,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:11:41,432 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 135 transitions. [2018-02-04 13:11:41,432 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 13:11:41,432 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 135 transitions. [2018-02-04 13:11:41,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 13:11:41,433 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:11:41,433 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:11:41,433 INFO L371 AbstractCegarLoop]: === Iteration 21 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:11:41,433 INFO L82 PathProgramCache]: Analyzing trace with hash 660985098, now seen corresponding path program 1 times [2018-02-04 13:11:41,433 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:11:41,433 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:11:41,434 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:41,434 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:11:41,434 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:41,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:11:41,442 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:11:41,546 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 13:11:41,546 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:11:41,546 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 13:11:41,546 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 13:11:41,546 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 13:11:41,546 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-04 13:11:41,547 INFO L87 Difference]: Start difference. First operand 126 states and 135 transitions. Second operand 10 states. [2018-02-04 13:11:41,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:11:41,825 INFO L93 Difference]: Finished difference Result 133 states and 142 transitions. [2018-02-04 13:11:41,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 13:11:41,825 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-02-04 13:11:41,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:11:41,826 INFO L225 Difference]: With dead ends: 133 [2018-02-04 13:11:41,826 INFO L226 Difference]: Without dead ends: 133 [2018-02-04 13:11:41,826 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2018-02-04 13:11:41,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-02-04 13:11:41,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 121. [2018-02-04 13:11:41,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-02-04 13:11:41,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2018-02-04 13:11:41,830 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 31 [2018-02-04 13:11:41,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:11:41,830 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2018-02-04 13:11:41,830 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 13:11:41,830 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2018-02-04 13:11:41,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 13:11:41,830 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:11:41,831 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] [2018-02-04 13:11:41,831 INFO L371 AbstractCegarLoop]: === Iteration 22 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:11:41,831 INFO L82 PathProgramCache]: Analyzing trace with hash -184722078, now seen corresponding path program 1 times [2018-02-04 13:11:41,831 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:11:41,831 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:11:41,832 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:41,832 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:11:41,832 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:41,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:11:41,842 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:11:41,934 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:11:41,934 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:11:41,934 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:11:41,943 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:11:41,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:11:41,984 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:11:42,089 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:11:42,097 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 13:11:42,098 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:11:42,117 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:11:42,117 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:11:42,118 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 13:11:42,118 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:11:42,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:11:42,124 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2018-02-04 13:11:42,155 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:11:42,187 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:11:42,188 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2018-02-04 13:11:42,188 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 13:11:42,188 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 13:11:42,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-02-04 13:11:42,189 INFO L87 Difference]: Start difference. First operand 121 states and 129 transitions. Second operand 13 states. [2018-02-04 13:11:42,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:11:42,503 INFO L93 Difference]: Finished difference Result 133 states and 142 transitions. [2018-02-04 13:11:42,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 13:11:42,505 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2018-02-04 13:11:42,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:11:42,505 INFO L225 Difference]: With dead ends: 133 [2018-02-04 13:11:42,505 INFO L226 Difference]: Without dead ends: 133 [2018-02-04 13:11:42,506 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2018-02-04 13:11:42,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-02-04 13:11:42,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 113. [2018-02-04 13:11:42,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-04 13:11:42,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions. [2018-02-04 13:11:42,508 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 34 [2018-02-04 13:11:42,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:11:42,508 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions. [2018-02-04 13:11:42,509 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 13:11:42,509 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2018-02-04 13:11:42,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 13:11:42,509 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:11:42,509 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] [2018-02-04 13:11:42,509 INFO L371 AbstractCegarLoop]: === Iteration 23 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:11:42,509 INFO L82 PathProgramCache]: Analyzing trace with hash 501156800, now seen corresponding path program 1 times [2018-02-04 13:11:42,510 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:11:42,510 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:11:42,510 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:42,510 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:11:42,511 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:42,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:11:42,518 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:11:42,570 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 13:11:42,571 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:11:42,571 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 13:11:42,571 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 13:11:42,571 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 13:11:42,571 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-04 13:11:42,571 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand 7 states. [2018-02-04 13:11:42,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:11:42,737 INFO L93 Difference]: Finished difference Result 134 states and 144 transitions. [2018-02-04 13:11:42,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 13:11:42,738 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-02-04 13:11:42,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:11:42,738 INFO L225 Difference]: With dead ends: 134 [2018-02-04 13:11:42,738 INFO L226 Difference]: Without dead ends: 134 [2018-02-04 13:11:42,738 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-04 13:11:42,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-02-04 13:11:42,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 118. [2018-02-04 13:11:42,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-02-04 13:11:42,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 126 transitions. [2018-02-04 13:11:42,741 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 126 transitions. Word has length 33 [2018-02-04 13:11:42,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:11:42,742 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 126 transitions. [2018-02-04 13:11:42,742 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 13:11:42,742 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 126 transitions. [2018-02-04 13:11:42,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 13:11:42,742 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:11:42,742 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] [2018-02-04 13:11:42,742 INFO L371 AbstractCegarLoop]: === Iteration 24 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:11:42,743 INFO L82 PathProgramCache]: Analyzing trace with hash 501156801, now seen corresponding path program 1 times [2018-02-04 13:11:42,743 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:11:42,743 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:11:42,743 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:42,743 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:11:42,744 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:42,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:11:42,751 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:11:42,856 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 13:11:42,856 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:11:42,856 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 13:11:42,856 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 13:11:42,856 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 13:11:42,857 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 13:11:42,857 INFO L87 Difference]: Start difference. First operand 118 states and 126 transitions. Second operand 9 states. [2018-02-04 13:11:43,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:11:43,180 INFO L93 Difference]: Finished difference Result 159 states and 173 transitions. [2018-02-04 13:11:43,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 13:11:43,180 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-02-04 13:11:43,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:11:43,181 INFO L225 Difference]: With dead ends: 159 [2018-02-04 13:11:43,181 INFO L226 Difference]: Without dead ends: 159 [2018-02-04 13:11:43,181 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-02-04 13:11:43,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-02-04 13:11:43,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 132. [2018-02-04 13:11:43,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-02-04 13:11:43,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 142 transitions. [2018-02-04 13:11:43,185 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 142 transitions. Word has length 33 [2018-02-04 13:11:43,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:11:43,185 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 142 transitions. [2018-02-04 13:11:43,185 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 13:11:43,185 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 142 transitions. [2018-02-04 13:11:43,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 13:11:43,185 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:11:43,186 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] [2018-02-04 13:11:43,186 INFO L371 AbstractCegarLoop]: === Iteration 25 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:11:43,186 INFO L82 PathProgramCache]: Analyzing trace with hash 574362333, now seen corresponding path program 1 times [2018-02-04 13:11:43,186 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:11:43,186 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:11:43,187 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:43,187 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:11:43,187 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:43,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:11:43,194 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:11:43,239 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 13:11:43,240 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:11:43,240 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 13:11:43,240 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 13:11:43,240 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 13:11:43,240 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 13:11:43,240 INFO L87 Difference]: Start difference. First operand 132 states and 142 transitions. Second operand 8 states. [2018-02-04 13:11:43,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:11:43,351 INFO L93 Difference]: Finished difference Result 157 states and 168 transitions. [2018-02-04 13:11:43,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 13:11:43,351 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-02-04 13:11:43,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:11:43,352 INFO L225 Difference]: With dead ends: 157 [2018-02-04 13:11:43,352 INFO L226 Difference]: Without dead ends: 157 [2018-02-04 13:11:43,352 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-02-04 13:11:43,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-02-04 13:11:43,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 132. [2018-02-04 13:11:43,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-02-04 13:11:43,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 140 transitions. [2018-02-04 13:11:43,355 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 140 transitions. Word has length 35 [2018-02-04 13:11:43,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:11:43,355 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 140 transitions. [2018-02-04 13:11:43,355 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 13:11:43,355 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 140 transitions. [2018-02-04 13:11:43,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 13:11:43,355 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:11:43,355 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 13:11:43,355 INFO L371 AbstractCegarLoop]: === Iteration 26 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:11:43,355 INFO L82 PathProgramCache]: Analyzing trace with hash 655964540, now seen corresponding path program 1 times [2018-02-04 13:11:43,355 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:11:43,355 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:11:43,356 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:43,356 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:11:43,356 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:43,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:11:43,361 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:11:43,374 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 13:11:43,374 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:11:43,374 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 13:11:43,375 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 13:11:43,375 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 13:11:43,375 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:11:43,375 INFO L87 Difference]: Start difference. First operand 132 states and 140 transitions. Second operand 5 states. [2018-02-04 13:11:43,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:11:43,445 INFO L93 Difference]: Finished difference Result 131 states and 139 transitions. [2018-02-04 13:11:43,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 13:11:43,445 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-02-04 13:11:43,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:11:43,446 INFO L225 Difference]: With dead ends: 131 [2018-02-04 13:11:43,446 INFO L226 Difference]: Without dead ends: 131 [2018-02-04 13:11:43,446 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-04 13:11:43,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-02-04 13:11:43,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-02-04 13:11:43,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-02-04 13:11:43,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 139 transitions. [2018-02-04 13:11:43,448 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 139 transitions. Word has length 36 [2018-02-04 13:11:43,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:11:43,448 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 139 transitions. [2018-02-04 13:11:43,448 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 13:11:43,448 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 139 transitions. [2018-02-04 13:11:43,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 13:11:43,448 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:11:43,448 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 13:11:43,449 INFO L371 AbstractCegarLoop]: === Iteration 27 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:11:43,449 INFO L82 PathProgramCache]: Analyzing trace with hash 655964541, now seen corresponding path program 1 times [2018-02-04 13:11:43,449 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:11:43,449 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:11:43,449 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:43,449 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:11:43,449 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:43,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:11:43,456 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:11:43,574 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 13:11:43,574 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:11:43,574 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 13:11:43,574 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 13:11:43,574 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 13:11:43,574 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-04 13:11:43,575 INFO L87 Difference]: Start difference. First operand 131 states and 139 transitions. Second operand 10 states. [2018-02-04 13:11:43,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:11:43,816 INFO L93 Difference]: Finished difference Result 153 states and 165 transitions. [2018-02-04 13:11:43,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 13:11:43,816 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2018-02-04 13:11:43,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:11:43,817 INFO L225 Difference]: With dead ends: 153 [2018-02-04 13:11:43,817 INFO L226 Difference]: Without dead ends: 153 [2018-02-04 13:11:43,817 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2018-02-04 13:11:43,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-02-04 13:11:43,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 134. [2018-02-04 13:11:43,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-04 13:11:43,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 142 transitions. [2018-02-04 13:11:43,828 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 142 transitions. Word has length 36 [2018-02-04 13:11:43,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:11:43,828 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 142 transitions. [2018-02-04 13:11:43,828 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 13:11:43,828 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 142 transitions. [2018-02-04 13:11:43,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 13:11:43,829 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:11:43,829 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:11:43,829 INFO L371 AbstractCegarLoop]: === Iteration 28 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:11:43,829 INFO L82 PathProgramCache]: Analyzing trace with hash -747720392, now seen corresponding path program 1 times [2018-02-04 13:11:43,829 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:11:43,829 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:11:43,830 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:43,830 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:11:43,830 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:43,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:11:43,836 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:11:43,889 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:11:43,889 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:11:43,889 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:11:43,895 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:11:43,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:11:43,921 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:11:43,926 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 13:11:43,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:11:43,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:11:43,927 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 13:11:43,933 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:11:43,933 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:11:43,934 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 13:11:43,934 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:11:43,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:11:43,938 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-02-04 13:11:43,950 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 13 treesize of output 10 [2018-02-04 13:11:43,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 10 treesize of output 9 [2018-02-04 13:11:43,953 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:11:43,954 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:11:43,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:11:43,958 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27 [2018-02-04 13:11:43,996 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 57 [2018-02-04 13:11:43,998 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 32 treesize of output 1 [2018-02-04 13:11:43,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:11:44,002 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:11:44,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:11:44,007 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:27 [2018-02-04 13:11:44,010 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 31 treesize of output 25 [2018-02-04 13:11:44,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2018-02-04 13:11:44,012 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:11:44,014 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:11:44,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:11:44,017 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:15 [2018-02-04 13:11:44,030 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 13:11:44,047 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:11:44,048 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2018-02-04 13:11:44,048 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 13:11:44,048 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 13:11:44,048 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-02-04 13:11:44,048 INFO L87 Difference]: Start difference. First operand 134 states and 142 transitions. Second operand 13 states. [2018-02-04 13:11:44,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:11:44,186 INFO L93 Difference]: Finished difference Result 133 states and 141 transitions. [2018-02-04 13:11:44,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 13:11:44,186 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2018-02-04 13:11:44,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:11:44,187 INFO L225 Difference]: With dead ends: 133 [2018-02-04 13:11:44,187 INFO L226 Difference]: Without dead ends: 133 [2018-02-04 13:11:44,187 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2018-02-04 13:11:44,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-02-04 13:11:44,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-02-04 13:11:44,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-02-04 13:11:44,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 141 transitions. [2018-02-04 13:11:44,189 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 141 transitions. Word has length 37 [2018-02-04 13:11:44,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:11:44,189 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 141 transitions. [2018-02-04 13:11:44,189 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 13:11:44,189 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 141 transitions. [2018-02-04 13:11:44,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 13:11:44,189 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:11:44,190 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:11:44,190 INFO L371 AbstractCegarLoop]: === Iteration 29 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:11:44,190 INFO L82 PathProgramCache]: Analyzing trace with hash -747720391, now seen corresponding path program 1 times [2018-02-04 13:11:44,190 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:11:44,190 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:11:44,190 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:44,191 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:11:44,191 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:44,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:11:44,197 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:11:44,339 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:11:44,340 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:11:44,340 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:11:44,347 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:11:44,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:11:44,374 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:11:44,381 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 13:11:44,381 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:11:44,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:11:44,382 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 13:11:44,391 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 13:11:44,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:11:44,396 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:11:44,396 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:11:44,397 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 13:11:44,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:11:44,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:11:44,408 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-02-04 13:11:44,424 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 13 treesize of output 10 [2018-02-04 13:11:44,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 10 treesize of output 9 [2018-02-04 13:11:44,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:11:44,427 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:11:44,436 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 13 treesize of output 10 [2018-02-04 13:11:44,438 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 10 treesize of output 9 [2018-02-04 13:11:44,438 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:11:44,441 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:11:44,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:11:44,445 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:31 [2018-02-04 13:11:44,480 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 98 [2018-02-04 13:11:44,484 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 32 treesize of output 1 [2018-02-04 13:11:44,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:11:44,492 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:11:44,505 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 51 treesize of output 52 [2018-02-04 13:11:44,507 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 32 treesize of output 1 [2018-02-04 13:11:44,507 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:11:44,509 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:11:44,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:11:44,514 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:116, output treesize:34 [2018-02-04 13:11:44,554 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 31 treesize of output 25 [2018-02-04 13:11:44,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2018-02-04 13:11:44,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:11:44,559 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:11:44,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 [2018-02-04 13:11:44,566 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 15 treesize of output 3 [2018-02-04 13:11:44,567 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:11:44,568 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:11:44,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:11:44,572 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:52, output treesize:12 [2018-02-04 13:11:44,584 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:11:44,614 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:11:44,614 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2018-02-04 13:11:44,614 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 13:11:44,614 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 13:11:44,614 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-02-04 13:11:44,614 INFO L87 Difference]: Start difference. First operand 133 states and 141 transitions. Second operand 15 states. [2018-02-04 13:11:44,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:11:44,966 INFO L93 Difference]: Finished difference Result 143 states and 151 transitions. [2018-02-04 13:11:44,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 13:11:44,966 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2018-02-04 13:11:44,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:11:44,966 INFO L225 Difference]: With dead ends: 143 [2018-02-04 13:11:44,966 INFO L226 Difference]: Without dead ends: 143 [2018-02-04 13:11:44,967 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 28 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=442, Unknown=0, NotChecked=0, Total=600 [2018-02-04 13:11:44,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-04 13:11:44,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-02-04 13:11:44,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-02-04 13:11:44,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 151 transitions. [2018-02-04 13:11:44,971 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 151 transitions. Word has length 37 [2018-02-04 13:11:44,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:11:44,971 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 151 transitions. [2018-02-04 13:11:44,971 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 13:11:44,972 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 151 transitions. [2018-02-04 13:11:44,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 13:11:44,972 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:11:44,972 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, 1, 1, 1, 1] [2018-02-04 13:11:44,972 INFO L371 AbstractCegarLoop]: === Iteration 30 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:11:44,972 INFO L82 PathProgramCache]: Analyzing trace with hash 484884458, now seen corresponding path program 1 times [2018-02-04 13:11:44,973 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:11:44,973 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:11:44,973 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:44,973 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:11:44,973 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:44,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:11:44,983 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:11:45,217 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 13:11:45,217 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:11:45,217 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-02-04 13:11:45,217 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 13:11:45,217 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 13:11:45,217 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-02-04 13:11:45,218 INFO L87 Difference]: Start difference. First operand 143 states and 151 transitions. Second operand 17 states. [2018-02-04 13:11:45,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:11:45,958 INFO L93 Difference]: Finished difference Result 178 states and 191 transitions. [2018-02-04 13:11:45,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 13:11:45,993 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 40 [2018-02-04 13:11:45,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:11:45,994 INFO L225 Difference]: With dead ends: 178 [2018-02-04 13:11:45,994 INFO L226 Difference]: Without dead ends: 178 [2018-02-04 13:11:45,995 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=988, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 13:11:45,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-02-04 13:11:45,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 160. [2018-02-04 13:11:45,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-02-04 13:11:45,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 171 transitions. [2018-02-04 13:11:45,999 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 171 transitions. Word has length 40 [2018-02-04 13:11:45,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:11:45,999 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 171 transitions. [2018-02-04 13:11:45,999 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 13:11:45,999 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 171 transitions. [2018-02-04 13:11:46,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 13:11:46,000 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:11:46,000 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, 1, 1, 1, 1] [2018-02-04 13:11:46,000 INFO L371 AbstractCegarLoop]: === Iteration 31 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:11:46,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1287024166, now seen corresponding path program 1 times [2018-02-04 13:11:46,000 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:11:46,000 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:11:46,001 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:46,001 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:11:46,001 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:46,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:11:46,012 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:11:46,154 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 13:11:46,154 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:11:46,154 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 13:11:46,155 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 13:11:46,155 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 13:11:46,155 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-02-04 13:11:46,155 INFO L87 Difference]: Start difference. First operand 160 states and 171 transitions. Second operand 12 states. [2018-02-04 13:11:46,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:11:46,589 INFO L93 Difference]: Finished difference Result 195 states and 213 transitions. [2018-02-04 13:11:46,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 13:11:46,589 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2018-02-04 13:11:46,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:11:46,590 INFO L225 Difference]: With dead ends: 195 [2018-02-04 13:11:46,590 INFO L226 Difference]: Without dead ends: 195 [2018-02-04 13:11:46,591 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2018-02-04 13:11:46,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-02-04 13:11:46,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 169. [2018-02-04 13:11:46,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-02-04 13:11:46,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 182 transitions. [2018-02-04 13:11:46,594 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 182 transitions. Word has length 40 [2018-02-04 13:11:46,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:11:46,595 INFO L432 AbstractCegarLoop]: Abstraction has 169 states and 182 transitions. [2018-02-04 13:11:46,595 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 13:11:46,595 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 182 transitions. [2018-02-04 13:11:46,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 13:11:46,595 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:11:46,595 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:11:46,595 INFO L371 AbstractCegarLoop]: === Iteration 32 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:11:46,595 INFO L82 PathProgramCache]: Analyzing trace with hash -907645030, now seen corresponding path program 1 times [2018-02-04 13:11:46,596 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:11:46,596 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:11:46,596 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:46,596 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:11:46,596 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:46,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:11:46,601 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:11:46,641 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 13:11:46,641 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:11:46,641 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 13:11:46,642 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 13:11:46,642 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 13:11:46,642 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 13:11:46,642 INFO L87 Difference]: Start difference. First operand 169 states and 182 transitions. Second operand 8 states. [2018-02-04 13:11:46,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:11:46,774 INFO L93 Difference]: Finished difference Result 185 states and 199 transitions. [2018-02-04 13:11:46,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 13:11:46,774 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2018-02-04 13:11:46,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:11:46,776 INFO L225 Difference]: With dead ends: 185 [2018-02-04 13:11:46,776 INFO L226 Difference]: Without dead ends: 185 [2018-02-04 13:11:46,776 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-02-04 13:11:46,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-02-04 13:11:46,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 178. [2018-02-04 13:11:46,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-02-04 13:11:46,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 196 transitions. [2018-02-04 13:11:46,781 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 196 transitions. Word has length 44 [2018-02-04 13:11:46,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:11:46,781 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 196 transitions. [2018-02-04 13:11:46,781 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 13:11:46,781 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 196 transitions. [2018-02-04 13:11:46,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 13:11:46,782 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:11:46,782 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:11:46,782 INFO L371 AbstractCegarLoop]: === Iteration 33 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:11:46,782 INFO L82 PathProgramCache]: Analyzing trace with hash -907645029, now seen corresponding path program 1 times [2018-02-04 13:11:46,782 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:11:46,782 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:11:46,783 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:46,783 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:11:46,783 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:46,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:11:46,790 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:11:46,814 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 13:11:46,815 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:11:46,815 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 13:11:46,815 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 13:11:46,815 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 13:11:46,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 13:11:46,816 INFO L87 Difference]: Start difference. First operand 178 states and 196 transitions. Second operand 6 states. [2018-02-04 13:11:46,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:11:46,929 INFO L93 Difference]: Finished difference Result 184 states and 202 transitions. [2018-02-04 13:11:46,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 13:11:46,929 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-02-04 13:11:46,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:11:46,930 INFO L225 Difference]: With dead ends: 184 [2018-02-04 13:11:46,930 INFO L226 Difference]: Without dead ends: 184 [2018-02-04 13:11:46,931 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 13:11:46,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-02-04 13:11:46,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 180. [2018-02-04 13:11:46,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-02-04 13:11:46,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 199 transitions. [2018-02-04 13:11:46,935 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 199 transitions. Word has length 44 [2018-02-04 13:11:46,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:11:46,935 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 199 transitions. [2018-02-04 13:11:46,935 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 13:11:46,935 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 199 transitions. [2018-02-04 13:11:46,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 13:11:46,936 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:11:46,936 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:11:46,936 INFO L371 AbstractCegarLoop]: === Iteration 34 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:11:46,936 INFO L82 PathProgramCache]: Analyzing trace with hash 563904760, now seen corresponding path program 1 times [2018-02-04 13:11:46,936 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:11:46,936 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:11:46,937 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:46,937 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:11:46,937 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:46,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:11:46,947 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:11:47,033 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 13:11:47,033 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:11:47,033 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 13:11:47,033 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 13:11:47,034 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 13:11:47,034 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-04 13:11:47,034 INFO L87 Difference]: Start difference. First operand 180 states and 199 transitions. Second operand 10 states. [2018-02-04 13:11:47,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:11:47,245 INFO L93 Difference]: Finished difference Result 186 states and 201 transitions. [2018-02-04 13:11:47,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 13:11:47,245 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2018-02-04 13:11:47,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:11:47,246 INFO L225 Difference]: With dead ends: 186 [2018-02-04 13:11:47,246 INFO L226 Difference]: Without dead ends: 186 [2018-02-04 13:11:47,246 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-02-04 13:11:47,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-02-04 13:11:47,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 170. [2018-02-04 13:11:47,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-02-04 13:11:47,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 187 transitions. [2018-02-04 13:11:47,250 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 187 transitions. Word has length 43 [2018-02-04 13:11:47,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:11:47,250 INFO L432 AbstractCegarLoop]: Abstraction has 170 states and 187 transitions. [2018-02-04 13:11:47,250 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 13:11:47,250 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 187 transitions. [2018-02-04 13:11:47,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 13:11:47,250 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:11:47,251 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:11:47,251 INFO L371 AbstractCegarLoop]: === Iteration 35 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:11:47,251 INFO L82 PathProgramCache]: Analyzing trace with hash -368510437, now seen corresponding path program 1 times [2018-02-04 13:11:47,251 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:11:47,251 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:11:47,251 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:47,251 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:11:47,252 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:47,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:11:47,258 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:11:47,368 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 13:11:47,368 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:11:47,368 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 13:11:47,369 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 13:11:47,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 13:11:47,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-04 13:11:47,369 INFO L87 Difference]: Start difference. First operand 170 states and 187 transitions. Second operand 12 states. [2018-02-04 13:11:47,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:11:47,639 INFO L93 Difference]: Finished difference Result 204 states and 228 transitions. [2018-02-04 13:11:47,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 13:11:47,640 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2018-02-04 13:11:47,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:11:47,641 INFO L225 Difference]: With dead ends: 204 [2018-02-04 13:11:47,641 INFO L226 Difference]: Without dead ends: 204 [2018-02-04 13:11:47,641 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-02-04 13:11:47,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-02-04 13:11:47,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 196. [2018-02-04 13:11:47,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-02-04 13:11:47,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 220 transitions. [2018-02-04 13:11:47,646 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 220 transitions. Word has length 46 [2018-02-04 13:11:47,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:11:47,646 INFO L432 AbstractCegarLoop]: Abstraction has 196 states and 220 transitions. [2018-02-04 13:11:47,646 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 13:11:47,646 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 220 transitions. [2018-02-04 13:11:47,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 13:11:47,649 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:11:47,649 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:11:47,649 INFO L371 AbstractCegarLoop]: === Iteration 36 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:11:47,649 INFO L82 PathProgramCache]: Analyzing trace with hash 221499877, now seen corresponding path program 1 times [2018-02-04 13:11:47,649 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:11:47,649 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:11:47,650 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:47,650 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:11:47,650 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:47,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:11:47,665 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:11:47,878 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 13:11:47,878 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:11:47,878 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-02-04 13:11:47,878 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 13:11:47,878 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 13:11:47,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2018-02-04 13:11:47,879 INFO L87 Difference]: Start difference. First operand 196 states and 220 transitions. Second operand 18 states. [2018-02-04 13:11:48,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:11:48,516 INFO L93 Difference]: Finished difference Result 222 states and 249 transitions. [2018-02-04 13:11:48,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 13:11:48,516 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 47 [2018-02-04 13:11:48,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:11:48,517 INFO L225 Difference]: With dead ends: 222 [2018-02-04 13:11:48,517 INFO L226 Difference]: Without dead ends: 222 [2018-02-04 13:11:48,517 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=1054, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 13:11:48,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-02-04 13:11:48,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 201. [2018-02-04 13:11:48,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-02-04 13:11:48,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 227 transitions. [2018-02-04 13:11:48,520 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 227 transitions. Word has length 47 [2018-02-04 13:11:48,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:11:48,520 INFO L432 AbstractCegarLoop]: Abstraction has 201 states and 227 transitions. [2018-02-04 13:11:48,520 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 13:11:48,520 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 227 transitions. [2018-02-04 13:11:48,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 13:11:48,521 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:11:48,521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:11:48,521 INFO L371 AbstractCegarLoop]: === Iteration 37 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:11:48,521 INFO L82 PathProgramCache]: Analyzing trace with hash 221499878, now seen corresponding path program 1 times [2018-02-04 13:11:48,521 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:11:48,521 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:11:48,522 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:48,522 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:11:48,522 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:48,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:11:48,528 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:11:48,773 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 13:11:48,773 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:11:48,773 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-02-04 13:11:48,773 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 13:11:48,773 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 13:11:48,774 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2018-02-04 13:11:48,774 INFO L87 Difference]: Start difference. First operand 201 states and 227 transitions. Second operand 19 states. [2018-02-04 13:11:49,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:11:49,556 INFO L93 Difference]: Finished difference Result 239 states and 269 transitions. [2018-02-04 13:11:49,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 13:11:49,556 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 47 [2018-02-04 13:11:49,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:11:49,557 INFO L225 Difference]: With dead ends: 239 [2018-02-04 13:11:49,557 INFO L226 Difference]: Without dead ends: 239 [2018-02-04 13:11:49,557 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=150, Invalid=1256, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 13:11:49,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-02-04 13:11:49,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 218. [2018-02-04 13:11:49,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-02-04 13:11:49,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 249 transitions. [2018-02-04 13:11:49,562 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 249 transitions. Word has length 47 [2018-02-04 13:11:49,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:11:49,563 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 249 transitions. [2018-02-04 13:11:49,563 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 13:11:49,563 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 249 transitions. [2018-02-04 13:11:49,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-04 13:11:49,563 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:11:49,564 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:11:49,564 INFO L371 AbstractCegarLoop]: === Iteration 38 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:11:49,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1633162428, now seen corresponding path program 1 times [2018-02-04 13:11:49,564 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:11:49,564 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:11:49,565 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:49,565 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:11:49,565 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:49,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:11:49,572 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:11:49,601 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 13:11:49,601 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:11:49,601 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 13:11:49,601 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 13:11:49,602 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 13:11:49,602 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:11:49,602 INFO L87 Difference]: Start difference. First operand 218 states and 249 transitions. Second operand 5 states. [2018-02-04 13:11:49,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:11:49,651 INFO L93 Difference]: Finished difference Result 222 states and 253 transitions. [2018-02-04 13:11:49,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:11:49,651 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-02-04 13:11:49,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:11:49,652 INFO L225 Difference]: With dead ends: 222 [2018-02-04 13:11:49,653 INFO L226 Difference]: Without dead ends: 222 [2018-02-04 13:11:49,653 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 13:11:49,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-02-04 13:11:49,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 217. [2018-02-04 13:11:49,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-02-04 13:11:49,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 247 transitions. [2018-02-04 13:11:49,657 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 247 transitions. Word has length 50 [2018-02-04 13:11:49,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:11:49,657 INFO L432 AbstractCegarLoop]: Abstraction has 217 states and 247 transitions. [2018-02-04 13:11:49,657 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 13:11:49,658 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 247 transitions. [2018-02-04 13:11:49,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-04 13:11:49,658 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:11:49,658 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:11:49,658 INFO L371 AbstractCegarLoop]: === Iteration 39 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:11:49,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1633162429, now seen corresponding path program 1 times [2018-02-04 13:11:49,659 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:11:49,659 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:11:49,659 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:49,659 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:11:49,659 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:49,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:11:49,666 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:11:49,695 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 13:11:49,696 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:11:49,696 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 13:11:49,696 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 13:11:49,696 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 13:11:49,696 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:11:49,696 INFO L87 Difference]: Start difference. First operand 217 states and 247 transitions. Second operand 5 states. [2018-02-04 13:11:49,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:11:49,754 INFO L93 Difference]: Finished difference Result 221 states and 251 transitions. [2018-02-04 13:11:49,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:11:49,754 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-02-04 13:11:49,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:11:49,755 INFO L225 Difference]: With dead ends: 221 [2018-02-04 13:11:49,755 INFO L226 Difference]: Without dead ends: 221 [2018-02-04 13:11:49,755 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 13:11:49,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-02-04 13:11:49,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 216. [2018-02-04 13:11:49,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-02-04 13:11:49,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 245 transitions. [2018-02-04 13:11:49,759 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 245 transitions. Word has length 50 [2018-02-04 13:11:49,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:11:49,760 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 245 transitions. [2018-02-04 13:11:49,760 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 13:11:49,760 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 245 transitions. [2018-02-04 13:11:49,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-04 13:11:49,760 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:11:49,760 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:11:49,761 INFO L371 AbstractCegarLoop]: === Iteration 40 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:11:49,761 INFO L82 PathProgramCache]: Analyzing trace with hash -420728712, now seen corresponding path program 1 times [2018-02-04 13:11:49,761 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:11:49,761 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:11:49,762 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:49,762 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:11:49,762 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:49,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:11:49,774 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:11:50,357 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:11:50,357 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:11:50,357 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:11:50,362 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:11:50,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:11:50,385 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:11:50,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 13:11:50,408 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 13:11:50,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:11:50,410 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:11:50,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 13:11:50,417 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 13:11:50,417 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:11:50,418 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:11:50,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:11:50,421 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-02-04 13:11:50,727 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2018-02-04 13:11:50,730 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:11:50,730 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-02-04 13:11:50,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2018-02-04 13:11:50,735 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:11:50,741 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:11:50,751 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 26 treesize of output 19 [2018-02-04 13:11:50,753 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:11:50,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2018-02-04 13:11:50,764 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 13:11:50,767 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:11:50,774 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:11:50,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 38 [2018-02-04 13:11:50,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-02-04 13:11:50,786 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 18 treesize of output 19 [2018-02-04 13:11:50,786 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 13:11:50,791 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:11:50,802 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:11:50,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 37 treesize of output 34 [2018-02-04 13:11:50,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-02-04 13:11:50,807 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 13:11:50,812 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:11:50,841 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:11:50,883 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2018-02-04 13:11:50,886 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:11:50,886 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-02-04 13:11:50,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2018-02-04 13:11:50,890 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-02-04 13:11:50,895 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:11:50,902 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 26 treesize of output 19 [2018-02-04 13:11:50,906 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:11:50,907 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 19 treesize of output 19 [2018-02-04 13:11:50,908 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-02-04 13:11:50,911 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:11:50,931 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:11:50,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 38 [2018-02-04 13:11:50,938 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-02-04 13:11:50,941 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 18 treesize of output 19 [2018-02-04 13:11:50,941 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-02-04 13:11:50,944 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:11:50,952 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:11:50,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 40 [2018-02-04 13:11:50,955 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 29 treesize of output 27 [2018-02-04 13:11:50,956 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-02-04 13:11:50,960 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:11:50,965 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:11:50,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-02-04 13:11:50,986 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 5 variables, input treesize:104, output treesize:177 [2018-02-04 13:11:51,250 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 95 treesize of output 94 [2018-02-04 13:11:51,250 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:11:51,280 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 13:11:51,280 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:188, output treesize:87 [2018-02-04 13:11:51,324 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:11:51,324 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:11:51,325 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 15 treesize of output 8 [2018-02-04 13:11:51,325 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:11:51,337 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:11:51,337 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:11:51,339 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:11:51,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 89 [2018-02-04 13:11:51,343 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 78 treesize of output 68 [2018-02-04 13:11:51,343 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:11:51,348 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:11:51,358 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:11:51,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 61 treesize of output 69 [2018-02-04 13:11:51,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 74 [2018-02-04 13:11:51,363 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 13:11:51,369 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:11:51,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:11:51,376 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:108, output treesize:68 [2018-02-04 13:11:51,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2018-02-04 13:11:51,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-02-04 13:11:51,416 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:11:51,419 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:11:51,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-02-04 13:11:51,420 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:11:51,421 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:11:51,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2018-02-04 13:11:51,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-02-04 13:11:51,428 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 13:11:51,431 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:11:51,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2018-02-04 13:11:51,432 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 13:11:51,433 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:11:51,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:11:51,437 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:79, output treesize:9 [2018-02-04 13:11:51,466 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:11:51,484 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:11:51,484 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 36 [2018-02-04 13:11:51,484 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-04 13:11:51,485 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-04 13:11:51,485 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1086, Unknown=31, NotChecked=0, Total=1260 [2018-02-04 13:11:51,485 INFO L87 Difference]: Start difference. First operand 216 states and 245 transitions. Second operand 36 states. [2018-02-04 13:11:52,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:11:52,570 INFO L93 Difference]: Finished difference Result 236 states and 267 transitions. [2018-02-04 13:11:52,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 13:11:52,571 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 51 [2018-02-04 13:11:52,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:11:52,571 INFO L225 Difference]: With dead ends: 236 [2018-02-04 13:11:52,571 INFO L226 Difference]: Without dead ends: 236 [2018-02-04 13:11:52,572 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 35 SyntacticMatches, 6 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=288, Invalid=2229, Unknown=33, NotChecked=0, Total=2550 [2018-02-04 13:11:52,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-02-04 13:11:52,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 224. [2018-02-04 13:11:52,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-02-04 13:11:52,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 253 transitions. [2018-02-04 13:11:52,576 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 253 transitions. Word has length 51 [2018-02-04 13:11:52,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:11:52,576 INFO L432 AbstractCegarLoop]: Abstraction has 224 states and 253 transitions. [2018-02-04 13:11:52,576 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-04 13:11:52,576 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 253 transitions. [2018-02-04 13:11:52,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 13:11:52,577 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:11:52,577 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:11:52,577 INFO L371 AbstractCegarLoop]: === Iteration 41 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:11:52,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1806033505, now seen corresponding path program 1 times [2018-02-04 13:11:52,577 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:11:52,578 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:11:52,578 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:52,578 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:11:52,578 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:52,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:11:52,584 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:11:52,605 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 13:11:52,606 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:11:52,606 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 13:11:52,606 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 13:11:52,606 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 13:11:52,606 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-04 13:11:52,606 INFO L87 Difference]: Start difference. First operand 224 states and 253 transitions. Second operand 6 states. [2018-02-04 13:11:52,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:11:52,708 INFO L93 Difference]: Finished difference Result 224 states and 251 transitions. [2018-02-04 13:11:52,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 13:11:52,708 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2018-02-04 13:11:52,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:11:52,709 INFO L225 Difference]: With dead ends: 224 [2018-02-04 13:11:52,709 INFO L226 Difference]: Without dead ends: 224 [2018-02-04 13:11:52,709 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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 13:11:52,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-02-04 13:11:52,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 221. [2018-02-04 13:11:52,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-02-04 13:11:52,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 248 transitions. [2018-02-04 13:11:52,711 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 248 transitions. Word has length 52 [2018-02-04 13:11:52,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:11:52,711 INFO L432 AbstractCegarLoop]: Abstraction has 221 states and 248 transitions. [2018-02-04 13:11:52,711 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 13:11:52,711 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 248 transitions. [2018-02-04 13:11:52,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-04 13:11:52,712 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:11:52,712 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:11:52,712 INFO L371 AbstractCegarLoop]: === Iteration 42 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:11:52,712 INFO L82 PathProgramCache]: Analyzing trace with hash -594351723, now seen corresponding path program 1 times [2018-02-04 13:11:52,712 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:11:52,712 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:11:52,712 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:52,712 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:11:52,713 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:11:52,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:11:52,718 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:11:53,022 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:11:53,022 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:11:53,022 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:11:53,029 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:11:53,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:11:53,061 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:11:53,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 13:11:53,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 13:11:53,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:11:53,141 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:11:53,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:11:53,147 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:28 [2018-02-04 13:11:53,205 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 15 treesize of output 8 [2018-02-04 13:11:53,205 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:11:53,210 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 13:11:53,210 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:20 [2018-02-04 13:11:53,255 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 41 treesize of output 33 [2018-02-04 13:11:53,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-02-04 13:11:53,259 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:11:53,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:11:53,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:11:53,268 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:27 [2018-02-04 13:11:53,314 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~mem25.base| Int) (|main_~#list~0.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_~#list~0.base| 1))) (and (= |c_#valid| (store (store .cse0 |main_#t~mem25.base| 0) |main_~#list~0.base| 0)) (= 0 (select |c_old(#valid)| |main_~#list~0.base|)) (not (= 0 |main_#t~mem25.base|)) (= 0 (select .cse0 |main_#t~mem25.base|))))) is different from true [2018-02-04 13:11:53,322 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:11:53,351 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:11:53,352 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-02-04 13:11:53,352 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 13:11:53,352 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 13:11:53,352 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=365, Unknown=3, NotChecked=38, Total=462 [2018-02-04 13:11:53,352 INFO L87 Difference]: Start difference. First operand 221 states and 248 transitions. Second operand 22 states. [2018-02-04 13:12:06,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:12:06,020 INFO L93 Difference]: Finished difference Result 232 states and 261 transitions. [2018-02-04 13:12:06,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 13:12:06,020 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 53 [2018-02-04 13:12:06,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:12:06,021 INFO L225 Difference]: With dead ends: 232 [2018-02-04 13:12:06,021 INFO L226 Difference]: Without dead ends: 207 [2018-02-04 13:12:06,021 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=124, Invalid=804, Unknown=6, NotChecked=58, Total=992 [2018-02-04 13:12:06,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-02-04 13:12:06,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 200. [2018-02-04 13:12:06,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-02-04 13:12:06,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 226 transitions. [2018-02-04 13:12:06,025 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 226 transitions. Word has length 53 [2018-02-04 13:12:06,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:12:06,025 INFO L432 AbstractCegarLoop]: Abstraction has 200 states and 226 transitions. [2018-02-04 13:12:06,025 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 13:12:06,025 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 226 transitions. [2018-02-04 13:12:06,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-04 13:12:06,026 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:12:06,026 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:12:06,026 INFO L371 AbstractCegarLoop]: === Iteration 43 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:12:06,026 INFO L82 PathProgramCache]: Analyzing trace with hash 419691716, now seen corresponding path program 1 times [2018-02-04 13:12:06,026 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:12:06,027 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:12:06,027 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:12:06,027 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:12:06,027 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:12:06,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:12:06,038 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:12:06,341 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 13:12:06,341 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:12:06,341 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-02-04 13:12:06,341 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 13:12:06,341 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 13:12:06,341 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2018-02-04 13:12:06,342 INFO L87 Difference]: Start difference. First operand 200 states and 226 transitions. Second operand 20 states. [2018-02-04 13:12:06,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:12:06,874 INFO L93 Difference]: Finished difference Result 236 states and 271 transitions. [2018-02-04 13:12:06,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 13:12:06,874 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 53 [2018-02-04 13:12:06,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:12:06,875 INFO L225 Difference]: With dead ends: 236 [2018-02-04 13:12:06,875 INFO L226 Difference]: Without dead ends: 236 [2018-02-04 13:12:06,876 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=982, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 13:12:06,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-02-04 13:12:06,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 221. [2018-02-04 13:12:06,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-02-04 13:12:06,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 254 transitions. [2018-02-04 13:12:06,880 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 254 transitions. Word has length 53 [2018-02-04 13:12:06,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:12:06,880 INFO L432 AbstractCegarLoop]: Abstraction has 221 states and 254 transitions. [2018-02-04 13:12:06,880 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 13:12:06,880 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 254 transitions. [2018-02-04 13:12:06,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 13:12:06,881 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:12:06,881 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:12:06,881 INFO L371 AbstractCegarLoop]: === Iteration 44 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:12:06,881 INFO L82 PathProgramCache]: Analyzing trace with hash 125541378, now seen corresponding path program 1 times [2018-02-04 13:12:06,881 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:12:06,881 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:12:06,882 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:12:06,882 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:12:06,882 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:12:06,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:12:06,890 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:12:07,218 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 13:12:07,218 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:12:07,218 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-02-04 13:12:07,219 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 13:12:07,219 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 13:12:07,219 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2018-02-04 13:12:07,219 INFO L87 Difference]: Start difference. First operand 221 states and 254 transitions. Second operand 19 states. [2018-02-04 13:12:07,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:12:07,770 INFO L93 Difference]: Finished difference Result 235 states and 269 transitions. [2018-02-04 13:12:07,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 13:12:07,770 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 54 [2018-02-04 13:12:07,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:12:07,771 INFO L225 Difference]: With dead ends: 235 [2018-02-04 13:12:07,771 INFO L226 Difference]: Without dead ends: 235 [2018-02-04 13:12:07,771 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=814, Unknown=0, NotChecked=0, Total=930 [2018-02-04 13:12:07,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-02-04 13:12:07,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 215. [2018-02-04 13:12:07,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-02-04 13:12:07,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 248 transitions. [2018-02-04 13:12:07,776 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 248 transitions. Word has length 54 [2018-02-04 13:12:07,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:12:07,776 INFO L432 AbstractCegarLoop]: Abstraction has 215 states and 248 transitions. [2018-02-04 13:12:07,776 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 13:12:07,776 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 248 transitions. [2018-02-04 13:12:07,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-04 13:12:07,777 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:12:07,777 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:12:07,777 INFO L371 AbstractCegarLoop]: === Iteration 45 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:12:07,777 INFO L82 PathProgramCache]: Analyzing trace with hash -688882574, now seen corresponding path program 1 times [2018-02-04 13:12:07,777 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:12:07,777 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:12:07,778 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:12:07,778 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:12:07,778 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:12:07,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:12:07,788 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:12:08,073 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 13:12:08,073 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:12:08,073 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:12:08,079 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:12:08,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:12:08,106 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:12:08,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 13:12:08,204 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 13:12:08,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:08,206 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:12:08,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 13:12:08,214 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 13:12:08,214 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:08,215 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:12:08,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:12:08,220 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-02-04 13:12:08,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-02-04 13:12:08,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2018-02-04 13:12:08,261 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 13:12:08,274 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 13:12:08,275 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:08,281 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 13:12:08,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-02-04 13:12:08,300 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 20 treesize of output 19 [2018-02-04 13:12:08,300 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:08,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2018-02-04 13:12:08,332 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-02-04 13:12:08,341 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 13:12:08,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-02-04 13:12:08,356 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:42, output treesize:115 [2018-02-04 13:12:08,392 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 13:12:08,392 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:08,399 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:12:08,400 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:12:08,400 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 15 treesize of output 8 [2018-02-04 13:12:08,400 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:08,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:12:08,404 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:42 [2018-02-04 13:12:08,452 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2018-02-04 13:12:08,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-02-04 13:12:08,453 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:12:08,459 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 19 treesize of output 3 [2018-02-04 13:12:08,459 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:08,462 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:12:08,467 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 23 treesize of output 19 [2018-02-04 13:12:08,468 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-02-04 13:12:08,468 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:12:08,472 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 11 treesize of output 3 [2018-02-04 13:12:08,472 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:08,472 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:12:08,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:12:08,476 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:69, output treesize:7 [2018-02-04 13:12:08,498 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:12:08,516 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:12:08,516 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 27 [2018-02-04 13:12:08,516 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 13:12:08,516 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 13:12:08,517 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=624, Unknown=2, NotChecked=0, Total=702 [2018-02-04 13:12:08,517 INFO L87 Difference]: Start difference. First operand 215 states and 248 transitions. Second operand 27 states. [2018-02-04 13:12:09,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:12:09,228 INFO L93 Difference]: Finished difference Result 239 states and 271 transitions. [2018-02-04 13:12:09,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 13:12:09,229 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 60 [2018-02-04 13:12:09,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:12:09,229 INFO L225 Difference]: With dead ends: 239 [2018-02-04 13:12:09,230 INFO L226 Difference]: Without dead ends: 239 [2018-02-04 13:12:09,230 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 47 SyntacticMatches, 7 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=254, Invalid=2000, Unknown=2, NotChecked=0, Total=2256 [2018-02-04 13:12:09,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-02-04 13:12:09,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 219. [2018-02-04 13:12:09,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-02-04 13:12:09,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 249 transitions. [2018-02-04 13:12:09,233 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 249 transitions. Word has length 60 [2018-02-04 13:12:09,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:12:09,233 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 249 transitions. [2018-02-04 13:12:09,233 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 13:12:09,233 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 249 transitions. [2018-02-04 13:12:09,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 13:12:09,234 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:12:09,234 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:12:09,234 INFO L371 AbstractCegarLoop]: === Iteration 46 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:12:09,234 INFO L82 PathProgramCache]: Analyzing trace with hash 866020445, now seen corresponding path program 1 times [2018-02-04 13:12:09,234 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:12:09,234 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:12:09,235 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:12:09,235 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:12:09,235 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:12:09,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:12:09,245 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:12:09,476 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 13:12:09,476 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:12:09,477 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:12:09,481 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:12:09,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:12:09,504 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:12:09,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 13:12:09,607 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 13:12:09,608 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:09,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:12:09,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:12:09,616 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-02-04 13:12:09,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33 [2018-02-04 13:12:09,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2018-02-04 13:12:09,702 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 13:12:09,725 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 18 treesize of output 17 [2018-02-04 13:12:09,726 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:09,740 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 13:12:09,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 13:12:09,756 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 13:12:09,756 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:09,770 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:12:09,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 13:12:09,781 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:37, output treesize:53 [2018-02-04 13:12:09,829 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:12:09,830 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:12:09,830 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 35 treesize of output 29 [2018-02-04 13:12:09,831 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:09,845 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 13:12:09,846 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:69, output treesize:29 [2018-02-04 13:12:09,872 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 25 treesize of output 21 [2018-02-04 13:12:09,875 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 21 treesize of output 13 [2018-02-04 13:12:09,875 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:09,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:12:09,880 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 13:12:09,881 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:29 [2018-02-04 13:12:09,906 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-02-04 13:12:09,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-02-04 13:12:09,912 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:09,915 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 13 treesize of output 5 [2018-02-04 13:12:09,915 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:09,916 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:12:09,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:12:09,917 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:33, output treesize:5 [2018-02-04 13:12:09,931 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:12:09,948 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:12:09,948 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 27 [2018-02-04 13:12:09,948 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 13:12:09,948 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 13:12:09,948 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=680, Unknown=0, NotChecked=0, Total=756 [2018-02-04 13:12:09,949 INFO L87 Difference]: Start difference. First operand 219 states and 249 transitions. Second operand 28 states. [2018-02-04 13:12:10,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:12:10,675 INFO L93 Difference]: Finished difference Result 250 states and 282 transitions. [2018-02-04 13:12:10,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 13:12:10,676 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 67 [2018-02-04 13:12:10,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:12:10,677 INFO L225 Difference]: With dead ends: 250 [2018-02-04 13:12:10,677 INFO L226 Difference]: Without dead ends: 250 [2018-02-04 13:12:10,677 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 56 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=235, Invalid=2021, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 13:12:10,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-02-04 13:12:10,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 223. [2018-02-04 13:12:10,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-02-04 13:12:10,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 253 transitions. [2018-02-04 13:12:10,680 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 253 transitions. Word has length 67 [2018-02-04 13:12:10,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:12:10,681 INFO L432 AbstractCegarLoop]: Abstraction has 223 states and 253 transitions. [2018-02-04 13:12:10,681 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 13:12:10,681 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 253 transitions. [2018-02-04 13:12:10,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 13:12:10,682 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:12:10,682 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:12:10,682 INFO L371 AbstractCegarLoop]: === Iteration 47 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:12:10,682 INFO L82 PathProgramCache]: Analyzing trace with hash 866020446, now seen corresponding path program 1 times [2018-02-04 13:12:10,682 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:12:10,682 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:12:10,683 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:12:10,683 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:12:10,683 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:12:10,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:12:10,694 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:12:10,949 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 13:12:10,949 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:12:10,949 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:12:10,954 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:12:10,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:12:10,980 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:12:11,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 13:12:11,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 8 treesize of output 7 [2018-02-04 13:12:11,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:11,157 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:12:11,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 13:12:11,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 13:12:11,165 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:11,166 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:12:11,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:12:11,171 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:39, output treesize:28 [2018-02-04 13:12:11,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-02-04 13:12:11,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2018-02-04 13:12:11,209 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 13:12:11,225 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 13:12:11,225 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:11,233 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 13:12:11,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33 [2018-02-04 13:12:11,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2018-02-04 13:12:11,263 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 13:12:11,279 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 18 treesize of output 17 [2018-02-04 13:12:11,280 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:11,288 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 13:12:11,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-02-04 13:12:11,304 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:44, output treesize:129 [2018-02-04 13:12:11,354 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:12:11,355 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:12:11,355 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 50 treesize of output 44 [2018-02-04 13:12:11,355 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:11,365 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 13:12:11,365 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:84, output treesize:44 [2018-02-04 13:12:11,418 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 58 [2018-02-04 13:12:11,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-02-04 13:12:11,421 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:12:11,426 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 21 treesize of output 5 [2018-02-04 13:12:11,427 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:11,430 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:12:11,435 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 23 treesize of output 19 [2018-02-04 13:12:11,441 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 15 treesize of output 3 [2018-02-04 13:12:11,441 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:11,445 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:12:11,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:12:11,448 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:71, output treesize:9 [2018-02-04 13:12:11,519 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:12:11,537 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:12:11,537 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 35 [2018-02-04 13:12:11,537 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-04 13:12:11,538 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-04 13:12:11,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=1166, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 13:12:11,538 INFO L87 Difference]: Start difference. First operand 223 states and 253 transitions. Second operand 36 states. [2018-02-04 13:12:13,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:12:13,200 INFO L93 Difference]: Finished difference Result 300 states and 334 transitions. [2018-02-04 13:12:13,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-04 13:12:13,200 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 67 [2018-02-04 13:12:13,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:12:13,201 INFO L225 Difference]: With dead ends: 300 [2018-02-04 13:12:13,201 INFO L226 Difference]: Without dead ends: 300 [2018-02-04 13:12:13,202 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 51 SyntacticMatches, 6 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1133 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=405, Invalid=4707, Unknown=0, NotChecked=0, Total=5112 [2018-02-04 13:12:13,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-02-04 13:12:13,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 247. [2018-02-04 13:12:13,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-02-04 13:12:13,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 276 transitions. [2018-02-04 13:12:13,205 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 276 transitions. Word has length 67 [2018-02-04 13:12:13,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:12:13,205 INFO L432 AbstractCegarLoop]: Abstraction has 247 states and 276 transitions. [2018-02-04 13:12:13,205 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-04 13:12:13,205 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 276 transitions. [2018-02-04 13:12:13,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-04 13:12:13,205 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:12:13,205 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:12:13,205 INFO L371 AbstractCegarLoop]: === Iteration 48 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:12:13,205 INFO L82 PathProgramCache]: Analyzing trace with hash 804681722, now seen corresponding path program 1 times [2018-02-04 13:12:13,206 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:12:13,206 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:12:13,206 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:12:13,206 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:12:13,206 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:12:13,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:12:13,215 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:12:13,245 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-04 13:12:13,246 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:12:13,246 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:12:13,256 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:12:13,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:12:13,289 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:12:13,307 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-04 13:12:13,325 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:12:13,325 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-02-04 13:12:13,325 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 13:12:13,325 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 13:12:13,325 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-02-04 13:12:13,325 INFO L87 Difference]: Start difference. First operand 247 states and 276 transitions. Second operand 7 states. [2018-02-04 13:12:13,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:12:13,337 INFO L93 Difference]: Finished difference Result 259 states and 288 transitions. [2018-02-04 13:12:13,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 13:12:13,337 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-02-04 13:12:13,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:12:13,338 INFO L225 Difference]: With dead ends: 259 [2018-02-04 13:12:13,338 INFO L226 Difference]: Without dead ends: 259 [2018-02-04 13:12:13,338 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-02-04 13:12:13,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-02-04 13:12:13,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 254. [2018-02-04 13:12:13,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-02-04 13:12:13,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 283 transitions. [2018-02-04 13:12:13,341 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 283 transitions. Word has length 74 [2018-02-04 13:12:13,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:12:13,341 INFO L432 AbstractCegarLoop]: Abstraction has 254 states and 283 transitions. [2018-02-04 13:12:13,341 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 13:12:13,341 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 283 transitions. [2018-02-04 13:12:13,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 13:12:13,341 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:12:13,341 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:12:13,341 INFO L371 AbstractCegarLoop]: === Iteration 49 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:12:13,342 INFO L82 PathProgramCache]: Analyzing trace with hash -2023698147, now seen corresponding path program 1 times [2018-02-04 13:12:13,342 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:12:13,342 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:12:13,342 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:12:13,342 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:12:13,342 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:12:13,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:12:13,351 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:12:13,687 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 13:12:13,687 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:12:13,687 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-02-04 13:12:13,687 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 13:12:13,687 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 13:12:13,687 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2018-02-04 13:12:13,688 INFO L87 Difference]: Start difference. First operand 254 states and 283 transitions. Second operand 23 states. [2018-02-04 13:12:14,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:12:14,285 INFO L93 Difference]: Finished difference Result 272 states and 300 transitions. [2018-02-04 13:12:14,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 13:12:14,285 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 56 [2018-02-04 13:12:14,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:12:14,286 INFO L225 Difference]: With dead ends: 272 [2018-02-04 13:12:14,286 INFO L226 Difference]: Without dead ends: 272 [2018-02-04 13:12:14,286 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=1239, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 13:12:14,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-02-04 13:12:14,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 254. [2018-02-04 13:12:14,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-02-04 13:12:14,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 281 transitions. [2018-02-04 13:12:14,289 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 281 transitions. Word has length 56 [2018-02-04 13:12:14,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:12:14,289 INFO L432 AbstractCegarLoop]: Abstraction has 254 states and 281 transitions. [2018-02-04 13:12:14,289 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 13:12:14,289 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 281 transitions. [2018-02-04 13:12:14,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-04 13:12:14,289 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:12:14,289 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:12:14,289 INFO L371 AbstractCegarLoop]: === Iteration 50 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:12:14,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1689866953, now seen corresponding path program 1 times [2018-02-04 13:12:14,289 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:12:14,290 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:12:14,290 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:12:14,290 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:12:14,290 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:12:14,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:12:14,302 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:12:14,639 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 13:12:14,639 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:12:14,639 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-02-04 13:12:14,639 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 13:12:14,639 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 13:12:14,639 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2018-02-04 13:12:14,639 INFO L87 Difference]: Start difference. First operand 254 states and 281 transitions. Second operand 22 states. [2018-02-04 13:12:15,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:12:15,122 INFO L93 Difference]: Finished difference Result 277 states and 304 transitions. [2018-02-04 13:12:15,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 13:12:15,122 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 57 [2018-02-04 13:12:15,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:12:15,123 INFO L225 Difference]: With dead ends: 277 [2018-02-04 13:12:15,123 INFO L226 Difference]: Without dead ends: 277 [2018-02-04 13:12:15,123 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=1048, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 13:12:15,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-02-04 13:12:15,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 239. [2018-02-04 13:12:15,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-02-04 13:12:15,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 263 transitions. [2018-02-04 13:12:15,126 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 263 transitions. Word has length 57 [2018-02-04 13:12:15,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:12:15,126 INFO L432 AbstractCegarLoop]: Abstraction has 239 states and 263 transitions. [2018-02-04 13:12:15,126 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 13:12:15,126 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 263 transitions. [2018-02-04 13:12:15,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-04 13:12:15,126 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:12:15,126 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:12:15,126 INFO L371 AbstractCegarLoop]: === Iteration 51 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:12:15,127 INFO L82 PathProgramCache]: Analyzing trace with hash 195535773, now seen corresponding path program 1 times [2018-02-04 13:12:15,127 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:12:15,127 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:12:15,127 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:12:15,127 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:12:15,127 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:12:15,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:12:15,133 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:12:15,535 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:12:15,535 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:12:15,535 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-02-04 13:12:15,536 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 13:12:15,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 13:12:15,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-02-04 13:12:15,536 INFO L87 Difference]: Start difference. First operand 239 states and 263 transitions. Second operand 21 states. [2018-02-04 13:12:16,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:12:16,103 INFO L93 Difference]: Finished difference Result 268 states and 292 transitions. [2018-02-04 13:12:16,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 13:12:16,104 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 58 [2018-02-04 13:12:16,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:12:16,104 INFO L225 Difference]: With dead ends: 268 [2018-02-04 13:12:16,104 INFO L226 Difference]: Without dead ends: 259 [2018-02-04 13:12:16,105 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=185, Invalid=1297, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 13:12:16,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-02-04 13:12:16,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 244. [2018-02-04 13:12:16,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-02-04 13:12:16,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 266 transitions. [2018-02-04 13:12:16,108 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 266 transitions. Word has length 58 [2018-02-04 13:12:16,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:12:16,108 INFO L432 AbstractCegarLoop]: Abstraction has 244 states and 266 transitions. [2018-02-04 13:12:16,108 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 13:12:16,108 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 266 transitions. [2018-02-04 13:12:16,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-04 13:12:16,108 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:12:16,108 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:12:16,108 INFO L371 AbstractCegarLoop]: === Iteration 52 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:12:16,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1730490531, now seen corresponding path program 1 times [2018-02-04 13:12:16,109 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:12:16,109 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:12:16,109 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:12:16,109 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:12:16,109 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:12:16,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:12:16,115 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:12:16,218 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 13:12:16,218 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:12:16,218 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:12:16,225 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:12:16,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:12:16,255 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:12:16,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 13:12:16,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-02-04 13:12:16,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:16,308 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:12:16,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:12:16,311 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2018-02-04 13:12:16,313 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:12:16,314 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:12:16,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-02-04 13:12:16,314 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:16,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:12:16,317 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2018-02-04 13:12:16,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 13:12:16,360 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:16,366 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 13:12:16,366 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:20 [2018-02-04 13:12:16,409 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 24 treesize of output 18 [2018-02-04 13:12:16,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 18 treesize of output 9 [2018-02-04 13:12:16,411 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:16,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:12:16,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:12:16,420 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:14 [2018-02-04 13:12:16,423 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:12:16,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 13:12:16,424 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:16,431 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 13:12:16,431 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:15 [2018-02-04 13:12:16,461 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:12:16,495 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:12:16,495 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15] total 17 [2018-02-04 13:12:16,496 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 13:12:16,496 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 13:12:16,496 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-02-04 13:12:16,496 INFO L87 Difference]: Start difference. First operand 244 states and 266 transitions. Second operand 18 states. [2018-02-04 13:12:16,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:12:16,907 INFO L93 Difference]: Finished difference Result 274 states and 297 transitions. [2018-02-04 13:12:16,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 13:12:16,908 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 66 [2018-02-04 13:12:16,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:12:16,908 INFO L225 Difference]: With dead ends: 274 [2018-02-04 13:12:16,909 INFO L226 Difference]: Without dead ends: 265 [2018-02-04 13:12:16,909 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 56 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=150, Invalid=780, Unknown=0, NotChecked=0, Total=930 [2018-02-04 13:12:16,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-02-04 13:12:16,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 184. [2018-02-04 13:12:16,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-02-04 13:12:16,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 198 transitions. [2018-02-04 13:12:16,911 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 198 transitions. Word has length 66 [2018-02-04 13:12:16,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:12:16,912 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 198 transitions. [2018-02-04 13:12:16,912 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 13:12:16,912 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 198 transitions. [2018-02-04 13:12:16,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-04 13:12:16,913 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:12:16,913 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:12:16,913 INFO L371 AbstractCegarLoop]: === Iteration 53 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:12:16,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1492741583, now seen corresponding path program 1 times [2018-02-04 13:12:16,913 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:12:16,913 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:12:16,914 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:12:16,914 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:12:16,914 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:12:16,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:12:16,923 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:12:17,671 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:12:17,671 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:12:17,671 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2018-02-04 13:12:17,671 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 13:12:17,672 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 13:12:17,672 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2018-02-04 13:12:17,672 INFO L87 Difference]: Start difference. First operand 184 states and 198 transitions. Second operand 26 states. [2018-02-04 13:12:18,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:12:18,781 INFO L93 Difference]: Finished difference Result 212 states and 230 transitions. [2018-02-04 13:12:18,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 13:12:18,781 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 61 [2018-02-04 13:12:18,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:12:18,783 INFO L225 Difference]: With dead ends: 212 [2018-02-04 13:12:18,783 INFO L226 Difference]: Without dead ends: 207 [2018-02-04 13:12:18,783 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 698 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=279, Invalid=2583, Unknown=0, NotChecked=0, Total=2862 [2018-02-04 13:12:18,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-02-04 13:12:18,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 191. [2018-02-04 13:12:18,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-02-04 13:12:18,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 206 transitions. [2018-02-04 13:12:18,788 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 206 transitions. Word has length 61 [2018-02-04 13:12:18,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:12:18,788 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 206 transitions. [2018-02-04 13:12:18,788 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 13:12:18,788 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 206 transitions. [2018-02-04 13:12:18,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-04 13:12:18,789 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:12:18,789 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:12:18,789 INFO L371 AbstractCegarLoop]: === Iteration 54 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:12:18,789 INFO L82 PathProgramCache]: Analyzing trace with hash -722214450, now seen corresponding path program 1 times [2018-02-04 13:12:18,789 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:12:18,789 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:12:18,790 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:12:18,790 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:12:18,790 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:12:18,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:12:18,798 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:12:18,854 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:12:18,854 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:12:18,854 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:12:18,866 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:12:18,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:12:18,896 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:12:18,905 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:12:18,936 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:12:18,936 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-02-04 13:12:18,936 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 13:12:18,937 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 13:12:18,937 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-02-04 13:12:18,937 INFO L87 Difference]: Start difference. First operand 191 states and 206 transitions. Second operand 8 states. [2018-02-04 13:12:18,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:12:18,970 INFO L93 Difference]: Finished difference Result 203 states and 218 transitions. [2018-02-04 13:12:18,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 13:12:18,970 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2018-02-04 13:12:18,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:12:18,971 INFO L225 Difference]: With dead ends: 203 [2018-02-04 13:12:18,971 INFO L226 Difference]: Without dead ends: 203 [2018-02-04 13:12:18,971 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-02-04 13:12:18,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-02-04 13:12:18,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 198. [2018-02-04 13:12:18,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-02-04 13:12:18,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 213 transitions. [2018-02-04 13:12:18,976 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 213 transitions. Word has length 61 [2018-02-04 13:12:18,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:12:18,976 INFO L432 AbstractCegarLoop]: Abstraction has 198 states and 213 transitions. [2018-02-04 13:12:18,976 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 13:12:18,976 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 213 transitions. [2018-02-04 13:12:18,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-04 13:12:18,977 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:12:18,977 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:12:18,977 INFO L371 AbstractCegarLoop]: === Iteration 55 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:12:18,977 INFO L82 PathProgramCache]: Analyzing trace with hash 823786890, now seen corresponding path program 1 times [2018-02-04 13:12:18,977 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:12:18,977 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:12:18,978 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:12:18,978 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:12:18,978 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:12:18,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:12:18,990 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:12:19,580 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:12:19,580 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:12:19,580 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:12:19,585 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:12:19,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:12:19,609 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:12:19,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 13:12:19,626 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 13:12:19,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:19,627 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:12:19,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 13:12:19,632 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 13:12:19,632 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:19,633 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:12:19,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:12:19,636 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-02-04 13:12:19,771 WARN L1033 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base Int) (create_data_~data~0.offset Int)) (let ((.cse0 (+ create_data_~data~0.offset 4))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| create_data_~data~0.base (store (store (select |c_old(#memory_$Pointer$.base)| create_data_~data~0.base) .cse0 0) create_data_~data~0.offset (select (select |c_#memory_$Pointer$.base| create_data_~data~0.base) create_data_~data~0.offset)))) (= (store |c_old(#memory_$Pointer$.offset)| create_data_~data~0.base (store (store (select |c_old(#memory_$Pointer$.offset)| create_data_~data~0.base) .cse0 0) create_data_~data~0.offset (select (select |c_#memory_$Pointer$.offset| create_data_~data~0.base) create_data_~data~0.offset))) |c_#memory_$Pointer$.offset|) (= 0 (select |c_old(#valid)| create_data_~data~0.base))))) is different from true [2018-02-04 13:12:19,777 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:12:19,778 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:12:19,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 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 13:12:19,779 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:19,796 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 13:12:19,796 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:120, output treesize:114 [2018-02-04 13:12:23,893 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:12:23,901 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:12:23,943 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:12:23,947 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:12:23,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-02-04 13:12:23,991 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:136, output treesize:204 [2018-02-04 13:12:26,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 183 treesize of output 112 [2018-02-04 13:12:27,210 WARN L143 SmtUtils]: Spent 922ms on a formula simplification that was a NOOP. DAG size: 98 [2018-02-04 13:12:27,216 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 81 treesize of output 80 [2018-02-04 13:12:27,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:27,217 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 13:12:27,217 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:27,533 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:12:27,533 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 72 treesize of output 79 [2018-02-04 13:12:27,534 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:27,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 66 [2018-02-04 13:12:27,794 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-02-04 13:12:27,798 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:12:27,800 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 16 treesize of output 23 [2018-02-04 13:12:27,800 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:27,806 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:12:27,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 56 [2018-02-04 13:12:27,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2018-02-04 13:12:27,835 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:27,855 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 42 treesize of output 39 [2018-02-04 13:12:27,858 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:12:27,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2018-02-04 13:12:27,861 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:27,870 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:12:27,877 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:12:27,887 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:12:28,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 72 treesize of output 76 [2018-02-04 13:12:28,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 66 [2018-02-04 13:12:28,088 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:12:28,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 53 [2018-02-04 13:12:28,099 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-02-04 13:12:28,176 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 13:12:28,475 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 65 [2018-02-04 13:12:28,484 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:12:28,487 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 16 treesize of output 23 [2018-02-04 13:12:28,487 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:28,513 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:12:28,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 73 [2018-02-04 13:12:28,857 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 64 treesize of output 65 [2018-02-04 13:12:28,858 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:28,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 52 [2018-02-04 13:12:28,964 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:29,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 42 [2018-02-04 13:12:29,063 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:12:29,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2018-02-04 13:12:29,066 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:29,080 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:12:29,173 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:12:29,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 63 [2018-02-04 13:12:29,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2018-02-04 13:12:29,192 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:29,225 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 13:12:29,284 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 13:12:29,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 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 13:12:29,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-02-04 13:12:29,484 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:29,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 74 [2018-02-04 13:12:29,540 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 13:12:29,541 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:29,678 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:12:29,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 52 [2018-02-04 13:12:29,681 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:29,783 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 46 treesize of output 45 [2018-02-04 13:12:29,784 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:29,852 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:12:29,853 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:12:29,854 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:12:29,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 60 [2018-02-04 13:12:29,860 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:29,911 INFO L267 ElimStorePlain]: Start of recursive call 27: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 13:12:29,949 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-02-04 13:12:29,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 56 [2018-02-04 13:12:29,965 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 25 treesize of output 30 [2018-02-04 13:12:29,965 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:30,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 78 [2018-02-04 13:12:30,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 64 [2018-02-04 13:12:30,021 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:30,251 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 54 treesize of output 53 [2018-02-04 13:12:30,251 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:30,290 INFO L267 ElimStorePlain]: Start of recursive call 34: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 13:12:30,321 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 13:12:30,427 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-02-04 13:12:30,570 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-02-04 13:12:30,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 183 treesize of output 112 [2018-02-04 13:12:31,503 WARN L143 SmtUtils]: Spent 853ms on a formula simplification that was a NOOP. DAG size: 98 [2018-02-04 13:12:31,506 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 81 treesize of output 80 [2018-02-04 13:12:31,506 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:31,507 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 13:12:31,507 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:31,637 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:12:31,638 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 72 treesize of output 79 [2018-02-04 13:12:31,664 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:31,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 66 [2018-02-04 13:12:31,803 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-02-04 13:12:31,805 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:12:31,806 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 16 treesize of output 23 [2018-02-04 13:12:31,807 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:31,811 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:12:31,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 56 [2018-02-04 13:12:31,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2018-02-04 13:12:31,838 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:31,850 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 42 treesize of output 39 [2018-02-04 13:12:31,852 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:12:31,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2018-02-04 13:12:31,860 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:31,866 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:12:31,871 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:12:31,877 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:12:31,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 72 treesize of output 76 [2018-02-04 13:12:31,956 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 69 [2018-02-04 13:12:31,959 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:12:31,960 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 16 treesize of output 23 [2018-02-04 13:12:31,960 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:31,970 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:12:32,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 62 [2018-02-04 13:12:32,040 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:12:32,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 53 [2018-02-04 13:12:32,046 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 2 xjuncts. [2018-02-04 13:12:32,079 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 13:12:32,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 73 [2018-02-04 13:12:32,195 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 64 treesize of output 65 [2018-02-04 13:12:32,195 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:32,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 52 [2018-02-04 13:12:32,257 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:32,305 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:12:32,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 74 [2018-02-04 13:12:32,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 61 [2018-02-04 13:12:32,321 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:32,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2018-02-04 13:12:32,347 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:32,363 INFO L267 ElimStorePlain]: Start of recursive call 56: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 13:12:32,406 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:12:32,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 73 [2018-02-04 13:12:32,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 62 [2018-02-04 13:12:32,417 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:32,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2018-02-04 13:12:32,443 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:32,460 INFO L267 ElimStorePlain]: Start of recursive call 59: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 13:12:32,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 42 [2018-02-04 13:12:32,506 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:12:32,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2018-02-04 13:12:32,507 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:32,514 INFO L267 ElimStorePlain]: Start of recursive call 62: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:12:32,538 INFO L267 ElimStorePlain]: Start of recursive call 53: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-02-04 13:12:32,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 56 [2018-02-04 13:12:32,629 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 25 treesize of output 30 [2018-02-04 13:12:32,629 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:32,645 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:12:32,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 85 [2018-02-04 13:12:32,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 73 [2018-02-04 13:12:32,664 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:32,797 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:12:32,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 51 treesize of output 96 [2018-02-04 13:12:32,812 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 6 xjuncts. [2018-02-04 13:12:32,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 56 [2018-02-04 13:12:32,901 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:32,952 INFO L267 ElimStorePlain]: Start of recursive call 66: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-02-04 13:12:32,996 INFO L267 ElimStorePlain]: Start of recursive call 64: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-02-04 13:12:33,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 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 13:12:33,003 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 19 treesize of output 22 [2018-02-04 13:12:33,003 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:33,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 74 [2018-02-04 13:12:33,034 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:12:33,035 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:12:33,035 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:12:33,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 68 [2018-02-04 13:12:33,038 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:33,137 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:12:33,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 52 [2018-02-04 13:12:33,139 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:33,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 46 treesize of output 45 [2018-02-04 13:12:33,235 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:33,261 INFO L267 ElimStorePlain]: Start of recursive call 72: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 13:12:33,283 INFO L267 ElimStorePlain]: Start of recursive call 70: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-02-04 13:12:33,387 INFO L267 ElimStorePlain]: Start of recursive call 48: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-02-04 13:12:33,490 INFO L267 ElimStorePlain]: Start of recursive call 37: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-02-04 13:12:33,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: 18 dim-0 vars, and 11 xjuncts. [2018-02-04 13:12:33,560 INFO L202 ElimStorePlain]: Needed 75 recursive calls to eliminate 9 variables, input treesize:376, output treesize:713 [2018-02-04 13:12:34,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 111 treesize of output 110 [2018-02-04 13:12:34,285 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:34,324 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 92 treesize of output 91 [2018-02-04 13:12:34,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:34,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-02-04 13:12:34,353 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:307, output treesize:202 [2018-02-04 13:12:34,453 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:12:34,454 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:12:34,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 125 [2018-02-04 13:12:34,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:34,458 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:12:34,459 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:12:34,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 106 [2018-02-04 13:12:34,460 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:34,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 115 [2018-02-04 13:12:34,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 69 [2018-02-04 13:12:34,528 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:12:34,544 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:12:34,588 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:12:34,589 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:12:34,591 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:12:34,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 129 [2018-02-04 13:12:34,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 86 [2018-02-04 13:12:34,595 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:34,609 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:12:34,644 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:12:34,644 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:12:34,646 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:12:34,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 119 [2018-02-04 13:12:34,650 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 97 treesize of output 85 [2018-02-04 13:12:34,651 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:34,659 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:12:34,688 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:12:34,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 101 [2018-02-04 13:12:34,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 63 [2018-02-04 13:12:34,694 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:34,707 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:12:34,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 13:12:34,729 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:244, output treesize:193 [2018-02-04 13:12:34,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 91 [2018-02-04 13:12:34,843 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 11 treesize of output 1 [2018-02-04 13:12:34,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:34,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 19 [2018-02-04 13:12:34,857 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:34,866 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 7 treesize of output 1 [2018-02-04 13:12:34,866 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:34,873 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:12:34,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2018-02-04 13:12:34,897 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 7 treesize of output 1 [2018-02-04 13:12:34,897 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:34,904 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 13 treesize of output 5 [2018-02-04 13:12:34,905 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:34,911 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 11 treesize of output 3 [2018-02-04 13:12:34,911 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:34,915 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:12:34,932 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 107 treesize of output 79 [2018-02-04 13:12:34,933 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:12:34,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 40 [2018-02-04 13:12:34,934 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:34,941 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 11 treesize of output 3 [2018-02-04 13:12:34,941 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:34,947 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:12:34,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-02-04 13:12:34,972 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 13 treesize of output 5 [2018-02-04 13:12:34,972 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:34,979 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 11 treesize of output 3 [2018-02-04 13:12:34,979 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-02-04 13:12:34,983 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:12:34,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 13:12:34,992 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 10 variables, input treesize:219, output treesize:11 [2018-02-04 13:12:35,053 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:12:35,070 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:12:35,070 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 26] total 42 [2018-02-04 13:12:35,071 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-04 13:12:35,071 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-04 13:12:35,071 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1474, Unknown=32, NotChecked=78, Total=1722 [2018-02-04 13:12:35,071 INFO L87 Difference]: Start difference. First operand 198 states and 213 transitions. Second operand 42 states. [2018-02-04 13:12:48,219 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 79 DAG size of output 67 [2018-02-04 13:12:51,653 WARN L146 SmtUtils]: Spent 976ms on a formula simplification. DAG size of input: 63 DAG size of output 56 [2018-02-04 13:12:52,712 WARN L146 SmtUtils]: Spent 974ms on a formula simplification. DAG size of input: 65 DAG size of output 58 [2018-02-04 13:12:53,829 WARN L146 SmtUtils]: Spent 978ms on a formula simplification. DAG size of input: 77 DAG size of output 60 [2018-02-04 13:12:56,955 WARN L146 SmtUtils]: Spent 991ms on a formula simplification. DAG size of input: 91 DAG size of output 66 [2018-02-04 13:12:58,117 WARN L146 SmtUtils]: Spent 1061ms on a formula simplification. DAG size of input: 84 DAG size of output 62 [2018-02-04 13:12:59,405 WARN L146 SmtUtils]: Spent 964ms on a formula simplification. DAG size of input: 86 DAG size of output 66 [2018-02-04 13:13:00,487 WARN L146 SmtUtils]: Spent 1036ms on a formula simplification. DAG size of input: 89 DAG size of output 70 [2018-02-04 13:13:01,662 WARN L146 SmtUtils]: Spent 1144ms on a formula simplification. DAG size of input: 84 DAG size of output 65 [2018-02-04 13:13:02,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:13:02,666 INFO L93 Difference]: Finished difference Result 245 states and 266 transitions. [2018-02-04 13:13:02,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 13:13:02,667 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 64 [2018-02-04 13:13:02,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:13:02,668 INFO L225 Difference]: With dead ends: 245 [2018-02-04 13:13:02,669 INFO L226 Difference]: Without dead ends: 242 [2018-02-04 13:13:02,669 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 46 SyntacticMatches, 6 SemanticMatches, 67 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1222 ImplicationChecksByTransitivity, 21.2s TimeCoverageRelationStatistics Valid=386, Invalid=4132, Unknown=42, NotChecked=132, Total=4692 [2018-02-04 13:13:02,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-02-04 13:13:02,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 226. [2018-02-04 13:13:02,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-02-04 13:13:02,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 242 transitions. [2018-02-04 13:13:02,675 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 242 transitions. Word has length 64 [2018-02-04 13:13:02,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:13:02,675 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 242 transitions. [2018-02-04 13:13:02,675 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-04 13:13:02,675 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 242 transitions. [2018-02-04 13:13:02,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-04 13:13:02,676 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:13:02,676 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:13:02,676 INFO L371 AbstractCegarLoop]: === Iteration 56 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:13:02,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1226100465, now seen corresponding path program 1 times [2018-02-04 13:13:02,677 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:13:02,677 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:13:02,677 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:13:02,677 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:13:02,677 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:13:02,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:13:02,692 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:13:03,453 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:13:03,453 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:13:03,453 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:13:03,458 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:13:03,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:13:03,483 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:13:03,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 13:13:03,609 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 13:13:03,609 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:13:03,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:13:03,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 13:13:03,616 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 13:13:03,617 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:13:03,618 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:13:03,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:13:03,621 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26 [2018-02-04 13:13:04,061 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:13:04,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-04 13:13:04,066 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:13:04,126 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:13:04,128 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:13:04,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-02-04 13:13:04,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:13:04,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 48 [2018-02-04 13:13:04,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 18 [2018-02-04 13:13:04,196 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 18 treesize of output 19 [2018-02-04 13:13:04,196 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 13:13:04,200 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:13:04,213 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:13:04,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 42 [2018-02-04 13:13:04,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-02-04 13:13:04,216 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 13:13:04,223 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:13:04,230 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:13:04,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 47 [2018-02-04 13:13:04,236 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:13:04,237 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2018-02-04 13:13:04,240 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 41 treesize of output 42 [2018-02-04 13:13:04,240 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 13:13:04,247 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:13:04,258 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 36 treesize of output 27 [2018-02-04 13:13:04,260 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:13:04,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2018-02-04 13:13:04,262 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 13:13:04,266 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:13:04,273 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:13:04,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 38 [2018-02-04 13:13:04,313 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-02-04 13:13:04,316 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 18 treesize of output 19 [2018-02-04 13:13:04,316 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-02-04 13:13:04,319 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:13:04,327 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:13:04,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 37 treesize of output 34 [2018-02-04 13:13:04,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-02-04 13:13:04,330 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-02-04 13:13:04,333 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:13:04,338 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:13:04,341 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2018-02-04 13:13:04,343 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:13:04,343 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-02-04 13:13:04,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2018-02-04 13:13:04,347 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-02-04 13:13:04,352 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:13:04,359 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 26 treesize of output 19 [2018-02-04 13:13:04,361 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:13:04,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2018-02-04 13:13:04,363 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-02-04 13:13:04,366 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:13:04,370 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:13:04,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-02-04 13:13:04,393 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 7 variables, input treesize:126, output treesize:286 [2018-02-04 13:13:04,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 13:13:04,736 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:13:04,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:13:04,752 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:127, output treesize:119 [2018-02-04 13:13:04,803 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:13:04,804 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:13:04,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-02-04 13:13:04,805 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:13:04,821 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:13:04,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 77 treesize of output 93 [2018-02-04 13:13:04,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 114 [2018-02-04 13:13:04,824 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:13:04,831 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:13:04,844 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:13:04,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 118 [2018-02-04 13:13:04,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 90 [2018-02-04 13:13:04,848 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:13:04,856 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:13:04,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:13:04,865 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:140, output treesize:79 [2018-02-04 13:13:04,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2018-02-04 13:13:04,922 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 19 treesize of output 11 [2018-02-04 13:13:04,922 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:13:04,928 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:13:04,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-02-04 13:13:04,929 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:13:04,932 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:13:04,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2018-02-04 13:13:04,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-02-04 13:13:04,943 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 13:13:04,947 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:13:04,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2018-02-04 13:13:04,947 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 13:13:04,949 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:13:04,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:13:04,955 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:90, output treesize:22 [2018-02-04 13:13:05,011 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:13:05,028 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:13:05,028 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 27] total 46 [2018-02-04 13:13:05,029 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-02-04 13:13:05,029 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-02-04 13:13:05,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1955, Unknown=9, NotChecked=0, Total=2162 [2018-02-04 13:13:05,029 INFO L87 Difference]: Start difference. First operand 226 states and 242 transitions. Second operand 47 states. [2018-02-04 13:13:05,595 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 97 DAG size of output 83 [2018-02-04 13:13:07,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:13:07,511 INFO L93 Difference]: Finished difference Result 295 states and 325 transitions. [2018-02-04 13:13:07,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 13:13:07,511 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 71 [2018-02-04 13:13:07,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:13:07,512 INFO L225 Difference]: With dead ends: 295 [2018-02-04 13:13:07,512 INFO L226 Difference]: Without dead ends: 295 [2018-02-04 13:13:07,512 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 46 SyntacticMatches, 8 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1817 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=587, Invalid=5406, Unknown=13, NotChecked=0, Total=6006 [2018-02-04 13:13:07,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-02-04 13:13:07,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 253. [2018-02-04 13:13:07,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-02-04 13:13:07,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 274 transitions. [2018-02-04 13:13:07,515 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 274 transitions. Word has length 71 [2018-02-04 13:13:07,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:13:07,515 INFO L432 AbstractCegarLoop]: Abstraction has 253 states and 274 transitions. [2018-02-04 13:13:07,515 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-02-04 13:13:07,516 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 274 transitions. [2018-02-04 13:13:07,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-04 13:13:07,516 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:13:07,516 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:13:07,516 INFO L371 AbstractCegarLoop]: === Iteration 57 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:13:07,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1384233511, now seen corresponding path program 1 times [2018-02-04 13:13:07,517 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:13:07,517 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:13:07,517 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:13:07,517 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:13:07,518 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:13:07,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:13:07,531 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:13:08,481 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:13:08,481 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:13:08,481 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:13:08,486 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:13:08,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:13:08,511 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:13:08,696 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 11 treesize of output 8 [2018-02-04 13:13:08,698 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 13:13:08,699 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:13:08,700 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:13:08,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:13:08,710 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:41 [2018-02-04 13:13:08,769 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 47 [2018-02-04 13:13:08,780 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:13:08,794 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 43 [2018-02-04 13:13:08,794 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 13:13:08,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 34 treesize of output 33 [2018-02-04 13:13:08,821 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:13:08,837 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 13:13:08,852 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 2 xjuncts. [2018-02-04 13:13:08,853 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:46, output treesize:97 [2018-02-04 13:13:09,064 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:13:09,065 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:13:09,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 43 [2018-02-04 13:13:09,074 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:13:09,075 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:13:09,075 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:13:09,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2018-02-04 13:13:09,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:13:09,079 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:13:09,082 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 13:13:09,082 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:40 [2018-02-04 13:13:09,551 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:13:09,553 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:13:09,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 125 treesize of output 112 [2018-02-04 13:13:09,585 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 97 [2018-02-04 13:13:09,586 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 13:13:09,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 80 [2018-02-04 13:13:09,638 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-02-04 13:13:09,698 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 77 [2018-02-04 13:13:09,699 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-02-04 13:13:09,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 63 [2018-02-04 13:13:09,785 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-02-04 13:13:09,897 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 58 treesize of output 40 [2018-02-04 13:13:09,897 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 13:13:09,898 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 73 treesize of output 55 [2018-02-04 13:13:09,898 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 13:13:10,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 63 [2018-02-04 13:13:10,006 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 13:13:10,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 48 [2018-02-04 13:13:10,007 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 13:13:10,102 INFO L267 ElimStorePlain]: Start of recursive call 2: 6 dim-1 vars, End of recursive call: 9 dim-0 vars, and 6 xjuncts. [2018-02-04 13:13:10,198 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 47 treesize of output 45 [2018-02-04 13:13:10,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 13:13:10,200 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-04 13:13:10,205 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:13:10,206 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 55 treesize of output 51 [2018-02-04 13:13:10,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-02-04 13:13:10,208 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-02-04 13:13:10,214 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:13:10,215 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 62 treesize of output 58 [2018-02-04 13:13:10,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-02-04 13:13:10,217 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-02-04 13:13:10,225 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:13:10,226 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 47 treesize of output 45 [2018-02-04 13:13:10,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 13:13:10,227 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-02-04 13:13:10,233 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:13:10,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 66 treesize of output 62 [2018-02-04 13:13:10,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-02-04 13:13:10,236 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-02-04 13:13:10,245 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:13:10,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 70 treesize of output 64 [2018-02-04 13:13:10,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 18 treesize of output 9 [2018-02-04 13:13:10,248 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-02-04 13:13:10,256 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:13:10,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 9 dim-0 vars, and 6 xjuncts. [2018-02-04 13:13:10,355 INFO L202 ElimStorePlain]: Needed 22 recursive calls to eliminate 2 variables, input treesize:137, output treesize:316 [2018-02-04 13:13:10,672 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~mem25.base| Int) (|main_~#list~0.base| Int) (v_prenex_67 Int)) (let ((.cse1 (store |c_old(#valid)| |main_~#list~0.base| 1))) (let ((.cse0 (store .cse1 |main_#t~mem25.base| 1))) (and (= |c_#valid| (store (store (store .cse0 v_prenex_67 0) |main_#t~mem25.base| 0) |main_~#list~0.base| 0)) (= 0 (select |c_old(#valid)| |main_~#list~0.base|)) (not (= 0 |main_#t~mem25.base|)) (= 0 (select .cse0 v_prenex_67)) (not (= 0 v_prenex_67)) (= 0 (select .cse1 |main_#t~mem25.base|)))))) is different from true [2018-02-04 13:13:10,692 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:13:10,708 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:13:10,709 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 49 [2018-02-04 13:13:10,709 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-04 13:13:10,709 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-04 13:13:10,709 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2191, Unknown=6, NotChecked=94, Total=2450 [2018-02-04 13:13:10,709 INFO L87 Difference]: Start difference. First operand 253 states and 274 transitions. Second operand 50 states. [2018-02-04 13:13:11,461 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 83 DAG size of output 73 [2018-02-04 13:13:13,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:13:13,164 INFO L93 Difference]: Finished difference Result 263 states and 286 transitions. [2018-02-04 13:13:13,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 13:13:13,164 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 66 [2018-02-04 13:13:13,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:13:13,165 INFO L225 Difference]: With dead ends: 263 [2018-02-04 13:13:13,165 INFO L226 Difference]: Without dead ends: 232 [2018-02-04 13:13:13,165 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 47 SyntacticMatches, 7 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1098 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=293, Invalid=4396, Unknown=7, NotChecked=134, Total=4830 [2018-02-04 13:13:13,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-02-04 13:13:13,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 226. [2018-02-04 13:13:13,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-02-04 13:13:13,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 246 transitions. [2018-02-04 13:13:13,169 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 246 transitions. Word has length 66 [2018-02-04 13:13:13,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:13:13,169 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 246 transitions. [2018-02-04 13:13:13,169 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-04 13:13:13,169 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 246 transitions. [2018-02-04 13:13:13,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-04 13:13:13,170 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:13:13,170 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:13:13,170 INFO L371 AbstractCegarLoop]: === Iteration 58 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:13:13,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1460521485, now seen corresponding path program 1 times [2018-02-04 13:13:13,171 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:13:13,171 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:13:13,171 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:13:13,171 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:13:13,171 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:13:13,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:13:13,180 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:13:13,537 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:13:13,538 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:13:13,538 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:13:13,543 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:13:13,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:13:13,566 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:13:13,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 13:13:13,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-02-04 13:13:13,595 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:13:13,596 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:13:13,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:13:13,598 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2018-02-04 13:13:13,717 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|append_#t~ret17.base| Int) (append_~node~0.base Int)) (and (not (= append_~node~0.base 0)) (= (let ((.cse0 (store |c_old(#memory_$Pointer$.base)| append_~node~0.base (store (store (select |c_old(#memory_$Pointer$.base)| append_~node~0.base) 4 (select (select |c_old(#memory_$Pointer$.base)| |c_append_#in~pointerToList.base|) |c_append_#in~pointerToList.offset|)) 0 |append_#t~ret17.base|)))) (store .cse0 |c_append_#in~pointerToList.base| (store (select .cse0 |c_append_#in~pointerToList.base|) |c_append_#in~pointerToList.offset| append_~node~0.base))) |c_#memory_$Pointer$.base|))) is different from true [2018-02-04 13:13:13,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 39 [2018-02-04 13:13:13,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 18 [2018-02-04 13:13:13,739 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 18 treesize of output 19 [2018-02-04 13:13:13,739 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:13:13,742 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:13:13,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 38 treesize of output 35 [2018-02-04 13:13:13,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2018-02-04 13:13:13,751 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 13:13:13,754 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:13:13,757 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:13:13,760 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2018-02-04 13:13:13,761 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:13:13,761 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2018-02-04 13:13:13,763 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 34 treesize of output 37 [2018-02-04 13:13:13,764 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 13:13:13,768 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:13:13,773 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 27 treesize of output 20 [2018-02-04 13:13:13,774 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:13:13,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 20 [2018-02-04 13:13:13,776 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 13:13:13,778 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:13:13,781 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:13:13,790 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 13:13:13,790 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:57, output treesize:52 [2018-02-04 13:13:17,962 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 25 treesize of output 21 [2018-02-04 13:13:17,963 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 21 treesize of output 13 [2018-02-04 13:13:17,963 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:13:17,964 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:13:17,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:13:17,969 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:55, output treesize:44 [2018-02-04 13:13:17,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 13:13:17,993 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:13:17,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:13:17,998 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:44 [2018-02-04 13:13:18,023 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:13:18,023 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:13:18,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-02-04 13:13:18,024 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:13:18,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 38 [2018-02-04 13:13:18,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2018-02-04 13:13:18,036 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:13:18,040 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:13:18,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:13:18,044 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:57, output treesize:31 [2018-02-04 13:13:18,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-02-04 13:13:18,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2018-02-04 13:13:18,073 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:13:18,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-02-04 13:13:18,076 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:13:18,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:13:18,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:13:18,079 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:35, output treesize:4 [2018-02-04 13:13:18,088 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-02-04 13:13:18,105 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:13:18,105 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 25] total 37 [2018-02-04 13:13:18,105 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 13:13:18,105 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 13:13:18,105 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1110, Unknown=9, NotChecked=68, Total=1332 [2018-02-04 13:13:18,105 INFO L87 Difference]: Start difference. First operand 226 states and 246 transitions. Second operand 37 states. [2018-02-04 13:14:19,254 WARN L143 SmtUtils]: Spent 193ms on a formula simplification that was a NOOP. DAG size: 23 [2018-02-04 13:14:19,592 WARN L143 SmtUtils]: Spent 204ms on a formula simplification that was a NOOP. DAG size: 37 [2018-02-04 13:14:23,732 WARN L143 SmtUtils]: Spent 2010ms on a formula simplification that was a NOOP. DAG size: 41 [2018-02-04 13:14:34,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:14:34,190 INFO L93 Difference]: Finished difference Result 283 states and 314 transitions. [2018-02-04 13:14:34,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 13:14:34,191 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 73 [2018-02-04 13:14:34,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:14:34,191 INFO L225 Difference]: With dead ends: 283 [2018-02-04 13:14:34,191 INFO L226 Difference]: Without dead ends: 283 [2018-02-04 13:14:34,192 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 57 SyntacticMatches, 8 SemanticMatches, 67 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1216 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=516, Invalid=4015, Unknown=29, NotChecked=132, Total=4692 [2018-02-04 13:14:34,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-02-04 13:14:34,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 234. [2018-02-04 13:14:34,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-02-04 13:14:34,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 253 transitions. [2018-02-04 13:14:34,195 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 253 transitions. Word has length 73 [2018-02-04 13:14:34,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:14:34,195 INFO L432 AbstractCegarLoop]: Abstraction has 234 states and 253 transitions. [2018-02-04 13:14:34,195 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 13:14:34,195 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 253 transitions. [2018-02-04 13:14:34,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-04 13:14:34,196 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:14:34,196 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:14:34,196 INFO L371 AbstractCegarLoop]: === Iteration 59 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:14:34,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1937872819, now seen corresponding path program 1 times [2018-02-04 13:14:34,197 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:14:34,197 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:14:34,197 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:14:34,197 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:14:34,197 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:14:34,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:14:34,209 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:14:34,768 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:14:34,768 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:14:34,768 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:14:34,773 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:14:34,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:14:34,801 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:14:34,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 13:14:34,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 8 treesize of output 7 [2018-02-04 13:14:34,828 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:14:34,829 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:14:34,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:14:34,830 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-02-04 13:14:34,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 13:14:34,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-02-04 13:14:34,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:14:34,964 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:14:34,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:14:34,969 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:66 [2018-02-04 13:14:35,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2018-02-04 13:14:35,032 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-02-04 13:14:35,034 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 22 treesize of output 27 [2018-02-04 13:14:35,034 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:14:35,037 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:14:35,044 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:14:35,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 45 treesize of output 46 [2018-02-04 13:14:35,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2018-02-04 13:14:35,046 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 13:14:35,050 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:14:35,054 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:14:35,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 47 [2018-02-04 13:14:35,058 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:14:35,059 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2018-02-04 13:14:35,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 45 [2018-02-04 13:14:35,061 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 13:14:35,066 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:14:35,072 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 38 treesize of output 30 [2018-02-04 13:14:35,079 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:14:35,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2018-02-04 13:14:35,081 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 13:14:35,084 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:14:35,088 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:14:35,099 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 13:14:35,099 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:76, output treesize:80 [2018-02-04 13:14:35,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 49 [2018-02-04 13:14:35,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 36 [2018-02-04 13:14:35,277 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:14:35,280 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:14:35,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:14:35,286 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:69, output treesize:46 [2018-02-04 13:14:35,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 6 treesize of output 5 [2018-02-04 13:14:35,316 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:14:35,321 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 13:14:35,322 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:52, output treesize:44 [2018-02-04 13:14:35,357 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:14:35,357 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:14:35,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 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 13:14:35,358 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:14:35,366 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:14:35,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 40 treesize of output 50 [2018-02-04 13:14:35,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 53 [2018-02-04 13:14:35,368 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:14:35,371 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:14:35,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:14:35,376 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:57, output treesize:40 [2018-02-04 13:14:35,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 23 treesize of output 19 [2018-02-04 13:14:35,488 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 19 treesize of output 11 [2018-02-04 13:14:35,488 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:14:35,489 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:14:35,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2018-02-04 13:14:35,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-02-04 13:14:35,498 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:14:35,503 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:14:35,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2018-02-04 13:14:35,504 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 13:14:35,506 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:14:35,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:14:35,510 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:66, output treesize:13 [2018-02-04 13:14:35,545 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:14:35,563 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:14:35,563 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26] total 42 [2018-02-04 13:14:35,563 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-04 13:14:35,563 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-04 13:14:35,563 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1589, Unknown=32, NotChecked=0, Total=1806 [2018-02-04 13:14:35,564 INFO L87 Difference]: Start difference. First operand 234 states and 253 transitions. Second operand 43 states. [2018-02-04 13:14:36,451 WARN L146 SmtUtils]: Spent 478ms on a formula simplification. DAG size of input: 38 DAG size of output 37 [2018-02-04 13:14:36,969 WARN L146 SmtUtils]: Spent 484ms on a formula simplification. DAG size of input: 42 DAG size of output 41 [2018-02-04 13:14:37,506 WARN L146 SmtUtils]: Spent 503ms on a formula simplification. DAG size of input: 47 DAG size of output 46 [2018-02-04 13:14:38,042 WARN L146 SmtUtils]: Spent 506ms on a formula simplification. DAG size of input: 52 DAG size of output 51 [2018-02-04 13:14:38,572 WARN L146 SmtUtils]: Spent 502ms on a formula simplification. DAG size of input: 56 DAG size of output 55 [2018-02-04 13:14:39,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:14:39,734 INFO L93 Difference]: Finished difference Result 272 states and 297 transitions. [2018-02-04 13:14:39,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-04 13:14:39,734 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 74 [2018-02-04 13:14:39,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:14:39,735 INFO L225 Difference]: With dead ends: 272 [2018-02-04 13:14:39,735 INFO L226 Difference]: Without dead ends: 272 [2018-02-04 13:14:39,735 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 54 SyntacticMatches, 7 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1751 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=607, Invalid=5363, Unknown=36, NotChecked=0, Total=6006 [2018-02-04 13:14:39,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-02-04 13:14:39,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 239. [2018-02-04 13:14:39,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-02-04 13:14:39,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 259 transitions. [2018-02-04 13:14:39,738 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 259 transitions. Word has length 74 [2018-02-04 13:14:39,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:14:39,738 INFO L432 AbstractCegarLoop]: Abstraction has 239 states and 259 transitions. [2018-02-04 13:14:39,738 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-02-04 13:14:39,738 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 259 transitions. [2018-02-04 13:14:39,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-02-04 13:14:39,739 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:14:39,739 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:14:39,739 INFO L371 AbstractCegarLoop]: === Iteration 60 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:14:39,739 INFO L82 PathProgramCache]: Analyzing trace with hash 2132843125, now seen corresponding path program 1 times [2018-02-04 13:14:39,739 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:14:39,739 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:14:39,740 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:14:39,740 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:14:39,740 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:14:39,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:14:39,747 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:14:39,802 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 6 proven. 80 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-04 13:14:39,802 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:14:39,802 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:14:39,809 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:14:39,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:14:39,841 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:14:39,847 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 6 proven. 80 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-04 13:14:39,865 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:14:39,865 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-02-04 13:14:39,865 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 13:14:39,865 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 13:14:39,865 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-02-04 13:14:39,865 INFO L87 Difference]: Start difference. First operand 239 states and 259 transitions. Second operand 9 states. [2018-02-04 13:14:39,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:14:39,889 INFO L93 Difference]: Finished difference Result 251 states and 271 transitions. [2018-02-04 13:14:39,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 13:14:39,889 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2018-02-04 13:14:39,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:14:39,890 INFO L225 Difference]: With dead ends: 251 [2018-02-04 13:14:39,890 INFO L226 Difference]: Without dead ends: 251 [2018-02-04 13:14:39,890 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-02-04 13:14:39,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-02-04 13:14:39,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 246. [2018-02-04 13:14:39,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-02-04 13:14:39,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 266 transitions. [2018-02-04 13:14:39,892 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 266 transitions. Word has length 95 [2018-02-04 13:14:39,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:14:39,892 INFO L432 AbstractCegarLoop]: Abstraction has 246 states and 266 transitions. [2018-02-04 13:14:39,893 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 13:14:39,893 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 266 transitions. [2018-02-04 13:14:39,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-04 13:14:39,893 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:14:39,893 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:14:39,893 INFO L371 AbstractCegarLoop]: === Iteration 61 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:14:39,893 INFO L82 PathProgramCache]: Analyzing trace with hash -612890950, now seen corresponding path program 1 times [2018-02-04 13:14:39,893 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:14:39,893 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:14:39,894 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:14:39,894 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:14:39,894 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:14:39,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:14:39,903 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:14:40,991 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:14:40,991 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:14:40,991 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:14:40,996 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:14:41,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:14:41,031 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:14:41,033 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 13:14:41,033 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:14:41,037 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 13:14:41,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:14:41,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:14:41,041 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 13:14:41,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 13:14:41,308 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 13:14:41,308 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:14:41,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:14:41,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 13:14:41,319 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 13:14:41,319 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:14:41,332 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:14:41,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:14:41,340 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:45, output treesize:37 [2018-02-04 13:14:41,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-02-04 13:14:41,406 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 20 treesize of output 19 [2018-02-04 13:14:41,407 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:14:41,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2018-02-04 13:14:41,425 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 13:14:41,436 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 13:14:41,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-02-04 13:14:41,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 20 treesize of output 19 [2018-02-04 13:14:41,462 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 13:14:41,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2018-02-04 13:14:41,481 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-02-04 13:14:41,492 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 13:14:41,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-02-04 13:14:41,511 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:53, output treesize:167 [2018-02-04 13:14:41,597 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:14:41,597 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:14:41,598 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 72 treesize of output 66 [2018-02-04 13:14:41,598 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:14:41,610 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:14:41,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 29 [2018-02-04 13:14:41,611 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:14:41,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:14:41,630 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:117, output treesize:57 [2018-02-04 13:14:42,254 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:14:42,255 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:14:42,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-02-04 13:14:42,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:14:42,315 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:14:42,318 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:14:42,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 50 [2018-02-04 13:14:42,322 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 13:14:42,404 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:14:42,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 77 [2018-02-04 13:14:42,414 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-02-04 13:14:42,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2018-02-04 13:14:42,417 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 13:14:42,421 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:14:42,436 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:14:42,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 71 [2018-02-04 13:14:42,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2018-02-04 13:14:42,445 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 13:14:42,453 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:14:42,461 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:14:42,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 68 [2018-02-04 13:14:42,470 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:14:42,471 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 58 [2018-02-04 13:14:42,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 54 treesize of output 55 [2018-02-04 13:14:42,475 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 13:14:42,481 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:14:42,495 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 49 treesize of output 48 [2018-02-04 13:14:42,497 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:14:42,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2018-02-04 13:14:42,500 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 13:14:42,507 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:14:42,513 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:14:42,566 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 13:14:42,566 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-02-04 13:14:42,569 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:14:42,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 113 [2018-02-04 13:14:42,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-02-04 13:14:42,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2018-02-04 13:14:42,578 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-02-04 13:14:42,581 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:14:42,598 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:14:42,598 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:14:42,600 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:14:42,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 79 [2018-02-04 13:14:42,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2018-02-04 13:14:42,604 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-02-04 13:14:42,612 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:14:42,623 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:14:42,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 101 [2018-02-04 13:14:42,630 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:14:42,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 77 [2018-02-04 13:14:42,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 68 [2018-02-04 13:14:42,634 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-02-04 13:14:42,642 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:14:42,656 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 56 [2018-02-04 13:14:42,658 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:14:42,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 59 [2018-02-04 13:14:42,660 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-02-04 13:14:42,666 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:14:42,676 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:14:42,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 94 [2018-02-04 13:14:42,684 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:14:42,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 77 [2018-02-04 13:14:42,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 68 [2018-02-04 13:14:42,688 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-02-04 13:14:42,697 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:14:42,711 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2018-02-04 13:14:42,713 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:14:42,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 67 [2018-02-04 13:14:42,715 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-02-04 13:14:42,722 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:14:42,730 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:14:42,732 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 13:14:42,732 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-02-04 13:14:42,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 13:14:42,763 INFO L202 ElimStorePlain]: Needed 30 recursive calls to eliminate 7 variables, input treesize:154, output treesize:195 [2018-02-04 13:14:43,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 130 treesize of output 129 [2018-02-04 13:14:43,466 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:14:43,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 152 treesize of output 151 [2018-02-04 13:14:43,468 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:14:43,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 13:14:43,506 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:283, output treesize:281 [2018-02-04 13:14:43,616 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 13:14:43,616 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:14:43,618 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:14:43,618 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:14:43,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 166 [2018-02-04 13:14:43,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:14:43,670 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:14:43,670 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:14:43,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 131 [2018-02-04 13:14:43,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 42 [2018-02-04 13:14:43,679 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:14:43,688 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:14:43,702 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:14:43,703 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:14:43,706 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:14:43,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 130 [2018-02-04 13:14:43,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 105 [2018-02-04 13:14:43,710 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:14:43,721 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:14:43,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:14:43,732 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:323, output treesize:93 [2018-02-04 13:14:43,905 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:14:43,905 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:14:43,906 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:14:43,906 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:14:43,907 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:14:43,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 39 [2018-02-04 13:14:43,907 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:14:43,919 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 13:14:43,920 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:108, output treesize:89 [2018-02-04 13:14:44,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 85 [2018-02-04 13:14:44,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2018-02-04 13:14:44,087 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:14:44,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-02-04 13:14:44,095 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:14:44,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-02-04 13:14:44,101 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:14:44,106 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:14:44,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2018-02-04 13:14:44,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-02-04 13:14:44,119 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 13:14:44,126 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 18 treesize of output 11 [2018-02-04 13:14:44,126 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 13:14:44,129 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-02-04 13:14:44,130 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 13:14:44,130 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:14:44,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:14:44,136 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:121, output treesize:7 [2018-02-04 13:14:44,217 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:14:44,234 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:14:44,235 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 36] total 65 [2018-02-04 13:14:44,235 INFO L409 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-02-04 13:14:44,235 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-02-04 13:14:44,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=3922, Unknown=23, NotChecked=0, Total=4160 [2018-02-04 13:14:44,235 INFO L87 Difference]: Start difference. First operand 246 states and 266 transitions. Second operand 65 states. [2018-02-04 13:14:45,272 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 116 DAG size of output 95 [2018-02-04 13:14:47,812 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 104 DAG size of output 69 [2018-02-04 13:14:48,447 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 96 DAG size of output 68 [2018-02-04 13:14:48,608 WARN L146 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 86 DAG size of output 64 [2018-02-04 13:14:49,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:14:49,892 INFO L93 Difference]: Finished difference Result 321 states and 354 transitions. [2018-02-04 13:14:49,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-02-04 13:14:49,892 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 78 [2018-02-04 13:14:49,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:14:49,893 INFO L225 Difference]: With dead ends: 321 [2018-02-04 13:14:49,893 INFO L226 Difference]: Without dead ends: 321 [2018-02-04 13:14:49,894 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3129 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=712, Invalid=10603, Unknown=27, NotChecked=0, Total=11342 [2018-02-04 13:14:49,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-02-04 13:14:49,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 281. [2018-02-04 13:14:49,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-02-04 13:14:49,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 305 transitions. [2018-02-04 13:14:49,905 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 305 transitions. Word has length 78 [2018-02-04 13:14:49,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:14:49,905 INFO L432 AbstractCegarLoop]: Abstraction has 281 states and 305 transitions. [2018-02-04 13:14:49,905 INFO L433 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-02-04 13:14:49,905 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 305 transitions. [2018-02-04 13:14:49,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-04 13:14:49,906 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:14:49,906 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:14:49,906 INFO L371 AbstractCegarLoop]: === Iteration 62 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:14:49,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1381540371, now seen corresponding path program 1 times [2018-02-04 13:14:49,906 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:14:49,907 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:14:49,907 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:14:49,907 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:14:49,907 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:14:49,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:14:49,935 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-02-04 13:14:51,296 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 13:14:51,300 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 13:14:51,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 01:14:51 BoogieIcfgContainer [2018-02-04 13:14:51,301 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 13:14:51,301 INFO L168 Benchmark]: Toolchain (without parser) took 194346.47 ms. Allocated memory was 402.7 MB in the beginning and 809.5 MB in the end (delta: 406.8 MB). Free memory was 359.5 MB in the beginning and 444.3 MB in the end (delta: -84.8 MB). Peak memory consumption was 322.0 MB. Max. memory is 5.3 GB. [2018-02-04 13:14:51,302 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 402.7 MB. Free memory is still 366.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 13:14:51,302 INFO L168 Benchmark]: CACSL2BoogieTranslator took 161.68 ms. Allocated memory is still 402.7 MB. Free memory was 359.5 MB in the beginning and 349.0 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 13:14:51,302 INFO L168 Benchmark]: Boogie Preprocessor took 26.92 ms. Allocated memory is still 402.7 MB. Free memory was 349.0 MB in the beginning and 347.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 13:14:51,302 INFO L168 Benchmark]: RCFGBuilder took 371.13 ms. Allocated memory is still 402.7 MB. Free memory was 346.3 MB in the beginning and 313.5 MB in the end (delta: 32.8 MB). Peak memory consumption was 32.8 MB. Max. memory is 5.3 GB. [2018-02-04 13:14:51,303 INFO L168 Benchmark]: TraceAbstraction took 193783.92 ms. Allocated memory was 402.7 MB in the beginning and 809.5 MB in the end (delta: 406.8 MB). Free memory was 313.5 MB in the beginning and 444.3 MB in the end (delta: -130.8 MB). Peak memory consumption was 276.0 MB. Max. memory is 5.3 GB. [2018-02-04 13:14:51,303 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.19 ms. Allocated memory is still 402.7 MB. Free memory is still 366.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 161.68 ms. Allocated memory is still 402.7 MB. Free memory was 359.5 MB in the beginning and 349.0 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 26.92 ms. Allocated memory is still 402.7 MB. Free memory was 349.0 MB in the beginning and 347.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 371.13 ms. Allocated memory is still 402.7 MB. Free memory was 346.3 MB in the beginning and 313.5 MB in the end (delta: 32.8 MB). Peak memory consumption was 32.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 193783.92 ms. Allocated memory was 402.7 MB in the beginning and 809.5 MB in the end (delta: 406.8 MB). Free memory was 313.5 MB in the beginning and 444.3 MB in the end (delta: -130.8 MB). Peak memory consumption was 276.0 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 547). Cancelled while BasicCegarLoop was analyzing trace of length 85 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 34 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 85 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 34 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 85 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 34 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was analyzing trace of length 85 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 34 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was analyzing trace of length 85 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 34 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 85 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 34 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 85 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 34 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was analyzing trace of length 85 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 34 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was analyzing trace of length 85 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 34 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was analyzing trace of length 85 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 34 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 562). Cancelled while BasicCegarLoop was analyzing trace of length 85 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 34 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was analyzing trace of length 85 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 34 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 560). Cancelled while BasicCegarLoop was analyzing trace of length 85 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 34 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 560). Cancelled while BasicCegarLoop was analyzing trace of length 85 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 34 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was analyzing trace of length 85 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 34 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was analyzing trace of length 85 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 34 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was analyzing trace of length 85 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 34 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 562). Cancelled while BasicCegarLoop was analyzing trace of length 85 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 34 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was analyzing trace of length 85 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 34 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 579). Cancelled while BasicCegarLoop was analyzing trace of length 85 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 34 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 571). Cancelled while BasicCegarLoop was analyzing trace of length 85 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 34 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 580). Cancelled while BasicCegarLoop was analyzing trace of length 85 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 34 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was analyzing trace of length 85 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 34 known predicates. - TimeoutResultAtElement [Line: 570]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 570). Cancelled while BasicCegarLoop was analyzing trace of length 85 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 34 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 571). Cancelled while BasicCegarLoop was analyzing trace of length 85 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 34 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 576). Cancelled while BasicCegarLoop was analyzing trace of length 85 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 34 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was analyzing trace of length 85 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 34 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was analyzing trace of length 85 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 34 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was analyzing trace of length 85 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 34 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was analyzing trace of length 85 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 34 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 579). Cancelled while BasicCegarLoop was analyzing trace of length 85 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 34 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 580). Cancelled while BasicCegarLoop was analyzing trace of length 85 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 34 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 576). Cancelled while BasicCegarLoop was analyzing trace of length 85 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 34 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was analyzing trace of length 85 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 34 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 579). Cancelled while BasicCegarLoop was analyzing trace of length 85 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 34 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was analyzing trace of length 85 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 34 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 579). Cancelled while BasicCegarLoop was analyzing trace of length 85 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 34 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was analyzing trace of length 85 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 34 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was analyzing trace of length 85 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 34 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 568). Cancelled while BasicCegarLoop was analyzing trace of length 85 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 34 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was analyzing trace of length 85 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 34 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was analyzing trace of length 85 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 34 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was analyzing trace of length 85 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 34 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was analyzing trace of length 85 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 34 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 568). Cancelled while BasicCegarLoop was analyzing trace of length 85 with TraceHistMax 2, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 34 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 121 locations, 45 error locations. TIMEOUT Result, 193.7s OverallTime, 62 OverallIterations, 6 TraceHistogramMax, 147.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5233 SDtfs, 4957 SDslu, 28750 SDs, 0 SdLazy, 33403 SolverSat, 1297 SolverUnsat, 326 SolverUnknown, 0 SolverNotchecked, 99.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2438 GetRequests, 975 SyntacticMatches, 98 SemanticMatches, 1365 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 16350 ImplicationChecksByTransitivity, 72.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=281occurred in iteration=61, 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.2s AutomataMinimizationTime, 61 MinimizatonAttempts, 862 StatesRemovedByMinimization, 54 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 42.3s InterpolantComputationTime, 3745 NumberOfCodeBlocks, 3745 NumberOfCodeBlocksAsserted, 79 NumberOfCheckSat, 3666 ConstructedInterpolants, 170 QuantifiedInterpolants, 3612628 SizeOfPredicates, 301 NumberOfNonLiveVariables, 5136 ConjunctsInSsa, 928 ConjunctsInUnsatCore, 79 InterpolantComputations, 43 PerfectInterpolantSequences, 261/830 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/optional_data_creation_test04_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_13-14-51-309.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/optional_data_creation_test04_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_13-14-51-309.csv Completed graceful shutdown