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/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/memsafety-ext/tree_stack_true-valid-memsafety_false-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-acfac67 [2018-01-28 21:55:14,993 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-28 21:55:14,995 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-28 21:55:15,006 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-28 21:55:15,007 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-28 21:55:15,007 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-28 21:55:15,008 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-28 21:55:15,009 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-28 21:55:15,010 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-28 21:55:15,011 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-28 21:55:15,012 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-28 21:55:15,012 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-28 21:55:15,012 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-28 21:55:15,013 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-28 21:55:15,014 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-28 21:55:15,016 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-28 21:55:15,018 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-28 21:55:15,020 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-28 21:55:15,021 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-28 21:55:15,023 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-28 21:55:15,025 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-28 21:55:15,025 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-28 21:55:15,025 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-28 21:55:15,026 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-28 21:55:15,027 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-28 21:55:15,028 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-28 21:55:15,029 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-28 21:55:15,029 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-28 21:55:15,029 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-28 21:55:15,029 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-28 21:55:15,030 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-28 21:55:15,030 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-28 21:55:15,040 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-28 21:55:15,040 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-28 21:55:15,041 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-28 21:55:15,041 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-28 21:55:15,041 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-28 21:55:15,041 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-28 21:55:15,041 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-28 21:55:15,042 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-28 21:55:15,042 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-28 21:55:15,042 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-28 21:55:15,043 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-28 21:55:15,043 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-28 21:55:15,043 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-28 21:55:15,043 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-28 21:55:15,043 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-28 21:55:15,044 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-28 21:55:15,044 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-28 21:55:15,044 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-28 21:55:15,044 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-28 21:55:15,044 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-28 21:55:15,045 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-28 21:55:15,045 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-28 21:55:15,045 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-28 21:55:15,045 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 21:55:15,045 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-28 21:55:15,046 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-28 21:55:15,046 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-28 21:55:15,046 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-28 21:55:15,046 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-28 21:55:15,046 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-28 21:55:15,046 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-28 21:55:15,047 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-28 21:55:15,047 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-28 21:55:15,048 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-28 21:55:15,082 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-28 21:55:15,094 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-28 21:55:15,098 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-28 21:55:15,100 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-28 21:55:15,100 INFO L276 PluginConnector]: CDTParser initialized [2018-01-28 21:55:15,101 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/tree_stack_true-valid-memsafety_false-termination.i [2018-01-28 21:55:15,294 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-28 21:55:15,301 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-28 21:55:15,302 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-28 21:55:15,302 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-28 21:55:15,308 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-28 21:55:15,310 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 09:55:15" (1/1) ... [2018-01-28 21:55:15,313 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@250a961a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:55:15, skipping insertion in model container [2018-01-28 21:55:15,313 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 09:55:15" (1/1) ... [2018-01-28 21:55:15,331 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 21:55:15,370 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 21:55:15,487 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 21:55:15,506 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 21:55:15,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:55:15 WrapperNode [2018-01-28 21:55:15,513 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-28 21:55:15,514 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-28 21:55:15,514 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-28 21:55:15,514 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-28 21:55:15,524 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:55:15" (1/1) ... [2018-01-28 21:55:15,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:55:15" (1/1) ... [2018-01-28 21:55:15,533 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:55:15" (1/1) ... [2018-01-28 21:55:15,534 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:55:15" (1/1) ... [2018-01-28 21:55:15,539 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:55:15" (1/1) ... [2018-01-28 21:55:15,543 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:55:15" (1/1) ... [2018-01-28 21:55:15,544 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:55:15" (1/1) ... [2018-01-28 21:55:15,546 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-28 21:55:15,546 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-28 21:55:15,546 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-28 21:55:15,546 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-28 21:55:15,547 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:55:15" (1/1) ... No working directory specified, using /storage/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-01-28 21:55:15,589 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-28 21:55:15,589 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-28 21:55:15,590 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-28 21:55:15,590 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-28 21:55:15,590 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-28 21:55:15,590 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-28 21:55:15,590 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-28 21:55:15,590 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-28 21:55:15,590 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-28 21:55:15,590 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-28 21:55:15,590 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-28 21:55:15,591 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-28 21:55:15,591 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-28 21:55:15,591 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-28 21:55:16,119 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-28 21:55:16,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 09:55:16 BoogieIcfgContainer [2018-01-28 21:55:16,119 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-28 21:55:16,120 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-28 21:55:16,120 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-28 21:55:16,123 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-28 21:55:16,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 09:55:15" (1/3) ... [2018-01-28 21:55:16,124 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48550c04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 09:55:16, skipping insertion in model container [2018-01-28 21:55:16,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:55:15" (2/3) ... [2018-01-28 21:55:16,124 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48550c04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 09:55:16, skipping insertion in model container [2018-01-28 21:55:16,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 09:55:16" (3/3) ... [2018-01-28 21:55:16,126 INFO L107 eAbstractionObserver]: Analyzing ICFG tree_stack_true-valid-memsafety_false-termination.i [2018-01-28 21:55:16,132 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-28 21:55:16,138 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 65 error locations. [2018-01-28 21:55:16,186 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-28 21:55:16,186 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-28 21:55:16,186 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-28 21:55:16,187 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-28 21:55:16,187 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-28 21:55:16,187 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-28 21:55:16,187 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-28 21:55:16,187 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-28 21:55:16,188 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-28 21:55:16,206 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states. [2018-01-28 21:55:16,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-28 21:55:16,212 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:55:16,212 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:55:16,213 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:55:16,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1458345475, now seen corresponding path program 1 times [2018-01-28 21:55:16,218 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:55:16,218 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:55:16,257 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:16,257 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:55:16,257 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:16,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:55:16,299 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:55:16,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:55:16,367 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:55:16,367 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:55:16,368 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 21:55:16,462 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 21:55:16,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 21:55:16,465 INFO L87 Difference]: Start difference. First operand 189 states. Second operand 4 states. [2018-01-28 21:55:16,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:55:16,707 INFO L93 Difference]: Finished difference Result 383 states and 411 transitions. [2018-01-28 21:55:16,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 21:55:16,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-01-28 21:55:16,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:55:16,717 INFO L225 Difference]: With dead ends: 383 [2018-01-28 21:55:16,717 INFO L226 Difference]: Without dead ends: 203 [2018-01-28 21:55:16,721 INFO L533 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-01-28 21:55:16,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-01-28 21:55:16,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 184. [2018-01-28 21:55:16,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-01-28 21:55:16,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 194 transitions. [2018-01-28 21:55:16,758 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 194 transitions. Word has length 10 [2018-01-28 21:55:16,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:55:16,759 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 194 transitions. [2018-01-28 21:55:16,759 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 21:55:16,759 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 194 transitions. [2018-01-28 21:55:16,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-28 21:55:16,759 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:55:16,759 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:55:16,759 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:55:16,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1458345476, now seen corresponding path program 1 times [2018-01-28 21:55:16,760 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:55:16,760 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:55:16,761 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:16,761 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:55:16,761 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:16,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:55:16,776 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:55:16,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:55:16,842 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:55:16,843 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:55:16,844 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 21:55:16,845 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 21:55:16,845 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 21:55:16,845 INFO L87 Difference]: Start difference. First operand 184 states and 194 transitions. Second operand 4 states. [2018-01-28 21:55:16,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:55:16,990 INFO L93 Difference]: Finished difference Result 184 states and 194 transitions. [2018-01-28 21:55:16,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 21:55:16,991 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-01-28 21:55:16,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:55:16,993 INFO L225 Difference]: With dead ends: 184 [2018-01-28 21:55:16,993 INFO L226 Difference]: Without dead ends: 182 [2018-01-28 21:55:16,994 INFO L533 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-01-28 21:55:16,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-01-28 21:55:17,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-01-28 21:55:17,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-01-28 21:55:17,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 192 transitions. [2018-01-28 21:55:17,008 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 192 transitions. Word has length 10 [2018-01-28 21:55:17,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:55:17,008 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 192 transitions. [2018-01-28 21:55:17,009 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 21:55:17,009 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 192 transitions. [2018-01-28 21:55:17,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-28 21:55:17,009 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:55:17,009 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:55:17,010 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:55:17,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1495680078, now seen corresponding path program 1 times [2018-01-28 21:55:17,010 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:55:17,010 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:55:17,011 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:17,011 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:55:17,011 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:17,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:55:17,026 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:55:17,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:55:17,066 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:55:17,066 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:55:17,066 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 21:55:17,067 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 21:55:17,067 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 21:55:17,067 INFO L87 Difference]: Start difference. First operand 182 states and 192 transitions. Second operand 4 states. [2018-01-28 21:55:17,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:55:17,194 INFO L93 Difference]: Finished difference Result 212 states and 223 transitions. [2018-01-28 21:55:17,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 21:55:17,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-01-28 21:55:17,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:55:17,196 INFO L225 Difference]: With dead ends: 212 [2018-01-28 21:55:17,196 INFO L226 Difference]: Without dead ends: 196 [2018-01-28 21:55:17,196 INFO L533 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-01-28 21:55:17,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-01-28 21:55:17,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 169. [2018-01-28 21:55:17,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-01-28 21:55:17,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 180 transitions. [2018-01-28 21:55:17,209 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 180 transitions. Word has length 18 [2018-01-28 21:55:17,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:55:17,209 INFO L432 AbstractCegarLoop]: Abstraction has 169 states and 180 transitions. [2018-01-28 21:55:17,209 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 21:55:17,210 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 180 transitions. [2018-01-28 21:55:17,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-28 21:55:17,210 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:55:17,210 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:55:17,211 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:55:17,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1495680077, now seen corresponding path program 1 times [2018-01-28 21:55:17,211 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:55:17,211 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:55:17,212 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:17,212 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:55:17,213 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:17,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:55:17,225 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:55:17,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:55:17,296 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:55:17,296 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 21:55:17,296 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 21:55:17,296 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 21:55:17,297 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:55:17,297 INFO L87 Difference]: Start difference. First operand 169 states and 180 transitions. Second operand 5 states. [2018-01-28 21:55:17,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:55:17,542 INFO L93 Difference]: Finished difference Result 255 states and 273 transitions. [2018-01-28 21:55:17,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 21:55:17,542 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-28 21:55:17,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:55:17,544 INFO L225 Difference]: With dead ends: 255 [2018-01-28 21:55:17,544 INFO L226 Difference]: Without dead ends: 243 [2018-01-28 21:55:17,544 INFO L533 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-01-28 21:55:17,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-01-28 21:55:17,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 221. [2018-01-28 21:55:17,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-01-28 21:55:17,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 244 transitions. [2018-01-28 21:55:17,558 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 244 transitions. Word has length 18 [2018-01-28 21:55:17,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:55:17,559 INFO L432 AbstractCegarLoop]: Abstraction has 221 states and 244 transitions. [2018-01-28 21:55:17,559 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 21:55:17,559 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 244 transitions. [2018-01-28 21:55:17,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-28 21:55:17,560 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:55:17,560 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:55:17,560 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:55:17,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1149399778, now seen corresponding path program 1 times [2018-01-28 21:55:17,560 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:55:17,561 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:55:17,561 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:17,562 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:55:17,562 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:17,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:55:17,576 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:55:17,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:55:17,619 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:55:17,619 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:55:17,620 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 21:55:17,620 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 21:55:17,620 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 21:55:17,620 INFO L87 Difference]: Start difference. First operand 221 states and 244 transitions. Second operand 4 states. [2018-01-28 21:55:17,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:55:17,751 INFO L93 Difference]: Finished difference Result 240 states and 263 transitions. [2018-01-28 21:55:17,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 21:55:17,751 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-01-28 21:55:17,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:55:17,753 INFO L225 Difference]: With dead ends: 240 [2018-01-28 21:55:17,753 INFO L226 Difference]: Without dead ends: 237 [2018-01-28 21:55:17,753 INFO L533 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-01-28 21:55:17,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-01-28 21:55:17,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 223. [2018-01-28 21:55:17,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-01-28 21:55:17,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 248 transitions. [2018-01-28 21:55:17,763 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 248 transitions. Word has length 20 [2018-01-28 21:55:17,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:55:17,764 INFO L432 AbstractCegarLoop]: Abstraction has 223 states and 248 transitions. [2018-01-28 21:55:17,764 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 21:55:17,764 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 248 transitions. [2018-01-28 21:55:17,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-28 21:55:17,765 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:55:17,765 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:55:17,765 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:55:17,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1149399777, now seen corresponding path program 1 times [2018-01-28 21:55:17,765 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:55:17,766 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:55:17,766 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:17,767 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:55:17,767 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:17,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:55:17,778 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:55:17,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:55:17,816 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:55:17,816 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:55:17,817 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 21:55:17,817 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 21:55:17,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 21:55:17,817 INFO L87 Difference]: Start difference. First operand 223 states and 248 transitions. Second operand 4 states. [2018-01-28 21:55:17,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:55:17,918 INFO L93 Difference]: Finished difference Result 228 states and 251 transitions. [2018-01-28 21:55:17,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 21:55:17,918 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-01-28 21:55:17,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:55:17,919 INFO L225 Difference]: With dead ends: 228 [2018-01-28 21:55:17,919 INFO L226 Difference]: Without dead ends: 225 [2018-01-28 21:55:17,920 INFO L533 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-01-28 21:55:17,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-01-28 21:55:17,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 221. [2018-01-28 21:55:17,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-01-28 21:55:17,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 245 transitions. [2018-01-28 21:55:17,926 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 245 transitions. Word has length 20 [2018-01-28 21:55:17,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:55:17,926 INFO L432 AbstractCegarLoop]: Abstraction has 221 states and 245 transitions. [2018-01-28 21:55:17,926 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 21:55:17,927 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 245 transitions. [2018-01-28 21:55:17,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-28 21:55:17,927 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:55:17,927 INFO L330 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] [2018-01-28 21:55:17,928 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:55:17,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1050260520, now seen corresponding path program 1 times [2018-01-28 21:55:17,928 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:55:17,928 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:55:17,929 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:17,929 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:55:17,929 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:17,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:55:17,938 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:55:17,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:55:17,974 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:55:17,974 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 21:55:17,974 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 21:55:17,974 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 21:55:17,975 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 21:55:17,975 INFO L87 Difference]: Start difference. First operand 221 states and 245 transitions. Second operand 4 states. [2018-01-28 21:55:18,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:55:18,009 INFO L93 Difference]: Finished difference Result 225 states and 248 transitions. [2018-01-28 21:55:18,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 21:55:18,009 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-01-28 21:55:18,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:55:18,010 INFO L225 Difference]: With dead ends: 225 [2018-01-28 21:55:18,011 INFO L226 Difference]: Without dead ends: 222 [2018-01-28 21:55:18,011 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-01-28 21:55:18,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-01-28 21:55:18,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 221. [2018-01-28 21:55:18,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-01-28 21:55:18,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 244 transitions. [2018-01-28 21:55:18,020 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 244 transitions. Word has length 25 [2018-01-28 21:55:18,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:55:18,020 INFO L432 AbstractCegarLoop]: Abstraction has 221 states and 244 transitions. [2018-01-28 21:55:18,020 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 21:55:18,021 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 244 transitions. [2018-01-28 21:55:18,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-28 21:55:18,022 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:55:18,022 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:55:18,022 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:55:18,022 INFO L82 PathProgramCache]: Analyzing trace with hash 518194025, now seen corresponding path program 1 times [2018-01-28 21:55:18,022 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:55:18,022 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:55:18,023 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:18,023 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:55:18,023 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:18,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:55:18,041 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:55:18,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:55:18,083 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:55:18,083 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 21:55:18,084 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 21:55:18,084 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 21:55:18,084 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:55:18,084 INFO L87 Difference]: Start difference. First operand 221 states and 244 transitions. Second operand 5 states. [2018-01-28 21:55:18,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:55:18,208 INFO L93 Difference]: Finished difference Result 244 states and 269 transitions. [2018-01-28 21:55:18,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 21:55:18,208 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-01-28 21:55:18,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:55:18,210 INFO L225 Difference]: With dead ends: 244 [2018-01-28 21:55:18,210 INFO L226 Difference]: Without dead ends: 240 [2018-01-28 21:55:18,210 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-28 21:55:18,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-01-28 21:55:18,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 221. [2018-01-28 21:55:18,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-01-28 21:55:18,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 245 transitions. [2018-01-28 21:55:18,217 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 245 transitions. Word has length 28 [2018-01-28 21:55:18,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:55:18,217 INFO L432 AbstractCegarLoop]: Abstraction has 221 states and 245 transitions. [2018-01-28 21:55:18,217 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 21:55:18,217 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 245 transitions. [2018-01-28 21:55:18,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-28 21:55:18,218 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:55:18,218 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:55:18,218 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:55:18,219 INFO L82 PathProgramCache]: Analyzing trace with hash 518194026, now seen corresponding path program 1 times [2018-01-28 21:55:18,219 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:55:18,219 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:55:18,220 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:18,220 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:55:18,220 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:18,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:55:18,233 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:55:18,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:55:18,313 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:55:18,313 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 21:55:18,313 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 21:55:18,314 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 21:55:18,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:55:18,314 INFO L87 Difference]: Start difference. First operand 221 states and 245 transitions. Second operand 5 states. [2018-01-28 21:55:18,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:55:18,550 INFO L93 Difference]: Finished difference Result 249 states and 274 transitions. [2018-01-28 21:55:18,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 21:55:18,550 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-01-28 21:55:18,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:55:18,551 INFO L225 Difference]: With dead ends: 249 [2018-01-28 21:55:18,552 INFO L226 Difference]: Without dead ends: 247 [2018-01-28 21:55:18,552 INFO L533 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-01-28 21:55:18,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-01-28 21:55:18,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 224. [2018-01-28 21:55:18,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-01-28 21:55:18,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 247 transitions. [2018-01-28 21:55:18,560 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 247 transitions. Word has length 28 [2018-01-28 21:55:18,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:55:18,560 INFO L432 AbstractCegarLoop]: Abstraction has 224 states and 247 transitions. [2018-01-28 21:55:18,560 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 21:55:18,560 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 247 transitions. [2018-01-28 21:55:18,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-28 21:55:18,561 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:55:18,561 INFO L330 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] [2018-01-28 21:55:18,561 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:55:18,562 INFO L82 PathProgramCache]: Analyzing trace with hash 633314477, now seen corresponding path program 1 times [2018-01-28 21:55:18,562 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:55:18,562 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:55:18,563 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:18,563 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:55:18,563 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:18,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:55:18,579 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:55:19,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:55:19,002 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:55:19,002 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-28 21:55:19,002 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-28 21:55:19,002 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-28 21:55:19,002 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-01-28 21:55:19,002 INFO L87 Difference]: Start difference. First operand 224 states and 247 transitions. Second operand 12 states. [2018-01-28 21:55:19,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:55:19,619 INFO L93 Difference]: Finished difference Result 248 states and 274 transitions. [2018-01-28 21:55:19,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-28 21:55:19,619 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2018-01-28 21:55:19,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:55:19,621 INFO L225 Difference]: With dead ends: 248 [2018-01-28 21:55:19,621 INFO L226 Difference]: Without dead ends: 247 [2018-01-28 21:55:19,621 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=437, Unknown=0, NotChecked=0, Total=600 [2018-01-28 21:55:19,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-01-28 21:55:19,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 225. [2018-01-28 21:55:19,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-01-28 21:55:19,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 249 transitions. [2018-01-28 21:55:19,629 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 249 transitions. Word has length 32 [2018-01-28 21:55:19,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:55:19,630 INFO L432 AbstractCegarLoop]: Abstraction has 225 states and 249 transitions. [2018-01-28 21:55:19,630 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-28 21:55:19,630 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 249 transitions. [2018-01-28 21:55:19,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-28 21:55:19,631 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:55:19,631 INFO L330 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] [2018-01-28 21:55:19,632 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:55:19,632 INFO L82 PathProgramCache]: Analyzing trace with hash 633314478, now seen corresponding path program 1 times [2018-01-28 21:55:19,632 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:55:19,632 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:55:19,633 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:19,633 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:55:19,633 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:19,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:55:19,650 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:55:19,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:55:19,934 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:55:19,934 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-28 21:55:19,934 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-28 21:55:19,935 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-28 21:55:19,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-01-28 21:55:19,935 INFO L87 Difference]: Start difference. First operand 225 states and 249 transitions. Second operand 11 states. [2018-01-28 21:55:20,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:55:20,519 INFO L93 Difference]: Finished difference Result 308 states and 331 transitions. [2018-01-28 21:55:20,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-28 21:55:20,536 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-01-28 21:55:20,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:55:20,537 INFO L225 Difference]: With dead ends: 308 [2018-01-28 21:55:20,537 INFO L226 Difference]: Without dead ends: 303 [2018-01-28 21:55:20,537 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=154, Invalid=398, Unknown=0, NotChecked=0, Total=552 [2018-01-28 21:55:20,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-01-28 21:55:20,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 247. [2018-01-28 21:55:20,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-01-28 21:55:20,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 278 transitions. [2018-01-28 21:55:20,547 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 278 transitions. Word has length 32 [2018-01-28 21:55:20,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:55:20,548 INFO L432 AbstractCegarLoop]: Abstraction has 247 states and 278 transitions. [2018-01-28 21:55:20,548 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-28 21:55:20,548 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 278 transitions. [2018-01-28 21:55:20,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-28 21:55:20,549 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:55:20,549 INFO L330 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:55:20,549 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:55:20,549 INFO L82 PathProgramCache]: Analyzing trace with hash 959229324, now seen corresponding path program 1 times [2018-01-28 21:55:20,550 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:55:20,550 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:55:20,550 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:20,551 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:55:20,551 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:20,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:55:20,565 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:55:20,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:55:20,583 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:55:20,583 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:55:20,583 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 21:55:20,583 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 21:55:20,583 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 21:55:20,584 INFO L87 Difference]: Start difference. First operand 247 states and 278 transitions. Second operand 3 states. [2018-01-28 21:55:20,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:55:20,623 INFO L93 Difference]: Finished difference Result 485 states and 549 transitions. [2018-01-28 21:55:20,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 21:55:20,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-01-28 21:55:20,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:55:20,624 INFO L225 Difference]: With dead ends: 485 [2018-01-28 21:55:20,624 INFO L226 Difference]: Without dead ends: 249 [2018-01-28 21:55:20,626 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 21:55:20,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-01-28 21:55:20,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2018-01-28 21:55:20,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-01-28 21:55:20,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 280 transitions. [2018-01-28 21:55:20,632 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 280 transitions. Word has length 32 [2018-01-28 21:55:20,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:55:20,633 INFO L432 AbstractCegarLoop]: Abstraction has 249 states and 280 transitions. [2018-01-28 21:55:20,633 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 21:55:20,633 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 280 transitions. [2018-01-28 21:55:20,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-28 21:55:20,634 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:55:20,634 INFO L330 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:55:20,634 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:55:20,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1727612375, now seen corresponding path program 1 times [2018-01-28 21:55:20,634 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:55:20,634 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:55:20,635 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:20,635 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:55:20,635 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:20,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:55:20,644 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:55:20,713 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:55:20,713 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:55:20,713 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 21:55:20,713 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 21:55:20,713 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 21:55:20,714 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 21:55:20,714 INFO L87 Difference]: Start difference. First operand 249 states and 280 transitions. Second operand 6 states. [2018-01-28 21:55:20,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:55:20,952 INFO L93 Difference]: Finished difference Result 559 states and 629 transitions. [2018-01-28 21:55:20,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-28 21:55:20,952 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-01-28 21:55:20,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:55:20,954 INFO L225 Difference]: With dead ends: 559 [2018-01-28 21:55:20,954 INFO L226 Difference]: Without dead ends: 321 [2018-01-28 21:55:20,955 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-01-28 21:55:20,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-01-28 21:55:20,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 280. [2018-01-28 21:55:20,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-01-28 21:55:20,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 316 transitions. [2018-01-28 21:55:20,967 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 316 transitions. Word has length 34 [2018-01-28 21:55:20,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:55:20,967 INFO L432 AbstractCegarLoop]: Abstraction has 280 states and 316 transitions. [2018-01-28 21:55:20,967 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 21:55:20,967 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 316 transitions. [2018-01-28 21:55:20,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-28 21:55:20,968 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:55:20,968 INFO L330 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-01-28 21:55:20,969 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:55:20,969 INFO L82 PathProgramCache]: Analyzing trace with hash 223020355, now seen corresponding path program 1 times [2018-01-28 21:55:20,969 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:55:20,969 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:55:20,970 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:20,970 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:55:20,970 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:20,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:55:20,979 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:55:21,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:55:21,038 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:55:21,038 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-28 21:55:21,038 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 21:55:21,038 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 21:55:21,038 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-28 21:55:21,039 INFO L87 Difference]: Start difference. First operand 280 states and 316 transitions. Second operand 7 states. [2018-01-28 21:55:21,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:55:21,449 INFO L93 Difference]: Finished difference Result 640 states and 724 transitions. [2018-01-28 21:55:21,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-28 21:55:21,449 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2018-01-28 21:55:21,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:55:21,451 INFO L225 Difference]: With dead ends: 640 [2018-01-28 21:55:21,452 INFO L226 Difference]: Without dead ends: 371 [2018-01-28 21:55:21,452 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-01-28 21:55:21,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-01-28 21:55:21,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 292. [2018-01-28 21:55:21,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-01-28 21:55:21,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 328 transitions. [2018-01-28 21:55:21,463 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 328 transitions. Word has length 35 [2018-01-28 21:55:21,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:55:21,464 INFO L432 AbstractCegarLoop]: Abstraction has 292 states and 328 transitions. [2018-01-28 21:55:21,464 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 21:55:21,464 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 328 transitions. [2018-01-28 21:55:21,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-28 21:55:21,464 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:55:21,465 INFO L330 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] [2018-01-28 21:55:21,465 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:55:21,465 INFO L82 PathProgramCache]: Analyzing trace with hash -18208730, now seen corresponding path program 1 times [2018-01-28 21:55:21,465 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:55:21,465 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:55:21,466 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:21,466 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:55:21,466 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:21,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:55:21,476 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:55:21,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:55:21,514 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:55:21,514 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:55:21,514 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 21:55:21,514 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 21:55:21,515 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 21:55:21,515 INFO L87 Difference]: Start difference. First operand 292 states and 328 transitions. Second operand 4 states. [2018-01-28 21:55:21,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:55:21,677 INFO L93 Difference]: Finished difference Result 325 states and 366 transitions. [2018-01-28 21:55:21,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 21:55:21,678 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-01-28 21:55:21,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:55:21,680 INFO L225 Difference]: With dead ends: 325 [2018-01-28 21:55:21,681 INFO L226 Difference]: Without dead ends: 324 [2018-01-28 21:55:21,681 INFO L533 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-01-28 21:55:21,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-01-28 21:55:21,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 291. [2018-01-28 21:55:21,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-01-28 21:55:21,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 326 transitions. [2018-01-28 21:55:21,692 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 326 transitions. Word has length 37 [2018-01-28 21:55:21,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:55:21,693 INFO L432 AbstractCegarLoop]: Abstraction has 291 states and 326 transitions. [2018-01-28 21:55:21,693 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 21:55:21,693 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 326 transitions. [2018-01-28 21:55:21,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-28 21:55:21,693 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:55:21,694 INFO L330 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] [2018-01-28 21:55:21,694 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:55:21,694 INFO L82 PathProgramCache]: Analyzing trace with hash -18208729, now seen corresponding path program 1 times [2018-01-28 21:55:21,694 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:55:21,694 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:55:21,695 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:21,695 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:55:21,695 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:21,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:55:21,707 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:55:21,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:55:21,774 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:55:21,774 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:55:21,774 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 21:55:21,774 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 21:55:21,774 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 21:55:21,774 INFO L87 Difference]: Start difference. First operand 291 states and 326 transitions. Second operand 4 states. [2018-01-28 21:55:21,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:55:21,933 INFO L93 Difference]: Finished difference Result 362 states and 404 transitions. [2018-01-28 21:55:21,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 21:55:21,933 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-01-28 21:55:21,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:55:21,935 INFO L225 Difference]: With dead ends: 362 [2018-01-28 21:55:21,936 INFO L226 Difference]: Without dead ends: 360 [2018-01-28 21:55:21,936 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-01-28 21:55:21,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2018-01-28 21:55:21,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 289. [2018-01-28 21:55:21,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-01-28 21:55:21,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 322 transitions. [2018-01-28 21:55:21,949 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 322 transitions. Word has length 37 [2018-01-28 21:55:21,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:55:21,950 INFO L432 AbstractCegarLoop]: Abstraction has 289 states and 322 transitions. [2018-01-28 21:55:21,950 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 21:55:21,950 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 322 transitions. [2018-01-28 21:55:21,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-28 21:55:21,951 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:55:21,951 INFO L330 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] [2018-01-28 21:55:21,951 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:55:21,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1709947584, now seen corresponding path program 1 times [2018-01-28 21:55:21,952 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:55:21,952 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:55:21,952 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:21,953 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:55:21,953 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:21,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:55:21,971 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:55:22,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:55:22,021 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:55:22,022 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 21:55:22,022 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 21:55:22,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 21:55:22,022 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:55:22,022 INFO L87 Difference]: Start difference. First operand 289 states and 322 transitions. Second operand 5 states. [2018-01-28 21:55:22,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:55:22,316 INFO L93 Difference]: Finished difference Result 442 states and 493 transitions. [2018-01-28 21:55:22,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 21:55:22,316 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-01-28 21:55:22,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:55:22,318 INFO L225 Difference]: With dead ends: 442 [2018-01-28 21:55:22,319 INFO L226 Difference]: Without dead ends: 441 [2018-01-28 21:55:22,319 INFO L533 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-01-28 21:55:22,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2018-01-28 21:55:22,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 288. [2018-01-28 21:55:22,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-01-28 21:55:22,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 320 transitions. [2018-01-28 21:55:22,331 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 320 transitions. Word has length 37 [2018-01-28 21:55:22,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:55:22,331 INFO L432 AbstractCegarLoop]: Abstraction has 288 states and 320 transitions. [2018-01-28 21:55:22,331 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 21:55:22,332 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 320 transitions. [2018-01-28 21:55:22,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-28 21:55:22,332 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:55:22,332 INFO L330 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] [2018-01-28 21:55:22,332 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:55:22,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1709947583, now seen corresponding path program 1 times [2018-01-28 21:55:22,333 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:55:22,333 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:55:22,333 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:22,334 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:55:22,334 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:22,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:55:22,342 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:55:22,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:55:22,406 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:55:22,406 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 21:55:22,406 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 21:55:22,406 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 21:55:22,406 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:55:22,406 INFO L87 Difference]: Start difference. First operand 288 states and 320 transitions. Second operand 5 states. [2018-01-28 21:55:22,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:55:22,744 INFO L93 Difference]: Finished difference Result 514 states and 571 transitions. [2018-01-28 21:55:22,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 21:55:22,745 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-01-28 21:55:22,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:55:22,747 INFO L225 Difference]: With dead ends: 514 [2018-01-28 21:55:22,747 INFO L226 Difference]: Without dead ends: 513 [2018-01-28 21:55:22,748 INFO L533 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-01-28 21:55:22,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2018-01-28 21:55:22,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 287. [2018-01-28 21:55:22,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-01-28 21:55:22,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 318 transitions. [2018-01-28 21:55:22,760 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 318 transitions. Word has length 37 [2018-01-28 21:55:22,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:55:22,761 INFO L432 AbstractCegarLoop]: Abstraction has 287 states and 318 transitions. [2018-01-28 21:55:22,761 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 21:55:22,761 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 318 transitions. [2018-01-28 21:55:22,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-28 21:55:22,761 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:55:22,761 INFO L330 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-01-28 21:55:22,762 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:55:22,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1648128107, now seen corresponding path program 1 times [2018-01-28 21:55:22,762 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:55:22,762 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:55:22,763 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:22,763 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:55:22,763 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:22,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:55:22,774 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:55:22,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:55:22,807 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:55:22,807 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:55:22,807 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 21:55:22,807 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 21:55:22,808 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 21:55:22,808 INFO L87 Difference]: Start difference. First operand 287 states and 318 transitions. Second operand 4 states. [2018-01-28 21:55:22,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:55:22,930 INFO L93 Difference]: Finished difference Result 306 states and 339 transitions. [2018-01-28 21:55:22,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 21:55:22,930 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-01-28 21:55:22,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:55:22,932 INFO L225 Difference]: With dead ends: 306 [2018-01-28 21:55:22,932 INFO L226 Difference]: Without dead ends: 305 [2018-01-28 21:55:22,932 INFO L533 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-01-28 21:55:22,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-01-28 21:55:22,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 286. [2018-01-28 21:55:22,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-01-28 21:55:22,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 316 transitions. [2018-01-28 21:55:22,944 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 316 transitions. Word has length 40 [2018-01-28 21:55:22,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:55:22,944 INFO L432 AbstractCegarLoop]: Abstraction has 286 states and 316 transitions. [2018-01-28 21:55:22,944 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 21:55:22,945 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 316 transitions. [2018-01-28 21:55:22,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-28 21:55:22,945 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:55:22,945 INFO L330 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-01-28 21:55:22,945 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:55:22,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1648128106, now seen corresponding path program 1 times [2018-01-28 21:55:22,946 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:55:22,946 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:55:22,947 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:22,947 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:55:22,947 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:22,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:55:22,959 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:55:23,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:55:23,027 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:55:23,027 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:55:23,027 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 21:55:23,027 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 21:55:23,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 21:55:23,028 INFO L87 Difference]: Start difference. First operand 286 states and 316 transitions. Second operand 4 states. [2018-01-28 21:55:23,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:55:23,163 INFO L93 Difference]: Finished difference Result 335 states and 367 transitions. [2018-01-28 21:55:23,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 21:55:23,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-01-28 21:55:23,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:55:23,165 INFO L225 Difference]: With dead ends: 335 [2018-01-28 21:55:23,165 INFO L226 Difference]: Without dead ends: 333 [2018-01-28 21:55:23,166 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-01-28 21:55:23,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-01-28 21:55:23,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 284. [2018-01-28 21:55:23,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-01-28 21:55:23,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 312 transitions. [2018-01-28 21:55:23,178 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 312 transitions. Word has length 40 [2018-01-28 21:55:23,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:55:23,178 INFO L432 AbstractCegarLoop]: Abstraction has 284 states and 312 transitions. [2018-01-28 21:55:23,178 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 21:55:23,178 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 312 transitions. [2018-01-28 21:55:23,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-28 21:55:23,179 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:55:23,179 INFO L330 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-01-28 21:55:23,179 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:55:23,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1558701394, now seen corresponding path program 1 times [2018-01-28 21:55:23,180 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:55:23,180 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:55:23,180 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:23,181 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:55:23,181 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:23,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:55:23,191 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:55:23,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:55:23,354 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:55:23,354 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 21:55:23,354 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 21:55:23,354 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 21:55:23,354 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-28 21:55:23,354 INFO L87 Difference]: Start difference. First operand 284 states and 312 transitions. Second operand 9 states. [2018-01-28 21:55:23,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:55:23,750 INFO L93 Difference]: Finished difference Result 341 states and 377 transitions. [2018-01-28 21:55:23,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 21:55:23,751 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2018-01-28 21:55:23,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:55:23,752 INFO L225 Difference]: With dead ends: 341 [2018-01-28 21:55:23,753 INFO L226 Difference]: Without dead ends: 340 [2018-01-28 21:55:23,753 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-01-28 21:55:23,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-01-28 21:55:23,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 283. [2018-01-28 21:55:23,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-01-28 21:55:23,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 310 transitions. [2018-01-28 21:55:23,764 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 310 transitions. Word has length 40 [2018-01-28 21:55:23,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:55:23,764 INFO L432 AbstractCegarLoop]: Abstraction has 283 states and 310 transitions. [2018-01-28 21:55:23,764 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 21:55:23,764 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 310 transitions. [2018-01-28 21:55:23,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-28 21:55:23,765 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:55:23,765 INFO L330 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-01-28 21:55:23,765 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:55:23,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1558701395, now seen corresponding path program 1 times [2018-01-28 21:55:23,765 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:55:23,765 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:55:23,766 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:23,766 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:55:23,766 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:23,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:55:23,777 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:55:23,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:55:23,938 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:55:23,938 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 21:55:23,938 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 21:55:23,938 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 21:55:23,939 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-28 21:55:23,939 INFO L87 Difference]: Start difference. First operand 283 states and 310 transitions. Second operand 9 states. [2018-01-28 21:55:24,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:55:24,266 INFO L93 Difference]: Finished difference Result 340 states and 375 transitions. [2018-01-28 21:55:24,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 21:55:24,266 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2018-01-28 21:55:24,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:55:24,267 INFO L225 Difference]: With dead ends: 340 [2018-01-28 21:55:24,267 INFO L226 Difference]: Without dead ends: 339 [2018-01-28 21:55:24,268 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-01-28 21:55:24,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-01-28 21:55:24,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 282. [2018-01-28 21:55:24,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-01-28 21:55:24,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 308 transitions. [2018-01-28 21:55:24,274 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 308 transitions. Word has length 40 [2018-01-28 21:55:24,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:55:24,274 INFO L432 AbstractCegarLoop]: Abstraction has 282 states and 308 transitions. [2018-01-28 21:55:24,274 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 21:55:24,274 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 308 transitions. [2018-01-28 21:55:24,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-28 21:55:24,275 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:55:24,275 INFO L330 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:55:24,275 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:55:24,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1515842358, now seen corresponding path program 1 times [2018-01-28 21:55:24,275 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:55:24,275 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:55:24,276 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:24,276 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:55:24,276 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:24,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:55:24,285 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:55:24,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:55:24,678 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:55:24,678 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-28 21:55:24,684 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:55:24,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:55:24,728 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:55:25,092 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 13 treesize of output 10 [2018-01-28 21:55:25,098 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-01-28 21:55:25,098 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:55:25,100 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:55:25,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:55:25,111 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:57 [2018-01-28 21:55:25,339 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 60 treesize of output 50 [2018-01-28 21:55:25,350 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 39 [2018-01-28 21:55:25,352 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-28 21:55:25,369 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-28 21:55:25,389 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-01-28 21:55:25,389 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:70, output treesize:72 [2018-01-28 21:55:25,658 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~n~4.base Int) (main_~st~4.base Int)) (let ((.cse0 (store |c_old(#valid)| main_~n~4.base 1))) (and (= 0 (select .cse0 main_~st~4.base)) (not (= 0 main_~n~4.base)) (= |c_#valid| (store (store .cse0 main_~st~4.base 0) main_~n~4.base 0)) (not (= main_~st~4.base 0)) (= 0 (select |c_old(#valid)| main_~n~4.base))))) is different from true [2018-01-28 21:55:25,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-01-28 21:55:25,702 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:55:25,702 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 27 [2018-01-28 21:55:25,702 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-28 21:55:25,702 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-28 21:55:25,703 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=633, Unknown=4, NotChecked=50, Total=756 [2018-01-28 21:55:25,703 INFO L87 Difference]: Start difference. First operand 282 states and 308 transitions. Second operand 28 states. [2018-01-28 21:55:28,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:55:28,524 INFO L93 Difference]: Finished difference Result 343 states and 372 transitions. [2018-01-28 21:55:28,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-28 21:55:28,524 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 42 [2018-01-28 21:55:28,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:55:28,525 INFO L225 Difference]: With dead ends: 343 [2018-01-28 21:55:28,525 INFO L226 Difference]: Without dead ends: 340 [2018-01-28 21:55:28,526 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=252, Invalid=1629, Unknown=15, NotChecked=84, Total=1980 [2018-01-28 21:55:28,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-01-28 21:55:28,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 308. [2018-01-28 21:55:28,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-01-28 21:55:28,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 336 transitions. [2018-01-28 21:55:28,539 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 336 transitions. Word has length 42 [2018-01-28 21:55:28,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:55:28,539 INFO L432 AbstractCegarLoop]: Abstraction has 308 states and 336 transitions. [2018-01-28 21:55:28,539 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-28 21:55:28,539 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 336 transitions. [2018-01-28 21:55:28,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-28 21:55:28,540 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:55:28,540 INFO L330 BasicCegarLoop]: trace histogram [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] [2018-01-28 21:55:28,540 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:55:28,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1515842612, now seen corresponding path program 1 times [2018-01-28 21:55:28,540 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:55:28,540 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:55:28,541 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:28,541 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:55:28,541 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:28,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:55:28,551 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:55:28,627 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:55:28,628 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:55:28,628 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-28 21:55:28,635 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:55:28,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:55:28,665 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:55:28,674 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-01-28 21:55:28,677 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-01-28 21:55:28,677 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:55:28,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:55:28,685 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-01-28 21:55:28,687 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-01-28 21:55:28,687 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:55:28,688 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:55:28,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:55:28,692 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-01-28 21:55:28,698 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 21 [2018-01-28 21:55:28,706 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:55:28,707 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-01-28 21:55:28,708 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:55:28,721 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:55:28,731 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 21 [2018-01-28 21:55:28,737 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:55:28,738 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-01-28 21:55:28,738 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:55:28,743 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:55:28,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:55:28,749 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:51, output treesize:15 [2018-01-28 21:55:28,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-28 21:55:28,822 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-01-28 21:55:28,822 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:55:28,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:55:28,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-28 21:55:28,832 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-01-28 21:55:28,832 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:55:28,833 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:55:28,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:55:28,835 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:39, output treesize:7 [2018-01-28 21:55:28,841 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:55:28,861 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:55:28,861 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-01-28 21:55:28,861 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 21:55:28,861 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 21:55:28,861 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:55:28,861 INFO L87 Difference]: Start difference. First operand 308 states and 336 transitions. Second operand 5 states. [2018-01-28 21:55:28,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:55:28,931 INFO L93 Difference]: Finished difference Result 369 states and 401 transitions. [2018-01-28 21:55:28,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 21:55:28,931 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-01-28 21:55:28,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:55:28,932 INFO L225 Difference]: With dead ends: 369 [2018-01-28 21:55:28,932 INFO L226 Difference]: Without dead ends: 318 [2018-01-28 21:55:28,932 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 SyntacticMatches, 7 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-28 21:55:28,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-01-28 21:55:28,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 310. [2018-01-28 21:55:28,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-01-28 21:55:28,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 338 transitions. [2018-01-28 21:55:28,946 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 338 transitions. Word has length 42 [2018-01-28 21:55:28,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:55:28,946 INFO L432 AbstractCegarLoop]: Abstraction has 310 states and 338 transitions. [2018-01-28 21:55:28,946 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 21:55:28,946 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 338 transitions. [2018-01-28 21:55:28,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-28 21:55:28,947 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:55:28,947 INFO L330 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-01-28 21:55:28,947 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:55:28,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1748919826, now seen corresponding path program 1 times [2018-01-28 21:55:28,947 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:55:28,947 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:55:28,948 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:28,948 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:55:28,948 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:28,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:55:28,957 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:55:28,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:55:28,978 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:55:28,978 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:55:28,978 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 21:55:28,978 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 21:55:28,978 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 21:55:28,978 INFO L87 Difference]: Start difference. First operand 310 states and 338 transitions. Second operand 3 states. [2018-01-28 21:55:28,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:55:28,994 INFO L93 Difference]: Finished difference Result 559 states and 613 transitions. [2018-01-28 21:55:28,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 21:55:28,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-01-28 21:55:28,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:55:28,996 INFO L225 Difference]: With dead ends: 559 [2018-01-28 21:55:28,996 INFO L226 Difference]: Without dead ends: 313 [2018-01-28 21:55:28,997 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 21:55:28,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-01-28 21:55:29,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 312. [2018-01-28 21:55:29,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-01-28 21:55:29,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 340 transitions. [2018-01-28 21:55:29,010 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 340 transitions. Word has length 44 [2018-01-28 21:55:29,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:55:29,011 INFO L432 AbstractCegarLoop]: Abstraction has 312 states and 340 transitions. [2018-01-28 21:55:29,011 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 21:55:29,011 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 340 transitions. [2018-01-28 21:55:29,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-28 21:55:29,012 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:55:29,012 INFO L330 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-01-28 21:55:29,012 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:55:29,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1631084651, now seen corresponding path program 1 times [2018-01-28 21:55:29,012 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:55:29,012 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:55:29,013 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:29,013 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:55:29,013 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:29,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:55:29,023 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:55:29,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:55:29,052 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:55:29,053 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 21:55:29,053 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 21:55:29,053 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 21:55:29,053 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:55:29,053 INFO L87 Difference]: Start difference. First operand 312 states and 340 transitions. Second operand 5 states. [2018-01-28 21:55:29,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:55:29,281 INFO L93 Difference]: Finished difference Result 464 states and 508 transitions. [2018-01-28 21:55:29,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 21:55:29,282 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-01-28 21:55:29,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:55:29,284 INFO L225 Difference]: With dead ends: 464 [2018-01-28 21:55:29,284 INFO L226 Difference]: Without dead ends: 463 [2018-01-28 21:55:29,284 INFO L533 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-01-28 21:55:29,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-01-28 21:55:29,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 311. [2018-01-28 21:55:29,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-01-28 21:55:29,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 338 transitions. [2018-01-28 21:55:29,297 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 338 transitions. Word has length 46 [2018-01-28 21:55:29,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:55:29,297 INFO L432 AbstractCegarLoop]: Abstraction has 311 states and 338 transitions. [2018-01-28 21:55:29,297 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 21:55:29,298 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 338 transitions. [2018-01-28 21:55:29,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-28 21:55:29,298 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:55:29,298 INFO L330 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-01-28 21:55:29,299 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:55:29,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1631084652, now seen corresponding path program 1 times [2018-01-28 21:55:29,299 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:55:29,301 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:55:29,302 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:29,302 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:55:29,302 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:29,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:55:29,313 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:55:29,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-01-28 21:55:29,368 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:55:29,369 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 21:55:29,369 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 21:55:29,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 21:55:29,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:55:29,369 INFO L87 Difference]: Start difference. First operand 311 states and 338 transitions. Second operand 5 states. [2018-01-28 21:55:29,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:55:29,659 INFO L93 Difference]: Finished difference Result 539 states and 587 transitions. [2018-01-28 21:55:29,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 21:55:29,660 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-01-28 21:55:29,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:55:29,662 INFO L225 Difference]: With dead ends: 539 [2018-01-28 21:55:29,662 INFO L226 Difference]: Without dead ends: 538 [2018-01-28 21:55:29,663 INFO L533 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-01-28 21:55:29,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2018-01-28 21:55:29,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 310. [2018-01-28 21:55:29,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-01-28 21:55:29,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 336 transitions. [2018-01-28 21:55:29,677 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 336 transitions. Word has length 46 [2018-01-28 21:55:29,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:55:29,677 INFO L432 AbstractCegarLoop]: Abstraction has 310 states and 336 transitions. [2018-01-28 21:55:29,677 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 21:55:29,678 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 336 transitions. [2018-01-28 21:55:29,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-28 21:55:29,678 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:55:29,678 INFO L330 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:55:29,679 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:55:29,679 INFO L82 PathProgramCache]: Analyzing trace with hash -392062362, now seen corresponding path program 1 times [2018-01-28 21:55:29,679 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:55:29,679 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:55:29,680 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:29,680 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:55:29,680 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:29,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:55:29,690 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:55:29,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:55:29,736 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:55:29,737 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 21:55:29,737 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 21:55:29,737 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 21:55:29,737 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:55:29,737 INFO L87 Difference]: Start difference. First operand 310 states and 336 transitions. Second operand 5 states. [2018-01-28 21:55:29,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:55:29,822 INFO L93 Difference]: Finished difference Result 416 states and 447 transitions. [2018-01-28 21:55:29,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 21:55:29,822 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-01-28 21:55:29,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:55:29,823 INFO L225 Difference]: With dead ends: 416 [2018-01-28 21:55:29,823 INFO L226 Difference]: Without dead ends: 413 [2018-01-28 21:55:29,824 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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-01-28 21:55:29,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-01-28 21:55:29,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 317. [2018-01-28 21:55:29,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-01-28 21:55:29,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 346 transitions. [2018-01-28 21:55:29,837 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 346 transitions. Word has length 49 [2018-01-28 21:55:29,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:55:29,837 INFO L432 AbstractCegarLoop]: Abstraction has 317 states and 346 transitions. [2018-01-28 21:55:29,837 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 21:55:29,837 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 346 transitions. [2018-01-28 21:55:29,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-28 21:55:29,838 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:55:29,838 INFO L330 BasicCegarLoop]: trace histogram [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-01-28 21:55:29,838 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:55:29,839 INFO L82 PathProgramCache]: Analyzing trace with hash -392062616, now seen corresponding path program 1 times [2018-01-28 21:55:29,839 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:55:29,839 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:55:29,840 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:29,840 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:55:29,840 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:29,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:55:29,851 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:55:29,947 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:55:29,947 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:55:29,947 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 21:55:29,947 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 21:55:29,947 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 21:55:29,948 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-28 21:55:29,948 INFO L87 Difference]: Start difference. First operand 317 states and 346 transitions. Second operand 7 states. [2018-01-28 21:55:30,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:55:30,393 INFO L93 Difference]: Finished difference Result 371 states and 399 transitions. [2018-01-28 21:55:30,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-28 21:55:30,393 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2018-01-28 21:55:30,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:55:30,395 INFO L225 Difference]: With dead ends: 371 [2018-01-28 21:55:30,395 INFO L226 Difference]: Without dead ends: 369 [2018-01-28 21:55:30,395 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-01-28 21:55:30,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-01-28 21:55:30,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 322. [2018-01-28 21:55:30,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2018-01-28 21:55:30,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 353 transitions. [2018-01-28 21:55:30,407 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 353 transitions. Word has length 49 [2018-01-28 21:55:30,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:55:30,408 INFO L432 AbstractCegarLoop]: Abstraction has 322 states and 353 transitions. [2018-01-28 21:55:30,408 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 21:55:30,408 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 353 transitions. [2018-01-28 21:55:30,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-28 21:55:30,409 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:55:30,409 INFO L330 BasicCegarLoop]: trace histogram [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-01-28 21:55:30,409 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:55:30,409 INFO L82 PathProgramCache]: Analyzing trace with hash -392062615, now seen corresponding path program 1 times [2018-01-28 21:55:30,409 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:55:30,409 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:55:30,410 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:30,410 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:55:30,410 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:30,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:55:30,421 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:55:30,499 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:55:30,499 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:55:30,499 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 21:55:30,499 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 21:55:30,500 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 21:55:30,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:55:30,500 INFO L87 Difference]: Start difference. First operand 322 states and 353 transitions. Second operand 5 states. [2018-01-28 21:55:30,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:55:30,682 INFO L93 Difference]: Finished difference Result 411 states and 442 transitions. [2018-01-28 21:55:30,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 21:55:30,758 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-01-28 21:55:30,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:55:30,760 INFO L225 Difference]: With dead ends: 411 [2018-01-28 21:55:30,760 INFO L226 Difference]: Without dead ends: 408 [2018-01-28 21:55:30,760 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-28 21:55:30,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2018-01-28 21:55:30,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 325. [2018-01-28 21:55:30,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-01-28 21:55:30,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 354 transitions. [2018-01-28 21:55:30,768 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 354 transitions. Word has length 49 [2018-01-28 21:55:30,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:55:30,768 INFO L432 AbstractCegarLoop]: Abstraction has 325 states and 354 transitions. [2018-01-28 21:55:30,768 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 21:55:30,768 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 354 transitions. [2018-01-28 21:55:30,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-28 21:55:30,769 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:55:30,769 INFO L330 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:55:30,769 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:55:30,769 INFO L82 PathProgramCache]: Analyzing trace with hash 746128264, now seen corresponding path program 1 times [2018-01-28 21:55:30,769 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:55:30,769 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:55:30,770 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:30,770 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:55:30,770 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:30,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:55:30,777 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:55:30,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:55:30,798 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:55:30,798 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 21:55:30,798 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 21:55:30,798 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 21:55:30,799 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:55:30,799 INFO L87 Difference]: Start difference. First operand 325 states and 354 transitions. Second operand 5 states. [2018-01-28 21:55:30,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:55:30,938 INFO L93 Difference]: Finished difference Result 422 states and 458 transitions. [2018-01-28 21:55:30,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 21:55:30,938 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-01-28 21:55:30,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:55:30,940 INFO L225 Difference]: With dead ends: 422 [2018-01-28 21:55:30,940 INFO L226 Difference]: Without dead ends: 419 [2018-01-28 21:55:30,940 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-01-28 21:55:30,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-01-28 21:55:30,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 328. [2018-01-28 21:55:30,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-01-28 21:55:30,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 358 transitions. [2018-01-28 21:55:30,949 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 358 transitions. Word has length 49 [2018-01-28 21:55:30,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:55:30,949 INFO L432 AbstractCegarLoop]: Abstraction has 328 states and 358 transitions. [2018-01-28 21:55:30,949 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 21:55:30,949 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 358 transitions. [2018-01-28 21:55:30,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-28 21:55:30,949 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:55:30,950 INFO L330 BasicCegarLoop]: trace histogram [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-01-28 21:55:30,950 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:55:30,950 INFO L82 PathProgramCache]: Analyzing trace with hash 746128010, now seen corresponding path program 1 times [2018-01-28 21:55:30,950 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:55:30,950 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:55:30,951 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:30,951 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:55:30,951 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:30,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:55:30,959 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:55:31,081 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:55:31,082 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:55:31,082 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 21:55:31,082 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 21:55:31,082 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 21:55:31,082 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-28 21:55:31,082 INFO L87 Difference]: Start difference. First operand 328 states and 358 transitions. Second operand 7 states. [2018-01-28 21:55:31,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:55:31,338 INFO L93 Difference]: Finished difference Result 346 states and 376 transitions. [2018-01-28 21:55:31,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-28 21:55:31,339 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2018-01-28 21:55:31,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:55:31,340 INFO L225 Difference]: With dead ends: 346 [2018-01-28 21:55:31,340 INFO L226 Difference]: Without dead ends: 344 [2018-01-28 21:55:31,340 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-01-28 21:55:31,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-01-28 21:55:31,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 333. [2018-01-28 21:55:31,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-01-28 21:55:31,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 365 transitions. [2018-01-28 21:55:31,350 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 365 transitions. Word has length 49 [2018-01-28 21:55:31,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:55:31,350 INFO L432 AbstractCegarLoop]: Abstraction has 333 states and 365 transitions. [2018-01-28 21:55:31,350 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 21:55:31,350 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 365 transitions. [2018-01-28 21:55:31,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-28 21:55:31,351 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:55:31,351 INFO L330 BasicCegarLoop]: trace histogram [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-01-28 21:55:31,351 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:55:31,351 INFO L82 PathProgramCache]: Analyzing trace with hash 746128011, now seen corresponding path program 1 times [2018-01-28 21:55:31,351 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:55:31,351 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:55:31,352 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:31,352 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:55:31,352 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:31,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:55:31,360 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:55:31,567 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:55:31,567 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:55:31,568 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 21:55:31,568 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 21:55:31,568 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 21:55:31,568 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:55:31,568 INFO L87 Difference]: Start difference. First operand 333 states and 365 transitions. Second operand 5 states. [2018-01-28 21:55:31,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:55:31,712 INFO L93 Difference]: Finished difference Result 417 states and 453 transitions. [2018-01-28 21:55:31,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 21:55:31,712 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-01-28 21:55:31,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:55:31,713 INFO L225 Difference]: With dead ends: 417 [2018-01-28 21:55:31,714 INFO L226 Difference]: Without dead ends: 414 [2018-01-28 21:55:31,714 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-28 21:55:31,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2018-01-28 21:55:31,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 324. [2018-01-28 21:55:31,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-01-28 21:55:31,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 353 transitions. [2018-01-28 21:55:31,727 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 353 transitions. Word has length 49 [2018-01-28 21:55:31,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:55:31,727 INFO L432 AbstractCegarLoop]: Abstraction has 324 states and 353 transitions. [2018-01-28 21:55:31,727 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 21:55:31,727 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 353 transitions. [2018-01-28 21:55:31,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-28 21:55:31,728 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:55:31,728 INFO L330 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] [2018-01-28 21:55:31,728 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:55:31,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1617028815, now seen corresponding path program 1 times [2018-01-28 21:55:31,728 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:55:31,728 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:55:31,729 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:31,729 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:55:31,729 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:31,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:55:31,740 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:55:31,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:55:31,879 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:55:31,879 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 21:55:31,880 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 21:55:31,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 21:55:31,880 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-28 21:55:31,880 INFO L87 Difference]: Start difference. First operand 324 states and 353 transitions. Second operand 9 states. [2018-01-28 21:55:32,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:55:32,144 INFO L93 Difference]: Finished difference Result 338 states and 369 transitions. [2018-01-28 21:55:32,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 21:55:32,145 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2018-01-28 21:55:32,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:55:32,146 INFO L225 Difference]: With dead ends: 338 [2018-01-28 21:55:32,146 INFO L226 Difference]: Without dead ends: 337 [2018-01-28 21:55:32,146 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-01-28 21:55:32,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-01-28 21:55:32,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 323. [2018-01-28 21:55:32,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-01-28 21:55:32,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 352 transitions. [2018-01-28 21:55:32,154 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 352 transitions. Word has length 49 [2018-01-28 21:55:32,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:55:32,154 INFO L432 AbstractCegarLoop]: Abstraction has 323 states and 352 transitions. [2018-01-28 21:55:32,154 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 21:55:32,154 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 352 transitions. [2018-01-28 21:55:32,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-28 21:55:32,155 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:55:32,155 INFO L330 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] [2018-01-28 21:55:32,155 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:55:32,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1617028814, now seen corresponding path program 1 times [2018-01-28 21:55:32,156 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:55:32,156 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:55:32,156 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:32,157 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:55:32,157 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:32,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:55:32,166 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:55:32,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:55:32,316 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:55:32,317 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 21:55:32,317 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 21:55:32,317 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 21:55:32,317 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-28 21:55:32,317 INFO L87 Difference]: Start difference. First operand 323 states and 352 transitions. Second operand 9 states. [2018-01-28 21:55:32,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:55:32,609 INFO L93 Difference]: Finished difference Result 337 states and 368 transitions. [2018-01-28 21:55:32,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 21:55:32,609 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2018-01-28 21:55:32,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:55:32,611 INFO L225 Difference]: With dead ends: 337 [2018-01-28 21:55:32,611 INFO L226 Difference]: Without dead ends: 336 [2018-01-28 21:55:32,611 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-01-28 21:55:32,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-01-28 21:55:32,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 322. [2018-01-28 21:55:32,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2018-01-28 21:55:32,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 351 transitions. [2018-01-28 21:55:32,618 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 351 transitions. Word has length 49 [2018-01-28 21:55:32,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:55:32,618 INFO L432 AbstractCegarLoop]: Abstraction has 322 states and 351 transitions. [2018-01-28 21:55:32,619 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 21:55:32,619 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 351 transitions. [2018-01-28 21:55:32,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-28 21:55:32,619 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:55:32,619 INFO L330 BasicCegarLoop]: trace histogram [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] [2018-01-28 21:55:32,619 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:55:32,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1330154913, now seen corresponding path program 1 times [2018-01-28 21:55:32,620 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:55:32,620 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:55:32,621 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:32,621 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:55:32,621 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:32,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:55:32,639 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:55:33,091 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:55:33,091 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:55:33,091 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-01-28 21:55:33,092 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-28 21:55:33,092 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-28 21:55:33,092 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-01-28 21:55:33,092 INFO L87 Difference]: Start difference. First operand 322 states and 351 transitions. Second operand 15 states. [2018-01-28 21:55:34,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:55:34,070 INFO L93 Difference]: Finished difference Result 424 states and 460 transitions. [2018-01-28 21:55:34,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-28 21:55:34,070 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2018-01-28 21:55:34,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:55:34,071 INFO L225 Difference]: With dead ends: 424 [2018-01-28 21:55:34,071 INFO L226 Difference]: Without dead ends: 343 [2018-01-28 21:55:34,072 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=189, Invalid=681, Unknown=0, NotChecked=0, Total=870 [2018-01-28 21:55:34,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-01-28 21:55:34,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 322. [2018-01-28 21:55:34,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2018-01-28 21:55:34,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 350 transitions. [2018-01-28 21:55:34,079 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 350 transitions. Word has length 56 [2018-01-28 21:55:34,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:55:34,079 INFO L432 AbstractCegarLoop]: Abstraction has 322 states and 350 transitions. [2018-01-28 21:55:34,079 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-28 21:55:34,080 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 350 transitions. [2018-01-28 21:55:34,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-28 21:55:34,080 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:55:34,080 INFO L330 BasicCegarLoop]: trace histogram [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] [2018-01-28 21:55:34,080 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:55:34,080 INFO L82 PathProgramCache]: Analyzing trace with hash -464527619, now seen corresponding path program 1 times [2018-01-28 21:55:34,080 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:55:34,080 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:55:34,081 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:34,081 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:55:34,081 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:34,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:55:34,096 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:55:34,612 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:55:34,612 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:55:34,612 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-01-28 21:55:34,612 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-28 21:55:34,612 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-28 21:55:34,612 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2018-01-28 21:55:34,612 INFO L87 Difference]: Start difference. First operand 322 states and 350 transitions. Second operand 19 states. [2018-01-28 21:55:35,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:55:35,578 INFO L93 Difference]: Finished difference Result 437 states and 474 transitions. [2018-01-28 21:55:35,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-28 21:55:35,578 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 56 [2018-01-28 21:55:35,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:55:35,580 INFO L225 Difference]: With dead ends: 437 [2018-01-28 21:55:35,580 INFO L226 Difference]: Without dead ends: 343 [2018-01-28 21:55:35,580 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=258, Invalid=1224, Unknown=0, NotChecked=0, Total=1482 [2018-01-28 21:55:35,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-01-28 21:55:35,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 300. [2018-01-28 21:55:35,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-01-28 21:55:35,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 327 transitions. [2018-01-28 21:55:35,587 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 327 transitions. Word has length 56 [2018-01-28 21:55:35,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:55:35,587 INFO L432 AbstractCegarLoop]: Abstraction has 300 states and 327 transitions. [2018-01-28 21:55:35,588 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-28 21:55:35,588 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 327 transitions. [2018-01-28 21:55:35,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-01-28 21:55:35,588 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:55:35,588 INFO L330 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-28 21:55:35,589 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:55:35,589 INFO L82 PathProgramCache]: Analyzing trace with hash 2104195250, now seen corresponding path program 1 times [2018-01-28 21:55:35,589 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:55:35,589 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:55:35,590 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:35,590 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:55:35,590 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:35,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:55:35,600 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:55:36,085 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:55:36,085 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:55:36,121 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-28 21:55:36,127 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:55:36,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:55:36,159 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:55:36,209 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 13 treesize of output 10 [2018-01-28 21:55:36,211 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-01-28 21:55:36,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:55:36,213 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:55:36,229 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 13 treesize of output 10 [2018-01-28 21:55:36,231 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-01-28 21:55:36,231 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:55:36,232 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:55:36,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:55:36,238 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-01-28 21:55:36,333 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:55:36,333 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:55:36,334 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-01-28 21:55:36,334 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:55:36,342 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-01-28 21:55:36,342 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:35 [2018-01-28 21:55:36,378 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 21 treesize of output 19 [2018-01-28 21:55:36,381 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:55:36,382 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-01-28 21:55:36,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:55:36,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:55:36,404 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 21 treesize of output 19 [2018-01-28 21:55:36,411 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:55:36,413 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-01-28 21:55:36,413 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:55:36,420 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:55:36,436 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 1 xjuncts. [2018-01-28 21:55:36,436 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:57, output treesize:39 [2018-01-28 21:55:36,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-01-28 21:55:36,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-28 21:55:36,512 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:55:36,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:55:36,530 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 52 [2018-01-28 21:55:36,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-28 21:55:36,533 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:55:36,539 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:55:36,549 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 1 xjuncts. [2018-01-28 21:55:36,549 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:77, output treesize:61 [2018-01-28 21:55:36,633 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 82 treesize of output 72 [2018-01-28 21:55:36,637 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 20 treesize of output 25 [2018-01-28 21:55:36,638 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:55:36,647 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:55:36,667 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 37 [2018-01-28 21:55:36,670 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 20 treesize of output 25 [2018-01-28 21:55:36,671 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:55:36,676 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:55:36,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-28 21:55:36,690 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:103, output treesize:87 [2018-01-28 21:55:39,178 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 53 treesize of output 44 [2018-01-28 21:55:39,180 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-01-28 21:55:39,180 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:55:39,188 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:55:39,189 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:55:39,189 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 21:55:39,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2018-01-28 21:55:39,192 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:55:39,198 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:55:39,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-01-28 21:55:39,215 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-01-28 21:55:39,215 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-28 21:55:39,220 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 21:55:39,221 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-01-28 21:55:39,221 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 21:55:39,224 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:55:39,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:55:39,231 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:80, output treesize:7 [2018-01-28 21:55:39,295 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-28 21:55:39,315 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-28 21:55:39,315 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [16] total 30 [2018-01-28 21:55:39,316 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-28 21:55:39,316 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-28 21:55:39,316 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=770, Unknown=2, NotChecked=0, Total=870 [2018-01-28 21:55:39,316 INFO L87 Difference]: Start difference. First operand 300 states and 327 transitions. Second operand 30 states. [2018-01-28 21:55:51,249 WARN L146 SmtUtils]: Spent 2065ms on a formula simplification. DAG size of input: 83 DAG size of output 47 [2018-01-28 21:55:56,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:55:56,846 INFO L93 Difference]: Finished difference Result 666 states and 727 transitions. [2018-01-28 21:55:56,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-28 21:55:56,846 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 71 [2018-01-28 21:55:56,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:55:56,847 INFO L225 Difference]: With dead ends: 666 [2018-01-28 21:55:56,848 INFO L226 Difference]: Without dead ends: 377 [2018-01-28 21:55:56,848 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=685, Invalid=2168, Unknown=9, NotChecked=0, Total=2862 [2018-01-28 21:55:56,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-01-28 21:55:56,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 350. [2018-01-28 21:55:56,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-01-28 21:55:56,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 381 transitions. [2018-01-28 21:55:56,857 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 381 transitions. Word has length 71 [2018-01-28 21:55:56,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:55:56,857 INFO L432 AbstractCegarLoop]: Abstraction has 350 states and 381 transitions. [2018-01-28 21:55:56,857 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-28 21:55:56,858 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 381 transitions. [2018-01-28 21:55:56,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-01-28 21:55:56,858 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:55:56,858 INFO L330 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-28 21:55:56,858 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:55:56,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1336970885, now seen corresponding path program 1 times [2018-01-28 21:55:56,859 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:55:56,859 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:55:56,859 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:56,859 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:55:56,859 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:55:56,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:55:56,869 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:55:57,253 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:55:57,253 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:55:57,253 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-28 21:55:57,267 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:55:57,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:55:57,296 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:55:57,529 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:55:57,529 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:55:57,530 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-01-28 21:55:57,530 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:55:57,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:55:57,538 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:31 [2018-01-28 21:55:57,565 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 21 treesize of output 16 [2018-01-28 21:55:57,568 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:55:57,570 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-01-28 21:55:57,570 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:55:57,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:55:57,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 21 treesize of output 16 [2018-01-28 21:55:57,634 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:55:57,636 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-01-28 21:55:57,636 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:55:57,640 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:55:57,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:55:57,652 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:57, output treesize:37 [2018-01-28 21:55:57,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2018-01-28 21:55:57,716 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 14 treesize of output 13 [2018-01-28 21:55:57,716 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:55:57,721 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:55:57,739 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 54 treesize of output 58 [2018-01-28 21:55:57,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-28 21:55:57,741 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:55:57,748 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:55:57,760 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:55:57,760 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:83, output treesize:63 [2018-01-28 21:55:57,846 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 94 treesize of output 80 [2018-01-28 21:55:57,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-01-28 21:55:57,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:55:57,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:55:57,878 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 46 treesize of output 39 [2018-01-28 21:55:57,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-01-28 21:55:57,882 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:55:57,887 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:55:57,901 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 1 xjuncts. [2018-01-28 21:55:57,901 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:107, output treesize:87 [2018-01-28 21:56:04,011 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 55 treesize of output 46 [2018-01-28 21:56:04,013 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:56:04,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2018-01-28 21:56:04,015 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:56:04,021 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-01-28 21:56:04,021 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 21:56:04,025 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:56:04,033 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 24 treesize of output 22 [2018-01-28 21:56:04,035 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-01-28 21:56:04,035 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-28 21:56:04,039 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-01-28 21:56:04,039 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 21:56:04,040 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:56:04,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:56:04,044 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:75, output treesize:7 [2018-01-28 21:56:04,068 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:56:04,087 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:56:04,088 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 29 [2018-01-28 21:56:04,088 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-28 21:56:04,088 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-28 21:56:04,088 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=676, Unknown=3, NotChecked=0, Total=812 [2018-01-28 21:56:04,089 INFO L87 Difference]: Start difference. First operand 350 states and 381 transitions. Second operand 29 states. [2018-01-28 21:56:39,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:56:39,383 INFO L93 Difference]: Finished difference Result 805 states and 880 transitions. [2018-01-28 21:56:39,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-28 21:56:39,383 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 73 [2018-01-28 21:56:39,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:56:39,385 INFO L225 Difference]: With dead ends: 805 [2018-01-28 21:56:39,385 INFO L226 Difference]: Without dead ends: 497 [2018-01-28 21:56:39,386 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 791 ImplicationChecksByTransitivity, 32.4s TimeCoverageRelationStatistics Valid=786, Invalid=2504, Unknown=16, NotChecked=0, Total=3306 [2018-01-28 21:56:39,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2018-01-28 21:56:39,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 410. [2018-01-28 21:56:39,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-01-28 21:56:39,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 448 transitions. [2018-01-28 21:56:39,398 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 448 transitions. Word has length 73 [2018-01-28 21:56:39,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:56:39,398 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 448 transitions. [2018-01-28 21:56:39,398 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-28 21:56:39,398 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 448 transitions. [2018-01-28 21:56:39,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-01-28 21:56:39,399 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:56:39,399 INFO L330 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:56:39,399 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:56:39,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1747727066, now seen corresponding path program 1 times [2018-01-28 21:56:39,399 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:56:39,400 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:56:39,400 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:56:39,400 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:56:39,400 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:56:39,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:56:39,413 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:56:40,069 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:56:40,069 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:56:40,069 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-01-28 21:56:40,069 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-28 21:56:40,070 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-28 21:56:40,070 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2018-01-28 21:56:40,070 INFO L87 Difference]: Start difference. First operand 410 states and 448 transitions. Second operand 23 states. [2018-01-28 21:56:41,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:56:41,261 INFO L93 Difference]: Finished difference Result 830 states and 915 transitions. [2018-01-28 21:56:41,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-01-28 21:56:41,261 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 81 [2018-01-28 21:56:41,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:56:41,264 INFO L225 Difference]: With dead ends: 830 [2018-01-28 21:56:41,264 INFO L226 Difference]: Without dead ends: 823 [2018-01-28 21:56:41,264 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=458, Invalid=1992, Unknown=0, NotChecked=0, Total=2450 [2018-01-28 21:56:41,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2018-01-28 21:56:41,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 554. [2018-01-28 21:56:41,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2018-01-28 21:56:41,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 620 transitions. [2018-01-28 21:56:41,282 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 620 transitions. Word has length 81 [2018-01-28 21:56:41,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:56:41,282 INFO L432 AbstractCegarLoop]: Abstraction has 554 states and 620 transitions. [2018-01-28 21:56:41,282 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-28 21:56:41,282 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 620 transitions. [2018-01-28 21:56:41,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-01-28 21:56:41,283 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:56:41,283 INFO L330 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:56:41,283 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:56:41,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1098283958, now seen corresponding path program 1 times [2018-01-28 21:56:41,284 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:56:41,284 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:56:41,285 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:56:41,285 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:56:41,285 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:56:41,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:56:41,300 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:56:41,732 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:56:41,732 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:56:41,750 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-01-28 21:56:41,750 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-28 21:56:41,750 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-28 21:56:41,750 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2018-01-28 21:56:41,750 INFO L87 Difference]: Start difference. First operand 554 states and 620 transitions. Second operand 23 states. [2018-01-28 21:56:43,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:56:43,053 INFO L93 Difference]: Finished difference Result 1064 states and 1184 transitions. [2018-01-28 21:56:43,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-28 21:56:43,054 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 81 [2018-01-28 21:56:43,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:56:43,056 INFO L225 Difference]: With dead ends: 1064 [2018-01-28 21:56:43,056 INFO L226 Difference]: Without dead ends: 987 [2018-01-28 21:56:43,057 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=384, Invalid=1778, Unknown=0, NotChecked=0, Total=2162 [2018-01-28 21:56:43,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2018-01-28 21:56:43,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 693. [2018-01-28 21:56:43,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 693 states. [2018-01-28 21:56:43,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 786 transitions. [2018-01-28 21:56:43,078 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 786 transitions. Word has length 81 [2018-01-28 21:56:43,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:56:43,078 INFO L432 AbstractCegarLoop]: Abstraction has 693 states and 786 transitions. [2018-01-28 21:56:43,078 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-28 21:56:43,078 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 786 transitions. [2018-01-28 21:56:43,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-01-28 21:56:43,079 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:56:43,079 INFO L330 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-28 21:56:43,079 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:56:43,080 INFO L82 PathProgramCache]: Analyzing trace with hash -528873395, now seen corresponding path program 1 times [2018-01-28 21:56:43,080 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:56:43,080 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:56:43,080 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:56:43,080 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:56:43,080 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:56:43,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:56:43,094 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:56:43,258 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:56:43,258 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:56:43,258 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-28 21:56:43,267 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:56:43,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:56:43,306 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:56:43,335 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:56:43,336 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:56:43,337 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-01-28 21:56:43,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:56:43,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:56:43,368 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-01-28 21:56:43,384 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-01-28 21:56:43,386 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-01-28 21:56:43,386 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:56:43,387 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:56:43,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:56:43,394 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:33 [2018-01-28 21:56:43,428 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 45 treesize of output 39 [2018-01-28 21:56:43,429 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 14 treesize of output 13 [2018-01-28 21:56:43,430 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:56:43,434 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:56:43,440 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-01-28 21:56:43,440 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:46 [2018-01-28 21:56:43,482 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 60 treesize of output 46 [2018-01-28 21:56:43,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-01-28 21:56:43,485 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:56:43,490 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:56:43,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-28 21:56:43,497 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:55 [2018-01-28 21:56:49,558 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 46 treesize of output 32 [2018-01-28 21:56:49,560 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-01-28 21:56:49,560 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:56:49,564 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-01-28 21:56:49,564 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 21:56:49,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:56:49,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:56:49,570 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:51, output treesize:15 [2018-01-28 21:56:49,631 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:56:49,651 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:56:49,651 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2018-01-28 21:56:49,652 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-28 21:56:49,652 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-28 21:56:49,652 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=331, Unknown=3, NotChecked=0, Total=420 [2018-01-28 21:56:49,652 INFO L87 Difference]: Start difference. First operand 693 states and 786 transitions. Second operand 21 states. Received shutdown request... [2018-01-28 21:57:36,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-28 21:57:36,535 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-28 21:57:36,540 WARN L185 ceAbstractionStarter]: Timeout [2018-01-28 21:57:36,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 09:57:36 BoogieIcfgContainer [2018-01-28 21:57:36,541 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-28 21:57:36,542 INFO L168 Benchmark]: Toolchain (without parser) took 141247.09 ms. Allocated memory was 297.3 MB in the beginning and 705.2 MB in the end (delta: 407.9 MB). Free memory was 257.3 MB in the beginning and 552.7 MB in the end (delta: -295.4 MB). Peak memory consumption was 112.5 MB. Max. memory is 5.3 GB. [2018-01-28 21:57:36,543 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 297.3 MB. Free memory is still 263.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-28 21:57:36,543 INFO L168 Benchmark]: CACSL2BoogieTranslator took 211.67 ms. Allocated memory is still 297.3 MB. Free memory was 256.3 MB in the beginning and 245.2 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-01-28 21:57:36,543 INFO L168 Benchmark]: Boogie Preprocessor took 32.12 ms. Allocated memory is still 297.3 MB. Free memory was 245.2 MB in the beginning and 243.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-28 21:57:36,543 INFO L168 Benchmark]: RCFGBuilder took 573.31 ms. Allocated memory is still 297.3 MB. Free memory was 243.2 MB in the beginning and 201.2 MB in the end (delta: 42.0 MB). Peak memory consumption was 42.0 MB. Max. memory is 5.3 GB. [2018-01-28 21:57:36,543 INFO L168 Benchmark]: TraceAbstraction took 140420.75 ms. Allocated memory was 297.3 MB in the beginning and 705.2 MB in the end (delta: 407.9 MB). Free memory was 201.2 MB in the beginning and 552.7 MB in the end (delta: -351.5 MB). Peak memory consumption was 56.4 MB. Max. memory is 5.3 GB. [2018-01-28 21:57:36,544 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.18 ms. Allocated memory is still 297.3 MB. Free memory is still 263.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 211.67 ms. Allocated memory is still 297.3 MB. Free memory was 256.3 MB in the beginning and 245.2 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.12 ms. Allocated memory is still 297.3 MB. Free memory was 245.2 MB in the beginning and 243.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 573.31 ms. Allocated memory is still 297.3 MB. Free memory was 243.2 MB in the beginning and 201.2 MB in the end (delta: 42.0 MB). Peak memory consumption was 42.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 140420.75 ms. Allocated memory was 297.3 MB in the beginning and 705.2 MB in the end (delta: 407.9 MB). Free memory was 201.2 MB in the beginning and 552.7 MB in the end (delta: -351.5 MB). Peak memory consumption was 56.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 672). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 662). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 620]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 620). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 668). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 672). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 659). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 668). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 662). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 659). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was constructing difference of abstraction (693states) and interpolant automaton (currently 19 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 44. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 189 locations, 65 error locations. TIMEOUT Result, 140.3s OverallTime, 42 OverallIterations, 3 TraceHistogramMax, 114.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6707 SDtfs, 13799 SDslu, 27100 SDs, 0 SdLazy, 15506 SolverSat, 966 SolverUnsat, 50 SolverUnknown, 0 SolverNotchecked, 34.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 934 GetRequests, 328 SyntacticMatches, 31 SemanticMatches, 574 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3328 ImplicationChecksByTransitivity, 89.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=693occurred in iteration=41, 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.4s AutomataMinimizationTime, 41 MinimizatonAttempts, 2600 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 23.7s InterpolantComputationTime, 2070 NumberOfCodeBlocks, 2070 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 2023 ConstructedInterpolants, 83 QuantifiedInterpolants, 1115935 SizeOfPredicates, 78 NumberOfNonLiveVariables, 986 ConjunctsInSsa, 139 ConjunctsInUnsatCore, 47 InterpolantComputations, 38 PerfectInterpolantSequences, 98/152 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_stack_true-valid-memsafety_false-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-28_21-57-36-554.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_stack_true-valid-memsafety_false-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-28_21-57-36-554.csv Completed graceful shutdown