java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test19_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 00:52:36,079 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 00:52:36,081 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 00:52:36,091 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 00:52:36,092 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 00:52:36,092 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 00:52:36,093 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 00:52:36,094 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 00:52:36,095 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 00:52:36,096 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 00:52:36,097 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 00:52:36,097 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 00:52:36,098 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 00:52:36,099 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 00:52:36,099 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 00:52:36,101 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 00:52:36,103 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 00:52:36,104 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 00:52:36,105 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 00:52:36,106 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 00:52:36,108 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 00:52:36,108 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 00:52:36,108 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 00:52:36,109 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 00:52:36,110 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 00:52:36,110 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 00:52:36,111 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 00:52:36,111 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 00:52:36,111 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 00:52:36,111 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 00:52:36,112 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 00:52:36,112 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-04 00:52:36,122 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 00:52:36,122 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 00:52:36,123 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 00:52:36,123 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 00:52:36,123 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 00:52:36,123 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 00:52:36,124 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 00:52:36,124 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 00:52:36,124 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 00:52:36,124 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 00:52:36,124 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 00:52:36,124 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 00:52:36,124 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 00:52:36,125 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 00:52:36,125 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 00:52:36,125 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 00:52:36,125 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 00:52:36,125 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 00:52:36,125 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 00:52:36,126 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 00:52:36,126 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 00:52:36,126 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 00:52:36,126 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 00:52:36,126 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 00:52:36,126 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 00:52:36,158 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 00:52:36,170 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 00:52:36,175 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 00:52:36,176 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 00:52:36,176 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 00:52:36,177 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test19_true-valid-memsafety_true-termination.i [2018-02-04 00:52:36,334 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 00:52:36,335 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 00:52:36,336 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 00:52:36,336 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 00:52:36,342 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 00:52:36,342 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:52:36" (1/1) ... [2018-02-04 00:52:36,345 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ef0a5f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:52:36, skipping insertion in model container [2018-02-04 00:52:36,345 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:52:36" (1/1) ... [2018-02-04 00:52:36,359 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 00:52:36,397 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 00:52:36,482 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 00:52:36,494 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 00:52:36,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:52:36 WrapperNode [2018-02-04 00:52:36,500 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 00:52:36,501 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 00:52:36,501 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 00:52:36,501 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 00:52:36,513 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:52:36" (1/1) ... [2018-02-04 00:52:36,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:52:36" (1/1) ... [2018-02-04 00:52:36,522 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:52:36" (1/1) ... [2018-02-04 00:52:36,522 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:52:36" (1/1) ... [2018-02-04 00:52:36,525 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:52:36" (1/1) ... [2018-02-04 00:52:36,526 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:52:36" (1/1) ... [2018-02-04 00:52:36,527 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:52:36" (1/1) ... [2018-02-04 00:52:36,528 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 00:52:36,529 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 00:52:36,529 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 00:52:36,529 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 00:52:36,530 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:52:36" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 00:52:36,565 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 00:52:36,565 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 00:52:36,565 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 00:52:36,565 INFO L136 BoogieDeclarations]: Found implementation of procedure f19 [2018-02-04 00:52:36,565 INFO L136 BoogieDeclarations]: Found implementation of procedure f19_undo [2018-02-04 00:52:36,566 INFO L136 BoogieDeclarations]: Found implementation of procedure g19 [2018-02-04 00:52:36,566 INFO L136 BoogieDeclarations]: Found implementation of procedure probe_19 [2018-02-04 00:52:36,566 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_19 [2018-02-04 00:52:36,566 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 00:52:36,566 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 00:52:36,566 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 00:52:36,566 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 00:52:36,566 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 00:52:36,566 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 00:52:36,566 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 00:52:36,566 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 00:52:36,566 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 00:52:36,567 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 00:52:36,567 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 00:52:36,567 INFO L128 BoogieDeclarations]: Found specification of procedure f19 [2018-02-04 00:52:36,567 INFO L128 BoogieDeclarations]: Found specification of procedure f19_undo [2018-02-04 00:52:36,567 INFO L128 BoogieDeclarations]: Found specification of procedure g19 [2018-02-04 00:52:36,567 INFO L128 BoogieDeclarations]: Found specification of procedure probe_19 [2018-02-04 00:52:36,567 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_19 [2018-02-04 00:52:36,567 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 00:52:36,567 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 00:52:36,568 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 00:52:36,568 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 00:52:36,757 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 00:52:36,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:52:36 BoogieIcfgContainer [2018-02-04 00:52:36,758 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 00:52:36,758 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 00:52:36,758 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 00:52:36,760 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 00:52:36,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 12:52:36" (1/3) ... [2018-02-04 00:52:36,761 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55978f05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:52:36, skipping insertion in model container [2018-02-04 00:52:36,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:52:36" (2/3) ... [2018-02-04 00:52:36,761 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55978f05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:52:36, skipping insertion in model container [2018-02-04 00:52:36,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:52:36" (3/3) ... [2018-02-04 00:52:36,762 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test19_true-valid-memsafety_true-termination.i [2018-02-04 00:52:36,768 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 00:52:36,772 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-02-04 00:52:36,803 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 00:52:36,803 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 00:52:36,803 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 00:52:36,803 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 00:52:36,804 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 00:52:36,804 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 00:52:36,804 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 00:52:36,804 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 00:52:36,805 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 00:52:36,817 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states. [2018-02-04 00:52:36,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 00:52:36,825 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:52:36,826 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:52:36,826 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-02-04 00:52:36,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1329506467, now seen corresponding path program 1 times [2018-02-04 00:52:36,831 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:52:36,832 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:52:36,880 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:52:36,880 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:52:36,880 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:52:36,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:52:36,928 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:52:37,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:52:37,032 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:52:37,032 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 00:52:37,033 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 00:52:37,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 00:52:37,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:52:37,102 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 6 states. [2018-02-04 00:52:37,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:52:37,340 INFO L93 Difference]: Finished difference Result 136 states and 158 transitions. [2018-02-04 00:52:37,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 00:52:37,341 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-02-04 00:52:37,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:52:37,352 INFO L225 Difference]: With dead ends: 136 [2018-02-04 00:52:37,352 INFO L226 Difference]: Without dead ends: 133 [2018-02-04 00:52:37,353 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-04 00:52:37,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-02-04 00:52:37,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 97. [2018-02-04 00:52:37,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-02-04 00:52:37,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 113 transitions. [2018-02-04 00:52:37,392 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 113 transitions. Word has length 15 [2018-02-04 00:52:37,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:52:37,392 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 113 transitions. [2018-02-04 00:52:37,392 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 00:52:37,392 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 113 transitions. [2018-02-04 00:52:37,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 00:52:37,393 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:52:37,394 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:52:37,394 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-02-04 00:52:37,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1329506468, now seen corresponding path program 1 times [2018-02-04 00:52:37,394 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:52:37,394 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:52:37,395 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:52:37,396 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:52:37,396 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:52:37,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:52:37,410 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:52:37,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:52:37,484 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:52:37,484 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 00:52:37,485 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 00:52:37,485 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 00:52:37,486 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:52:37,486 INFO L87 Difference]: Start difference. First operand 97 states and 113 transitions. Second operand 6 states. [2018-02-04 00:52:37,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:52:37,681 INFO L93 Difference]: Finished difference Result 126 states and 146 transitions. [2018-02-04 00:52:37,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 00:52:37,681 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-02-04 00:52:37,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:52:37,683 INFO L225 Difference]: With dead ends: 126 [2018-02-04 00:52:37,683 INFO L226 Difference]: Without dead ends: 126 [2018-02-04 00:52:37,683 INFO L554 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-02-04 00:52:37,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-04 00:52:37,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 109. [2018-02-04 00:52:37,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-04 00:52:37,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 132 transitions. [2018-02-04 00:52:37,693 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 132 transitions. Word has length 15 [2018-02-04 00:52:37,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:52:37,694 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 132 transitions. [2018-02-04 00:52:37,694 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 00:52:37,694 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 132 transitions. [2018-02-04 00:52:37,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 00:52:37,695 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:52:37,695 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:52:37,695 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-02-04 00:52:37,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1959488357, now seen corresponding path program 1 times [2018-02-04 00:52:37,695 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:52:37,696 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:52:37,697 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:52:37,697 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:52:37,697 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:52:37,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:52:37,715 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:52:37,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:52:37,811 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:52:37,811 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 00:52:37,812 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 00:52:37,812 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 00:52:37,812 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 00:52:37,812 INFO L87 Difference]: Start difference. First operand 109 states and 132 transitions. Second operand 8 states. [2018-02-04 00:52:38,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:52:38,097 INFO L93 Difference]: Finished difference Result 147 states and 174 transitions. [2018-02-04 00:52:38,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 00:52:38,097 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-02-04 00:52:38,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:52:38,098 INFO L225 Difference]: With dead ends: 147 [2018-02-04 00:52:38,098 INFO L226 Difference]: Without dead ends: 147 [2018-02-04 00:52:38,099 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-02-04 00:52:38,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-02-04 00:52:38,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 106. [2018-02-04 00:52:38,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-02-04 00:52:38,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 128 transitions. [2018-02-04 00:52:38,106 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 128 transitions. Word has length 17 [2018-02-04 00:52:38,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:52:38,106 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 128 transitions. [2018-02-04 00:52:38,106 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 00:52:38,106 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 128 transitions. [2018-02-04 00:52:38,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 00:52:38,106 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:52:38,106 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:52:38,107 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-02-04 00:52:38,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1959488358, now seen corresponding path program 1 times [2018-02-04 00:52:38,107 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:52:38,107 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:52:38,108 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:52:38,108 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:52:38,108 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:52:38,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:52:38,121 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:52:38,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:52:38,199 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:52:38,199 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 00:52:38,199 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 00:52:38,199 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 00:52:38,199 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-04 00:52:38,199 INFO L87 Difference]: Start difference. First operand 106 states and 128 transitions. Second operand 9 states. [2018-02-04 00:52:38,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:52:38,470 INFO L93 Difference]: Finished difference Result 149 states and 175 transitions. [2018-02-04 00:52:38,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 00:52:38,470 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-02-04 00:52:38,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:52:38,471 INFO L225 Difference]: With dead ends: 149 [2018-02-04 00:52:38,471 INFO L226 Difference]: Without dead ends: 149 [2018-02-04 00:52:38,472 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-02-04 00:52:38,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-02-04 00:52:38,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 82. [2018-02-04 00:52:38,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-04 00:52:38,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2018-02-04 00:52:38,477 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 17 [2018-02-04 00:52:38,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:52:38,477 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2018-02-04 00:52:38,477 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 00:52:38,477 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2018-02-04 00:52:38,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 00:52:38,478 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:52:38,478 INFO L351 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] [2018-02-04 00:52:38,478 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-02-04 00:52:38,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1193563309, now seen corresponding path program 1 times [2018-02-04 00:52:38,478 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:52:38,479 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:52:38,480 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:52:38,480 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:52:38,480 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:52:38,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:52:38,490 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:52:38,532 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 00:52:38,532 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:52:38,533 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:52:38,541 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:52:38,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:52:38,592 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:52:38,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 00:52:38,619 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:52:38,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:52:38,621 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 00:52:38,672 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 00:52:38,692 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 00:52:38,692 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 12 [2018-02-04 00:52:38,692 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 00:52:38,692 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 00:52:38,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-02-04 00:52:38,693 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand 12 states. [2018-02-04 00:52:39,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:52:39,019 INFO L93 Difference]: Finished difference Result 112 states and 127 transitions. [2018-02-04 00:52:39,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 00:52:39,019 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-02-04 00:52:39,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:52:39,021 INFO L225 Difference]: With dead ends: 112 [2018-02-04 00:52:39,021 INFO L226 Difference]: Without dead ends: 112 [2018-02-04 00:52:39,021 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2018-02-04 00:52:39,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-04 00:52:39,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 88. [2018-02-04 00:52:39,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-04 00:52:39,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2018-02-04 00:52:39,027 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 26 [2018-02-04 00:52:39,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:52:39,027 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2018-02-04 00:52:39,027 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 00:52:39,027 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2018-02-04 00:52:39,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 00:52:39,028 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:52:39,028 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:52:39,028 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-02-04 00:52:39,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1571443383, now seen corresponding path program 1 times [2018-02-04 00:52:39,029 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:52:39,029 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:52:39,030 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:52:39,030 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:52:39,030 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:52:39,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:52:39,039 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:52:39,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:52:39,088 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:52:39,088 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 00:52:39,088 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 00:52:39,088 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 00:52:39,089 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 00:52:39,089 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand 8 states. [2018-02-04 00:52:39,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:52:39,173 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2018-02-04 00:52:39,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 00:52:39,173 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-02-04 00:52:39,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:52:39,174 INFO L225 Difference]: With dead ends: 101 [2018-02-04 00:52:39,174 INFO L226 Difference]: Without dead ends: 101 [2018-02-04 00:52:39,175 INFO L554 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-02-04 00:52:39,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-02-04 00:52:39,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 96. [2018-02-04 00:52:39,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-04 00:52:39,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2018-02-04 00:52:39,179 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 26 [2018-02-04 00:52:39,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:52:39,180 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2018-02-04 00:52:39,180 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 00:52:39,180 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2018-02-04 00:52:39,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 00:52:39,181 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:52:39,181 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:52:39,181 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-02-04 00:52:39,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1571443382, now seen corresponding path program 1 times [2018-02-04 00:52:39,182 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:52:39,182 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:52:39,183 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:52:39,183 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:52:39,183 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:52:39,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:52:39,192 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:52:39,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:52:39,223 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:52:39,223 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 00:52:39,223 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 00:52:39,223 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 00:52:39,224 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:52:39,224 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand 6 states. [2018-02-04 00:52:39,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:52:39,241 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2018-02-04 00:52:39,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 00:52:39,241 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-04 00:52:39,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:52:39,242 INFO L225 Difference]: With dead ends: 97 [2018-02-04 00:52:39,242 INFO L226 Difference]: Without dead ends: 97 [2018-02-04 00:52:39,242 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:52:39,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-04 00:52:39,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2018-02-04 00:52:39,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-04 00:52:39,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2018-02-04 00:52:39,245 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 26 [2018-02-04 00:52:39,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:52:39,245 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2018-02-04 00:52:39,245 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 00:52:39,245 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2018-02-04 00:52:39,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 00:52:39,246 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:52:39,246 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:52:39,246 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-02-04 00:52:39,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1472265042, now seen corresponding path program 1 times [2018-02-04 00:52:39,246 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:52:39,246 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:52:39,247 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:52:39,247 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:52:39,247 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:52:39,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:52:39,256 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:52:39,328 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:52:39,328 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:52:39,328 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 00:52:39,329 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 00:52:39,329 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 00:52:39,329 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-04 00:52:39,329 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand 9 states. [2018-02-04 00:52:39,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:52:39,574 INFO L93 Difference]: Finished difference Result 112 states and 125 transitions. [2018-02-04 00:52:39,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 00:52:39,575 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-02-04 00:52:39,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:52:39,576 INFO L225 Difference]: With dead ends: 112 [2018-02-04 00:52:39,576 INFO L226 Difference]: Without dead ends: 112 [2018-02-04 00:52:39,576 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-02-04 00:52:39,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-04 00:52:39,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 95. [2018-02-04 00:52:39,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-04 00:52:39,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2018-02-04 00:52:39,581 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 28 [2018-02-04 00:52:39,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:52:39,581 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2018-02-04 00:52:39,581 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 00:52:39,581 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2018-02-04 00:52:39,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 00:52:39,582 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:52:39,582 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:52:39,582 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-02-04 00:52:39,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1711860499, now seen corresponding path program 1 times [2018-02-04 00:52:39,582 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:52:39,583 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:52:39,584 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:52:39,584 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:52:39,584 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:52:39,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:52:39,594 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:52:39,668 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:52:39,668 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:52:39,668 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 00:52:39,668 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 00:52:39,669 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 00:52:39,669 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 00:52:39,669 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand 8 states. [2018-02-04 00:52:39,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:52:39,883 INFO L93 Difference]: Finished difference Result 117 states and 130 transitions. [2018-02-04 00:52:39,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 00:52:39,883 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-02-04 00:52:39,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:52:39,885 INFO L225 Difference]: With dead ends: 117 [2018-02-04 00:52:39,885 INFO L226 Difference]: Without dead ends: 117 [2018-02-04 00:52:39,885 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-02-04 00:52:39,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-02-04 00:52:39,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 94. [2018-02-04 00:52:39,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-04 00:52:39,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2018-02-04 00:52:39,889 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 30 [2018-02-04 00:52:39,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:52:39,890 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2018-02-04 00:52:39,890 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 00:52:39,890 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2018-02-04 00:52:39,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 00:52:39,891 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:52:39,891 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:52:39,891 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-02-04 00:52:39,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1711860500, now seen corresponding path program 1 times [2018-02-04 00:52:39,891 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:52:39,891 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:52:39,892 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:52:39,893 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:52:39,893 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:52:39,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:52:39,903 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:52:40,049 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:52:40,049 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:52:40,049 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 00:52:40,049 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 00:52:40,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 00:52:40,050 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-04 00:52:40,050 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand 12 states. [2018-02-04 00:52:40,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:52:40,397 INFO L93 Difference]: Finished difference Result 124 states and 136 transitions. [2018-02-04 00:52:40,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 00:52:40,397 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2018-02-04 00:52:40,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:52:40,398 INFO L225 Difference]: With dead ends: 124 [2018-02-04 00:52:40,398 INFO L226 Difference]: Without dead ends: 124 [2018-02-04 00:52:40,398 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2018-02-04 00:52:40,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-04 00:52:40,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 89. [2018-02-04 00:52:40,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-04 00:52:40,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2018-02-04 00:52:40,401 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 30 [2018-02-04 00:52:40,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:52:40,402 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2018-02-04 00:52:40,402 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 00:52:40,402 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2018-02-04 00:52:40,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 00:52:40,402 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:52:40,403 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:52:40,403 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-02-04 00:52:40,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1708399928, now seen corresponding path program 1 times [2018-02-04 00:52:40,403 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:52:40,403 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:52:40,404 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:52:40,404 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:52:40,404 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:52:40,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:52:40,411 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:52:40,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:52:40,445 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:52:40,445 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 00:52:40,446 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 00:52:40,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 00:52:40,446 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 00:52:40,446 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand 4 states. [2018-02-04 00:52:40,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:52:40,512 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2018-02-04 00:52:40,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:52:40,512 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-02-04 00:52:40,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:52:40,512 INFO L225 Difference]: With dead ends: 105 [2018-02-04 00:52:40,513 INFO L226 Difference]: Without dead ends: 91 [2018-02-04 00:52:40,513 INFO L554 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-02-04 00:52:40,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-04 00:52:40,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 85. [2018-02-04 00:52:40,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-02-04 00:52:40,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2018-02-04 00:52:40,516 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 28 [2018-02-04 00:52:40,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:52:40,516 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2018-02-04 00:52:40,516 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 00:52:40,516 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2018-02-04 00:52:40,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 00:52:40,517 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:52:40,517 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:52:40,517 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-02-04 00:52:40,517 INFO L82 PathProgramCache]: Analyzing trace with hash -526031434, now seen corresponding path program 1 times [2018-02-04 00:52:40,517 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:52:40,517 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:52:40,518 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:52:40,518 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:52:40,518 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:52:40,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:52:40,524 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:52:40,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:52:40,570 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:52:40,570 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 00:52:40,570 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 00:52:40,570 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 00:52:40,571 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:52:40,571 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand 7 states. [2018-02-04 00:52:40,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:52:40,611 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2018-02-04 00:52:40,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 00:52:40,611 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-02-04 00:52:40,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:52:40,612 INFO L225 Difference]: With dead ends: 80 [2018-02-04 00:52:40,612 INFO L226 Difference]: Without dead ends: 80 [2018-02-04 00:52:40,612 INFO L554 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-02-04 00:52:40,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-04 00:52:40,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-02-04 00:52:40,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-04 00:52:40,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2018-02-04 00:52:40,614 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 30 [2018-02-04 00:52:40,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:52:40,614 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2018-02-04 00:52:40,614 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 00:52:40,614 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2018-02-04 00:52:40,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 00:52:40,615 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:52:40,615 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:52:40,615 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-02-04 00:52:40,615 INFO L82 PathProgramCache]: Analyzing trace with hash 850149805, now seen corresponding path program 1 times [2018-02-04 00:52:40,616 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:52:40,616 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:52:40,617 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:52:40,617 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:52:40,617 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:52:40,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:52:40,625 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:52:40,647 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 00:52:40,647 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:52:40,647 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 00:52:40,648 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 00:52:40,648 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 00:52:40,648 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:52:40,648 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand 5 states. [2018-02-04 00:52:40,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:52:40,659 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2018-02-04 00:52:40,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:52:40,659 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-02-04 00:52:40,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:52:40,660 INFO L225 Difference]: With dead ends: 86 [2018-02-04 00:52:40,660 INFO L226 Difference]: Without dead ends: 86 [2018-02-04 00:52:40,660 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:52:40,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-04 00:52:40,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2018-02-04 00:52:40,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-04 00:52:40,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2018-02-04 00:52:40,664 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 37 [2018-02-04 00:52:40,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:52:40,664 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2018-02-04 00:52:40,664 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 00:52:40,664 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2018-02-04 00:52:40,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 00:52:40,665 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:52:40,665 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:52:40,665 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-02-04 00:52:40,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1737653486, now seen corresponding path program 1 times [2018-02-04 00:52:40,665 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:52:40,665 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:52:40,666 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:52:40,666 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:52:40,666 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:52:40,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:52:40,675 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:52:40,848 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 00:52:40,848 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:52:40,848 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:52:40,853 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:52:40,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:52:40,869 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:52:40,884 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-02-04 00:52:40,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 00:52:40,885 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:52:40,886 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:52:40,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:52:40,887 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-02-04 00:52:40,922 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-02-04 00:52:40,929 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-02-04 00:52:40,931 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-02-04 00:52:40,931 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:52:40,933 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:52:40,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:52:40,936 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2018-02-04 00:52:40,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-02-04 00:52:40,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-02-04 00:52:40,946 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:52:40,947 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:52:40,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:52:40,948 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-02-04 00:52:40,950 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 00:52:40,979 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 00:52:40,979 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 18 [2018-02-04 00:52:40,979 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 00:52:40,979 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 00:52:40,979 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=259, Unknown=1, NotChecked=32, Total=342 [2018-02-04 00:52:40,980 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand 19 states. [2018-02-04 00:52:41,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:52:41,267 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2018-02-04 00:52:41,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 00:52:41,267 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 37 [2018-02-04 00:52:41,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:52:41,268 INFO L225 Difference]: With dead ends: 83 [2018-02-04 00:52:41,268 INFO L226 Difference]: Without dead ends: 83 [2018-02-04 00:52:41,268 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=740, Unknown=4, NotChecked=56, Total=930 [2018-02-04 00:52:41,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-04 00:52:41,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-02-04 00:52:41,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-04 00:52:41,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2018-02-04 00:52:41,271 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 37 [2018-02-04 00:52:41,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:52:41,271 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2018-02-04 00:52:41,271 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 00:52:41,272 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2018-02-04 00:52:41,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 00:52:41,272 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:52:41,272 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:52:41,272 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-02-04 00:52:41,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1737653487, now seen corresponding path program 1 times [2018-02-04 00:52:41,273 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:52:41,273 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:52:41,274 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:52:41,274 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:52:41,274 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:52:41,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:52:41,283 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:52:41,471 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:52:41,472 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:52:41,472 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:52:41,479 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:52:41,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:52:41,503 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:52:41,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 00:52:41,511 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:52:41,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:52:41,512 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 00:52:41,522 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-02-04 00:52:41,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 00:52:41,523 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:52:41,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:52:41,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:52:41,532 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-02-04 00:52:41,596 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-02-04 00:52:41,603 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-02-04 00:52:41,604 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 00:52:41,612 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 00:52:41,634 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-02-04 00:52:41,634 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:35 [2018-02-04 00:52:41,664 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-02-04 00:52:41,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-02-04 00:52:41,666 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:52:41,668 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:52:41,674 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-02-04 00:52:41,678 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-02-04 00:52:41,679 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-04 00:52:41,684 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:52:41,698 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-02-04 00:52:41,699 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:53, output treesize:24 [2018-02-04 00:52:41,719 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:52:41,736 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:52:41,736 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 22 [2018-02-04 00:52:41,736 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 00:52:41,736 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 00:52:41,736 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=431, Unknown=8, NotChecked=0, Total=506 [2018-02-04 00:52:41,737 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand 23 states. [2018-02-04 00:52:42,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:52:42,079 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2018-02-04 00:52:42,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 00:52:42,079 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 37 [2018-02-04 00:52:42,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:52:42,080 INFO L225 Difference]: With dead ends: 103 [2018-02-04 00:52:42,080 INFO L226 Difference]: Without dead ends: 103 [2018-02-04 00:52:42,080 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=1020, Unknown=13, NotChecked=0, Total=1190 [2018-02-04 00:52:42,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-02-04 00:52:42,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 93. [2018-02-04 00:52:42,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-04 00:52:42,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2018-02-04 00:52:42,082 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 37 [2018-02-04 00:52:42,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:52:42,082 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2018-02-04 00:52:42,082 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 00:52:42,082 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2018-02-04 00:52:42,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 00:52:42,082 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:52:42,083 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:52:42,083 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-02-04 00:52:42,083 INFO L82 PathProgramCache]: Analyzing trace with hash 695150445, now seen corresponding path program 1 times [2018-02-04 00:52:42,083 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:52:42,083 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:52:42,084 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:52:42,084 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:52:42,084 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:52:42,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:52:42,090 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:52:42,113 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 00:52:42,113 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:52:42,113 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 00:52:42,113 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 00:52:42,113 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 00:52:42,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:52:42,114 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand 7 states. [2018-02-04 00:52:42,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:52:42,146 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2018-02-04 00:52:42,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 00:52:42,146 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-02-04 00:52:42,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:52:42,146 INFO L225 Difference]: With dead ends: 90 [2018-02-04 00:52:42,146 INFO L226 Difference]: Without dead ends: 90 [2018-02-04 00:52:42,147 INFO L554 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-02-04 00:52:42,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-02-04 00:52:42,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2018-02-04 00:52:42,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-04 00:52:42,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2018-02-04 00:52:42,148 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 39 [2018-02-04 00:52:42,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:52:42,148 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2018-02-04 00:52:42,148 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 00:52:42,148 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2018-02-04 00:52:42,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 00:52:42,149 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:52:42,149 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:52:42,149 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-02-04 00:52:42,149 INFO L82 PathProgramCache]: Analyzing trace with hash -200066512, now seen corresponding path program 1 times [2018-02-04 00:52:42,149 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:52:42,149 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:52:42,150 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:52:42,150 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:52:42,150 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:52:42,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:52:42,155 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:52:42,175 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:52:42,176 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:52:42,176 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 00:52:42,176 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 00:52:42,176 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 00:52:42,176 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:52:42,176 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand 6 states. [2018-02-04 00:52:42,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:52:42,248 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2018-02-04 00:52:42,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 00:52:42,248 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-02-04 00:52:42,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:52:42,249 INFO L225 Difference]: With dead ends: 104 [2018-02-04 00:52:42,249 INFO L226 Difference]: Without dead ends: 104 [2018-02-04 00:52:42,249 INFO L554 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-02-04 00:52:42,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-04 00:52:42,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2018-02-04 00:52:42,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-02-04 00:52:42,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2018-02-04 00:52:42,251 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 108 transitions. Word has length 44 [2018-02-04 00:52:42,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:52:42,251 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 108 transitions. [2018-02-04 00:52:42,251 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 00:52:42,252 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2018-02-04 00:52:42,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 00:52:42,252 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:52:42,252 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:52:42,252 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-02-04 00:52:42,252 INFO L82 PathProgramCache]: Analyzing trace with hash -200066511, now seen corresponding path program 1 times [2018-02-04 00:52:42,252 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:52:42,253 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:52:42,253 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:52:42,253 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:52:42,254 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:52:42,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:52:42,261 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:52:42,307 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 00:52:42,307 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:52:42,308 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 00:52:42,308 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 00:52:42,308 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 00:52:42,308 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:52:42,308 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand 6 states. [2018-02-04 00:52:42,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:52:42,331 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2018-02-04 00:52:42,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 00:52:42,331 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-02-04 00:52:42,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:52:42,332 INFO L225 Difference]: With dead ends: 94 [2018-02-04 00:52:42,332 INFO L226 Difference]: Without dead ends: 94 [2018-02-04 00:52:42,332 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 00:52:42,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-04 00:52:42,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-02-04 00:52:42,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-04 00:52:42,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2018-02-04 00:52:42,334 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 44 [2018-02-04 00:52:42,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:52:42,334 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2018-02-04 00:52:42,334 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 00:52:42,334 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2018-02-04 00:52:42,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 00:52:42,334 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:52:42,334 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:52:42,334 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-02-04 00:52:42,335 INFO L82 PathProgramCache]: Analyzing trace with hash -705625136, now seen corresponding path program 1 times [2018-02-04 00:52:42,335 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:52:42,335 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:52:42,336 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:52:42,336 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:52:42,336 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:52:42,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:52:42,342 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:52:42,366 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 00:52:42,366 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:52:42,366 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 00:52:42,366 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 00:52:42,366 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 00:52:42,366 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:52:42,367 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand 5 states. [2018-02-04 00:52:42,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:52:42,377 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2018-02-04 00:52:42,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:52:42,378 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-02-04 00:52:42,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:52:42,378 INFO L225 Difference]: With dead ends: 92 [2018-02-04 00:52:42,378 INFO L226 Difference]: Without dead ends: 92 [2018-02-04 00:52:42,378 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:52:42,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-04 00:52:42,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2018-02-04 00:52:42,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-04 00:52:42,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2018-02-04 00:52:42,381 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 44 [2018-02-04 00:52:42,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:52:42,381 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2018-02-04 00:52:42,381 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 00:52:42,381 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-02-04 00:52:42,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 00:52:42,382 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:52:42,382 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:52:42,382 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-02-04 00:52:42,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1264018930, now seen corresponding path program 1 times [2018-02-04 00:52:42,382 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:52:42,382 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:52:42,383 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:52:42,383 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:52:42,383 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:52:42,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:52:42,388 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:52:42,429 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 00:52:42,430 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:52:42,430 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 00:52:42,430 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 00:52:42,430 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 00:52:42,430 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 00:52:42,430 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand 8 states. [2018-02-04 00:52:42,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:52:42,520 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2018-02-04 00:52:42,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 00:52:42,520 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-02-04 00:52:42,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:52:42,521 INFO L225 Difference]: With dead ends: 96 [2018-02-04 00:52:42,521 INFO L226 Difference]: Without dead ends: 96 [2018-02-04 00:52:42,521 INFO L554 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-02-04 00:52:42,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-04 00:52:42,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2018-02-04 00:52:42,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-02-04 00:52:42,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2018-02-04 00:52:42,524 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 46 [2018-02-04 00:52:42,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:52:42,524 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2018-02-04 00:52:42,524 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 00:52:42,524 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2018-02-04 00:52:42,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 00:52:42,524 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:52:42,525 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:52:42,525 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-02-04 00:52:42,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1264018931, now seen corresponding path program 1 times [2018-02-04 00:52:42,525 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:52:42,525 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:52:42,526 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:52:42,526 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:52:42,526 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:52:42,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:52:42,533 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:52:42,657 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 00:52:42,658 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:52:42,658 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 00:52:42,658 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 00:52:42,658 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 00:52:42,658 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-04 00:52:42,658 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand 11 states. [2018-02-04 00:52:42,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:52:42,789 INFO L93 Difference]: Finished difference Result 96 states and 99 transitions. [2018-02-04 00:52:42,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 00:52:42,789 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 46 [2018-02-04 00:52:42,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:52:42,790 INFO L225 Difference]: With dead ends: 96 [2018-02-04 00:52:42,790 INFO L226 Difference]: Without dead ends: 96 [2018-02-04 00:52:42,790 INFO L554 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-02-04 00:52:42,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-04 00:52:42,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2018-02-04 00:52:42,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-04 00:52:42,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2018-02-04 00:52:42,792 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 46 [2018-02-04 00:52:42,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:52:42,793 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2018-02-04 00:52:42,793 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 00:52:42,793 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2018-02-04 00:52:42,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 00:52:42,793 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:52:42,793 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:52:42,793 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-02-04 00:52:42,794 INFO L82 PathProgramCache]: Analyzing trace with hash 529881151, now seen corresponding path program 1 times [2018-02-04 00:52:42,794 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:52:42,794 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:52:42,794 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:52:42,794 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:52:42,794 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:52:42,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:52:42,800 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:52:42,857 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 00:52:42,857 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:52:42,857 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 00:52:42,857 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 00:52:42,857 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 00:52:42,857 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-02-04 00:52:42,858 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand 11 states. [2018-02-04 00:52:43,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:52:43,056 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2018-02-04 00:52:43,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 00:52:43,056 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-02-04 00:52:43,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:52:43,057 INFO L225 Difference]: With dead ends: 97 [2018-02-04 00:52:43,057 INFO L226 Difference]: Without dead ends: 97 [2018-02-04 00:52:43,058 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-02-04 00:52:43,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-04 00:52:43,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2018-02-04 00:52:43,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-04 00:52:43,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2018-02-04 00:52:43,060 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 47 [2018-02-04 00:52:43,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:52:43,060 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2018-02-04 00:52:43,061 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 00:52:43,061 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2018-02-04 00:52:43,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 00:52:43,061 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:52:43,061 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:52:43,061 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-02-04 00:52:43,062 INFO L82 PathProgramCache]: Analyzing trace with hash 529881150, now seen corresponding path program 1 times [2018-02-04 00:52:43,062 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:52:43,062 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:52:43,062 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:52:43,063 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:52:43,063 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:52:43,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:52:43,070 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:52:43,136 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 00:52:43,137 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:52:43,137 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 00:52:43,137 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 00:52:43,137 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 00:52:43,137 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-02-04 00:52:43,137 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand 11 states. [2018-02-04 00:52:43,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:52:43,231 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2018-02-04 00:52:43,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 00:52:43,232 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-02-04 00:52:43,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:52:43,232 INFO L225 Difference]: With dead ends: 94 [2018-02-04 00:52:43,232 INFO L226 Difference]: Without dead ends: 94 [2018-02-04 00:52:43,232 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-02-04 00:52:43,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-04 00:52:43,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-02-04 00:52:43,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-04 00:52:43,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 97 transitions. [2018-02-04 00:52:43,234 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 97 transitions. Word has length 47 [2018-02-04 00:52:43,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:52:43,235 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 97 transitions. [2018-02-04 00:52:43,235 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 00:52:43,235 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2018-02-04 00:52:43,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 00:52:43,235 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:52:43,235 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:52:43,235 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-02-04 00:52:43,236 INFO L82 PathProgramCache]: Analyzing trace with hash 365897592, now seen corresponding path program 1 times [2018-02-04 00:52:43,236 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:52:43,236 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:52:43,236 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:52:43,236 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:52:43,236 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:52:43,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:52:43,244 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:52:43,543 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:52:43,544 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:52:43,544 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:52:43,548 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:52:43,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:52:43,569 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:52:43,668 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 00:52:43,685 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 00:52:43,685 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [18] total 25 [2018-02-04 00:52:43,685 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 00:52:43,686 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 00:52:43,686 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2018-02-04 00:52:43,686 INFO L87 Difference]: Start difference. First operand 94 states and 97 transitions. Second operand 25 states. [2018-02-04 00:52:44,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:52:44,539 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2018-02-04 00:52:44,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 00:52:44,539 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 46 [2018-02-04 00:52:44,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:52:44,539 INFO L225 Difference]: With dead ends: 116 [2018-02-04 00:52:44,539 INFO L226 Difference]: Without dead ends: 116 [2018-02-04 00:52:44,540 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=199, Invalid=2057, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 00:52:44,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-04 00:52:44,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 107. [2018-02-04 00:52:44,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-02-04 00:52:44,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2018-02-04 00:52:44,542 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 46 [2018-02-04 00:52:44,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:52:44,542 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2018-02-04 00:52:44,542 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 00:52:44,542 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2018-02-04 00:52:44,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-04 00:52:44,542 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:52:44,543 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:52:44,543 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-02-04 00:52:44,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1831313542, now seen corresponding path program 1 times [2018-02-04 00:52:44,543 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:52:44,544 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:52:44,544 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:52:44,544 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:52:44,544 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:52:44,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:52:44,553 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:52:44,702 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:52:44,703 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:52:44,703 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-02-04 00:52:44,703 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 00:52:44,703 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 00:52:44,703 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-02-04 00:52:44,703 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand 15 states. [2018-02-04 00:52:45,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:52:45,092 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2018-02-04 00:52:45,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 00:52:45,118 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 50 [2018-02-04 00:52:45,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:52:45,119 INFO L225 Difference]: With dead ends: 106 [2018-02-04 00:52:45,119 INFO L226 Difference]: Without dead ends: 106 [2018-02-04 00:52:45,119 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2018-02-04 00:52:45,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-02-04 00:52:45,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-02-04 00:52:45,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-02-04 00:52:45,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2018-02-04 00:52:45,122 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 50 [2018-02-04 00:52:45,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:52:45,124 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2018-02-04 00:52:45,124 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 00:52:45,124 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2018-02-04 00:52:45,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 00:52:45,125 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:52:45,125 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:52:45,125 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-02-04 00:52:45,125 INFO L82 PathProgramCache]: Analyzing trace with hash -522729561, now seen corresponding path program 1 times [2018-02-04 00:52:45,125 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:52:45,126 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:52:45,126 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:52:45,126 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:52:45,127 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:52:45,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:52:45,136 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:52:45,505 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 00:52:45,505 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:52:45,505 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:52:45,510 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:52:45,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:52:45,531 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:52:45,606 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-02-04 00:52:45,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 00:52:45,609 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:52:45,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:52:45,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:52:45,615 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:34 [2018-02-04 00:52:45,695 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-02-04 00:52:45,702 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:52:45,705 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-02-04 00:52:45,706 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:52:45,711 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:52:45,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:52:45,717 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:34 [2018-02-04 00:52:45,720 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-02-04 00:52:45,722 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-02-04 00:52:45,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:52:45,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:52:45,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:52:45,728 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:16 [2018-02-04 00:52:45,854 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 00:52:45,887 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:52:45,887 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 27 [2018-02-04 00:52:45,887 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 00:52:45,888 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 00:52:45,888 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=644, Unknown=21, NotChecked=0, Total=756 [2018-02-04 00:52:45,888 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand 28 states. [2018-02-04 00:52:46,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:52:46,485 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2018-02-04 00:52:46,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 00:52:46,485 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 48 [2018-02-04 00:52:46,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:52:46,486 INFO L225 Difference]: With dead ends: 111 [2018-02-04 00:52:46,486 INFO L226 Difference]: Without dead ends: 88 [2018-02-04 00:52:46,486 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=177, Invalid=1357, Unknown=26, NotChecked=0, Total=1560 [2018-02-04 00:52:46,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-02-04 00:52:46,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-02-04 00:52:46,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-04 00:52:46,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2018-02-04 00:52:46,488 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 48 [2018-02-04 00:52:46,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:52:46,488 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2018-02-04 00:52:46,488 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 00:52:46,488 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-02-04 00:52:46,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-04 00:52:46,488 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:52:46,488 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:52:46,488 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-02-04 00:52:46,489 INFO L82 PathProgramCache]: Analyzing trace with hash 680328992, now seen corresponding path program 1 times [2018-02-04 00:52:46,489 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:52:46,489 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:52:46,490 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:52:46,490 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:52:46,490 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:52:46,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:52:46,500 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:52:46,644 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:52:46,645 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:52:46,645 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-04 00:52:46,645 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 00:52:46,645 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 00:52:46,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-02-04 00:52:46,645 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand 13 states. [2018-02-04 00:52:46,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:52:46,899 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2018-02-04 00:52:46,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 00:52:46,900 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 51 [2018-02-04 00:52:46,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:52:46,900 INFO L225 Difference]: With dead ends: 87 [2018-02-04 00:52:46,900 INFO L226 Difference]: Without dead ends: 87 [2018-02-04 00:52:46,901 INFO L554 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-02-04 00:52:46,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-02-04 00:52:46,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-02-04 00:52:46,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-04 00:52:46,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2018-02-04 00:52:46,903 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 51 [2018-02-04 00:52:46,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:52:46,903 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2018-02-04 00:52:46,903 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 00:52:46,904 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-02-04 00:52:46,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-04 00:52:46,904 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:52:46,904 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:52:46,904 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-02-04 00:52:46,904 INFO L82 PathProgramCache]: Analyzing trace with hash -936145011, now seen corresponding path program 1 times [2018-02-04 00:52:46,904 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:52:46,905 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:52:46,905 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:52:46,906 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:52:46,906 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:52:46,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:52:46,916 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:52:47,227 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 00:52:47,227 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:52:47,227 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:52:47,232 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:52:47,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:52:47,254 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:52:47,307 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-02-04 00:52:47,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 00:52:47,308 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:52:47,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:52:47,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:52:47,311 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-02-04 00:52:47,368 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-02-04 00:52:47,373 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-02-04 00:52:47,376 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-02-04 00:52:47,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:52:47,379 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:52:47,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:52:47,382 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2018-02-04 00:52:47,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-02-04 00:52:47,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-02-04 00:52:47,478 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:52:47,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:52:47,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:52:47,480 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-02-04 00:52:47,482 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 00:52:47,500 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 00:52:47,500 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [17] total 30 [2018-02-04 00:52:47,501 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-04 00:52:47,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-04 00:52:47,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=779, Unknown=1, NotChecked=56, Total=930 [2018-02-04 00:52:47,501 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 31 states. [2018-02-04 00:52:49,938 WARN L143 SmtUtils]: Spent 2009ms on a formula simplification that was a NOOP. DAG size: 30 [2018-02-04 00:52:50,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:52:50,180 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2018-02-04 00:52:50,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 00:52:50,204 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 51 [2018-02-04 00:52:50,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:52:50,205 INFO L225 Difference]: With dead ends: 92 [2018-02-04 00:52:50,205 INFO L226 Difference]: Without dead ends: 92 [2018-02-04 00:52:50,205 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=257, Invalid=2000, Unknown=3, NotChecked=92, Total=2352 [2018-02-04 00:52:50,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-04 00:52:50,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-02-04 00:52:50,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-04 00:52:50,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 95 transitions. [2018-02-04 00:52:50,208 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 95 transitions. Word has length 51 [2018-02-04 00:52:50,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:52:50,208 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 95 transitions. [2018-02-04 00:52:50,208 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-04 00:52:50,208 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2018-02-04 00:52:50,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-04 00:52:50,208 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:52:50,209 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:52:50,209 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-02-04 00:52:50,209 INFO L82 PathProgramCache]: Analyzing trace with hash -936145010, now seen corresponding path program 1 times [2018-02-04 00:52:50,209 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:52:50,209 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:52:50,210 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:52:50,210 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:52:50,210 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:52:50,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:52:50,224 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:52:50,662 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:52:50,662 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:52:50,662 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:52:50,667 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:52:50,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:52:50,684 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:52:50,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 00:52:50,699 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:52:50,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:52:50,700 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 00:52:50,732 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-02-04 00:52:50,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-02-04 00:52:50,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:52:50,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:52:50,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:52:50,737 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-02-04 00:52:50,806 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-02-04 00:52:50,811 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-02-04 00:52:50,811 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:52:50,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-02-04 00:52:50,822 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-02-04 00:52:50,823 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 00:52:50,827 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:52:50,830 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-02-04 00:52:50,830 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:29, output treesize:21 [2018-02-04 00:52:50,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-02-04 00:52:50,935 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-02-04 00:52:50,935 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:52:50,936 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:52:50,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:52:50,937 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2018-02-04 00:52:50,939 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:52:50,956 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 00:52:50,956 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [21] total 36 [2018-02-04 00:52:50,957 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 00:52:50,957 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 00:52:50,957 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1142, Unknown=1, NotChecked=68, Total=1332 [2018-02-04 00:52:50,957 INFO L87 Difference]: Start difference. First operand 92 states and 95 transitions. Second operand 37 states. [2018-02-04 00:52:55,786 WARN L146 SmtUtils]: Spent 4048ms on a formula simplification. DAG size of input: 46 DAG size of output 43 [2018-02-04 00:52:56,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:52:56,091 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2018-02-04 00:52:56,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 00:52:56,092 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 51 [2018-02-04 00:52:56,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:52:56,092 INFO L225 Difference]: With dead ends: 94 [2018-02-04 00:52:56,092 INFO L226 Difference]: Without dead ends: 94 [2018-02-04 00:52:56,093 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=313, Invalid=2658, Unknown=3, NotChecked=106, Total=3080 [2018-02-04 00:52:56,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-04 00:52:56,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2018-02-04 00:52:56,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-04 00:52:56,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 96 transitions. [2018-02-04 00:52:56,094 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 96 transitions. Word has length 51 [2018-02-04 00:52:56,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:52:56,095 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 96 transitions. [2018-02-04 00:52:56,095 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 00:52:56,095 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2018-02-04 00:52:56,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 00:52:56,095 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:52:56,095 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:52:56,095 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-02-04 00:52:56,096 INFO L82 PathProgramCache]: Analyzing trace with hash -384637660, now seen corresponding path program 1 times [2018-02-04 00:52:56,096 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:52:56,096 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:52:56,096 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:52:56,096 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:52:56,096 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:52:56,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:52:56,104 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:52:56,597 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:52:56,597 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:52:56,597 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:52:56,607 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:52:56,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:52:56,648 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:52:56,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 00:52:56,653 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:52:56,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:52:56,654 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 00:52:56,675 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-02-04 00:52:56,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 00:52:56,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:52:56,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:52:56,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:52:56,679 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-02-04 00:52:56,783 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:52:56,784 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:52:56,784 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-02-04 00:52:56,785 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:52:56,792 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-02-04 00:52:56,794 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:52:56,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-02-04 00:52:56,795 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:52:56,798 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:52:56,802 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-02-04 00:52:56,802 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:38, output treesize:43 [2018-02-04 00:52:56,877 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-02-04 00:52:56,877 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:52:56,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 00:52:56,881 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:26 [2018-02-04 00:53:01,051 WARN L143 SmtUtils]: Spent 4013ms on a formula simplification that was a NOOP. DAG size: 27 [2018-02-04 00:53:01,115 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:53:01,117 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-02-04 00:53:01,117 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:53:01,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 00:53:01,125 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:75, output treesize:51 [2018-02-04 00:53:01,184 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-02-04 00:53:01,186 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:53:01,186 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:53:01,187 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-02-04 00:53:01,187 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:53:01,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:53:01,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:53:01,194 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:15 [2018-02-04 00:53:01,221 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:53:01,240 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 00:53:01,240 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [22] total 35 [2018-02-04 00:53:01,241 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-04 00:53:01,241 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-04 00:53:01,241 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1144, Unknown=8, NotChecked=0, Total=1260 [2018-02-04 00:53:01,241 INFO L87 Difference]: Start difference. First operand 93 states and 96 transitions. Second operand 36 states. [2018-02-04 00:53:04,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:53:04,337 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2018-02-04 00:53:04,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 00:53:04,337 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 52 [2018-02-04 00:53:04,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:53:04,337 INFO L225 Difference]: With dead ends: 93 [2018-02-04 00:53:04,337 INFO L226 Difference]: Without dead ends: 93 [2018-02-04 00:53:04,338 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 35 SyntacticMatches, 6 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 671 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=250, Invalid=2498, Unknown=8, NotChecked=0, Total=2756 [2018-02-04 00:53:04,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-04 00:53:04,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2018-02-04 00:53:04,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-04 00:53:04,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 95 transitions. [2018-02-04 00:53:04,340 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 95 transitions. Word has length 52 [2018-02-04 00:53:04,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:53:04,340 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 95 transitions. [2018-02-04 00:53:04,340 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-04 00:53:04,340 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2018-02-04 00:53:04,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 00:53:04,340 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:53:04,340 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:53:04,341 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-02-04 00:53:04,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1081279336, now seen corresponding path program 1 times [2018-02-04 00:53:04,341 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:53:04,341 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:53:04,341 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:53:04,341 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:53:04,342 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:53:04,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:53:04,348 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:53:04,367 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 00:53:04,367 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:53:04,367 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 00:53:04,367 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 00:53:04,368 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 00:53:04,368 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:53:04,368 INFO L87 Difference]: Start difference. First operand 92 states and 95 transitions. Second operand 5 states. [2018-02-04 00:53:04,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:53:04,375 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2018-02-04 00:53:04,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:53:04,375 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-02-04 00:53:04,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:53:04,376 INFO L225 Difference]: With dead ends: 96 [2018-02-04 00:53:04,376 INFO L226 Difference]: Without dead ends: 96 [2018-02-04 00:53:04,376 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:53:04,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-04 00:53:04,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2018-02-04 00:53:04,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-04 00:53:04,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2018-02-04 00:53:04,378 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 52 [2018-02-04 00:53:04,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:53:04,379 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2018-02-04 00:53:04,379 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 00:53:04,379 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2018-02-04 00:53:04,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 00:53:04,379 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:53:04,379 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:53:04,379 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-02-04 00:53:04,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1569562575, now seen corresponding path program 1 times [2018-02-04 00:53:04,380 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:53:04,380 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:53:04,380 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:53:04,380 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:53:04,381 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:53:04,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:53:04,393 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:53:04,910 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:53:04,911 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:53:04,911 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:53:04,915 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:53:04,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:53:04,933 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:53:04,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 00:53:04,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:53:04,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:53:04,937 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 00:53:05,020 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-02-04 00:53:05,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 00:53:05,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:53:05,022 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:53:05,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:53:05,026 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:28 [2018-02-04 00:53:05,098 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-02-04 00:53:05,100 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:53:05,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, 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-02-04 00:53:05,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:53:05,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:53:05,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:53:05,109 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:27 [2018-02-04 00:53:05,131 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-02-04 00:53:05,132 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:53:05,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 00:53:05,134 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-02-04 00:53:11,234 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:53:11,235 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:53:11,235 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-02-04 00:53:11,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:53:11,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:53:11,238 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2018-02-04 00:53:11,309 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-02-04 00:53:11,311 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-02-04 00:53:11,311 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:53:11,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:53:11,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:53:11,315 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:14 [2018-02-04 00:53:11,338 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:53:11,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-02-04 00:53:11,339 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:53:11,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:53:11,344 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:15 [2018-02-04 00:53:11,478 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:53:11,497 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:53:11,497 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 38 [2018-02-04 00:53:11,497 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-04 00:53:11,497 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-04 00:53:11,498 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1375, Unknown=5, NotChecked=0, Total=1482 [2018-02-04 00:53:11,498 INFO L87 Difference]: Start difference. First operand 92 states and 94 transitions. Second operand 39 states. [2018-02-04 00:53:29,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:53:29,923 INFO L93 Difference]: Finished difference Result 100 states and 103 transitions. [2018-02-04 00:53:29,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 00:53:29,924 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 55 [2018-02-04 00:53:29,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:53:29,924 INFO L225 Difference]: With dead ends: 100 [2018-02-04 00:53:29,924 INFO L226 Difference]: Without dead ends: 100 [2018-02-04 00:53:29,925 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 997 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=345, Invalid=4205, Unknown=6, NotChecked=0, Total=4556 [2018-02-04 00:53:29,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-02-04 00:53:29,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2018-02-04 00:53:29,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-04 00:53:29,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2018-02-04 00:53:29,928 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 55 [2018-02-04 00:53:29,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:53:29,928 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2018-02-04 00:53:29,928 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-04 00:53:29,928 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-02-04 00:53:29,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 00:53:29,928 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:53:29,929 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:53:29,929 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-02-04 00:53:29,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1569562576, now seen corresponding path program 1 times [2018-02-04 00:53:29,929 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:53:29,929 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:53:29,930 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:53:29,930 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:53:29,930 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:53:29,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:53:29,938 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:53:30,001 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 00:53:30,002 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:53:30,002 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 00:53:30,002 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 00:53:30,002 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 00:53:30,003 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-04 00:53:30,003 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand 8 states. [2018-02-04 00:53:30,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:53:30,057 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2018-02-04 00:53:30,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 00:53:30,057 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2018-02-04 00:53:30,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:53:30,058 INFO L225 Difference]: With dead ends: 95 [2018-02-04 00:53:30,058 INFO L226 Difference]: Without dead ends: 95 [2018-02-04 00:53:30,058 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-02-04 00:53:30,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-04 00:53:30,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-02-04 00:53:30,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-04 00:53:30,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 98 transitions. [2018-02-04 00:53:30,060 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 98 transitions. Word has length 55 [2018-02-04 00:53:30,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:53:30,060 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 98 transitions. [2018-02-04 00:53:30,061 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 00:53:30,061 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 98 transitions. [2018-02-04 00:53:30,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 00:53:30,061 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:53:30,061 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:53:30,061 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-02-04 00:53:30,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1411799554, now seen corresponding path program 1 times [2018-02-04 00:53:30,061 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:53:30,062 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:53:30,062 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:53:30,062 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:53:30,062 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:53:30,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:53:30,075 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:53:30,736 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:53:30,736 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:53:30,736 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:53:30,743 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:53:30,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:53:30,764 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:53:30,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 00:53:30,786 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:53:30,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:53:30,788 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:10 [2018-02-04 00:53:30,837 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-02-04 00:53:30,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 00:53:30,839 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:53:30,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:53:30,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:53:30,845 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:28 [2018-02-04 00:53:31,036 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:53:31,037 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:53:31,038 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-02-04 00:53:31,038 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:53:31,046 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-02-04 00:53:31,048 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:53:31,048 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-02-04 00:53:31,049 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:53:31,053 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:53:31,059 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-02-04 00:53:31,059 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:44, output treesize:45 [2018-02-04 00:53:31,290 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:53:31,291 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-02-04 00:53:31,291 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:53:31,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:53:31,296 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:60, output treesize:34 [2018-02-04 00:53:31,390 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-02-04 00:53:31,392 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:53:31,392 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-02-04 00:53:31,392 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:53:31,396 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:53:31,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:53:31,400 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:15 [2018-02-04 00:53:31,440 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:53:31,456 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:53:31,456 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 44 [2018-02-04 00:53:31,457 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-02-04 00:53:31,457 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-02-04 00:53:31,457 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1839, Unknown=8, NotChecked=0, Total=1980 [2018-02-04 00:53:31,458 INFO L87 Difference]: Start difference. First operand 95 states and 98 transitions. Second operand 45 states. [2018-02-04 00:53:32,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:53:32,344 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2018-02-04 00:53:32,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 00:53:32,344 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 56 [2018-02-04 00:53:32,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:53:32,344 INFO L225 Difference]: With dead ends: 97 [2018-02-04 00:53:32,344 INFO L226 Difference]: Without dead ends: 97 [2018-02-04 00:53:32,345 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 981 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=285, Invalid=3613, Unknown=8, NotChecked=0, Total=3906 [2018-02-04 00:53:32,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-04 00:53:32,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2018-02-04 00:53:32,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-04 00:53:32,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2018-02-04 00:53:32,347 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 56 [2018-02-04 00:53:32,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:53:32,347 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2018-02-04 00:53:32,347 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-02-04 00:53:32,347 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-02-04 00:53:32,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 00:53:32,347 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:53:32,347 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:53:32,347 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-02-04 00:53:32,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1411799553, now seen corresponding path program 1 times [2018-02-04 00:53:32,347 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:53:32,348 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:53:32,348 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:53:32,348 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:53:32,348 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:53:32,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:53:32,354 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:53:32,471 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 00:53:32,471 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:53:32,472 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-02-04 00:53:32,472 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 00:53:32,472 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 00:53:32,472 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-02-04 00:53:32,472 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand 15 states. [2018-02-04 00:53:32,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:53:32,633 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2018-02-04 00:53:32,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 00:53:32,633 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2018-02-04 00:53:32,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:53:32,634 INFO L225 Difference]: With dead ends: 95 [2018-02-04 00:53:32,634 INFO L226 Difference]: Without dead ends: 95 [2018-02-04 00:53:32,634 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-02-04 00:53:32,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-04 00:53:32,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-02-04 00:53:32,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-04 00:53:32,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 98 transitions. [2018-02-04 00:53:32,636 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 98 transitions. Word has length 56 [2018-02-04 00:53:32,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:53:32,636 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 98 transitions. [2018-02-04 00:53:32,636 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 00:53:32,636 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 98 transitions. [2018-02-04 00:53:32,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-04 00:53:32,637 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:53:32,637 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:53:32,637 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-02-04 00:53:32,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1384633629, now seen corresponding path program 1 times [2018-02-04 00:53:32,637 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:53:32,637 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:53:32,638 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:53:32,638 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:53:32,638 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:53:32,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:53:32,645 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:53:32,671 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 00:53:32,671 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:53:32,671 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 00:53:32,671 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 00:53:32,672 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 00:53:32,672 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:53:32,672 INFO L87 Difference]: Start difference. First operand 95 states and 98 transitions. Second operand 6 states. [2018-02-04 00:53:32,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:53:32,689 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-02-04 00:53:32,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 00:53:32,689 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-02-04 00:53:32,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:53:32,690 INFO L225 Difference]: With dead ends: 86 [2018-02-04 00:53:32,690 INFO L226 Difference]: Without dead ends: 86 [2018-02-04 00:53:32,690 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:53:32,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-04 00:53:32,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2018-02-04 00:53:32,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-04 00:53:32,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-02-04 00:53:32,692 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 61 [2018-02-04 00:53:32,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:53:32,693 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-02-04 00:53:32,693 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 00:53:32,693 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-02-04 00:53:32,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-04 00:53:32,693 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:53:32,693 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:53:32,693 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-02-04 00:53:32,694 INFO L82 PathProgramCache]: Analyzing trace with hash 843947090, now seen corresponding path program 1 times [2018-02-04 00:53:32,694 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:53:32,694 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:53:32,694 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:53:32,695 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:53:32,695 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:53:32,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:53:32,710 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:53:33,715 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 00:53:33,715 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:53:33,716 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:53:33,721 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:53:33,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:53:33,744 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:53:33,809 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-02-04 00:53:33,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 00:53:33,810 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:53:33,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:53:33,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:53:33,817 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:45 [2018-02-04 00:53:33,992 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 00:53:34,013 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-02-04 00:53:34,015 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:53:34,016 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:53:34,016 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-02-04 00:53:34,016 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:53:34,023 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:53:34,034 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-02-04 00:53:34,034 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:82, output treesize:86 [2018-02-04 00:53:34,036 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 219172 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:222) 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:397) 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-02-04 00:53:34,038 INFO L168 Benchmark]: Toolchain (without parser) took 57703.76 ms. Allocated memory was 404.2 MB in the beginning and 891.3 MB in the end (delta: 487.1 MB). Free memory was 360.9 MB in the beginning and 627.8 MB in the end (delta: -266.9 MB). Peak memory consumption was 220.2 MB. Max. memory is 5.3 GB. [2018-02-04 00:53:34,039 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 404.2 MB. Free memory is still 366.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 00:53:34,039 INFO L168 Benchmark]: CACSL2BoogieTranslator took 164.56 ms. Allocated memory is still 404.2 MB. Free memory was 360.9 MB in the beginning and 347.7 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 00:53:34,039 INFO L168 Benchmark]: Boogie Preprocessor took 27.76 ms. Allocated memory is still 404.2 MB. Free memory was 347.7 MB in the beginning and 345.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 00:53:34,040 INFO L168 Benchmark]: RCFGBuilder took 228.99 ms. Allocated memory is still 404.2 MB. Free memory was 345.1 MB in the beginning and 319.8 MB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 5.3 GB. [2018-02-04 00:53:34,040 INFO L168 Benchmark]: TraceAbstraction took 57279.52 ms. Allocated memory was 404.2 MB in the beginning and 891.3 MB in the end (delta: 487.1 MB). Free memory was 319.8 MB in the beginning and 627.8 MB in the end (delta: -308.0 MB). Peak memory consumption was 179.0 MB. Max. memory is 5.3 GB. [2018-02-04 00:53:34,041 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 404.2 MB. Free memory is still 366.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 164.56 ms. Allocated memory is still 404.2 MB. Free memory was 360.9 MB in the beginning and 347.7 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 27.76 ms. Allocated memory is still 404.2 MB. Free memory was 347.7 MB in the beginning and 345.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 228.99 ms. Allocated memory is still 404.2 MB. Free memory was 345.1 MB in the beginning and 319.8 MB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 57279.52 ms. Allocated memory was 404.2 MB in the beginning and 891.3 MB in the end (delta: 487.1 MB). Free memory was 319.8 MB in the beginning and 627.8 MB in the end (delta: -308.0 MB). Peak memory consumption was 179.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 219172 column 39: unknown constant v_DerPreprocessor_1 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 219172 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 /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test19_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_00-53-34-048.csv Received shutdown request...