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_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 19:13:55,073 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 19:13:55,074 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 19:13:55,084 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 19:13:55,084 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 19:13:55,085 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 19:13:55,086 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 19:13:55,087 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 19:13:55,089 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 19:13:55,089 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 19:13:55,090 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 19:13:55,090 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 19:13:55,091 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 19:13:55,092 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 19:13:55,093 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 19:13:55,094 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 19:13:55,096 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 19:13:55,097 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 19:13:55,098 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 19:13:55,099 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 19:13:55,101 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 19:13:55,101 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 19:13:55,101 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 19:13:55,102 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 19:13:55,102 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 19:13:55,103 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 19:13:55,103 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 19:13:55,104 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 19:13:55,104 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 19:13:55,104 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 19:13:55,105 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 19:13:55,105 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-02 19:13:55,114 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 19:13:55,115 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 19:13:55,115 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 19:13:55,116 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 19:13:55,116 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 19:13:55,116 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 19:13:55,116 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 19:13:55,116 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 19:13:55,116 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 19:13:55,117 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 19:13:55,117 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 19:13:55,117 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 19:13:55,117 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 19:13:55,117 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 19:13:55,118 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 19:13:55,118 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 19:13:55,118 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 19:13:55,118 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 19:13:55,118 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 19:13:55,118 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 19:13:55,119 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 19:13:55,119 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 19:13:55,119 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 19:13:55,119 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 19:13:55,119 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 19:13:55,149 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 19:13:55,165 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 19:13:55,170 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 19:13:55,172 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 19:13:55,172 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 19:13:55,173 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test19_false-valid-free.i [2018-02-02 19:13:55,327 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 19:13:55,328 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 19:13:55,329 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 19:13:55,329 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 19:13:55,335 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 19:13:55,336 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 07:13:55" (1/1) ... [2018-02-02 19:13:55,338 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30ce2b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:13:55, skipping insertion in model container [2018-02-02 19:13:55,338 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 07:13:55" (1/1) ... [2018-02-02 19:13:55,353 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 19:13:55,392 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 19:13:55,478 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 19:13:55,490 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 19:13:55,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:13:55 WrapperNode [2018-02-02 19:13:55,496 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 19:13:55,496 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 19:13:55,496 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 19:13:55,496 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 19:13:55,509 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:13:55" (1/1) ... [2018-02-02 19:13:55,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:13:55" (1/1) ... [2018-02-02 19:13:55,517 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:13:55" (1/1) ... [2018-02-02 19:13:55,518 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:13:55" (1/1) ... [2018-02-02 19:13:55,520 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:13:55" (1/1) ... [2018-02-02 19:13:55,522 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:13:55" (1/1) ... [2018-02-02 19:13:55,522 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:13:55" (1/1) ... [2018-02-02 19:13:55,524 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 19:13:55,524 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 19:13:55,524 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 19:13:55,524 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 19:13:55,525 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:13:55" (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-02 19:13:55,558 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 19:13:55,558 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 19:13:55,558 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 19:13:55,558 INFO L136 BoogieDeclarations]: Found implementation of procedure f19 [2018-02-02 19:13:55,558 INFO L136 BoogieDeclarations]: Found implementation of procedure f19_undo [2018-02-02 19:13:55,558 INFO L136 BoogieDeclarations]: Found implementation of procedure g19 [2018-02-02 19:13:55,558 INFO L136 BoogieDeclarations]: Found implementation of procedure probe_unsafe_19 [2018-02-02 19:13:55,558 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_19 [2018-02-02 19:13:55,559 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 19:13:55,559 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 19:13:55,559 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 19:13:55,559 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 19:13:55,559 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 19:13:55,559 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 19:13:55,559 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 19:13:55,559 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 19:13:55,559 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 19:13:55,559 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 19:13:55,559 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 19:13:55,559 INFO L128 BoogieDeclarations]: Found specification of procedure f19 [2018-02-02 19:13:55,559 INFO L128 BoogieDeclarations]: Found specification of procedure f19_undo [2018-02-02 19:13:55,560 INFO L128 BoogieDeclarations]: Found specification of procedure g19 [2018-02-02 19:13:55,560 INFO L128 BoogieDeclarations]: Found specification of procedure probe_unsafe_19 [2018-02-02 19:13:55,560 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_19 [2018-02-02 19:13:55,560 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 19:13:55,560 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 19:13:55,560 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 19:13:55,560 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 19:13:55,743 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 19:13:55,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 07:13:55 BoogieIcfgContainer [2018-02-02 19:13:55,744 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 19:13:55,744 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 19:13:55,745 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 19:13:55,747 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 19:13:55,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 07:13:55" (1/3) ... [2018-02-02 19:13:55,748 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e2a58ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 07:13:55, skipping insertion in model container [2018-02-02 19:13:55,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:13:55" (2/3) ... [2018-02-02 19:13:55,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e2a58ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 07:13:55, skipping insertion in model container [2018-02-02 19:13:55,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 07:13:55" (3/3) ... [2018-02-02 19:13:55,750 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test19_false-valid-free.i [2018-02-02 19:13:55,755 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 19:13:55,759 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-02-02 19:13:55,790 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 19:13:55,790 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 19:13:55,791 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 19:13:55,791 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 19:13:55,791 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 19:13:55,791 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 19:13:55,791 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 19:13:55,791 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 19:13:55,792 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 19:13:55,804 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states. [2018-02-02 19:13:55,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 19:13:55,813 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:13:55,813 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:13:55,814 INFO L371 AbstractCegarLoop]: === Iteration 1 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-02 19:13:55,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1664045335, now seen corresponding path program 1 times [2018-02-02 19:13:55,819 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:13:55,820 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:13:55,858 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:13:55,859 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:13:55,859 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:13:55,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:13:55,894 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:13:56,010 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-02 19:13:56,012 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:13:56,013 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 19:13:56,014 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 19:13:56,087 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 19:13:56,087 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 19:13:56,089 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 6 states. [2018-02-02 19:13:56,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:13:56,388 INFO L93 Difference]: Finished difference Result 136 states and 158 transitions. [2018-02-02 19:13:56,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 19:13:56,389 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-02-02 19:13:56,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:13:56,399 INFO L225 Difference]: With dead ends: 136 [2018-02-02 19:13:56,399 INFO L226 Difference]: Without dead ends: 133 [2018-02-02 19:13:56,400 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-02 19:13:56,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-02-02 19:13:56,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 97. [2018-02-02 19:13:56,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-02-02 19:13:56,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 113 transitions. [2018-02-02 19:13:56,436 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 113 transitions. Word has length 15 [2018-02-02 19:13:56,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:13:56,437 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 113 transitions. [2018-02-02 19:13:56,437 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 19:13:56,437 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 113 transitions. [2018-02-02 19:13:56,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 19:13:56,438 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:13:56,438 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:13:56,438 INFO L371 AbstractCegarLoop]: === Iteration 2 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-02 19:13:56,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1664045336, now seen corresponding path program 1 times [2018-02-02 19:13:56,438 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:13:56,438 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:13:56,440 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:13:56,440 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:13:56,440 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:13:56,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:13:56,456 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:13:56,529 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-02 19:13:56,529 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:13:56,529 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 19:13:56,530 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 19:13:56,531 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 19:13:56,531 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 19:13:56,531 INFO L87 Difference]: Start difference. First operand 97 states and 113 transitions. Second operand 6 states. [2018-02-02 19:13:56,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:13:56,761 INFO L93 Difference]: Finished difference Result 126 states and 146 transitions. [2018-02-02 19:13:56,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 19:13:56,761 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-02-02 19:13:56,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:13:56,765 INFO L225 Difference]: With dead ends: 126 [2018-02-02 19:13:56,765 INFO L226 Difference]: Without dead ends: 126 [2018-02-02 19:13:56,765 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-02 19:13:56,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-02 19:13:56,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 109. [2018-02-02 19:13:56,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-02 19:13:56,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 132 transitions. [2018-02-02 19:13:56,775 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 132 transitions. Word has length 15 [2018-02-02 19:13:56,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:13:56,776 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 132 transitions. [2018-02-02 19:13:56,776 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 19:13:56,776 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 132 transitions. [2018-02-02 19:13:56,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 19:13:56,776 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:13:56,776 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:13:56,776 INFO L371 AbstractCegarLoop]: === Iteration 3 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-02 19:13:56,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1330432345, now seen corresponding path program 1 times [2018-02-02 19:13:56,777 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:13:56,777 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:13:56,778 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:13:56,778 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:13:56,779 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:13:56,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:13:56,798 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:13:56,881 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-02 19:13:56,881 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:13:56,881 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 19:13:56,881 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 19:13:56,882 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 19:13:56,882 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 19:13:56,882 INFO L87 Difference]: Start difference. First operand 109 states and 132 transitions. Second operand 8 states. [2018-02-02 19:13:57,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:13:57,193 INFO L93 Difference]: Finished difference Result 147 states and 174 transitions. [2018-02-02 19:13:57,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 19:13:57,193 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-02-02 19:13:57,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:13:57,194 INFO L225 Difference]: With dead ends: 147 [2018-02-02 19:13:57,194 INFO L226 Difference]: Without dead ends: 147 [2018-02-02 19:13:57,195 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-02 19:13:57,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-02-02 19:13:57,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 106. [2018-02-02 19:13:57,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-02-02 19:13:57,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 128 transitions. [2018-02-02 19:13:57,203 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 128 transitions. Word has length 17 [2018-02-02 19:13:57,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:13:57,204 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 128 transitions. [2018-02-02 19:13:57,204 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 19:13:57,204 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 128 transitions. [2018-02-02 19:13:57,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 19:13:57,204 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:13:57,204 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:13:57,205 INFO L371 AbstractCegarLoop]: === Iteration 4 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-02 19:13:57,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1330432346, now seen corresponding path program 1 times [2018-02-02 19:13:57,205 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:13:57,205 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:13:57,206 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:13:57,207 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:13:57,207 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:13:57,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:13:57,220 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:13:57,305 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-02 19:13:57,305 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:13:57,305 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 19:13:57,305 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 19:13:57,306 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 19:13:57,306 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 19:13:57,306 INFO L87 Difference]: Start difference. First operand 106 states and 128 transitions. Second operand 9 states. [2018-02-02 19:13:57,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:13:57,605 INFO L93 Difference]: Finished difference Result 149 states and 175 transitions. [2018-02-02 19:13:57,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 19:13:57,605 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-02-02 19:13:57,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:13:57,606 INFO L225 Difference]: With dead ends: 149 [2018-02-02 19:13:57,606 INFO L226 Difference]: Without dead ends: 149 [2018-02-02 19:13:57,606 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-02-02 19:13:57,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-02-02 19:13:57,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 82. [2018-02-02 19:13:57,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-02 19:13:57,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2018-02-02 19:13:57,612 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 17 [2018-02-02 19:13:57,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:13:57,612 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2018-02-02 19:13:57,612 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 19:13:57,612 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2018-02-02 19:13:57,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 19:13:57,613 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:13:57,613 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-02 19:13:57,613 INFO L371 AbstractCegarLoop]: === Iteration 5 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-02 19:13:57,613 INFO L82 PathProgramCache]: Analyzing trace with hash 522081757, now seen corresponding path program 1 times [2018-02-02 19:13:57,613 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:13:57,614 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:13:57,615 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:13:57,615 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:13:57,615 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:13:57,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:13:57,625 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:13:57,672 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-02 19:13:57,672 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:13:57,672 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-02 19:13:57,680 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:13:57,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:13:57,711 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:13:57,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 19:13:57,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:13:57,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:13:57,738 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-02 19:13:57,787 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-02 19:13:57,805 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:13:57,805 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 12 [2018-02-02 19:13:57,806 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 19:13:57,806 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 19:13:57,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-02-02 19:13:57,806 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand 12 states. [2018-02-02 19:13:58,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:13:58,080 INFO L93 Difference]: Finished difference Result 112 states and 127 transitions. [2018-02-02 19:13:58,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 19:13:58,084 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-02-02 19:13:58,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:13:58,086 INFO L225 Difference]: With dead ends: 112 [2018-02-02 19:13:58,086 INFO L226 Difference]: Without dead ends: 112 [2018-02-02 19:13:58,086 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-02 19:13:58,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-02 19:13:58,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 88. [2018-02-02 19:13:58,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-02 19:13:58,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2018-02-02 19:13:58,092 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 26 [2018-02-02 19:13:58,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:13:58,092 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2018-02-02 19:13:58,093 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 19:13:58,093 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2018-02-02 19:13:58,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 19:13:58,093 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:13:58,094 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-02 19:13:58,095 INFO L371 AbstractCegarLoop]: === Iteration 6 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-02 19:13:58,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1860386785, now seen corresponding path program 1 times [2018-02-02 19:13:58,095 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:13:58,095 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:13:58,096 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:13:58,096 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:13:58,097 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:13:58,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:13:58,105 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:13:58,143 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-02 19:13:58,143 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:13:58,144 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 19:13:58,144 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 19:13:58,144 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 19:13:58,144 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 19:13:58,144 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand 8 states. [2018-02-02 19:13:58,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:13:58,228 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2018-02-02 19:13:58,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 19:13:58,229 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-02-02 19:13:58,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:13:58,230 INFO L225 Difference]: With dead ends: 101 [2018-02-02 19:13:58,230 INFO L226 Difference]: Without dead ends: 101 [2018-02-02 19:13:58,230 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-02 19:13:58,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-02-02 19:13:58,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 96. [2018-02-02 19:13:58,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-02 19:13:58,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2018-02-02 19:13:58,236 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 26 [2018-02-02 19:13:58,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:13:58,236 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2018-02-02 19:13:58,236 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 19:13:58,236 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2018-02-02 19:13:58,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 19:13:58,237 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:13:58,237 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:13:58,237 INFO L371 AbstractCegarLoop]: === Iteration 7 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-02 19:13:58,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1860386784, now seen corresponding path program 1 times [2018-02-02 19:13:58,237 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:13:58,238 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:13:58,239 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:13:58,239 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:13:58,239 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:13:58,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:13:58,247 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:13:58,272 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-02 19:13:58,272 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:13:58,272 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 19:13:58,272 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 19:13:58,272 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 19:13:58,272 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 19:13:58,273 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand 6 states. [2018-02-02 19:13:58,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:13:58,284 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2018-02-02 19:13:58,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 19:13:58,285 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-02 19:13:58,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:13:58,285 INFO L225 Difference]: With dead ends: 97 [2018-02-02 19:13:58,285 INFO L226 Difference]: Without dead ends: 97 [2018-02-02 19:13:58,286 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-02 19:13:58,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-02 19:13:58,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2018-02-02 19:13:58,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-02 19:13:58,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2018-02-02 19:13:58,289 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 26 [2018-02-02 19:13:58,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:13:58,289 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2018-02-02 19:13:58,289 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 19:13:58,289 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2018-02-02 19:13:58,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 19:13:58,289 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:13:58,290 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-02 19:13:58,290 INFO L371 AbstractCegarLoop]: === Iteration 8 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-02 19:13:58,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1338867620, now seen corresponding path program 1 times [2018-02-02 19:13:58,290 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:13:58,290 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:13:58,291 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:13:58,291 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:13:58,291 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:13:58,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:13:58,301 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:13:58,381 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-02 19:13:58,381 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:13:58,381 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 19:13:58,382 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 19:13:58,382 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 19:13:58,382 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-02 19:13:58,382 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand 9 states. [2018-02-02 19:13:58,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:13:58,605 INFO L93 Difference]: Finished difference Result 112 states and 125 transitions. [2018-02-02 19:13:58,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 19:13:58,605 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-02-02 19:13:58,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:13:58,606 INFO L225 Difference]: With dead ends: 112 [2018-02-02 19:13:58,606 INFO L226 Difference]: Without dead ends: 112 [2018-02-02 19:13:58,606 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-02 19:13:58,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-02 19:13:58,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 95. [2018-02-02 19:13:58,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-02 19:13:58,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2018-02-02 19:13:58,609 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 28 [2018-02-02 19:13:58,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:13:58,609 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2018-02-02 19:13:58,609 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 19:13:58,609 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2018-02-02 19:13:58,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 19:13:58,610 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:13:58,610 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-02 19:13:58,610 INFO L371 AbstractCegarLoop]: === Iteration 9 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-02 19:13:58,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1748755101, now seen corresponding path program 1 times [2018-02-02 19:13:58,610 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:13:58,610 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:13:58,612 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:13:58,612 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:13:58,612 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:13:58,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:13:58,622 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:13:58,689 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-02 19:13:58,689 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:13:58,689 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 19:13:58,689 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 19:13:58,690 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 19:13:58,690 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 19:13:58,690 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand 8 states. [2018-02-02 19:13:58,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:13:58,905 INFO L93 Difference]: Finished difference Result 117 states and 130 transitions. [2018-02-02 19:13:58,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 19:13:58,906 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-02-02 19:13:58,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:13:58,907 INFO L225 Difference]: With dead ends: 117 [2018-02-02 19:13:58,907 INFO L226 Difference]: Without dead ends: 117 [2018-02-02 19:13:58,907 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-02-02 19:13:58,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-02-02 19:13:58,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 94. [2018-02-02 19:13:58,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-02 19:13:58,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2018-02-02 19:13:58,911 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 30 [2018-02-02 19:13:58,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:13:58,911 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2018-02-02 19:13:58,911 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 19:13:58,911 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2018-02-02 19:13:58,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 19:13:58,912 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:13:58,912 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-02 19:13:58,912 INFO L371 AbstractCegarLoop]: === Iteration 10 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-02 19:13:58,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1748755102, now seen corresponding path program 1 times [2018-02-02 19:13:58,913 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:13:58,913 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:13:58,914 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:13:58,914 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:13:58,914 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:13:58,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:13:58,924 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:13:59,033 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-02 19:13:59,033 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:13:59,033 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 19:13:59,033 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 19:13:59,034 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 19:13:59,034 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-02 19:13:59,034 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand 12 states. [2018-02-02 19:13:59,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:13:59,361 INFO L93 Difference]: Finished difference Result 124 states and 136 transitions. [2018-02-02 19:13:59,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 19:13:59,361 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2018-02-02 19:13:59,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:13:59,362 INFO L225 Difference]: With dead ends: 124 [2018-02-02 19:13:59,362 INFO L226 Difference]: Without dead ends: 124 [2018-02-02 19:13:59,363 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2018-02-02 19:13:59,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-02 19:13:59,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 89. [2018-02-02 19:13:59,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-02 19:13:59,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2018-02-02 19:13:59,366 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 30 [2018-02-02 19:13:59,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:13:59,369 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2018-02-02 19:13:59,369 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 19:13:59,369 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2018-02-02 19:13:59,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 19:13:59,370 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:13:59,370 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-02 19:13:59,370 INFO L371 AbstractCegarLoop]: === Iteration 11 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-02 19:13:59,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1057519410, now seen corresponding path program 1 times [2018-02-02 19:13:59,371 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:13:59,371 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:13:59,372 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:13:59,372 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:13:59,372 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:13:59,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:13:59,380 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:13:59,428 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-02 19:13:59,428 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:13:59,429 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 19:13:59,429 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 19:13:59,429 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 19:13:59,429 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 19:13:59,429 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand 4 states. [2018-02-02 19:13:59,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:13:59,482 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2018-02-02 19:13:59,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 19:13:59,483 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-02-02 19:13:59,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:13:59,484 INFO L225 Difference]: With dead ends: 105 [2018-02-02 19:13:59,484 INFO L226 Difference]: Without dead ends: 91 [2018-02-02 19:13:59,484 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-02 19:13:59,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-02 19:13:59,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 85. [2018-02-02 19:13:59,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-02-02 19:13:59,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2018-02-02 19:13:59,487 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 28 [2018-02-02 19:13:59,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:13:59,488 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2018-02-02 19:13:59,488 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 19:13:59,488 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2018-02-02 19:13:59,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 19:13:59,488 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:13:59,489 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-02 19:13:59,489 INFO L371 AbstractCegarLoop]: === Iteration 12 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-02 19:13:59,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1571490764, now seen corresponding path program 1 times [2018-02-02 19:13:59,489 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:13:59,489 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:13:59,490 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:13:59,490 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:13:59,491 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:13:59,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:13:59,497 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:13:59,522 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-02 19:13:59,523 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:13:59,523 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 19:13:59,523 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 19:13:59,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 19:13:59,523 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 19:13:59,523 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand 7 states. [2018-02-02 19:13:59,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:13:59,556 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2018-02-02 19:13:59,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 19:13:59,556 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-02-02 19:13:59,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:13:59,557 INFO L225 Difference]: With dead ends: 80 [2018-02-02 19:13:59,557 INFO L226 Difference]: Without dead ends: 80 [2018-02-02 19:13:59,557 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-02 19:13:59,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-02 19:13:59,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-02-02 19:13:59,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-02 19:13:59,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2018-02-02 19:13:59,559 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 30 [2018-02-02 19:13:59,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:13:59,559 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2018-02-02 19:13:59,559 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 19:13:59,559 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2018-02-02 19:13:59,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 19:13:59,560 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:13:59,560 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-02 19:13:59,561 INFO L371 AbstractCegarLoop]: === Iteration 13 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-02 19:13:59,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1767360087, now seen corresponding path program 1 times [2018-02-02 19:13:59,561 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:13:59,561 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:13:59,562 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:13:59,562 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:13:59,562 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:13:59,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:13:59,569 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:13:59,601 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-02 19:13:59,601 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:13:59,601 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 19:13:59,601 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 19:13:59,601 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 19:13:59,601 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:13:59,601 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand 5 states. [2018-02-02 19:13:59,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:13:59,610 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2018-02-02 19:13:59,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 19:13:59,611 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-02-02 19:13:59,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:13:59,611 INFO L225 Difference]: With dead ends: 91 [2018-02-02 19:13:59,611 INFO L226 Difference]: Without dead ends: 91 [2018-02-02 19:13:59,611 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-02 19:13:59,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-02 19:13:59,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 84. [2018-02-02 19:13:59,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-02 19:13:59,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2018-02-02 19:13:59,614 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 37 [2018-02-02 19:13:59,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:13:59,614 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2018-02-02 19:13:59,614 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 19:13:59,614 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2018-02-02 19:13:59,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 19:13:59,615 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:13:59,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-02 19:13:59,615 INFO L371 AbstractCegarLoop]: === Iteration 14 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-02 19:13:59,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1640103528, now seen corresponding path program 1 times [2018-02-02 19:13:59,616 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:13:59,616 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:13:59,617 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:13:59,617 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:13:59,617 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:13:59,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:13:59,626 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:13:59,781 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-02 19:13:59,781 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:13:59,781 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-02 19:13:59,786 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:13:59,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:13:59,808 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:13:59,822 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-02 19:13:59,823 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-02 19:13:59,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:13:59,824 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:13:59,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:13:59,825 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-02-02 19:13:59,855 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-02 19:13:59,862 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-02 19:13:59,864 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-02 19:13:59,864 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:13:59,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:13:59,868 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-02 19:13:59,869 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2018-02-02 19:13:59,878 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-02 19:13:59,879 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-02 19:13:59,880 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:13:59,880 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:13:59,881 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-02 19:13:59,881 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-02-02 19:13:59,883 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-02 19:13:59,909 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:13:59,909 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 18 [2018-02-02 19:13:59,909 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 19:13:59,910 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 19:13:59,910 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=259, Unknown=1, NotChecked=32, Total=342 [2018-02-02 19:13:59,910 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand 19 states. [2018-02-02 19:14:00,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:14:00,270 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2018-02-02 19:14:00,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 19:14:00,270 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 37 [2018-02-02 19:14:00,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:14:00,270 INFO L225 Difference]: With dead ends: 83 [2018-02-02 19:14:00,270 INFO L226 Difference]: Without dead ends: 83 [2018-02-02 19:14:00,271 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-02 19:14:00,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-02 19:14:00,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-02-02 19:14:00,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-02 19:14:00,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2018-02-02 19:14:00,272 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 37 [2018-02-02 19:14:00,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:14:00,273 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2018-02-02 19:14:00,273 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 19:14:00,273 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2018-02-02 19:14:00,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 19:14:00,273 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:14:00,273 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-02 19:14:00,273 INFO L371 AbstractCegarLoop]: === Iteration 15 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-02 19:14:00,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1640103527, now seen corresponding path program 1 times [2018-02-02 19:14:00,274 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:14:00,274 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:14:00,274 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:14:00,275 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:14:00,275 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:14:00,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:14:00,281 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:14:00,440 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-02 19:14:00,440 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:14:00,440 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-02 19:14:00,447 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:14:00,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:14:00,474 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:14:00,480 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-02 19:14:00,480 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:14:00,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:14:00,481 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-02 19:14:00,493 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-02 19:14:00,496 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-02 19:14:00,497 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:14:00,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:14:00,502 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-02 19:14:00,502 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-02-02 19:14:00,566 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-02 19:14:00,573 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-02 19:14:00,574 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-02 19:14:00,582 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-02 19:14:00,589 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-02 19:14:00,589 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:35 [2018-02-02 19:14:00,616 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-02 19:14:00,617 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-02 19:14:00,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:14:00,620 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:14:00,626 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-02 19:14:00,630 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-02 19:14:00,630 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-02 19:14:00,635 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 19:14:00,642 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-02 19:14:00,642 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:53, output treesize:24 [2018-02-02 19:14:00,661 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-02 19:14:00,678 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:14:00,678 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 22 [2018-02-02 19:14:00,678 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 19:14:00,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 19:14:00,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=431, Unknown=8, NotChecked=0, Total=506 [2018-02-02 19:14:00,679 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand 23 states. [2018-02-02 19:14:01,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:14:01,145 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2018-02-02 19:14:01,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 19:14:01,145 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 37 [2018-02-02 19:14:01,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:14:01,146 INFO L225 Difference]: With dead ends: 103 [2018-02-02 19:14:01,146 INFO L226 Difference]: Without dead ends: 103 [2018-02-02 19:14:01,146 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=1020, Unknown=13, NotChecked=0, Total=1190 [2018-02-02 19:14:01,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-02-02 19:14:01,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 93. [2018-02-02 19:14:01,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-02 19:14:01,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2018-02-02 19:14:01,149 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 37 [2018-02-02 19:14:01,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:14:01,149 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2018-02-02 19:14:01,149 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 19:14:01,150 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2018-02-02 19:14:01,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 19:14:01,150 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:14:01,150 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-02 19:14:01,150 INFO L371 AbstractCegarLoop]: === Iteration 16 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-02 19:14:01,150 INFO L82 PathProgramCache]: Analyzing trace with hash -124647017, now seen corresponding path program 1 times [2018-02-02 19:14:01,150 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:14:01,150 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:14:01,151 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:14:01,151 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:14:01,151 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:14:01,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:14:01,157 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:14:01,181 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-02 19:14:01,182 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:14:01,182 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 19:14:01,182 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 19:14:01,182 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 19:14:01,182 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 19:14:01,182 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand 7 states. [2018-02-02 19:14:01,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:14:01,211 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2018-02-02 19:14:01,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 19:14:01,211 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-02-02 19:14:01,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:14:01,212 INFO L225 Difference]: With dead ends: 90 [2018-02-02 19:14:01,212 INFO L226 Difference]: Without dead ends: 90 [2018-02-02 19:14:01,212 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-02 19:14:01,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-02-02 19:14:01,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2018-02-02 19:14:01,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-02 19:14:01,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2018-02-02 19:14:01,215 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 39 [2018-02-02 19:14:01,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:14:01,215 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2018-02-02 19:14:01,215 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 19:14:01,216 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2018-02-02 19:14:01,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 19:14:01,216 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:14:01,216 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-02 19:14:01,216 INFO L371 AbstractCegarLoop]: === Iteration 17 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-02 19:14:01,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1308023878, now seen corresponding path program 1 times [2018-02-02 19:14:01,216 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:14:01,216 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:14:01,217 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:14:01,217 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:14:01,217 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:14:01,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:14:01,224 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:14:01,247 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-02 19:14:01,248 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:14:01,248 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 19:14:01,248 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 19:14:01,248 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 19:14:01,248 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 19:14:01,248 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand 6 states. [2018-02-02 19:14:01,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:14:01,332 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2018-02-02 19:14:01,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 19:14:01,332 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-02-02 19:14:01,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:14:01,333 INFO L225 Difference]: With dead ends: 104 [2018-02-02 19:14:01,333 INFO L226 Difference]: Without dead ends: 104 [2018-02-02 19:14:01,333 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-02 19:14:01,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-02 19:14:01,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2018-02-02 19:14:01,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-02-02 19:14:01,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2018-02-02 19:14:01,335 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 108 transitions. Word has length 44 [2018-02-02 19:14:01,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:14:01,335 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 108 transitions. [2018-02-02 19:14:01,335 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 19:14:01,335 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2018-02-02 19:14:01,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 19:14:01,336 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:14:01,336 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-02 19:14:01,336 INFO L371 AbstractCegarLoop]: === Iteration 18 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-02 19:14:01,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1308023877, now seen corresponding path program 1 times [2018-02-02 19:14:01,336 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:14:01,336 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:14:01,337 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:14:01,337 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:14:01,337 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:14:01,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:14:01,342 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:14:01,373 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-02 19:14:01,373 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:14:01,373 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 19:14:01,373 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 19:14:01,373 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 19:14:01,373 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 19:14:01,373 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand 6 states. [2018-02-02 19:14:01,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:14:01,402 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2018-02-02 19:14:01,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 19:14:01,402 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-02-02 19:14:01,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:14:01,403 INFO L225 Difference]: With dead ends: 94 [2018-02-02 19:14:01,403 INFO L226 Difference]: Without dead ends: 94 [2018-02-02 19:14:01,403 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-02 19:14:01,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-02 19:14:01,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-02-02 19:14:01,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-02 19:14:01,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2018-02-02 19:14:01,406 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 44 [2018-02-02 19:14:01,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:14:01,406 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2018-02-02 19:14:01,406 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 19:14:01,406 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2018-02-02 19:14:01,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 19:14:01,406 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:14:01,406 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-02 19:14:01,407 INFO L371 AbstractCegarLoop]: === Iteration 19 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-02 19:14:01,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1813582502, now seen corresponding path program 1 times [2018-02-02 19:14:01,407 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:14:01,407 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:14:01,407 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:14:01,408 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:14:01,408 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:14:01,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:14:01,413 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:14:01,430 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-02 19:14:01,430 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:14:01,430 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 19:14:01,430 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 19:14:01,430 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 19:14:01,430 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:14:01,430 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand 5 states. [2018-02-02 19:14:01,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:14:01,441 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2018-02-02 19:14:01,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 19:14:01,442 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-02-02 19:14:01,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:14:01,442 INFO L225 Difference]: With dead ends: 92 [2018-02-02 19:14:01,442 INFO L226 Difference]: Without dead ends: 92 [2018-02-02 19:14:01,442 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-02 19:14:01,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-02 19:14:01,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2018-02-02 19:14:01,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-02 19:14:01,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2018-02-02 19:14:01,445 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 44 [2018-02-02 19:14:01,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:14:01,446 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2018-02-02 19:14:01,446 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 19:14:01,446 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-02-02 19:14:01,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 19:14:01,446 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:14:01,446 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-02 19:14:01,446 INFO L371 AbstractCegarLoop]: === Iteration 20 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-02 19:14:01,446 INFO L82 PathProgramCache]: Analyzing trace with hash 182043132, now seen corresponding path program 1 times [2018-02-02 19:14:01,446 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:14:01,446 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:14:01,447 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:14:01,447 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:14:01,447 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:14:01,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:14:01,453 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:14:01,481 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-02 19:14:01,481 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:14:01,481 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 19:14:01,481 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 19:14:01,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 19:14:01,481 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 19:14:01,481 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand 8 states. [2018-02-02 19:14:01,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:14:01,578 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2018-02-02 19:14:01,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 19:14:01,578 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-02-02 19:14:01,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:14:01,578 INFO L225 Difference]: With dead ends: 96 [2018-02-02 19:14:01,578 INFO L226 Difference]: Without dead ends: 96 [2018-02-02 19:14:01,579 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-02 19:14:01,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-02 19:14:01,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2018-02-02 19:14:01,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-02-02 19:14:01,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2018-02-02 19:14:01,581 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 46 [2018-02-02 19:14:01,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:14:01,581 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2018-02-02 19:14:01,581 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 19:14:01,581 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2018-02-02 19:14:01,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 19:14:01,582 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:14:01,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:14:01,582 INFO L371 AbstractCegarLoop]: === Iteration 21 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-02 19:14:01,582 INFO L82 PathProgramCache]: Analyzing trace with hash 182043133, now seen corresponding path program 1 times [2018-02-02 19:14:01,582 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:14:01,582 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:14:01,583 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:14:01,583 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:14:01,583 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:14:01,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:14:01,591 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:14:01,729 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-02 19:14:01,730 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:14:01,730 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 19:14:01,730 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 19:14:01,730 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 19:14:01,730 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-02 19:14:01,730 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand 11 states. [2018-02-02 19:14:01,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:14:01,886 INFO L93 Difference]: Finished difference Result 96 states and 99 transitions. [2018-02-02 19:14:01,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 19:14:01,886 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 46 [2018-02-02 19:14:01,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:14:01,887 INFO L225 Difference]: With dead ends: 96 [2018-02-02 19:14:01,887 INFO L226 Difference]: Without dead ends: 96 [2018-02-02 19:14:01,887 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-02 19:14:01,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-02 19:14:01,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2018-02-02 19:14:01,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-02 19:14:01,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2018-02-02 19:14:01,889 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 46 [2018-02-02 19:14:01,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:14:01,890 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2018-02-02 19:14:01,890 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 19:14:01,890 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2018-02-02 19:14:01,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 19:14:01,890 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:14:01,890 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-02 19:14:01,890 INFO L371 AbstractCegarLoop]: === Iteration 22 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-02 19:14:01,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1348369820, now seen corresponding path program 1 times [2018-02-02 19:14:01,891 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:14:01,891 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:14:01,891 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:14:01,891 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:14:01,891 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:14:01,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:14:01,898 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:14:02,000 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-02 19:14:02,000 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:14:02,000 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 19:14:02,001 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 19:14:02,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 19:14:02,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-02-02 19:14:02,001 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand 11 states. [2018-02-02 19:14:02,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:14:02,199 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2018-02-02 19:14:02,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 19:14:02,200 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-02-02 19:14:02,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:14:02,201 INFO L225 Difference]: With dead ends: 95 [2018-02-02 19:14:02,202 INFO L226 Difference]: Without dead ends: 95 [2018-02-02 19:14:02,202 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-02-02 19:14:02,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-02 19:14:02,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2018-02-02 19:14:02,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-02 19:14:02,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2018-02-02 19:14:02,205 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 47 [2018-02-02 19:14:02,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:14:02,206 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2018-02-02 19:14:02,206 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 19:14:02,206 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2018-02-02 19:14:02,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 19:14:02,206 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:14:02,207 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-02 19:14:02,207 INFO L371 AbstractCegarLoop]: === Iteration 23 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-02 19:14:02,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1348369821, now seen corresponding path program 1 times [2018-02-02 19:14:02,207 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:14:02,207 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:14:02,208 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:14:02,208 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:14:02,208 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:14:02,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:14:02,218 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:14:02,287 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-02 19:14:02,287 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:14:02,287 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 19:14:02,288 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 19:14:02,288 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 19:14:02,288 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-02-02 19:14:02,288 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand 11 states. [2018-02-02 19:14:02,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:14:02,540 INFO L93 Difference]: Finished difference Result 96 states and 99 transitions. [2018-02-02 19:14:02,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 19:14:02,541 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-02-02 19:14:02,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:14:02,542 INFO L225 Difference]: With dead ends: 96 [2018-02-02 19:14:02,542 INFO L226 Difference]: Without dead ends: 96 [2018-02-02 19:14:02,542 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-02-02 19:14:02,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-02 19:14:02,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2018-02-02 19:14:02,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-02 19:14:02,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 97 transitions. [2018-02-02 19:14:02,545 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 97 transitions. Word has length 47 [2018-02-02 19:14:02,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:14:02,545 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 97 transitions. [2018-02-02 19:14:02,545 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 19:14:02,545 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2018-02-02 19:14:02,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 19:14:02,546 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:14:02,546 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-02 19:14:02,546 INFO L371 AbstractCegarLoop]: === Iteration 24 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-02 19:14:02,546 INFO L82 PathProgramCache]: Analyzing trace with hash -32858344, now seen corresponding path program 1 times [2018-02-02 19:14:02,546 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:14:02,546 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:14:02,547 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:14:02,547 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:14:02,547 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:14:02,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:14:02,555 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:14:02,868 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-02 19:14:02,868 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:14:02,868 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-02 19:14:02,873 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:14:02,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:14:02,897 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:14:03,084 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-02 19:14:03,115 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:14:03,115 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [18] total 25 [2018-02-02 19:14:03,116 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 19:14:03,116 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 19:14:03,116 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2018-02-02 19:14:03,116 INFO L87 Difference]: Start difference. First operand 94 states and 97 transitions. Second operand 25 states. [2018-02-02 19:14:04,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:14:04,454 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2018-02-02 19:14:04,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 19:14:04,459 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 46 [2018-02-02 19:14:04,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:14:04,459 INFO L225 Difference]: With dead ends: 116 [2018-02-02 19:14:04,460 INFO L226 Difference]: Without dead ends: 116 [2018-02-02 19:14:04,460 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=199, Invalid=2057, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 19:14:04,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-02 19:14:04,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 107. [2018-02-02 19:14:04,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-02-02 19:14:04,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2018-02-02 19:14:04,463 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 46 [2018-02-02 19:14:04,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:14:04,463 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2018-02-02 19:14:04,463 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 19:14:04,463 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2018-02-02 19:14:04,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 19:14:04,464 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:14:04,464 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-02 19:14:04,464 INFO L371 AbstractCegarLoop]: === Iteration 25 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-02 19:14:04,464 INFO L82 PathProgramCache]: Analyzing trace with hash -301259046, now seen corresponding path program 1 times [2018-02-02 19:14:04,464 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:14:04,464 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:14:04,465 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:14:04,465 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:14:04,465 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:14:04,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:14:04,474 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:14:04,680 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-02 19:14:04,681 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:14:04,681 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-02-02 19:14:04,681 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 19:14:04,681 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 19:14:04,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-02-02 19:14:04,682 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand 15 states. [2018-02-02 19:14:05,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:14:05,085 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2018-02-02 19:14:05,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 19:14:05,085 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 50 [2018-02-02 19:14:05,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:14:05,086 INFO L225 Difference]: With dead ends: 106 [2018-02-02 19:14:05,086 INFO L226 Difference]: Without dead ends: 106 [2018-02-02 19:14:05,086 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2018-02-02 19:14:05,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-02-02 19:14:05,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-02-02 19:14:05,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-02-02 19:14:05,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2018-02-02 19:14:05,089 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 50 [2018-02-02 19:14:05,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:14:05,089 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2018-02-02 19:14:05,089 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 19:14:05,089 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2018-02-02 19:14:05,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 19:14:05,089 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:14:05,090 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-02 19:14:05,090 INFO L371 AbstractCegarLoop]: === Iteration 26 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-02 19:14:05,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1444311673, now seen corresponding path program 1 times [2018-02-02 19:14:05,090 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:14:05,090 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:14:05,091 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:14:05,091 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:14:05,091 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:14:05,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:14:05,100 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:14:05,441 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-02 19:14:05,467 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:14:05,467 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-02 19:14:05,474 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:14:05,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:14:05,497 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:14:05,554 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-02 19:14:05,557 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-02 19:14:05,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:14:05,558 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:14:05,561 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-02 19:14:05,561 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:34 [2018-02-02 19:14:05,619 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-02 19:14:05,622 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:14:05,623 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-02 19:14:05,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:14:05,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:14:05,636 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-02 19:14:05,636 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:34 [2018-02-02 19:14:05,640 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-02 19:14:05,641 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-02 19:14:05,641 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:14:05,644 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:14:05,647 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-02 19:14:05,647 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:16 [2018-02-02 19:14:05,768 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-02 19:14:05,799 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:14:05,799 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 27 [2018-02-02 19:14:05,799 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 19:14:05,799 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 19:14:05,800 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=644, Unknown=21, NotChecked=0, Total=756 [2018-02-02 19:14:05,800 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand 28 states. [2018-02-02 19:14:06,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:14:06,478 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2018-02-02 19:14:06,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 19:14:06,478 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 48 [2018-02-02 19:14:06,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:14:06,479 INFO L225 Difference]: With dead ends: 111 [2018-02-02 19:14:06,479 INFO L226 Difference]: Without dead ends: 88 [2018-02-02 19:14:06,480 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-02 19:14:06,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-02-02 19:14:06,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-02-02 19:14:06,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-02 19:14:06,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2018-02-02 19:14:06,482 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 48 [2018-02-02 19:14:06,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:14:06,482 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2018-02-02 19:14:06,482 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 19:14:06,482 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-02-02 19:14:06,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 19:14:06,483 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:14:06,483 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-02 19:14:06,483 INFO L371 AbstractCegarLoop]: === Iteration 27 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-02 19:14:06,483 INFO L82 PathProgramCache]: Analyzing trace with hash -612693804, now seen corresponding path program 1 times [2018-02-02 19:14:06,483 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:14:06,483 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:14:06,484 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:14:06,484 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:14:06,485 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:14:06,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:14:06,503 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:14:06,597 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-02 19:14:06,598 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:14:06,598 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-02 19:14:06,598 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 19:14:06,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 19:14:06,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-02-02 19:14:06,598 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand 13 states. [2018-02-02 19:14:06,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:14:06,830 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2018-02-02 19:14:06,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 19:14:06,831 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 51 [2018-02-02 19:14:06,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:14:06,831 INFO L225 Difference]: With dead ends: 87 [2018-02-02 19:14:06,831 INFO L226 Difference]: Without dead ends: 87 [2018-02-02 19:14:06,831 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2018-02-02 19:14:06,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-02-02 19:14:06,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-02-02 19:14:06,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-02 19:14:06,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2018-02-02 19:14:06,833 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 51 [2018-02-02 19:14:06,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:14:06,834 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2018-02-02 19:14:06,834 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 19:14:06,834 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-02-02 19:14:06,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 19:14:06,834 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:14:06,834 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-02 19:14:06,835 INFO L371 AbstractCegarLoop]: === Iteration 28 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-02 19:14:06,836 INFO L82 PathProgramCache]: Analyzing trace with hash -749095891, now seen corresponding path program 1 times [2018-02-02 19:14:06,836 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:14:06,836 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:14:06,836 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:14:06,837 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:14:06,837 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:14:06,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:14:06,847 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:14:07,189 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-02 19:14:07,189 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:14:07,189 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-02 19:14:07,194 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:14:07,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:14:07,211 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:14:07,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-02 19:14:07,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-02 19:14:07,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:14:07,258 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:14:07,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:14:07,260 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-02-02 19:14:07,323 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-02 19:14:07,328 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-02 19:14:07,330 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-02 19:14:07,331 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:14:07,334 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:14:07,336 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-02 19:14:07,336 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2018-02-02 19:14:07,431 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-02 19:14:07,432 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-02 19:14:07,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:14:07,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:14:07,434 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-02 19:14:07,434 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-02-02 19:14:07,436 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-02 19:14:07,454 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:14:07,454 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [17] total 30 [2018-02-02 19:14:07,454 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-02 19:14:07,455 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-02 19:14:07,455 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=779, Unknown=1, NotChecked=56, Total=930 [2018-02-02 19:14:07,455 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 31 states. [2018-02-02 19:14:10,077 WARN L143 SmtUtils]: Spent 2013ms on a formula simplification that was a NOOP. DAG size: 30 [2018-02-02 19:14:10,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:14:10,304 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2018-02-02 19:14:10,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 19:14:10,304 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 51 [2018-02-02 19:14:10,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:14:10,304 INFO L225 Difference]: With dead ends: 92 [2018-02-02 19:14:10,304 INFO L226 Difference]: Without dead ends: 92 [2018-02-02 19:14:10,305 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=257, Invalid=2000, Unknown=3, NotChecked=92, Total=2352 [2018-02-02 19:14:10,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-02 19:14:10,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-02-02 19:14:10,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-02 19:14:10,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 95 transitions. [2018-02-02 19:14:10,306 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 95 transitions. Word has length 51 [2018-02-02 19:14:10,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:14:10,306 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 95 transitions. [2018-02-02 19:14:10,306 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-02 19:14:10,307 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2018-02-02 19:14:10,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 19:14:10,307 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:14:10,307 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-02 19:14:10,307 INFO L371 AbstractCegarLoop]: === Iteration 29 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-02 19:14:10,307 INFO L82 PathProgramCache]: Analyzing trace with hash -749095890, now seen corresponding path program 1 times [2018-02-02 19:14:10,307 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:14:10,307 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:14:10,308 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:14:10,308 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:14:10,308 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:14:10,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:14:10,316 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:14:10,795 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-02 19:14:10,795 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:14:10,795 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-02 19:14:10,801 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:14:10,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:14:10,824 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:14:10,841 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-02 19:14:10,841 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:14:10,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:14:10,842 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-02 19:14:10,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-02 19:14:10,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-02 19:14:10,886 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:14:10,887 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:14:10,890 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-02 19:14:10,890 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-02-02 19:14:11,002 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-02 19:14:11,008 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-02 19:14:11,008 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:14:11,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 23 treesize of output 18 [2018-02-02 19:14:11,018 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-02 19:14:11,019 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-02 19:14:11,023 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:14:11,026 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-02 19:14:11,026 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:29, output treesize:21 [2018-02-02 19:14:11,142 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-02 19:14:11,147 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-02 19:14:11,147 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:14:11,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:14:11,149 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-02 19:14:11,149 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2018-02-02 19:14:11,151 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-02 19:14:11,169 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:14:11,169 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [21] total 36 [2018-02-02 19:14:11,169 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-02 19:14:11,169 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-02 19:14:11,170 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1142, Unknown=1, NotChecked=68, Total=1332 [2018-02-02 19:14:11,170 INFO L87 Difference]: Start difference. First operand 92 states and 95 transitions. Second operand 37 states. [2018-02-02 19:14:16,014 WARN L146 SmtUtils]: Spent 4033ms on a formula simplification. DAG size of input: 46 DAG size of output 43 [2018-02-02 19:14:16,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:14:16,313 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2018-02-02 19:14:16,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 19:14:16,313 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 51 [2018-02-02 19:14:16,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:14:16,314 INFO L225 Difference]: With dead ends: 94 [2018-02-02 19:14:16,314 INFO L226 Difference]: Without dead ends: 94 [2018-02-02 19:14:16,314 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=313, Invalid=2658, Unknown=3, NotChecked=106, Total=3080 [2018-02-02 19:14:16,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-02 19:14:16,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2018-02-02 19:14:16,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-02 19:14:16,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 96 transitions. [2018-02-02 19:14:16,316 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 96 transitions. Word has length 51 [2018-02-02 19:14:16,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:14:16,316 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 96 transitions. [2018-02-02 19:14:16,316 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-02 19:14:16,316 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2018-02-02 19:14:16,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 19:14:16,317 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:14:16,317 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-02 19:14:16,317 INFO L371 AbstractCegarLoop]: === Iteration 30 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-02 19:14:16,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1813638726, now seen corresponding path program 1 times [2018-02-02 19:14:16,317 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:14:16,317 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:14:16,318 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:14:16,318 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:14:16,318 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:14:16,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:14:16,326 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:14:16,844 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-02 19:14:16,844 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:14:16,844 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-02 19:14:16,853 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:14:16,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:14:16,882 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:14:16,884 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-02 19:14:16,885 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:14:16,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:14:16,887 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-02 19:14:16,908 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-02 19:14:16,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-02 19:14:16,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:14:16,910 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:14:16,913 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-02 19:14:16,913 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-02-02 19:14:17,018 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:14:17,019 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:14:17,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-02 19:14:17,020 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:14:17,028 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-02 19:14:17,029 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:14:17,030 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-02 19:14:17,030 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:14:17,033 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:14:17,038 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-02 19:14:17,038 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:38, output treesize:43 [2018-02-02 19:14:17,120 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-02 19:14:17,120 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:14:17,123 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-02 19:14:17,124 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:26 [2018-02-02 19:14:21,304 WARN L143 SmtUtils]: Spent 4012ms on a formula simplification that was a NOOP. DAG size: 27 [2018-02-02 19:14:21,373 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:14:21,375 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 47 [2018-02-02 19:14:21,375 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:14:21,383 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-02 19:14:21,383 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:75, output treesize:51 [2018-02-02 19:14:21,415 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-02 19:14:21,416 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:14:21,417 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:14:21,417 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-02 19:14:21,418 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-02 19:14:21,422 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-02 19:14:21,424 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-02 19:14:21,425 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:15 [2018-02-02 19:14:21,452 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-02 19:14:21,469 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:14:21,469 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [22] total 35 [2018-02-02 19:14:21,470 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-02 19:14:21,470 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-02 19:14:21,470 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1144, Unknown=8, NotChecked=0, Total=1260 [2018-02-02 19:14:21,470 INFO L87 Difference]: Start difference. First operand 93 states and 96 transitions. Second operand 36 states. [2018-02-02 19:14:24,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:14:24,419 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2018-02-02 19:14:24,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 19:14:24,419 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 52 [2018-02-02 19:14:24,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:14:24,420 INFO L225 Difference]: With dead ends: 93 [2018-02-02 19:14:24,420 INFO L226 Difference]: Without dead ends: 93 [2018-02-02 19:14:24,421 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=250, Invalid=2498, Unknown=8, NotChecked=0, Total=2756 [2018-02-02 19:14:24,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-02 19:14:24,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2018-02-02 19:14:24,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-02 19:14:24,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 95 transitions. [2018-02-02 19:14:24,423 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 95 transitions. Word has length 52 [2018-02-02 19:14:24,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:14:24,423 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 95 transitions. [2018-02-02 19:14:24,423 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-02 19:14:24,423 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2018-02-02 19:14:24,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 19:14:24,424 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:14:24,424 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-02 19:14:24,424 INFO L371 AbstractCegarLoop]: === Iteration 31 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-02 19:14:24,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1679349496, now seen corresponding path program 1 times [2018-02-02 19:14:24,424 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:14:24,424 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:14:24,425 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:14:24,425 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:14:24,425 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:14:24,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:14:24,433 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:14:24,453 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-02 19:14:24,453 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:14:24,453 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 19:14:24,453 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 19:14:24,454 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 19:14:24,454 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:14:24,454 INFO L87 Difference]: Start difference. First operand 92 states and 95 transitions. Second operand 5 states. [2018-02-02 19:14:24,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:14:24,462 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2018-02-02 19:14:24,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 19:14:24,463 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-02-02 19:14:24,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:14:24,463 INFO L225 Difference]: With dead ends: 96 [2018-02-02 19:14:24,463 INFO L226 Difference]: Without dead ends: 96 [2018-02-02 19:14:24,464 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-02 19:14:24,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-02 19:14:24,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2018-02-02 19:14:24,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-02 19:14:24,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2018-02-02 19:14:24,466 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 52 [2018-02-02 19:14:24,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:14:24,466 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2018-02-02 19:14:24,467 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 19:14:24,467 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2018-02-02 19:14:24,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 19:14:24,467 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:14:24,467 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-02 19:14:24,467 INFO L371 AbstractCegarLoop]: === Iteration 32 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-02 19:14:24,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1775270255, now seen corresponding path program 1 times [2018-02-02 19:14:24,468 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:14:24,468 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:14:24,468 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:14:24,468 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:14:24,469 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:14:24,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:14:24,480 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:14:24,737 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 23 DAG size of output 20 [2018-02-02 19:14:25,089 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-02 19:14:25,090 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:14:25,090 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-02 19:14:25,095 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:14:25,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:14:25,115 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:14:25,118 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-02 19:14:25,118 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:14:25,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:14:25,119 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-02 19:14:25,232 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-02 19:14:25,233 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-02 19:14:25,234 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:14:25,235 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:14:25,240 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-02 19:14:25,240 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:28 [2018-02-02 19:14:25,325 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-02 19:14:25,327 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:14:25,328 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-02 19:14:25,328 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:14:25,332 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:14:25,337 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-02 19:14:25,337 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:27 [2018-02-02 19:14:25,363 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-02 19:14:25,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:14:25,368 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-02 19:14:25,368 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-02-02 19:14:31,456 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:14:31,457 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:14:31,458 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-02 19:14:31,458 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:14:31,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:14:31,461 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2018-02-02 19:14:31,532 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-02 19:14:31,533 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-02 19:14:31,533 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:14:31,535 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:14:31,537 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-02 19:14:31,537 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:14 [2018-02-02 19:14:31,562 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:14:31,574 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-02 19:14:31,575 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:14:31,579 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-02 19:14:31,580 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:15 [2018-02-02 19:14:31,728 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-02 19:14:31,748 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:14:31,749 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 38 [2018-02-02 19:14:31,749 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-02 19:14:31,749 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-02 19:14:31,749 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1375, Unknown=5, NotChecked=0, Total=1482 [2018-02-02 19:14:31,750 INFO L87 Difference]: Start difference. First operand 92 states and 94 transitions. Second operand 39 states. [2018-02-02 19:14:38,252 WARN L146 SmtUtils]: Spent 2019ms on a formula simplification. DAG size of input: 38 DAG size of output 24 [2018-02-02 19:14:51,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:14:51,531 INFO L93 Difference]: Finished difference Result 100 states and 103 transitions. [2018-02-02 19:14:51,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 19:14:51,531 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 55 [2018-02-02 19:14:51,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:14:51,532 INFO L225 Difference]: With dead ends: 100 [2018-02-02 19:14:51,532 INFO L226 Difference]: Without dead ends: 100 [2018-02-02 19:14:51,533 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1038 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=356, Invalid=4327, Unknown=9, NotChecked=0, Total=4692 [2018-02-02 19:14:51,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-02-02 19:14:51,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2018-02-02 19:14:51,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-02 19:14:51,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2018-02-02 19:14:51,535 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 55 [2018-02-02 19:14:51,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:14:51,535 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2018-02-02 19:14:51,535 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-02 19:14:51,535 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-02-02 19:14:51,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 19:14:51,536 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:14:51,536 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-02 19:14:51,536 INFO L371 AbstractCegarLoop]: === Iteration 33 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-02 19:14:51,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1775270256, now seen corresponding path program 1 times [2018-02-02 19:14:51,536 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:14:51,536 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:14:51,537 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:14:51,537 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:14:51,537 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:14:51,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:14:51,544 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:14:51,597 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-02 19:14:51,597 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:14:51,597 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 19:14:51,598 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 19:14:51,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 19:14:51,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-02 19:14:51,598 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand 8 states. [2018-02-02 19:14:51,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:14:51,650 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2018-02-02 19:14:51,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 19:14:51,650 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2018-02-02 19:14:51,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:14:51,651 INFO L225 Difference]: With dead ends: 95 [2018-02-02 19:14:51,651 INFO L226 Difference]: Without dead ends: 95 [2018-02-02 19:14:51,651 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-02 19:14:51,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-02 19:14:51,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-02-02 19:14:51,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-02 19:14:51,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 98 transitions. [2018-02-02 19:14:51,652 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 98 transitions. Word has length 55 [2018-02-02 19:14:51,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:14:51,652 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 98 transitions. [2018-02-02 19:14:51,652 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 19:14:51,652 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 98 transitions. [2018-02-02 19:14:51,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 19:14:51,653 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:14:51,653 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-02 19:14:51,653 INFO L371 AbstractCegarLoop]: === Iteration 34 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-02 19:14:51,653 INFO L82 PathProgramCache]: Analyzing trace with hash -801196919, now seen corresponding path program 1 times [2018-02-02 19:14:51,653 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:14:51,653 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:14:51,653 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:14:51,654 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:14:51,654 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:14:51,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:14:51,661 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:14:51,807 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-02 19:14:51,807 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:14:51,807 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-02-02 19:14:51,807 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 19:14:51,807 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 19:14:51,808 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-02-02 19:14:51,808 INFO L87 Difference]: Start difference. First operand 95 states and 98 transitions. Second operand 15 states. [2018-02-02 19:14:51,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:14:51,954 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2018-02-02 19:14:51,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 19:14:51,954 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2018-02-02 19:14:51,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:14:51,954 INFO L225 Difference]: With dead ends: 94 [2018-02-02 19:14:51,954 INFO L226 Difference]: Without dead ends: 94 [2018-02-02 19:14:51,954 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-02 19:14:51,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-02 19:14:51,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-02-02 19:14:51,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-02 19:14:51,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 97 transitions. [2018-02-02 19:14:51,956 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 97 transitions. Word has length 56 [2018-02-02 19:14:51,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:14:51,956 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 97 transitions. [2018-02-02 19:14:51,957 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 19:14:51,957 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2018-02-02 19:14:51,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 19:14:51,957 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:14:51,957 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-02 19:14:51,957 INFO L371 AbstractCegarLoop]: === Iteration 35 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-02 19:14:51,957 INFO L82 PathProgramCache]: Analyzing trace with hash -801196918, now seen corresponding path program 1 times [2018-02-02 19:14:51,958 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:14:51,958 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:14:51,958 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:14:51,958 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:14:51,959 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:14:51,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:14:51,970 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:14:52,534 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-02 19:14:52,534 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:14:52,534 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-02 19:14:52,540 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:14:52,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:14:52,565 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:14:52,586 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-02 19:14:52,586 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:14:52,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:14:52,588 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:10 [2018-02-02 19:14:52,655 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-02 19:14:52,657 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-02 19:14:52,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:14:52,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:14:52,663 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-02 19:14:52,663 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:28 [2018-02-02 19:14:52,842 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:14:52,843 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:14:52,843 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-02 19:14:52,843 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:14:52,852 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-02 19:14:52,854 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:14:52,854 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-02 19:14:52,854 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:14:52,859 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:14:52,865 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-02 19:14:52,865 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:44, output treesize:45 [2018-02-02 19:14:53,093 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:14:53,093 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-02 19:14:53,093 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:14:53,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:14:53,098 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:60, output treesize:34 [2018-02-02 19:14:53,195 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-02 19:14:53,197 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:14:53,197 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-02 19:14:53,197 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-02 19:14:53,201 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-02 19:14:53,204 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-02 19:14:53,204 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:15 [2018-02-02 19:14:53,238 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-02 19:14:53,254 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:14:53,255 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 44 [2018-02-02 19:14:53,255 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-02-02 19:14:53,255 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-02-02 19:14:53,255 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1839, Unknown=8, NotChecked=0, Total=1980 [2018-02-02 19:14:53,255 INFO L87 Difference]: Start difference. First operand 94 states and 97 transitions. Second operand 45 states. [2018-02-02 19:14:54,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:14:54,423 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2018-02-02 19:14:54,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 19:14:54,423 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 56 [2018-02-02 19:14:54,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:14:54,423 INFO L225 Difference]: With dead ends: 95 [2018-02-02 19:14:54,423 INFO L226 Difference]: Without dead ends: 95 [2018-02-02 19:14:54,424 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-02 19:14:54,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-02 19:14:54,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-02-02 19:14:54,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-02 19:14:54,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 98 transitions. [2018-02-02 19:14:54,425 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 98 transitions. Word has length 56 [2018-02-02 19:14:54,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:14:54,425 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 98 transitions. [2018-02-02 19:14:54,425 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-02-02 19:14:54,425 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 98 transitions. [2018-02-02 19:14:54,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 19:14:54,426 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:14:54,426 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-02 19:14:54,426 INFO L371 AbstractCegarLoop]: === Iteration 36 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-02 19:14:54,426 INFO L82 PathProgramCache]: Analyzing trace with hash -101964777, now seen corresponding path program 1 times [2018-02-02 19:14:54,426 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:14:54,426 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:14:54,427 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:14:54,427 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:14:54,427 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:14:54,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:14:54,432 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:14:54,729 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-02 19:14:54,729 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:14:54,730 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-02 19:14:54,734 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:14:54,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:14:54,765 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:14:54,767 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-02 19:14:54,767 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:14:54,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:14:54,768 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-02 19:14:54,824 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-02 19:14:54,825 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-02 19:14:54,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:14:54,827 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:14:54,837 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-02 19:14:54,837 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-02-02 19:14:54,947 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:14:54,948 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:14:54,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 19:14:54,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:14:54,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2018-02-02 19:14:54,958 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:14:54,958 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-02 19:14:54,959 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:14:54,962 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:14:54,967 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-02 19:14:54,967 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:49, output treesize:36 [2018-02-02 19:14:54,989 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-02 19:14:54,990 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:14:54,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-02 19:14:54,993 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:22 [2018-02-02 19:15:00,528 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-02 19:15:00,528 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:15:00,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-02 19:15:00,532 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:22 [2018-02-02 19:15:05,560 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 39 treesize of output 31 [2018-02-02 19:15:05,562 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:15:05,563 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 31 treesize of output 20 [2018-02-02 19:15:05,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:15:05,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:15:05,571 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-02 19:15:05,571 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:15 [2018-02-02 19:15:05,606 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:15:05,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-02-02 19:15:05,610 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-02 19:15:05,617 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 2 xjuncts. [2018-02-02 19:15:05,617 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:36 [2018-02-02 19:15:05,663 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-02 19:15:05,663 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:15:05,669 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:15:05,669 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:15:05,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 19:15:05,670 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:15:05,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:15:05,674 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:15 [2018-02-02 19:15:05,892 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-02 19:15:05,912 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:15:05,912 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21] total 34 [2018-02-02 19:15:05,912 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-02 19:15:05,912 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-02 19:15:05,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1077, Unknown=12, NotChecked=0, Total=1190 [2018-02-02 19:15:05,913 INFO L87 Difference]: Start difference. First operand 95 states and 98 transitions. Second operand 35 states. Received shutdown request... [2018-02-02 19:15:27,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 19:15:27,026 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 19:15:27,030 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 19:15:27,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 07:15:27 BoogieIcfgContainer [2018-02-02 19:15:27,030 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 19:15:27,031 INFO L168 Benchmark]: Toolchain (without parser) took 91703.24 ms. Allocated memory was 401.1 MB in the beginning and 896.0 MB in the end (delta: 494.9 MB). Free memory was 355.1 MB in the beginning and 591.9 MB in the end (delta: -236.8 MB). Peak memory consumption was 258.1 MB. Max. memory is 5.3 GB. [2018-02-02 19:15:27,032 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 401.1 MB. Free memory is still 361.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 19:15:27,032 INFO L168 Benchmark]: CACSL2BoogieTranslator took 166.93 ms. Allocated memory is still 401.1 MB. Free memory was 355.1 MB in the beginning and 341.9 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-02 19:15:27,032 INFO L168 Benchmark]: Boogie Preprocessor took 27.55 ms. Allocated memory is still 401.1 MB. Free memory was 341.9 MB in the beginning and 340.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 19:15:27,033 INFO L168 Benchmark]: RCFGBuilder took 219.84 ms. Allocated memory is still 401.1 MB. Free memory was 340.5 MB in the beginning and 314.0 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 5.3 GB. [2018-02-02 19:15:27,033 INFO L168 Benchmark]: TraceAbstraction took 91285.83 ms. Allocated memory was 401.1 MB in the beginning and 896.0 MB in the end (delta: 494.9 MB). Free memory was 314.0 MB in the beginning and 591.9 MB in the end (delta: -277.8 MB). Peak memory consumption was 217.1 MB. Max. memory is 5.3 GB. [2018-02-02 19:15:27,034 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.14 ms. Allocated memory is still 401.1 MB. Free memory is still 361.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 166.93 ms. Allocated memory is still 401.1 MB. Free memory was 355.1 MB in the beginning and 341.9 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.55 ms. Allocated memory is still 401.1 MB. Free memory was 341.9 MB in the beginning and 340.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 219.84 ms. Allocated memory is still 401.1 MB. Free memory was 340.5 MB in the beginning and 314.0 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 91285.83 ms. Allocated memory was 401.1 MB in the beginning and 896.0 MB in the end (delta: 494.9 MB). Free memory was 314.0 MB in the beginning and 591.9 MB in the end (delta: -277.8 MB). Peak memory consumption was 217.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1478). Cancelled while BasicCegarLoop was constructing difference of abstraction (95states) and interpolant automaton (currently 15 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (33 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1478). Cancelled while BasicCegarLoop was constructing difference of abstraction (95states) and interpolant automaton (currently 15 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (33 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1478). Cancelled while BasicCegarLoop was constructing difference of abstraction (95states) and interpolant automaton (currently 15 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (33 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1478). Cancelled while BasicCegarLoop was constructing difference of abstraction (95states) and interpolant automaton (currently 15 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (33 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1472). Cancelled while BasicCegarLoop was constructing difference of abstraction (95states) and interpolant automaton (currently 15 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (33 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1457). Cancelled while BasicCegarLoop was constructing difference of abstraction (95states) and interpolant automaton (currently 15 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (33 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1458). Cancelled while BasicCegarLoop was constructing difference of abstraction (95states) and interpolant automaton (currently 15 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (33 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1458). Cancelled while BasicCegarLoop was constructing difference of abstraction (95states) and interpolant automaton (currently 15 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (33 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1457). Cancelled while BasicCegarLoop was constructing difference of abstraction (95states) and interpolant automaton (currently 15 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (33 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1472). Cancelled while BasicCegarLoop was constructing difference of abstraction (95states) and interpolant automaton (currently 15 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (33 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1472). Cancelled while BasicCegarLoop was constructing difference of abstraction (95states) and interpolant automaton (currently 15 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (33 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1472). Cancelled while BasicCegarLoop was constructing difference of abstraction (95states) and interpolant automaton (currently 15 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (33 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1447). Cancelled while BasicCegarLoop was constructing difference of abstraction (95states) and interpolant automaton (currently 15 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (33 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1447). Cancelled while BasicCegarLoop was constructing difference of abstraction (95states) and interpolant automaton (currently 15 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (33 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1447). Cancelled while BasicCegarLoop was constructing difference of abstraction (95states) and interpolant automaton (currently 15 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (33 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1447). Cancelled while BasicCegarLoop was constructing difference of abstraction (95states) and interpolant automaton (currently 15 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (33 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1491]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1491). Cancelled while BasicCegarLoop was constructing difference of abstraction (95states) and interpolant automaton (currently 15 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (33 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1441). Cancelled while BasicCegarLoop was constructing difference of abstraction (95states) and interpolant automaton (currently 15 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (33 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1441). Cancelled while BasicCegarLoop was constructing difference of abstraction (95states) and interpolant automaton (currently 15 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (33 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1440). Cancelled while BasicCegarLoop was constructing difference of abstraction (95states) and interpolant automaton (currently 15 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (33 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1440). Cancelled while BasicCegarLoop was constructing difference of abstraction (95states) and interpolant automaton (currently 15 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (33 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 89 locations, 21 error locations. TIMEOUT Result, 91.2s OverallTime, 36 OverallIterations, 2 TraceHistogramMax, 60.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2359 SDtfs, 2579 SDslu, 13241 SDs, 0 SdLazy, 15084 SolverSat, 907 SolverUnsat, 118 SolverUnknown, 0 SolverNotchecked, 41.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1209 GetRequests, 435 SyntacticMatches, 30 SemanticMatches, 744 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 5974 ImplicationChecksByTransitivity, 44.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 35 MinimizatonAttempts, 334 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 29.8s InterpolantComputationTime, 1960 NumberOfCodeBlocks, 1960 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 1913 ConstructedInterpolants, 112 QuantifiedInterpolants, 837288 SizeOfPredicates, 116 NumberOfNonLiveVariables, 2306 ConjunctsInSsa, 402 ConjunctsInUnsatCore, 47 InterpolantComputations, 31 PerfectInterpolantSequences, 149/204 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test19_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_19-15-27-040.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test19_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_19-15-27-040.csv Completed graceful shutdown