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/ldv-memsafety/memleaks_test19_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-30 00:15:40,094 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 00:15:40,096 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 00:15:40,109 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 00:15:40,110 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 00:15:40,110 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 00:15:40,112 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 00:15:40,113 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 00:15:40,115 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 00:15:40,116 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 00:15:40,117 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 00:15:40,117 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 00:15:40,118 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 00:15:40,120 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 00:15:40,120 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 00:15:40,123 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 00:15:40,125 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 00:15:40,126 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 00:15:40,128 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 00:15:40,129 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 00:15:40,131 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 00:15:40,131 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 00:15:40,131 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 00:15:40,132 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 00:15:40,133 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 00:15:40,134 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 00:15:40,134 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 00:15:40,135 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 00:15:40,135 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 00:15:40,135 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 00:15:40,136 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 00:15:40,136 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-30 00:15:40,145 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 00:15:40,146 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 00:15:40,146 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 00:15:40,147 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 00:15:40,147 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 00:15:40,147 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 00:15:40,147 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 00:15:40,148 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 00:15:40,148 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 00:15:40,148 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-30 00:15:40,148 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 00:15:40,149 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 00:15:40,149 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 00:15:40,149 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-30 00:15:40,149 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-30 00:15:40,149 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-30 00:15:40,150 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 00:15:40,150 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 00:15:40,150 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 00:15:40,150 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 00:15:40,150 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 00:15:40,151 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 00:15:40,151 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 00:15:40,151 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 00:15:40,151 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 00:15:40,151 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 00:15:40,152 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 00:15:40,152 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 00:15:40,152 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 00:15:40,152 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 00:15:40,152 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 00:15:40,153 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 00:15:40,153 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 00:15:40,154 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 00:15:40,187 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 00:15:40,199 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 00:15:40,203 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 00:15:40,205 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 00:15:40,205 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 00:15:40,206 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test19_true-valid-memsafety_true-termination.i [2018-01-30 00:15:40,402 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 00:15:40,409 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-30 00:15:40,410 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 00:15:40,410 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 00:15:40,417 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 00:15:40,418 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:15:40" (1/1) ... [2018-01-30 00:15:40,421 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@715ee194 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:15:40, skipping insertion in model container [2018-01-30 00:15:40,422 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:15:40" (1/1) ... [2018-01-30 00:15:40,440 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:15:40,492 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:15:40,603 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:15:40,619 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:15:40,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:15:40 WrapperNode [2018-01-30 00:15:40,626 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 00:15:40,627 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 00:15:40,627 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 00:15:40,627 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 00:15:40,639 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:15:40" (1/1) ... [2018-01-30 00:15:40,639 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:15:40" (1/1) ... [2018-01-30 00:15:40,651 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:15:40" (1/1) ... [2018-01-30 00:15:40,652 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:15:40" (1/1) ... [2018-01-30 00:15:40,656 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:15:40" (1/1) ... [2018-01-30 00:15:40,658 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:15:40" (1/1) ... [2018-01-30 00:15:40,659 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:15:40" (1/1) ... [2018-01-30 00:15:40,661 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 00:15:40,661 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 00:15:40,661 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 00:15:40,661 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 00:15:40,662 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:15:40" (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-30 00:15:40,706 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 00:15:40,706 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 00:15:40,706 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-30 00:15:40,706 INFO L136 BoogieDeclarations]: Found implementation of procedure f19 [2018-01-30 00:15:40,706 INFO L136 BoogieDeclarations]: Found implementation of procedure f19_undo [2018-01-30 00:15:40,706 INFO L136 BoogieDeclarations]: Found implementation of procedure g19 [2018-01-30 00:15:40,707 INFO L136 BoogieDeclarations]: Found implementation of procedure probe_19 [2018-01-30 00:15:40,707 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_19 [2018-01-30 00:15:40,707 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-30 00:15:40,707 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 00:15:40,707 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-30 00:15:40,707 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-30 00:15:40,708 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-30 00:15:40,708 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-30 00:15:40,708 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-30 00:15:40,708 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-30 00:15:40,708 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-30 00:15:40,708 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 00:15:40,708 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-30 00:15:40,709 INFO L128 BoogieDeclarations]: Found specification of procedure f19 [2018-01-30 00:15:40,709 INFO L128 BoogieDeclarations]: Found specification of procedure f19_undo [2018-01-30 00:15:40,709 INFO L128 BoogieDeclarations]: Found specification of procedure g19 [2018-01-30 00:15:40,709 INFO L128 BoogieDeclarations]: Found specification of procedure probe_19 [2018-01-30 00:15:40,709 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_19 [2018-01-30 00:15:40,710 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-30 00:15:40,710 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 00:15:40,710 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 00:15:40,710 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 00:15:41,020 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 00:15:41,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:15:41 BoogieIcfgContainer [2018-01-30 00:15:41,021 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 00:15:41,022 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 00:15:41,022 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 00:15:41,025 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 00:15:41,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 12:15:40" (1/3) ... [2018-01-30 00:15:41,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cde86d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:15:41, skipping insertion in model container [2018-01-30 00:15:41,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:15:40" (2/3) ... [2018-01-30 00:15:41,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cde86d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:15:41, skipping insertion in model container [2018-01-30 00:15:41,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:15:41" (3/3) ... [2018-01-30 00:15:41,029 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test19_true-valid-memsafety_true-termination.i [2018-01-30 00:15:41,038 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 00:15:41,044 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-01-30 00:15:41,090 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 00:15:41,090 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 00:15:41,090 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 00:15:41,090 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 00:15:41,090 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 00:15:41,091 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 00:15:41,091 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 00:15:41,091 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 00:15:41,091 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 00:15:41,107 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states. [2018-01-30 00:15:41,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-30 00:15:41,112 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:15:41,113 INFO L350 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-30 00:15:41,113 INFO L371 AbstractCegarLoop]: === Iteration 1 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-30 00:15:41,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1450049695, now seen corresponding path program 1 times [2018-01-30 00:15:41,118 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:15:41,118 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:15:41,163 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:41,163 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:41,163 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:41,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:41,229 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:15:41,388 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-30 00:15:41,391 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:15:41,391 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:15:41,392 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:15:41,476 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:15:41,476 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:15:41,478 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 6 states. [2018-01-30 00:15:41,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:15:41,915 INFO L93 Difference]: Finished difference Result 181 states and 205 transitions. [2018-01-30 00:15:41,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:15:41,917 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-01-30 00:15:41,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:15:41,931 INFO L225 Difference]: With dead ends: 181 [2018-01-30 00:15:41,931 INFO L226 Difference]: Without dead ends: 175 [2018-01-30 00:15:41,934 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:15:41,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-01-30 00:15:41,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 125. [2018-01-30 00:15:41,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-30 00:15:41,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 141 transitions. [2018-01-30 00:15:41,981 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 141 transitions. Word has length 20 [2018-01-30 00:15:41,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:15:41,981 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 141 transitions. [2018-01-30 00:15:41,981 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:15:41,982 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 141 transitions. [2018-01-30 00:15:41,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-30 00:15:41,983 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:15:41,984 INFO L350 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-30 00:15:41,984 INFO L371 AbstractCegarLoop]: === Iteration 2 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-30 00:15:41,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1450049696, now seen corresponding path program 1 times [2018-01-30 00:15:41,984 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:15:41,984 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:15:41,986 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:41,986 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:41,986 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:42,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:42,005 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:15:42,148 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-30 00:15:42,148 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:15:42,148 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:15:42,150 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:15:42,150 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:15:42,150 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:15:42,150 INFO L87 Difference]: Start difference. First operand 125 states and 141 transitions. Second operand 6 states. [2018-01-30 00:15:42,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:15:42,451 INFO L93 Difference]: Finished difference Result 167 states and 188 transitions. [2018-01-30 00:15:42,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:15:42,452 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-01-30 00:15:42,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:15:42,455 INFO L225 Difference]: With dead ends: 167 [2018-01-30 00:15:42,455 INFO L226 Difference]: Without dead ends: 164 [2018-01-30 00:15:42,456 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:15:42,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-01-30 00:15:42,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 142. [2018-01-30 00:15:42,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-01-30 00:15:42,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 165 transitions. [2018-01-30 00:15:42,478 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 165 transitions. Word has length 20 [2018-01-30 00:15:42,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:15:42,479 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 165 transitions. [2018-01-30 00:15:42,479 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:15:42,479 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 165 transitions. [2018-01-30 00:15:42,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-30 00:15:42,480 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:15:42,480 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:15:42,480 INFO L371 AbstractCegarLoop]: === Iteration 3 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-30 00:15:42,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1666557696, now seen corresponding path program 1 times [2018-01-30 00:15:42,481 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:15:42,481 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:15:42,482 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:42,482 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:42,483 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:42,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:42,505 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:15:42,622 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-30 00:15:42,622 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:15:42,622 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-30 00:15:42,622 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 00:15:42,623 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 00:15:42,623 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:15:42,623 INFO L87 Difference]: Start difference. First operand 142 states and 165 transitions. Second operand 8 states. [2018-01-30 00:15:43,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:15:43,070 INFO L93 Difference]: Finished difference Result 195 states and 223 transitions. [2018-01-30 00:15:43,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-30 00:15:43,071 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-01-30 00:15:43,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:15:43,072 INFO L225 Difference]: With dead ends: 195 [2018-01-30 00:15:43,072 INFO L226 Difference]: Without dead ends: 193 [2018-01-30 00:15:43,073 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-01-30 00:15:43,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-01-30 00:15:43,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 137. [2018-01-30 00:15:43,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-01-30 00:15:43,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 159 transitions. [2018-01-30 00:15:43,092 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 159 transitions. Word has length 21 [2018-01-30 00:15:43,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:15:43,092 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 159 transitions. [2018-01-30 00:15:43,092 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 00:15:43,092 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 159 transitions. [2018-01-30 00:15:43,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-30 00:15:43,093 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:15:43,093 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:15:43,093 INFO L371 AbstractCegarLoop]: === Iteration 4 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-30 00:15:43,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1666557695, now seen corresponding path program 1 times [2018-01-30 00:15:43,094 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:15:43,094 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:15:43,095 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:43,095 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:43,095 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:43,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:43,110 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:15:43,224 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-30 00:15:43,224 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:15:43,224 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-30 00:15:43,225 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 00:15:43,225 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 00:15:43,225 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-30 00:15:43,226 INFO L87 Difference]: Start difference. First operand 137 states and 159 transitions. Second operand 9 states. [2018-01-30 00:15:43,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:15:43,674 INFO L93 Difference]: Finished difference Result 200 states and 230 transitions. [2018-01-30 00:15:43,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-30 00:15:43,674 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-01-30 00:15:43,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:15:43,677 INFO L225 Difference]: With dead ends: 200 [2018-01-30 00:15:43,677 INFO L226 Difference]: Without dead ends: 197 [2018-01-30 00:15:43,677 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-01-30 00:15:43,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-01-30 00:15:43,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 104. [2018-01-30 00:15:43,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-01-30 00:15:43,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2018-01-30 00:15:43,694 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 21 [2018-01-30 00:15:43,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:15:43,694 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2018-01-30 00:15:43,694 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 00:15:43,694 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2018-01-30 00:15:43,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-30 00:15:43,695 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:15:43,696 INFO L350 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] [2018-01-30 00:15:43,696 INFO L371 AbstractCegarLoop]: === Iteration 5 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-30 00:15:43,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1931784256, now seen corresponding path program 1 times [2018-01-30 00:15:43,696 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:15:43,696 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:15:43,697 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:43,697 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:43,724 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:43,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:43,739 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:15:43,793 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-30 00:15:43,793 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:15:43,793 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-30 00:15:43,793 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 00:15:43,794 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 00:15:43,794 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:15:43,794 INFO L87 Difference]: Start difference. First operand 104 states and 111 transitions. Second operand 8 states. [2018-01-30 00:15:43,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:15:43,966 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2018-01-30 00:15:43,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 00:15:43,966 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-01-30 00:15:43,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:15:43,967 INFO L225 Difference]: With dead ends: 120 [2018-01-30 00:15:43,967 INFO L226 Difference]: Without dead ends: 119 [2018-01-30 00:15:43,967 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-30 00:15:43,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-30 00:15:43,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 114. [2018-01-30 00:15:43,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-30 00:15:43,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 124 transitions. [2018-01-30 00:15:43,982 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 124 transitions. Word has length 34 [2018-01-30 00:15:43,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:15:43,983 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 124 transitions. [2018-01-30 00:15:43,983 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 00:15:43,983 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 124 transitions. [2018-01-30 00:15:43,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-30 00:15:43,984 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:15:43,984 INFO L350 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] [2018-01-30 00:15:43,985 INFO L371 AbstractCegarLoop]: === Iteration 6 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-30 00:15:43,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1931784257, now seen corresponding path program 1 times [2018-01-30 00:15:43,985 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:15:43,985 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:15:43,986 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:43,987 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:43,987 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:43,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:44,000 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:15:44,059 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-30 00:15:44,059 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:15:44,059 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 00:15:44,059 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:15:44,060 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:15:44,060 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:15:44,060 INFO L87 Difference]: Start difference. First operand 114 states and 124 transitions. Second operand 6 states. [2018-01-30 00:15:44,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:15:44,091 INFO L93 Difference]: Finished difference Result 142 states and 149 transitions. [2018-01-30 00:15:44,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:15:44,091 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-01-30 00:15:44,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:15:44,092 INFO L225 Difference]: With dead ends: 142 [2018-01-30 00:15:44,092 INFO L226 Difference]: Without dead ends: 115 [2018-01-30 00:15:44,093 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:15:44,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-01-30 00:15:44,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2018-01-30 00:15:44,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-01-30 00:15:44,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2018-01-30 00:15:44,105 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 34 [2018-01-30 00:15:44,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:15:44,105 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2018-01-30 00:15:44,105 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:15:44,106 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2018-01-30 00:15:44,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-30 00:15:44,106 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:15:44,106 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:15:44,107 INFO L371 AbstractCegarLoop]: === Iteration 7 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-30 00:15:44,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1834967219, now seen corresponding path program 1 times [2018-01-30 00:15:44,107 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:15:44,107 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:15:44,108 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:44,108 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:44,108 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:44,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:44,120 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:15:44,181 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:15:44,181 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:15:44,181 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:15:44,182 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:15:44,182 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:15:44,182 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:15:44,182 INFO L87 Difference]: Start difference. First operand 111 states and 118 transitions. Second operand 6 states. [2018-01-30 00:15:44,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:15:44,426 INFO L93 Difference]: Finished difference Result 169 states and 190 transitions. [2018-01-30 00:15:44,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 00:15:44,427 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-01-30 00:15:44,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:15:44,428 INFO L225 Difference]: With dead ends: 169 [2018-01-30 00:15:44,428 INFO L226 Difference]: Without dead ends: 167 [2018-01-30 00:15:44,429 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-01-30 00:15:44,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-01-30 00:15:44,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 113. [2018-01-30 00:15:44,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-30 00:15:44,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2018-01-30 00:15:44,441 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 35 [2018-01-30 00:15:44,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:15:44,442 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2018-01-30 00:15:44,442 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:15:44,442 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2018-01-30 00:15:44,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-30 00:15:44,443 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:15:44,443 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:15:44,443 INFO L371 AbstractCegarLoop]: === Iteration 8 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-30 00:15:44,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1834967220, now seen corresponding path program 1 times [2018-01-30 00:15:44,444 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:15:44,444 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:15:44,445 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:44,445 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:44,445 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:44,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:44,457 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:15:44,605 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-30 00:15:44,606 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:15:44,606 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-30 00:15:44,606 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 00:15:44,606 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 00:15:44,606 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:15:44,606 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand 8 states. [2018-01-30 00:15:44,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:15:44,989 INFO L93 Difference]: Finished difference Result 181 states and 201 transitions. [2018-01-30 00:15:44,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 00:15:44,989 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-01-30 00:15:44,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:15:44,990 INFO L225 Difference]: With dead ends: 181 [2018-01-30 00:15:44,991 INFO L226 Difference]: Without dead ends: 179 [2018-01-30 00:15:44,991 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-01-30 00:15:44,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-01-30 00:15:45,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 140. [2018-01-30 00:15:45,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-01-30 00:15:45,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 156 transitions. [2018-01-30 00:15:45,004 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 156 transitions. Word has length 35 [2018-01-30 00:15:45,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:15:45,004 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 156 transitions. [2018-01-30 00:15:45,004 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 00:15:45,004 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 156 transitions. [2018-01-30 00:15:45,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-30 00:15:45,006 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:15:45,006 INFO L350 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] [2018-01-30 00:15:45,006 INFO L371 AbstractCegarLoop]: === Iteration 9 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-30 00:15:45,006 INFO L82 PathProgramCache]: Analyzing trace with hash 70064691, now seen corresponding path program 1 times [2018-01-30 00:15:45,006 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:15:45,006 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:15:45,007 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:45,008 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:45,008 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:45,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:45,021 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:15:45,121 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-30 00:15:45,121 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:15:45,121 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-30 00:15:45,121 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 00:15:45,122 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 00:15:45,122 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-30 00:15:45,122 INFO L87 Difference]: Start difference. First operand 140 states and 156 transitions. Second operand 9 states. [2018-01-30 00:15:45,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:15:45,343 INFO L93 Difference]: Finished difference Result 185 states and 207 transitions. [2018-01-30 00:15:45,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-30 00:15:45,344 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-01-30 00:15:45,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:15:45,345 INFO L225 Difference]: With dead ends: 185 [2018-01-30 00:15:45,345 INFO L226 Difference]: Without dead ends: 183 [2018-01-30 00:15:45,346 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-01-30 00:15:45,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-01-30 00:15:45,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 115. [2018-01-30 00:15:45,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-01-30 00:15:45,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 123 transitions. [2018-01-30 00:15:45,361 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 123 transitions. Word has length 36 [2018-01-30 00:15:45,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:15:45,361 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 123 transitions. [2018-01-30 00:15:45,361 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 00:15:45,361 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 123 transitions. [2018-01-30 00:15:45,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-30 00:15:45,362 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:15:45,362 INFO L350 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] [2018-01-30 00:15:45,362 INFO L371 AbstractCegarLoop]: === Iteration 10 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-30 00:15:45,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1675961816, now seen corresponding path program 1 times [2018-01-30 00:15:45,362 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:15:45,362 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:15:45,363 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:45,363 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:45,363 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:45,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:45,374 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:15:45,436 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-30 00:15:45,436 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:15:45,436 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-30 00:15:45,448 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:45,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:45,499 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:15:45,551 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-30 00:15:45,553 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-30 00:15:45,554 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:45,555 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:15:45,569 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-30 00:15:45,583 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-30 00:15:45,583 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:45,585 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:15:45,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:15:45,590 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-01-30 00:15:45,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-30 00:15:45,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-30 00:15:45,609 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:45,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:15:45,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-30 00:15:45,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-30 00:15:45,648 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:45,662 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:15:45,678 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-30 00:15:45,679 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:37, output treesize:7 [2018-01-30 00:15:45,729 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-30 00:15:45,750 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 00:15:45,750 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2018-01-30 00:15:45,750 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 00:15:45,751 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 00:15:45,751 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:15:45,751 INFO L87 Difference]: Start difference. First operand 115 states and 123 transitions. Second operand 7 states. [2018-01-30 00:15:45,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:15:45,925 INFO L93 Difference]: Finished difference Result 214 states and 228 transitions. [2018-01-30 00:15:45,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 00:15:45,925 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-01-30 00:15:45,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:15:45,926 INFO L225 Difference]: With dead ends: 214 [2018-01-30 00:15:45,926 INFO L226 Difference]: Without dead ends: 123 [2018-01-30 00:15:45,927 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:15:45,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-01-30 00:15:45,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2018-01-30 00:15:45,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-30 00:15:45,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2018-01-30 00:15:45,939 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 36 [2018-01-30 00:15:45,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:15:45,939 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions. [2018-01-30 00:15:45,939 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 00:15:45,939 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2018-01-30 00:15:45,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-30 00:15:45,940 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:15:45,940 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:15:45,940 INFO L371 AbstractCegarLoop]: === Iteration 11 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-30 00:15:45,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1496409031, now seen corresponding path program 1 times [2018-01-30 00:15:45,940 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:15:45,941 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:15:45,942 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:45,942 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:45,942 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:45,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:45,954 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:15:46,104 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:15:46,104 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:15:46,104 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-30 00:15:46,104 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 00:15:46,105 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 00:15:46,105 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:15:46,105 INFO L87 Difference]: Start difference. First operand 119 states and 127 transitions. Second operand 8 states. [2018-01-30 00:15:46,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:15:46,446 INFO L93 Difference]: Finished difference Result 155 states and 168 transitions. [2018-01-30 00:15:46,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-30 00:15:46,446 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-01-30 00:15:46,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:15:46,447 INFO L225 Difference]: With dead ends: 155 [2018-01-30 00:15:46,447 INFO L226 Difference]: Without dead ends: 154 [2018-01-30 00:15:46,447 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-01-30 00:15:46,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-30 00:15:46,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 118. [2018-01-30 00:15:46,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-30 00:15:46,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 126 transitions. [2018-01-30 00:15:46,459 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 126 transitions. Word has length 37 [2018-01-30 00:15:46,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:15:46,459 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 126 transitions. [2018-01-30 00:15:46,460 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 00:15:46,460 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 126 transitions. [2018-01-30 00:15:46,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-30 00:15:46,460 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:15:46,461 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:15:46,461 INFO L371 AbstractCegarLoop]: === Iteration 12 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-30 00:15:46,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1496409030, now seen corresponding path program 1 times [2018-01-30 00:15:46,461 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:15:46,461 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:15:46,462 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:46,462 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:46,463 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:46,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:46,475 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:15:46,594 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:15:46,594 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:15:46,594 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-30 00:15:46,595 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-30 00:15:46,595 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-30 00:15:46,595 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-01-30 00:15:46,595 INFO L87 Difference]: Start difference. First operand 118 states and 126 transitions. Second operand 12 states. [2018-01-30 00:15:47,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:15:47,178 INFO L93 Difference]: Finished difference Result 163 states and 175 transitions. [2018-01-30 00:15:47,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-30 00:15:47,179 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2018-01-30 00:15:47,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:15:47,181 INFO L225 Difference]: With dead ends: 163 [2018-01-30 00:15:47,181 INFO L226 Difference]: Without dead ends: 161 [2018-01-30 00:15:47,182 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2018-01-30 00:15:47,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-01-30 00:15:47,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 113. [2018-01-30 00:15:47,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-30 00:15:47,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 121 transitions. [2018-01-30 00:15:47,199 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 121 transitions. Word has length 37 [2018-01-30 00:15:47,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:15:47,200 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 121 transitions. [2018-01-30 00:15:47,200 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-30 00:15:47,200 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 121 transitions. [2018-01-30 00:15:47,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-30 00:15:47,201 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:15:47,201 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:15:47,201 INFO L371 AbstractCegarLoop]: === Iteration 13 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-30 00:15:47,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1047889712, now seen corresponding path program 1 times [2018-01-30 00:15:47,202 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:15:47,202 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:15:47,203 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:47,203 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:47,203 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:47,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:47,212 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:15:47,269 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-30 00:15:47,269 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:15:47,270 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 00:15:47,271 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 00:15:47,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 00:15:47,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:15:47,271 INFO L87 Difference]: Start difference. First operand 113 states and 121 transitions. Second operand 4 states. [2018-01-30 00:15:47,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:15:47,410 INFO L93 Difference]: Finished difference Result 137 states and 145 transitions. [2018-01-30 00:15:47,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 00:15:47,410 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-01-30 00:15:47,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:15:47,411 INFO L225 Difference]: With dead ends: 137 [2018-01-30 00:15:47,411 INFO L226 Difference]: Without dead ends: 119 [2018-01-30 00:15:47,412 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:15:47,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-30 00:15:47,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 109. [2018-01-30 00:15:47,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-01-30 00:15:47,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2018-01-30 00:15:47,426 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 36 [2018-01-30 00:15:47,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:15:47,427 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2018-01-30 00:15:47,427 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 00:15:47,427 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2018-01-30 00:15:47,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-30 00:15:47,427 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:15:47,428 INFO L350 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-30 00:15:47,428 INFO L371 AbstractCegarLoop]: === Iteration 14 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-30 00:15:47,428 INFO L82 PathProgramCache]: Analyzing trace with hash -2124481135, now seen corresponding path program 1 times [2018-01-30 00:15:47,428 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:15:47,428 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:15:47,429 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:47,429 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:47,429 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:47,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:47,438 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:15:47,527 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-30 00:15:47,527 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:15:47,528 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-30 00:15:47,528 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 00:15:47,528 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 00:15:47,528 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:15:47,529 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand 7 states. [2018-01-30 00:15:47,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:15:47,592 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2018-01-30 00:15:47,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 00:15:47,592 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2018-01-30 00:15:47,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:15:47,593 INFO L225 Difference]: With dead ends: 115 [2018-01-30 00:15:47,593 INFO L226 Difference]: Without dead ends: 101 [2018-01-30 00:15:47,594 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-01-30 00:15:47,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-01-30 00:15:47,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-01-30 00:15:47,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-01-30 00:15:47,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2018-01-30 00:15:47,609 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 37 [2018-01-30 00:15:47,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:15:47,609 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2018-01-30 00:15:47,609 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 00:15:47,609 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2018-01-30 00:15:47,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-30 00:15:47,610 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:15:47,610 INFO L350 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-30 00:15:47,610 INFO L371 AbstractCegarLoop]: === Iteration 15 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-30 00:15:47,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1940574048, now seen corresponding path program 1 times [2018-01-30 00:15:47,610 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:15:47,611 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:15:47,612 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:47,612 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:47,612 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:47,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:47,623 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:15:47,674 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-30 00:15:47,674 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:15:47,674 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:15:47,675 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:15:47,675 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:15:47,675 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:15:47,675 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand 5 states. [2018-01-30 00:15:47,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:15:47,746 INFO L93 Difference]: Finished difference Result 149 states and 156 transitions. [2018-01-30 00:15:47,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:15:47,746 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-01-30 00:15:47,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:15:47,747 INFO L225 Difference]: With dead ends: 149 [2018-01-30 00:15:47,748 INFO L226 Difference]: Without dead ends: 109 [2018-01-30 00:15:47,748 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:15:47,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-01-30 00:15:47,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2018-01-30 00:15:47,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-01-30 00:15:47,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2018-01-30 00:15:47,761 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 49 [2018-01-30 00:15:47,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:15:47,761 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2018-01-30 00:15:47,762 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:15:47,762 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2018-01-30 00:15:47,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-30 00:15:47,762 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:15:47,762 INFO L350 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-30 00:15:47,763 INFO L371 AbstractCegarLoop]: === Iteration 16 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-30 00:15:47,763 INFO L82 PathProgramCache]: Analyzing trace with hash -458430141, now seen corresponding path program 1 times [2018-01-30 00:15:47,763 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:15:47,763 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:15:47,764 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:47,764 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:47,764 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:47,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:47,776 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:15:48,335 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-30 00:15:48,335 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:15:48,335 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-30 00:15:48,343 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:48,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:48,378 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:15:48,404 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-30 00:15:48,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 00:15:48,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:48,410 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:15:48,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:15:48,411 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-01-30 00:15:48,515 WARN L1033 $PredicateComparison]: unable to prove that (exists ((f19_~a.offset Int)) (= (store |c_old(#memory_$Pointer$.offset)| |c_f19_#in~a.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_f19_#in~a.base|) f19_~a.offset 0)) |c_#memory_$Pointer$.offset|)) is different from true [2018-01-30 00:15:48,527 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-30 00:15:48,530 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 16 treesize of output 17 [2018-01-30 00:15:48,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:48,545 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:15:48,575 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-30 00:15:48,575 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2018-01-30 00:15:48,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-30 00:15:48,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-30 00:15:48,604 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:48,605 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:15:48,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:15:48,606 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-01-30 00:15:48,611 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-30 00:15:48,632 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 00:15:48,632 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 18 [2018-01-30 00:15:48,632 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-30 00:15:48,633 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-30 00:15:48,633 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=259, Unknown=1, NotChecked=32, Total=342 [2018-01-30 00:15:48,633 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand 19 states. [2018-01-30 00:15:49,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:15:49,262 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2018-01-30 00:15:49,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-30 00:15:49,291 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-01-30 00:15:49,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:15:49,292 INFO L225 Difference]: With dead ends: 107 [2018-01-30 00:15:49,292 INFO L226 Difference]: Without dead ends: 106 [2018-01-30 00:15:49,292 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=130, Invalid=740, Unknown=4, NotChecked=56, Total=930 [2018-01-30 00:15:49,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-01-30 00:15:49,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-01-30 00:15:49,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-01-30 00:15:49,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 112 transitions. [2018-01-30 00:15:49,301 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 112 transitions. Word has length 49 [2018-01-30 00:15:49,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:15:49,301 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 112 transitions. [2018-01-30 00:15:49,301 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-30 00:15:49,302 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 112 transitions. [2018-01-30 00:15:49,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-30 00:15:49,302 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:15:49,302 INFO L350 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-30 00:15:49,302 INFO L371 AbstractCegarLoop]: === Iteration 17 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-30 00:15:49,302 INFO L82 PathProgramCache]: Analyzing trace with hash -458430140, now seen corresponding path program 1 times [2018-01-30 00:15:49,302 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:15:49,303 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:15:49,303 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:49,304 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:49,304 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:49,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:49,313 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:15:49,579 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:15:49,579 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:15:49,579 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-30 00:15:49,585 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:49,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:49,616 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:15:49,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 00:15:49,619 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:49,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:15:49,620 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-30 00:15:49,632 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-30 00:15:49,633 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-30 00:15:49,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:49,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:15:49,636 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-30 00:15:49,637 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-01-30 00:15:49,716 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 23 treesize of output 18 [2018-01-30 00:15:49,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 28 [2018-01-30 00:15:49,726 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-30 00:15:49,734 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-30 00:15:49,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-30 00:15:49,742 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:35 [2018-01-30 00:15:49,773 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 28 treesize of output 22 [2018-01-30 00:15:49,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 16 [2018-01-30 00:15:49,781 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-30 00:15:49,790 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:15:49,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2018-01-30 00:15:49,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-30 00:15:49,807 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:49,809 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:15:49,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-01-30 00:15:49,819 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:53, output treesize:24 [2018-01-30 00:15:49,845 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:15:49,865 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:15:49,865 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 22 [2018-01-30 00:15:49,865 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-30 00:15:49,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-30 00:15:49,866 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=431, Unknown=8, NotChecked=0, Total=506 [2018-01-30 00:15:49,866 INFO L87 Difference]: Start difference. First operand 106 states and 112 transitions. Second operand 23 states. [2018-01-30 00:15:50,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:15:50,634 INFO L93 Difference]: Finished difference Result 139 states and 150 transitions. [2018-01-30 00:15:50,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-30 00:15:50,634 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 49 [2018-01-30 00:15:50,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:15:50,635 INFO L225 Difference]: With dead ends: 139 [2018-01-30 00:15:50,635 INFO L226 Difference]: Without dead ends: 138 [2018-01-30 00:15:50,636 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=157, Invalid=1020, Unknown=13, NotChecked=0, Total=1190 [2018-01-30 00:15:50,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-01-30 00:15:50,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 120. [2018-01-30 00:15:50,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-01-30 00:15:50,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2018-01-30 00:15:50,648 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 49 [2018-01-30 00:15:50,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:15:50,649 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2018-01-30 00:15:50,649 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-30 00:15:50,649 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2018-01-30 00:15:50,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-30 00:15:50,649 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:15:50,649 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:15:50,649 INFO L371 AbstractCegarLoop]: === Iteration 18 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-30 00:15:50,650 INFO L82 PathProgramCache]: Analyzing trace with hash 488581789, now seen corresponding path program 1 times [2018-01-30 00:15:50,650 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:15:50,650 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:15:50,650 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:50,651 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:50,651 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:50,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:50,661 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:15:50,706 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-30 00:15:50,706 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:15:50,706 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-30 00:15:50,707 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 00:15:50,707 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 00:15:50,707 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:15:50,707 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 7 states. [2018-01-30 00:15:50,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:15:50,810 INFO L93 Difference]: Finished difference Result 177 states and 187 transitions. [2018-01-30 00:15:50,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 00:15:50,810 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-01-30 00:15:50,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:15:50,811 INFO L225 Difference]: With dead ends: 177 [2018-01-30 00:15:50,811 INFO L226 Difference]: Without dead ends: 115 [2018-01-30 00:15:50,812 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-01-30 00:15:50,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-01-30 00:15:50,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2018-01-30 00:15:50,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-01-30 00:15:50,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 117 transitions. [2018-01-30 00:15:50,825 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 117 transitions. Word has length 50 [2018-01-30 00:15:50,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:15:50,825 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 117 transitions. [2018-01-30 00:15:50,825 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 00:15:50,825 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 117 transitions. [2018-01-30 00:15:50,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-30 00:15:50,826 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:15:50,826 INFO L350 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] [2018-01-30 00:15:50,826 INFO L371 AbstractCegarLoop]: === Iteration 19 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-30 00:15:50,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1248900333, now seen corresponding path program 1 times [2018-01-30 00:15:50,826 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:15:50,826 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:15:50,827 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:50,828 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:50,828 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:50,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:50,838 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:15:50,904 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-30 00:15:50,904 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:15:50,904 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 00:15:50,905 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:15:50,905 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:15:50,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:15:50,905 INFO L87 Difference]: Start difference. First operand 111 states and 117 transitions. Second operand 6 states. [2018-01-30 00:15:50,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:15:50,998 INFO L93 Difference]: Finished difference Result 172 states and 180 transitions. [2018-01-30 00:15:50,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:15:50,998 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2018-01-30 00:15:50,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:15:50,999 INFO L225 Difference]: With dead ends: 172 [2018-01-30 00:15:50,999 INFO L226 Difference]: Without dead ends: 111 [2018-01-30 00:15:51,000 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:15:51,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-30 00:15:51,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-01-30 00:15:51,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-01-30 00:15:51,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 116 transitions. [2018-01-30 00:15:51,015 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 116 transitions. Word has length 60 [2018-01-30 00:15:51,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:15:51,016 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 116 transitions. [2018-01-30 00:15:51,016 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:15:51,016 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 116 transitions. [2018-01-30 00:15:51,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-30 00:15:51,017 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:15:51,017 INFO L350 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] [2018-01-30 00:15:51,017 INFO L371 AbstractCegarLoop]: === Iteration 20 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-30 00:15:51,017 INFO L82 PathProgramCache]: Analyzing trace with hash 634445456, now seen corresponding path program 1 times [2018-01-30 00:15:51,017 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:15:51,017 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:15:51,018 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:51,019 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:51,019 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:51,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:51,029 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:15:51,071 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-30 00:15:51,071 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:15:51,072 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:15:51,072 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:15:51,072 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:15:51,072 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:15:51,072 INFO L87 Difference]: Start difference. First operand 111 states and 116 transitions. Second operand 6 states. [2018-01-30 00:15:51,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:15:51,272 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2018-01-30 00:15:51,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:15:51,273 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2018-01-30 00:15:51,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:15:51,274 INFO L225 Difference]: With dead ends: 128 [2018-01-30 00:15:51,274 INFO L226 Difference]: Without dead ends: 127 [2018-01-30 00:15:51,274 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-30 00:15:51,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-01-30 00:15:51,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 119. [2018-01-30 00:15:51,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-30 00:15:51,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 128 transitions. [2018-01-30 00:15:51,291 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 128 transitions. Word has length 60 [2018-01-30 00:15:51,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:15:51,291 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 128 transitions. [2018-01-30 00:15:51,291 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:15:51,291 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 128 transitions. [2018-01-30 00:15:51,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-30 00:15:51,292 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:15:51,292 INFO L350 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] [2018-01-30 00:15:51,293 INFO L371 AbstractCegarLoop]: === Iteration 21 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-30 00:15:51,293 INFO L82 PathProgramCache]: Analyzing trace with hash 634445457, now seen corresponding path program 1 times [2018-01-30 00:15:51,293 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:15:51,293 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:15:51,294 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:51,294 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:51,294 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:51,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:51,305 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:15:51,365 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-30 00:15:51,365 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:15:51,365 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:15:51,366 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:15:51,366 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:15:51,366 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:15:51,366 INFO L87 Difference]: Start difference. First operand 119 states and 128 transitions. Second operand 5 states. [2018-01-30 00:15:51,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:15:51,403 INFO L93 Difference]: Finished difference Result 170 states and 178 transitions. [2018-01-30 00:15:51,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 00:15:51,403 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2018-01-30 00:15:51,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:15:51,405 INFO L225 Difference]: With dead ends: 170 [2018-01-30 00:15:51,405 INFO L226 Difference]: Without dead ends: 115 [2018-01-30 00:15:51,405 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:15:51,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-01-30 00:15:51,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2018-01-30 00:15:51,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-01-30 00:15:51,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2018-01-30 00:15:51,419 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 60 [2018-01-30 00:15:51,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:15:51,419 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2018-01-30 00:15:51,419 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:15:51,420 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2018-01-30 00:15:51,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-30 00:15:51,420 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:15:51,421 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 00:15:51,421 INFO L371 AbstractCegarLoop]: === Iteration 22 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-30 00:15:51,421 INFO L82 PathProgramCache]: Analyzing trace with hash -375592934, now seen corresponding path program 1 times [2018-01-30 00:15:51,421 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:15:51,421 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:15:51,422 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:51,422 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:51,422 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:51,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:51,435 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:15:51,493 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-30 00:15:51,493 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:15:51,494 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-30 00:15:51,494 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 00:15:51,494 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 00:15:51,494 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:15:51,494 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand 8 states. [2018-01-30 00:15:51,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:15:51,617 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2018-01-30 00:15:51,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 00:15:51,617 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2018-01-30 00:15:51,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:15:51,618 INFO L225 Difference]: With dead ends: 120 [2018-01-30 00:15:51,618 INFO L226 Difference]: Without dead ends: 119 [2018-01-30 00:15:51,618 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-30 00:15:51,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-30 00:15:51,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 113. [2018-01-30 00:15:51,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-30 00:15:51,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 118 transitions. [2018-01-30 00:15:51,631 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 118 transitions. Word has length 61 [2018-01-30 00:15:51,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:15:51,632 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 118 transitions. [2018-01-30 00:15:51,632 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 00:15:51,632 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 118 transitions. [2018-01-30 00:15:51,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-30 00:15:51,633 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:15:51,633 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 00:15:51,633 INFO L371 AbstractCegarLoop]: === Iteration 23 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-30 00:15:51,634 INFO L82 PathProgramCache]: Analyzing trace with hash -375592933, now seen corresponding path program 1 times [2018-01-30 00:15:51,634 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:15:51,634 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:15:51,635 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:51,635 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:51,635 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:51,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:51,661 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:15:51,793 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-30 00:15:51,793 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:15:51,793 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-30 00:15:51,793 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-30 00:15:51,794 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-30 00:15:51,794 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-01-30 00:15:51,794 INFO L87 Difference]: Start difference. First operand 113 states and 118 transitions. Second operand 11 states. [2018-01-30 00:15:51,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:15:51,933 INFO L93 Difference]: Finished difference Result 120 states and 123 transitions. [2018-01-30 00:15:51,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-30 00:15:51,933 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 61 [2018-01-30 00:15:51,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:15:51,934 INFO L225 Difference]: With dead ends: 120 [2018-01-30 00:15:51,934 INFO L226 Difference]: Without dead ends: 119 [2018-01-30 00:15:51,934 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-01-30 00:15:51,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-30 00:15:51,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2018-01-30 00:15:51,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-01-30 00:15:51,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 122 transitions. [2018-01-30 00:15:51,945 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 122 transitions. Word has length 61 [2018-01-30 00:15:51,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:15:51,945 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 122 transitions. [2018-01-30 00:15:51,945 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-30 00:15:51,945 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 122 transitions. [2018-01-30 00:15:51,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-30 00:15:51,946 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:15:51,946 INFO L350 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] [2018-01-30 00:15:51,946 INFO L371 AbstractCegarLoop]: === Iteration 24 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-30 00:15:51,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1423740632, now seen corresponding path program 1 times [2018-01-30 00:15:51,946 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:15:51,947 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:15:51,947 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:51,947 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:51,947 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:51,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:51,957 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:15:52,118 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-30 00:15:52,118 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:15:52,118 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-30 00:15:52,118 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 00:15:52,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 00:15:52,118 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:15:52,119 INFO L87 Difference]: Start difference. First operand 117 states and 122 transitions. Second operand 8 states. [2018-01-30 00:15:52,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:15:52,238 INFO L93 Difference]: Finished difference Result 157 states and 162 transitions. [2018-01-30 00:15:52,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 00:15:52,239 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2018-01-30 00:15:52,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:15:52,240 INFO L225 Difference]: With dead ends: 157 [2018-01-30 00:15:52,240 INFO L226 Difference]: Without dead ends: 129 [2018-01-30 00:15:52,241 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-01-30 00:15:52,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-01-30 00:15:52,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 125. [2018-01-30 00:15:52,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-30 00:15:52,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 130 transitions. [2018-01-30 00:15:52,255 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 130 transitions. Word has length 60 [2018-01-30 00:15:52,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:15:52,256 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 130 transitions. [2018-01-30 00:15:52,256 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 00:15:52,258 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 130 transitions. [2018-01-30 00:15:52,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-30 00:15:52,259 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:15:52,259 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 00:15:52,259 INFO L371 AbstractCegarLoop]: === Iteration 25 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-30 00:15:52,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1241520919, now seen corresponding path program 1 times [2018-01-30 00:15:52,259 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:15:52,259 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:15:52,260 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:52,260 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:52,261 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:52,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:52,275 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:15:52,429 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-30 00:15:52,429 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:15:52,430 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-30 00:15:52,430 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-30 00:15:52,430 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-30 00:15:52,430 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-01-30 00:15:52,431 INFO L87 Difference]: Start difference. First operand 125 states and 130 transitions. Second operand 11 states. [2018-01-30 00:15:52,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:15:52,656 INFO L93 Difference]: Finished difference Result 129 states and 132 transitions. [2018-01-30 00:15:52,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-30 00:15:52,656 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2018-01-30 00:15:52,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:15:52,658 INFO L225 Difference]: With dead ends: 129 [2018-01-30 00:15:52,658 INFO L226 Difference]: Without dead ends: 128 [2018-01-30 00:15:52,658 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-01-30 00:15:52,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-01-30 00:15:52,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 125. [2018-01-30 00:15:52,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-30 00:15:52,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 129 transitions. [2018-01-30 00:15:52,671 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 129 transitions. Word has length 62 [2018-01-30 00:15:52,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:15:52,672 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 129 transitions. [2018-01-30 00:15:52,672 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-30 00:15:52,672 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2018-01-30 00:15:52,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-30 00:15:52,673 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:15:52,673 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 00:15:52,673 INFO L371 AbstractCegarLoop]: === Iteration 26 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-30 00:15:52,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1241520918, now seen corresponding path program 1 times [2018-01-30 00:15:52,673 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:15:52,673 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:15:52,674 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:52,675 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:52,675 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:52,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:52,685 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:15:53,011 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-30 00:15:53,011 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:15:53,011 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-30 00:15:53,011 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-30 00:15:53,012 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-30 00:15:53,012 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-01-30 00:15:53,012 INFO L87 Difference]: Start difference. First operand 125 states and 129 transitions. Second operand 11 states. [2018-01-30 00:15:53,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:15:53,165 INFO L93 Difference]: Finished difference Result 126 states and 129 transitions. [2018-01-30 00:15:53,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-30 00:15:53,165 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2018-01-30 00:15:53,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:15:53,166 INFO L225 Difference]: With dead ends: 126 [2018-01-30 00:15:53,166 INFO L226 Difference]: Without dead ends: 125 [2018-01-30 00:15:53,166 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-01-30 00:15:53,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-01-30 00:15:53,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-01-30 00:15:53,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-30 00:15:53,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 128 transitions. [2018-01-30 00:15:53,175 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 128 transitions. Word has length 62 [2018-01-30 00:15:53,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:15:53,175 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 128 transitions. [2018-01-30 00:15:53,175 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-30 00:15:53,175 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 128 transitions. [2018-01-30 00:15:53,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-30 00:15:53,176 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:15:53,176 INFO L350 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] [2018-01-30 00:15:53,176 INFO L371 AbstractCegarLoop]: === Iteration 27 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-30 00:15:53,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1850728504, now seen corresponding path program 1 times [2018-01-30 00:15:53,176 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:15:53,176 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:15:53,177 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:53,177 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:53,177 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:53,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:53,186 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:15:53,944 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-30 00:15:53,944 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:15:53,944 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-30 00:15:53,951 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:53,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:53,982 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:15:54,104 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-30 00:15:54,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-30 00:15:54,108 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:54,110 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:15:54,115 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-30 00:15:54,116 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:34 [2018-01-30 00:15:54,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-01-30 00:15:54,198 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:54,199 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 36 treesize of output 47 [2018-01-30 00:15:54,199 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:54,205 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:15:54,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:15:54,211 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:34 [2018-01-30 00:15:54,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2018-01-30 00:15:54,216 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 35 treesize of output 16 [2018-01-30 00:15:54,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:54,224 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:15:54,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:15:54,228 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:16 [2018-01-30 00:15:54,347 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-30 00:15:54,366 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:15:54,368 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 27 [2018-01-30 00:15:54,368 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-30 00:15:54,368 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-30 00:15:54,368 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=645, Unknown=20, NotChecked=0, Total=756 [2018-01-30 00:15:54,368 INFO L87 Difference]: Start difference. First operand 125 states and 128 transitions. Second operand 28 states. [2018-01-30 00:15:55,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:15:55,182 INFO L93 Difference]: Finished difference Result 131 states and 133 transitions. [2018-01-30 00:15:55,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-30 00:15:55,182 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 62 [2018-01-30 00:15:55,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:15:55,183 INFO L225 Difference]: With dead ends: 131 [2018-01-30 00:15:55,183 INFO L226 Difference]: Without dead ends: 99 [2018-01-30 00:15:55,183 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=170, Invalid=1287, Unknown=25, NotChecked=0, Total=1482 [2018-01-30 00:15:55,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-01-30 00:15:55,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-01-30 00:15:55,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-30 00:15:55,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 101 transitions. [2018-01-30 00:15:55,191 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 101 transitions. Word has length 62 [2018-01-30 00:15:55,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:15:55,191 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 101 transitions. [2018-01-30 00:15:55,191 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-30 00:15:55,191 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 101 transitions. [2018-01-30 00:15:55,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-01-30 00:15:55,192 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:15:55,192 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 00:15:55,192 INFO L371 AbstractCegarLoop]: === Iteration 28 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-30 00:15:55,192 INFO L82 PathProgramCache]: Analyzing trace with hash -945121096, now seen corresponding path program 1 times [2018-01-30 00:15:55,192 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:15:55,192 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:15:55,193 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:55,194 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:55,194 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:55,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:55,205 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:15:55,371 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:15:55,372 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:15:55,372 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-30 00:15:55,372 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-30 00:15:55,372 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-30 00:15:55,372 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-01-30 00:15:55,372 INFO L87 Difference]: Start difference. First operand 99 states and 101 transitions. Second operand 13 states. [2018-01-30 00:15:55,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:15:55,641 INFO L93 Difference]: Finished difference Result 99 states and 101 transitions. [2018-01-30 00:15:55,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-30 00:15:55,641 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2018-01-30 00:15:55,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:15:55,642 INFO L225 Difference]: With dead ends: 99 [2018-01-30 00:15:55,642 INFO L226 Difference]: Without dead ends: 98 [2018-01-30 00:15:55,642 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2018-01-30 00:15:55,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-30 00:15:55,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-01-30 00:15:55,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-30 00:15:55,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2018-01-30 00:15:55,654 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 66 [2018-01-30 00:15:55,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:15:55,655 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2018-01-30 00:15:55,655 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-30 00:15:55,655 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2018-01-30 00:15:55,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-01-30 00:15:55,655 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:15:55,655 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 00:15:55,655 INFO L371 AbstractCegarLoop]: === Iteration 29 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-30 00:15:55,656 INFO L82 PathProgramCache]: Analyzing trace with hash 766017186, now seen corresponding path program 1 times [2018-01-30 00:15:55,656 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:15:55,656 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:15:55,656 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:55,656 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:55,656 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:55,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:55,670 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:15:56,383 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:15:56,384 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:15:56,384 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-30 00:15:56,389 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:56,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:56,415 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:15:56,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 00:15:56,418 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:56,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:15:56,419 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-30 00:15:56,442 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-30 00:15:56,444 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-30 00:15:56,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:56,445 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:15:56,448 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-30 00:15:56,449 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-01-30 00:15:56,657 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:56,658 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:56,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 39 [2018-01-30 00:15:56,659 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:56,670 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 33 treesize of output 26 [2018-01-30 00:15:56,673 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:56,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-01-30 00:15:56,674 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:56,678 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:15:56,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:15:56,684 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:38, output treesize:43 [2018-01-30 00:15:56,802 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 21 treesize of output 14 [2018-01-30 00:15:56,802 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:56,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-30 00:15:56,807 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:26 [2018-01-30 00:16:01,034 WARN L143 SmtUtils]: Spent 4015ms on a formula simplification that was a NOOP. DAG size: 27 [2018-01-30 00:16:01,132 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:16:01,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 35 [2018-01-30 00:16:01,133 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:16:01,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-30 00:16:01,141 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:75, output treesize:51 [2018-01-30 00:16:01,204 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 38 treesize of output 30 [2018-01-30 00:16:01,206 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:16:01,207 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:16:01,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2018-01-30 00:16:01,208 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-30 00:16:01,215 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 00:16:01,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 00:16:01,219 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:15 [2018-01-30 00:16:01,277 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:16:01,301 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 00:16:01,301 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [22] total 35 [2018-01-30 00:16:01,301 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-01-30 00:16:01,301 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-01-30 00:16:01,302 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1144, Unknown=8, NotChecked=0, Total=1260 [2018-01-30 00:16:01,302 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 36 states. [2018-01-30 00:16:05,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:16:05,018 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2018-01-30 00:16:05,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-30 00:16:05,019 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 67 [2018-01-30 00:16:05,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:16:05,019 INFO L225 Difference]: With dead ends: 113 [2018-01-30 00:16:05,019 INFO L226 Difference]: Without dead ends: 112 [2018-01-30 00:16:05,020 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 50 SyntacticMatches, 6 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 671 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=250, Invalid=2498, Unknown=8, NotChecked=0, Total=2756 [2018-01-30 00:16:05,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-30 00:16:05,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 97. [2018-01-30 00:16:05,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-30 00:16:05,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 99 transitions. [2018-01-30 00:16:05,029 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 99 transitions. Word has length 67 [2018-01-30 00:16:05,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:16:05,029 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 99 transitions. [2018-01-30 00:16:05,029 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-01-30 00:16:05,029 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 99 transitions. [2018-01-30 00:16:05,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-01-30 00:16:05,030 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:16:05,030 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 00:16:05,030 INFO L371 AbstractCegarLoop]: === Iteration 30 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-30 00:16:05,030 INFO L82 PathProgramCache]: Analyzing trace with hash 498775454, now seen corresponding path program 1 times [2018-01-30 00:16:05,030 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:16:05,030 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:16:05,031 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:16:05,031 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:16:05,031 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:16:05,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:16:05,041 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:16:05,185 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-30 00:16:05,185 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:16:05,185 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-30 00:16:05,185 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-30 00:16:05,186 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-30 00:16:05,186 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-30 00:16:05,186 INFO L87 Difference]: Start difference. First operand 97 states and 99 transitions. Second operand 10 states. [2018-01-30 00:16:05,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:16:05,412 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2018-01-30 00:16:05,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-30 00:16:05,412 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2018-01-30 00:16:05,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:16:05,413 INFO L225 Difference]: With dead ends: 112 [2018-01-30 00:16:05,413 INFO L226 Difference]: Without dead ends: 111 [2018-01-30 00:16:05,414 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-01-30 00:16:05,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-30 00:16:05,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 106. [2018-01-30 00:16:05,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-01-30 00:16:05,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2018-01-30 00:16:05,426 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 67 [2018-01-30 00:16:05,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:16:05,427 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2018-01-30 00:16:05,427 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-30 00:16:05,427 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2018-01-30 00:16:05,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-01-30 00:16:05,427 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:16:05,428 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 00:16:05,428 INFO L371 AbstractCegarLoop]: === Iteration 31 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-30 00:16:05,428 INFO L82 PathProgramCache]: Analyzing trace with hash 498775455, now seen corresponding path program 1 times [2018-01-30 00:16:05,428 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:16:05,428 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:16:05,429 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:16:05,429 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:16:05,429 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:16:05,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:16:05,441 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:16:05,698 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:16:05,698 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:16:05,698 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-30 00:16:05,698 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-30 00:16:05,699 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-30 00:16:05,699 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-01-30 00:16:05,699 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand 15 states. [2018-01-30 00:16:06,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:16:06,137 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2018-01-30 00:16:06,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-30 00:16:06,137 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2018-01-30 00:16:06,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:16:06,138 INFO L225 Difference]: With dead ends: 106 [2018-01-30 00:16:06,138 INFO L226 Difference]: Without dead ends: 105 [2018-01-30 00:16:06,139 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=537, Unknown=0, NotChecked=0, Total=650 [2018-01-30 00:16:06,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-01-30 00:16:06,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-01-30 00:16:06,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-01-30 00:16:06,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2018-01-30 00:16:06,147 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 67 [2018-01-30 00:16:06,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:16:06,148 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2018-01-30 00:16:06,148 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-30 00:16:06,148 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2018-01-30 00:16:06,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-30 00:16:06,148 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:16:06,148 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 00:16:06,149 INFO L371 AbstractCegarLoop]: === Iteration 32 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-30 00:16:06,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1717830136, now seen corresponding path program 1 times [2018-01-30 00:16:06,149 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:16:06,149 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:16:06,150 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:16:06,150 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:16:06,150 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:16:06,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:16:06,162 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:16:06,643 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-30 00:16:06,644 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:16:06,644 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:16:06,649 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:16:06,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:16:06,675 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:16:06,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 13 treesize of output 10 [2018-01-30 00:16:06,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 00:16:06,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:16:06,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:16:06,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:16:06,737 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-01-30 00:16:06,791 WARN L1033 $PredicateComparison]: unable to prove that (exists ((f19_~a.offset Int)) (= (store |c_old(#memory_$Pointer$.offset)| |c_f19_#in~a.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_f19_#in~a.base|) f19_~a.offset 0)) |c_#memory_$Pointer$.offset|)) is different from true [2018-01-30 00:16:06,799 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-30 00:16:06,801 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 16 treesize of output 17 [2018-01-30 00:16:06,802 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:16:06,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:16:06,808 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-30 00:16:06,808 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2018-01-30 00:16:06,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-30 00:16:06,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-30 00:16:06,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:16:06,926 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:16:06,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:16:06,927 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-01-30 00:16:06,932 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-30 00:16:06,952 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 00:16:06,953 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [17] total 30 [2018-01-30 00:16:06,953 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-30 00:16:06,953 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-30 00:16:06,953 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=779, Unknown=1, NotChecked=56, Total=930 [2018-01-30 00:16:06,954 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand 31 states. [2018-01-30 00:16:11,468 WARN L146 SmtUtils]: Spent 4031ms on a formula simplification. DAG size of input: 34 DAG size of output 31 [2018-01-30 00:16:11,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:16:11,725 INFO L93 Difference]: Finished difference Result 113 states and 116 transitions. [2018-01-30 00:16:11,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-30 00:16:11,725 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 68 [2018-01-30 00:16:11,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:16:11,726 INFO L225 Difference]: With dead ends: 113 [2018-01-30 00:16:11,726 INFO L226 Difference]: Without dead ends: 112 [2018-01-30 00:16:11,727 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=257, Invalid=2000, Unknown=3, NotChecked=92, Total=2352 [2018-01-30 00:16:11,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-30 00:16:11,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-01-30 00:16:11,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-30 00:16:11,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 115 transitions. [2018-01-30 00:16:11,737 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 115 transitions. Word has length 68 [2018-01-30 00:16:11,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:16:11,737 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 115 transitions. [2018-01-30 00:16:11,737 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-01-30 00:16:11,737 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 115 transitions. [2018-01-30 00:16:11,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-30 00:16:11,738 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:16:11,738 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 00:16:11,738 INFO L371 AbstractCegarLoop]: === Iteration 33 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-30 00:16:11,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1717830135, now seen corresponding path program 1 times [2018-01-30 00:16:11,738 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:16:11,738 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:16:11,739 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:16:11,739 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:16:11,739 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:16:11,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:16:11,753 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:16:12,083 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 20 DAG size of output 17 [2018-01-30 00:16:12,473 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:16:12,474 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:16:12,474 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:16:12,478 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:16:12,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:16:12,504 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:16:12,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 00:16:12,525 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:16:12,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:16:12,526 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-30 00:16:12,575 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-30 00:16:12,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-30 00:16:12,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:16:12,581 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:16:12,585 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-30 00:16:12,585 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-01-30 00:16:12,678 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|f19_#t~ret2.base| Int) (f19_~a.offset Int)) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_f19_#in~a.base| (store (select |c_old(#memory_$Pointer$.base)| |c_f19_#in~a.base|) f19_~a.offset |f19_#t~ret2.base|))) (= |c_#valid| (store |c_old(#valid)| |f19_#t~ret2.base| 1)))) is different from true [2018-01-30 00:16:12,701 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 18 treesize of output 17 [2018-01-30 00:16:12,703 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:16:12,709 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 23 treesize of output 18 [2018-01-30 00:16:12,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 28 [2018-01-30 00:16:12,718 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-30 00:16:12,724 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:16:12,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 00:16:12,729 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:29, output treesize:21 [2018-01-30 00:16:12,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-01-30 00:16:12,856 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 17 treesize of output 5 [2018-01-30 00:16:12,856 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:16:12,857 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:16:12,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:16:12,858 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2018-01-30 00:16:12,864 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:16:12,884 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 00:16:12,884 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [21] total 36 [2018-01-30 00:16:12,884 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-01-30 00:16:12,884 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-01-30 00:16:12,885 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1142, Unknown=1, NotChecked=68, Total=1332 [2018-01-30 00:16:12,885 INFO L87 Difference]: Start difference. First operand 112 states and 115 transitions. Second operand 37 states. [2018-01-30 00:16:17,836 WARN L146 SmtUtils]: Spent 4046ms on a formula simplification. DAG size of input: 50 DAG size of output 44 [2018-01-30 00:16:18,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:16:18,217 INFO L93 Difference]: Finished difference Result 115 states and 118 transitions. [2018-01-30 00:16:18,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-30 00:16:18,218 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 68 [2018-01-30 00:16:18,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:16:18,218 INFO L225 Difference]: With dead ends: 115 [2018-01-30 00:16:18,219 INFO L226 Difference]: Without dead ends: 114 [2018-01-30 00:16:18,219 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=313, Invalid=2658, Unknown=3, NotChecked=106, Total=3080 [2018-01-30 00:16:18,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-01-30 00:16:18,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2018-01-30 00:16:18,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-30 00:16:18,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 116 transitions. [2018-01-30 00:16:18,228 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 116 transitions. Word has length 68 [2018-01-30 00:16:18,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:16:18,228 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 116 transitions. [2018-01-30 00:16:18,228 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-01-30 00:16:18,229 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 116 transitions. [2018-01-30 00:16:18,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-30 00:16:18,229 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:16:18,229 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 00:16:18,229 INFO L371 AbstractCegarLoop]: === Iteration 34 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-30 00:16:18,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1684034290, now seen corresponding path program 1 times [2018-01-30 00:16:18,229 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:16:18,229 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:16:18,230 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:16:18,230 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:16:18,230 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:16:18,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:16:18,238 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:16:18,315 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-30 00:16:18,315 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:16:18,315 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:16:18,316 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:16:18,316 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:16:18,316 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:16:18,316 INFO L87 Difference]: Start difference. First operand 113 states and 116 transitions. Second operand 5 states. [2018-01-30 00:16:18,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:16:18,409 INFO L93 Difference]: Finished difference Result 123 states and 125 transitions. [2018-01-30 00:16:18,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:16:18,409 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-01-30 00:16:18,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:16:18,410 INFO L225 Difference]: With dead ends: 123 [2018-01-30 00:16:18,410 INFO L226 Difference]: Without dead ends: 117 [2018-01-30 00:16:18,410 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:16:18,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-01-30 00:16:18,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2018-01-30 00:16:18,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-30 00:16:18,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 115 transitions. [2018-01-30 00:16:18,420 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 115 transitions. Word has length 69 [2018-01-30 00:16:18,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:16:18,421 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 115 transitions. [2018-01-30 00:16:18,421 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:16:18,421 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 115 transitions. [2018-01-30 00:16:18,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-01-30 00:16:18,421 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:16:18,421 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 00:16:18,421 INFO L371 AbstractCegarLoop]: === Iteration 35 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-30 00:16:18,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1339337568, now seen corresponding path program 1 times [2018-01-30 00:16:18,422 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:16:18,422 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:16:18,422 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:16:18,422 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:16:18,423 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:16:18,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:16:18,434 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:16:18,716 WARN L146 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 21 DAG size of output 15 [2018-01-30 00:16:19,121 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:16:19,121 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:16:19,121 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:16:19,126 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:16:19,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:16:19,155 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:16:19,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 00:16:19,157 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:16:19,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:16:19,158 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-30 00:16:19,256 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-30 00:16:19,257 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-30 00:16:19,258 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:16:19,259 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:16:19,265 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-30 00:16:19,265 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:28 [2018-01-30 00:16:19,370 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 33 treesize of output 26 [2018-01-30 00:16:19,372 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:16:19,374 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 26 treesize of output 35 [2018-01-30 00:16:19,374 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:16:19,380 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:16:19,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:16:19,386 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:27 [2018-01-30 00:16:19,414 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 11 treesize of output 1 [2018-01-30 00:16:19,415 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:16:19,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-30 00:16:19,417 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-01-30 00:16:23,972 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:16:23,973 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:16:23,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 10 [2018-01-30 00:16:23,974 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:16:23,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:16:23,977 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2018-01-30 00:16:24,063 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 30 treesize of output 24 [2018-01-30 00:16:24,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2018-01-30 00:16:24,065 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:16:24,067 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:16:24,070 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-30 00:16:24,070 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:14 [2018-01-30 00:16:24,099 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:16:24,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-01-30 00:16:24,100 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:16:24,104 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-30 00:16:24,104 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:15 [2018-01-30 00:16:24,209 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:16:24,229 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:16:24,229 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 38 [2018-01-30 00:16:24,229 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-01-30 00:16:24,229 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-01-30 00:16:24,230 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1379, Unknown=5, NotChecked=0, Total=1482 [2018-01-30 00:16:24,230 INFO L87 Difference]: Start difference. First operand 113 states and 115 transitions. Second operand 39 states. [2018-01-30 00:16:30,166 WARN L146 SmtUtils]: Spent 1480ms on a formula simplification. DAG size of input: 38 DAG size of output 24 [2018-01-30 00:16:47,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:16:47,529 INFO L93 Difference]: Finished difference Result 122 states and 125 transitions. [2018-01-30 00:16:47,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-30 00:16:47,529 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 72 [2018-01-30 00:16:47,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:16:47,530 INFO L225 Difference]: With dead ends: 122 [2018-01-30 00:16:47,530 INFO L226 Difference]: Without dead ends: 121 [2018-01-30 00:16:47,531 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 884 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=334, Invalid=4079, Unknown=9, NotChecked=0, Total=4422 [2018-01-30 00:16:47,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-30 00:16:47,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 117. [2018-01-30 00:16:47,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-01-30 00:16:47,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 121 transitions. [2018-01-30 00:16:47,541 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 121 transitions. Word has length 72 [2018-01-30 00:16:47,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:16:47,541 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 121 transitions. [2018-01-30 00:16:47,541 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-01-30 00:16:47,541 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2018-01-30 00:16:47,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-01-30 00:16:47,542 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:16:47,542 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 00:16:47,542 INFO L371 AbstractCegarLoop]: === Iteration 36 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-30 00:16:47,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1339337569, now seen corresponding path program 1 times [2018-01-30 00:16:47,542 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:16:47,542 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:16:47,543 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:16:47,543 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:16:47,543 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:16:47,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:16:47,550 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:16:47,745 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-30 00:16:47,745 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:16:47,745 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-30 00:16:47,745 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 00:16:47,746 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 00:16:47,746 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:16:47,746 INFO L87 Difference]: Start difference. First operand 117 states and 121 transitions. Second operand 8 states. [2018-01-30 00:16:47,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:16:47,812 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2018-01-30 00:16:47,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 00:16:47,812 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 72 [2018-01-30 00:16:47,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:16:47,813 INFO L225 Difference]: With dead ends: 117 [2018-01-30 00:16:47,813 INFO L226 Difference]: Without dead ends: 116 [2018-01-30 00:16:47,813 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-01-30 00:16:47,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-30 00:16:47,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-01-30 00:16:47,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-30 00:16:47,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 119 transitions. [2018-01-30 00:16:47,823 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 119 transitions. Word has length 72 [2018-01-30 00:16:47,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:16:47,824 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 119 transitions. [2018-01-30 00:16:47,824 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 00:16:47,824 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 119 transitions. [2018-01-30 00:16:47,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-01-30 00:16:47,825 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:16:47,825 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 00:16:47,825 INFO L371 AbstractCegarLoop]: === Iteration 37 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-30 00:16:47,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1430208367, now seen corresponding path program 1 times [2018-01-30 00:16:47,825 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:16:47,825 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:16:47,826 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:16:47,826 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:16:47,826 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:16:47,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:16:47,837 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:16:48,765 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:16:48,765 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:16:48,765 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:16:48,770 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:16:48,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:16:48,797 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:16:48,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 00:16:48,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:16:48,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:16:48,803 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:10 [2018-01-30 00:16:48,870 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-30 00:16:48,871 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-30 00:16:48,871 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:16:48,873 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:16:48,878 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-30 00:16:48,878 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:28 [2018-01-30 00:16:49,065 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:16:49,066 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:16:49,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 39 [2018-01-30 00:16:49,067 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:16:49,077 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 43 treesize of output 34 [2018-01-30 00:16:49,079 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:16:49,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 45 [2018-01-30 00:16:49,080 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 00:16:49,085 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:16:49,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:16:49,091 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:44, output treesize:45 [2018-01-30 00:16:49,344 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:16:49,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2018-01-30 00:16:49,345 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:16:49,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:16:49,350 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:60, output treesize:34 [2018-01-30 00:16:49,450 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 34 treesize of output 26 [2018-01-30 00:16:49,452 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:16:49,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2018-01-30 00:16:49,452 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-30 00:16:49,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 00:16:49,460 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-30 00:16:49,460 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:15 [2018-01-30 00:16:49,505 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:16:49,525 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:16:49,525 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 43 [2018-01-30 00:16:49,525 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-01-30 00:16:49,525 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-01-30 00:16:49,526 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1756, Unknown=8, NotChecked=0, Total=1892 [2018-01-30 00:16:49,526 INFO L87 Difference]: Start difference. First operand 116 states and 119 transitions. Second operand 44 states. [2018-01-30 00:16:50,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:16:50,875 INFO L93 Difference]: Finished difference Result 119 states and 122 transitions. [2018-01-30 00:16:50,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-01-30 00:16:50,875 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 73 [2018-01-30 00:16:50,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:16:50,876 INFO L225 Difference]: With dead ends: 119 [2018-01-30 00:16:50,876 INFO L226 Difference]: Without dead ends: 118 [2018-01-30 00:16:50,877 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 941 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=277, Invalid=3497, Unknown=8, NotChecked=0, Total=3782 [2018-01-30 00:16:50,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-30 00:16:50,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2018-01-30 00:16:50,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-01-30 00:16:50,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 121 transitions. [2018-01-30 00:16:50,894 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 121 transitions. Word has length 73 [2018-01-30 00:16:50,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:16:50,894 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 121 transitions. [2018-01-30 00:16:50,894 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-01-30 00:16:50,894 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2018-01-30 00:16:50,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-01-30 00:16:50,895 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:16:50,895 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 00:16:50,895 INFO L371 AbstractCegarLoop]: === Iteration 38 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-30 00:16:50,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1430208368, now seen corresponding path program 1 times [2018-01-30 00:16:50,896 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:16:50,896 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:16:50,896 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:16:50,897 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:16:50,897 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:16:50,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:16:50,907 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:16:51,114 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-30 00:16:51,114 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:16:51,114 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-30 00:16:51,114 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-30 00:16:51,115 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-30 00:16:51,115 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-01-30 00:16:51,115 INFO L87 Difference]: Start difference. First operand 117 states and 121 transitions. Second operand 15 states. [2018-01-30 00:16:51,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:16:51,323 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2018-01-30 00:16:51,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-30 00:16:51,349 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 73 [2018-01-30 00:16:51,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:16:51,350 INFO L225 Difference]: With dead ends: 117 [2018-01-30 00:16:51,350 INFO L226 Difference]: Without dead ends: 116 [2018-01-30 00:16:51,350 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-01-30 00:16:51,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-30 00:16:51,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-01-30 00:16:51,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-30 00:16:51,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 119 transitions. [2018-01-30 00:16:51,360 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 119 transitions. Word has length 73 [2018-01-30 00:16:51,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:16:51,360 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 119 transitions. [2018-01-30 00:16:51,360 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-30 00:16:51,360 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 119 transitions. [2018-01-30 00:16:51,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-01-30 00:16:51,360 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:16:51,361 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 00:16:51,361 INFO L371 AbstractCegarLoop]: === Iteration 39 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-30 00:16:51,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1769771706, now seen corresponding path program 1 times [2018-01-30 00:16:51,361 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:16:51,361 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:16:51,362 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:16:51,362 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:16:51,362 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:16:51,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:16:51,372 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:16:51,416 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-30 00:16:51,416 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:16:51,416 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 00:16:51,416 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:16:51,417 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:16:51,417 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:16:51,417 INFO L87 Difference]: Start difference. First operand 116 states and 119 transitions. Second operand 6 states. [2018-01-30 00:16:51,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:16:51,480 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-01-30 00:16:51,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:16:51,480 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-01-30 00:16:51,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:16:51,481 INFO L225 Difference]: With dead ends: 131 [2018-01-30 00:16:51,481 INFO L226 Difference]: Without dead ends: 107 [2018-01-30 00:16:51,481 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:16:51,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-01-30 00:16:51,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2018-01-30 00:16:51,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-30 00:16:51,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-01-30 00:16:51,491 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 78 [2018-01-30 00:16:51,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:16:51,491 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-01-30 00:16:51,491 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:16:51,491 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-01-30 00:16:51,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-30 00:16:51,491 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:16:51,492 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 00:16:51,492 INFO L371 AbstractCegarLoop]: === Iteration 40 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-01-30 00:16:51,492 INFO L82 PathProgramCache]: Analyzing trace with hash -27348182, now seen corresponding path program 1 times [2018-01-30 00:16:51,492 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:16:51,492 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:16:51,493 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:16:51,493 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:16:51,493 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:16:51,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:16:51,502 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:16:53,009 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-30 00:16:53,010 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:16:53,010 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:16:53,015 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:16:53,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:16:53,042 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:16:53,114 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-30 00:16:53,116 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-30 00:16:53,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:16:53,118 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:16:53,125 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-30 00:16:53,125 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:45 [2018-01-30 00:16:53,329 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-30 00:16:53,350 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 47 treesize of output 38 [2018-01-30 00:16:53,353 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:16:53,354 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:16:53,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 59 [2018-01-30 00:16:53,355 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 00:16:53,363 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:16:53,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-30 00:16:53,376 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:82, output treesize:86 [2018-01-30 00:16:53,377 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 216817 column 39: unknown constant v_DerPreprocessor_1 at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1420) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:206) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:222) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:146) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript$DiffTransformer.checkOrAddAxiom(DiffWrapperScript.java:95) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript$DiffTransformer.convertApplicationTerm(DiffWrapperScript.java:105) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:297) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:239) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:198) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.assertTerm(ManagedScript.java:133) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:1002) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:946) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:355) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:573) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:445) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:283) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:237) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:185) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackTraceAbstractionRefinementStrategy.getTraceCheck(MultiTrackTraceAbstractionRefinementStrategy.java:218) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:396) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-01-30 00:16:53,380 INFO L168 Benchmark]: Toolchain (without parser) took 72977.67 ms. Allocated memory was 303.0 MB in the beginning and 794.8 MB in the end (delta: 491.8 MB). Free memory was 262.1 MB in the beginning and 307.9 MB in the end (delta: -45.8 MB). Peak memory consumption was 446.0 MB. Max. memory is 5.3 GB. [2018-01-30 00:16:53,381 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 303.0 MB. Free memory is still 269.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 00:16:53,382 INFO L168 Benchmark]: CACSL2BoogieTranslator took 216.43 ms. Allocated memory is still 303.0 MB. Free memory was 262.1 MB in the beginning and 248.1 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-30 00:16:53,382 INFO L168 Benchmark]: Boogie Preprocessor took 33.86 ms. Allocated memory is still 303.0 MB. Free memory was 248.1 MB in the beginning and 247.1 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 5.3 GB. [2018-01-30 00:16:53,382 INFO L168 Benchmark]: RCFGBuilder took 360.28 ms. Allocated memory is still 303.0 MB. Free memory was 247.1 MB in the beginning and 221.2 MB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 5.3 GB. [2018-01-30 00:16:53,383 INFO L168 Benchmark]: TraceAbstraction took 72357.57 ms. Allocated memory was 303.0 MB in the beginning and 794.8 MB in the end (delta: 491.8 MB). Free memory was 221.2 MB in the beginning and 307.9 MB in the end (delta: -86.6 MB). Peak memory consumption was 405.1 MB. Max. memory is 5.3 GB. [2018-01-30 00:16:53,384 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.21 ms. Allocated memory is still 303.0 MB. Free memory is still 269.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 216.43 ms. Allocated memory is still 303.0 MB. Free memory was 262.1 MB in the beginning and 248.1 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.86 ms. Allocated memory is still 303.0 MB. Free memory was 248.1 MB in the beginning and 247.1 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 5.3 GB. * RCFGBuilder took 360.28 ms. Allocated memory is still 303.0 MB. Free memory was 247.1 MB in the beginning and 221.2 MB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 72357.57 ms. Allocated memory was 303.0 MB in the beginning and 794.8 MB in the end (delta: 491.8 MB). Free memory was 221.2 MB in the beginning and 307.9 MB in the end (delta: -86.6 MB). Peak memory consumption was 405.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 216817 column 39: unknown constant v_DerPreprocessor_1 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 216817 column 39: unknown constant v_DerPreprocessor_1: de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1420) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test19_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-30_00-16-53-391.csv Received shutdown request...