java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test19_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 08:51:35,608 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 08:51:35,610 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 08:51:35,627 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 08:51:35,628 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 08:51:35,629 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 08:51:35,630 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 08:51:35,633 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 08:51:35,637 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 08:51:35,637 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 08:51:35,638 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 08:51:35,638 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 08:51:35,639 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 08:51:35,649 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 08:51:35,650 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 08:51:35,654 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 08:51:35,656 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 08:51:35,658 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 08:51:35,663 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 08:51:35,664 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 08:51:35,666 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 08:51:35,666 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 08:51:35,666 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 08:51:35,673 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 08:51:35,674 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 08:51:35,675 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 08:51:35,675 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 08:51:35,676 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 08:51:35,676 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 08:51:35,676 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 08:51:35,677 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 08:51:35,679 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-31 08:51:35,694 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 08:51:35,694 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 08:51:35,698 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 08:51:35,698 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 08:51:35,698 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 08:51:35,698 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 08:51:35,698 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 08:51:35,699 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 08:51:35,699 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 08:51:35,699 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 08:51:35,699 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 08:51:35,700 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 08:51:35,700 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 08:51:35,700 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 08:51:35,701 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 08:51:35,701 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 08:51:35,701 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 08:51:35,701 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 08:51:35,701 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 08:51:35,701 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 08:51:35,702 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 08:51:35,702 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 08:51:35,702 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 08:51:35,702 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 08:51:35,702 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 08:51:35,702 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 08:51:35,703 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 08:51:35,703 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 08:51:35,703 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 08:51:35,703 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 08:51:35,703 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 08:51:35,703 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 08:51:35,706 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 08:51:35,706 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 08:51:35,757 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 08:51:35,766 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 08:51:35,770 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 08:51:35,771 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 08:51:35,771 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 08:51:35,772 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test19_false-valid-free.i [2018-01-31 08:51:35,997 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 08:51:36,008 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-31 08:51:36,009 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 08:51:36,010 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 08:51:36,016 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 08:51:36,017 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:51:35" (1/1) ... [2018-01-31 08:51:36,022 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ad862a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:51:36, skipping insertion in model container [2018-01-31 08:51:36,022 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:51:35" (1/1) ... [2018-01-31 08:51:36,042 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:51:36,124 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:51:36,283 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:51:36,303 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:51:36,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:51:36 WrapperNode [2018-01-31 08:51:36,312 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 08:51:36,312 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 08:51:36,312 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 08:51:36,312 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 08:51:36,328 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:51:36" (1/1) ... [2018-01-31 08:51:36,328 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:51:36" (1/1) ... [2018-01-31 08:51:36,339 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:51:36" (1/1) ... [2018-01-31 08:51:36,340 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:51:36" (1/1) ... [2018-01-31 08:51:36,345 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:51:36" (1/1) ... [2018-01-31 08:51:36,347 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:51:36" (1/1) ... [2018-01-31 08:51:36,349 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:51:36" (1/1) ... [2018-01-31 08:51:36,351 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 08:51:36,352 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 08:51:36,352 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 08:51:36,352 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 08:51:36,353 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:51:36" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 08:51:36,414 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 08:51:36,415 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 08:51:36,415 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-31 08:51:36,415 INFO L136 BoogieDeclarations]: Found implementation of procedure f19 [2018-01-31 08:51:36,415 INFO L136 BoogieDeclarations]: Found implementation of procedure f19_undo [2018-01-31 08:51:36,415 INFO L136 BoogieDeclarations]: Found implementation of procedure g19 [2018-01-31 08:51:36,415 INFO L136 BoogieDeclarations]: Found implementation of procedure probe_unsafe_19 [2018-01-31 08:51:36,415 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_19 [2018-01-31 08:51:36,415 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-31 08:51:36,415 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 08:51:36,416 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-31 08:51:36,416 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-31 08:51:36,416 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 08:51:36,416 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 08:51:36,416 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 08:51:36,416 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-31 08:51:36,417 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-31 08:51:36,417 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-31 08:51:36,417 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-31 08:51:36,417 INFO L128 BoogieDeclarations]: Found specification of procedure f19 [2018-01-31 08:51:36,417 INFO L128 BoogieDeclarations]: Found specification of procedure f19_undo [2018-01-31 08:51:36,417 INFO L128 BoogieDeclarations]: Found specification of procedure g19 [2018-01-31 08:51:36,418 INFO L128 BoogieDeclarations]: Found specification of procedure probe_unsafe_19 [2018-01-31 08:51:36,418 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_19 [2018-01-31 08:51:36,418 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-31 08:51:36,418 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 08:51:36,418 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 08:51:36,418 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 08:51:37,048 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 08:51:37,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:51:37 BoogieIcfgContainer [2018-01-31 08:51:37,052 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 08:51:37,053 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 08:51:37,053 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 08:51:37,057 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 08:51:37,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 08:51:35" (1/3) ... [2018-01-31 08:51:37,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cad706f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:51:37, skipping insertion in model container [2018-01-31 08:51:37,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:51:36" (2/3) ... [2018-01-31 08:51:37,058 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cad706f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:51:37, skipping insertion in model container [2018-01-31 08:51:37,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:51:37" (3/3) ... [2018-01-31 08:51:37,060 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test19_false-valid-free.i [2018-01-31 08:51:37,066 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 08:51:37,073 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-01-31 08:51:37,125 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 08:51:37,125 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 08:51:37,125 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 08:51:37,126 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 08:51:37,126 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 08:51:37,126 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 08:51:37,126 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 08:51:37,126 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 08:51:37,127 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 08:51:37,152 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states. [2018-01-31 08:51:37,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-31 08:51:37,163 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:51:37,164 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] [2018-01-31 08:51:37,164 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-01-31 08:51:37,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1039497959, now seen corresponding path program 1 times [2018-01-31 08:51:37,172 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:51:37,172 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:51:37,244 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:37,244 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:51:37,244 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:37,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:51:37,316 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:51:37,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:51:37,646 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:51:37,666 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:51:37,667 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:51:37,677 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:51:37,677 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:51:37,679 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 6 states. [2018-01-31 08:51:38,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:51:38,736 INFO L93 Difference]: Finished difference Result 178 states and 202 transitions. [2018-01-31 08:51:38,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:51:38,738 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-01-31 08:51:38,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:51:38,752 INFO L225 Difference]: With dead ends: 178 [2018-01-31 08:51:38,752 INFO L226 Difference]: Without dead ends: 172 [2018-01-31 08:51:38,756 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:51:38,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-01-31 08:51:38,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 124. [2018-01-31 08:51:38,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-31 08:51:38,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 140 transitions. [2018-01-31 08:51:38,823 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 140 transitions. Word has length 20 [2018-01-31 08:51:38,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:51:38,823 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 140 transitions. [2018-01-31 08:51:38,823 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:51:38,823 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 140 transitions. [2018-01-31 08:51:38,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-31 08:51:38,825 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:51:38,825 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] [2018-01-31 08:51:38,826 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-01-31 08:51:38,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1039497960, now seen corresponding path program 1 times [2018-01-31 08:51:38,826 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:51:38,826 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:51:38,828 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:38,828 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:51:38,828 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:38,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:51:38,846 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:51:39,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:51:39,026 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:51:39,026 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:51:39,028 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:51:39,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:51:39,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:51:39,028 INFO L87 Difference]: Start difference. First operand 124 states and 140 transitions. Second operand 6 states. [2018-01-31 08:51:39,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:51:39,449 INFO L93 Difference]: Finished difference Result 165 states and 186 transitions. [2018-01-31 08:51:39,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:51:39,450 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-01-31 08:51:39,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:51:39,453 INFO L225 Difference]: With dead ends: 165 [2018-01-31 08:51:39,453 INFO L226 Difference]: Without dead ends: 162 [2018-01-31 08:51:39,454 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:51:39,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-01-31 08:51:39,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 140. [2018-01-31 08:51:39,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-01-31 08:51:39,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 163 transitions. [2018-01-31 08:51:39,475 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 163 transitions. Word has length 20 [2018-01-31 08:51:39,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:51:39,475 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 163 transitions. [2018-01-31 08:51:39,475 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:51:39,475 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 163 transitions. [2018-01-31 08:51:39,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-31 08:51:39,476 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:51:39,476 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] [2018-01-31 08:51:39,477 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-01-31 08:51:39,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1508699396, now seen corresponding path program 1 times [2018-01-31 08:51:39,477 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:51:39,477 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:51:39,479 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:39,479 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:51:39,479 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:39,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:51:39,501 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:51:39,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:51:39,698 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:51:39,698 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 08:51:39,698 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 08:51:39,698 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 08:51:39,699 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:51:39,699 INFO L87 Difference]: Start difference. First operand 140 states and 163 transitions. Second operand 8 states. [2018-01-31 08:51:40,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:51:40,581 INFO L93 Difference]: Finished difference Result 192 states and 220 transitions. [2018-01-31 08:51:40,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-31 08:51:40,581 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-01-31 08:51:40,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:51:40,584 INFO L225 Difference]: With dead ends: 192 [2018-01-31 08:51:40,584 INFO L226 Difference]: Without dead ends: 190 [2018-01-31 08:51:40,584 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-01-31 08:51:40,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-01-31 08:51:40,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 135. [2018-01-31 08:51:40,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-31 08:51:40,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 157 transitions. [2018-01-31 08:51:40,605 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 157 transitions. Word has length 21 [2018-01-31 08:51:40,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:51:40,605 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 157 transitions. [2018-01-31 08:51:40,605 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 08:51:40,605 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 157 transitions. [2018-01-31 08:51:40,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-31 08:51:40,606 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:51:40,606 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] [2018-01-31 08:51:40,607 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-01-31 08:51:40,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1508699395, now seen corresponding path program 1 times [2018-01-31 08:51:40,607 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:51:40,607 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:51:40,609 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:40,609 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:51:40,609 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:40,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:51:40,626 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:51:40,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:51:40,775 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:51:40,775 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-31 08:51:40,776 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 08:51:40,776 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 08:51:40,776 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:51:40,777 INFO L87 Difference]: Start difference. First operand 135 states and 157 transitions. Second operand 9 states. [2018-01-31 08:51:41,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:51:41,450 INFO L93 Difference]: Finished difference Result 196 states and 226 transitions. [2018-01-31 08:51:41,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-31 08:51:41,451 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-01-31 08:51:41,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:51:41,453 INFO L225 Difference]: With dead ends: 196 [2018-01-31 08:51:41,453 INFO L226 Difference]: Without dead ends: 193 [2018-01-31 08:51:41,454 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-01-31 08:51:41,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-01-31 08:51:41,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 103. [2018-01-31 08:51:41,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-31 08:51:41,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 110 transitions. [2018-01-31 08:51:41,490 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 110 transitions. Word has length 21 [2018-01-31 08:51:41,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:51:41,491 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 110 transitions. [2018-01-31 08:51:41,491 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 08:51:41,491 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 110 transitions. [2018-01-31 08:51:41,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-31 08:51:41,493 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:51:41,493 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:51:41,493 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-01-31 08:51:41,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1163641768, now seen corresponding path program 1 times [2018-01-31 08:51:41,494 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:51:41,494 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:51:41,495 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:41,496 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:51:41,496 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:41,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:51:41,526 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:51:41,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:51:41,604 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:51:41,604 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 08:51:41,604 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 08:51:41,604 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 08:51:41,605 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:51:41,605 INFO L87 Difference]: Start difference. First operand 103 states and 110 transitions. Second operand 8 states. [2018-01-31 08:51:41,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:51:41,844 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2018-01-31 08:51:41,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 08:51:41,845 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-01-31 08:51:41,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:51:41,846 INFO L225 Difference]: With dead ends: 119 [2018-01-31 08:51:41,846 INFO L226 Difference]: Without dead ends: 118 [2018-01-31 08:51:41,847 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-01-31 08:51:41,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-31 08:51:41,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 113. [2018-01-31 08:51:41,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-31 08:51:41,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 123 transitions. [2018-01-31 08:51:41,862 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 123 transitions. Word has length 34 [2018-01-31 08:51:41,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:51:41,863 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 123 transitions. [2018-01-31 08:51:41,863 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 08:51:41,863 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 123 transitions. [2018-01-31 08:51:41,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-31 08:51:41,864 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:51:41,864 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:51:41,864 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-01-31 08:51:41,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1163641769, now seen corresponding path program 1 times [2018-01-31 08:51:41,865 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:51:41,865 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:51:41,866 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:41,866 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:51:41,866 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:41,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:51:41,881 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:51:41,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:51:41,949 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:51:41,949 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 08:51:41,950 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:51:41,950 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:51:41,950 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:51:41,950 INFO L87 Difference]: Start difference. First operand 113 states and 123 transitions. Second operand 6 states. [2018-01-31 08:51:41,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:51:41,983 INFO L93 Difference]: Finished difference Result 141 states and 148 transitions. [2018-01-31 08:51:41,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:51:41,983 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-01-31 08:51:41,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:51:41,984 INFO L225 Difference]: With dead ends: 141 [2018-01-31 08:51:41,985 INFO L226 Difference]: Without dead ends: 114 [2018-01-31 08:51:41,985 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-01-31 08:51:41,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-01-31 08:51:41,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 110. [2018-01-31 08:51:41,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-01-31 08:51:41,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 117 transitions. [2018-01-31 08:51:42,000 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 117 transitions. Word has length 34 [2018-01-31 08:51:42,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:51:42,000 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 117 transitions. [2018-01-31 08:51:42,000 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:51:42,001 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 117 transitions. [2018-01-31 08:51:42,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-31 08:51:42,002 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:51:42,002 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:51:42,002 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-01-31 08:51:42,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1870152642, now seen corresponding path program 1 times [2018-01-31 08:51:42,003 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:51:42,003 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:51:42,004 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:42,004 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:51:42,005 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:42,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:51:42,020 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:51:42,120 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:51:42,120 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:51:42,120 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:51:42,120 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:51:42,121 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:51:42,121 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:51:42,121 INFO L87 Difference]: Start difference. First operand 110 states and 117 transitions. Second operand 6 states. [2018-01-31 08:51:42,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:51:42,461 INFO L93 Difference]: Finished difference Result 166 states and 187 transitions. [2018-01-31 08:51:42,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 08:51:42,461 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-01-31 08:51:42,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:51:42,463 INFO L225 Difference]: With dead ends: 166 [2018-01-31 08:51:42,463 INFO L226 Difference]: Without dead ends: 164 [2018-01-31 08:51:42,464 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:51:42,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-01-31 08:51:42,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 112. [2018-01-31 08:51:42,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-31 08:51:42,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2018-01-31 08:51:42,479 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 35 [2018-01-31 08:51:42,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:51:42,479 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2018-01-31 08:51:42,479 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:51:42,479 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2018-01-31 08:51:42,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-31 08:51:42,480 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:51:42,481 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:51:42,481 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-01-31 08:51:42,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1870152641, now seen corresponding path program 1 times [2018-01-31 08:51:42,481 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:51:42,481 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:51:42,483 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:42,483 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:51:42,483 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:42,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:51:42,506 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:51:42,661 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-31 08:51:42,661 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:51:42,688 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 08:51:42,688 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 08:51:42,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 08:51:42,689 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:51:42,689 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand 8 states. [2018-01-31 08:51:43,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:51:43,403 INFO L93 Difference]: Finished difference Result 179 states and 199 transitions. [2018-01-31 08:51:43,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 08:51:43,404 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-01-31 08:51:43,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:51:43,405 INFO L225 Difference]: With dead ends: 179 [2018-01-31 08:51:43,406 INFO L226 Difference]: Without dead ends: 177 [2018-01-31 08:51:43,406 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-01-31 08:51:43,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-01-31 08:51:43,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 139. [2018-01-31 08:51:43,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-01-31 08:51:43,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 155 transitions. [2018-01-31 08:51:43,423 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 155 transitions. Word has length 35 [2018-01-31 08:51:43,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:51:43,424 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 155 transitions. [2018-01-31 08:51:43,424 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 08:51:43,424 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 155 transitions. [2018-01-31 08:51:43,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-31 08:51:43,425 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:51:43,425 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:51:43,426 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-01-31 08:51:43,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1736333194, now seen corresponding path program 1 times [2018-01-31 08:51:43,426 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:51:43,426 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:51:43,427 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:43,427 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:51:43,427 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:43,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:51:43,442 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:51:43,545 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:51:43,545 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:51:43,545 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-31 08:51:43,545 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 08:51:43,546 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 08:51:43,546 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:51:43,546 INFO L87 Difference]: Start difference. First operand 139 states and 155 transitions. Second operand 9 states. [2018-01-31 08:51:44,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:51:44,187 INFO L93 Difference]: Finished difference Result 182 states and 204 transitions. [2018-01-31 08:51:44,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-31 08:51:44,187 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-01-31 08:51:44,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:51:44,189 INFO L225 Difference]: With dead ends: 182 [2018-01-31 08:51:44,189 INFO L226 Difference]: Without dead ends: 180 [2018-01-31 08:51:44,190 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-01-31 08:51:44,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-01-31 08:51:44,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 114. [2018-01-31 08:51:44,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-31 08:51:44,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2018-01-31 08:51:44,205 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 36 [2018-01-31 08:51:44,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:51:44,205 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2018-01-31 08:51:44,205 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 08:51:44,205 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2018-01-31 08:51:44,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-31 08:51:44,207 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:51:44,207 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:51:44,207 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-01-31 08:51:44,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1513566001, now seen corresponding path program 1 times [2018-01-31 08:51:44,207 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:51:44,207 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:51:44,209 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:44,209 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:51:44,209 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:44,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:51:44,226 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:51:44,610 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 08:51:44,610 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:51:44,610 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:51:44,624 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:51:44,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:51:44,672 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:51:44,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-31 08:51:44,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-31 08:51:44,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:51:44,757 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:51:44,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-01-31 08:51:44,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-31 08:51:44,840 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 08:51:44,848 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:51:44,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:51:44,852 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-01-31 08:51:44,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-31 08:51:44,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-31 08:51:44,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:51:44,915 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:51:45,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-31 08:51:45,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-31 08:51:45,047 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 08:51:45,071 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:51:45,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:51:45,144 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:37, output treesize:7 [2018-01-31 08:51:45,217 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:51:45,250 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:51:45,250 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2018-01-31 08:51:45,250 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 08:51:45,250 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 08:51:45,250 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-31 08:51:45,250 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand 7 states. [2018-01-31 08:51:45,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:51:45,477 INFO L93 Difference]: Finished difference Result 212 states and 226 transitions. [2018-01-31 08:51:45,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 08:51:45,477 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-01-31 08:51:45,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:51:45,478 INFO L225 Difference]: With dead ends: 212 [2018-01-31 08:51:45,478 INFO L226 Difference]: Without dead ends: 122 [2018-01-31 08:51:45,479 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:51:45,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-01-31 08:51:45,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 118. [2018-01-31 08:51:45,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-31 08:51:45,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 126 transitions. [2018-01-31 08:51:45,495 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 126 transitions. Word has length 36 [2018-01-31 08:51:45,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:51:45,495 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 126 transitions. [2018-01-31 08:51:45,495 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 08:51:45,495 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 126 transitions. [2018-01-31 08:51:45,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-31 08:51:45,496 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:51:45,496 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:51:45,496 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-01-31 08:51:45,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1381654812, now seen corresponding path program 1 times [2018-01-31 08:51:45,497 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:51:45,497 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:51:45,498 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:45,498 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:51:45,498 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:45,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:51:45,526 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:51:45,705 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:51:45,706 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:51:45,706 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 08:51:45,706 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 08:51:45,706 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 08:51:45,706 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:51:45,706 INFO L87 Difference]: Start difference. First operand 118 states and 126 transitions. Second operand 8 states. [2018-01-31 08:51:46,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:51:46,120 INFO L93 Difference]: Finished difference Result 153 states and 166 transitions. [2018-01-31 08:51:46,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-31 08:51:46,121 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-01-31 08:51:46,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:51:46,122 INFO L225 Difference]: With dead ends: 153 [2018-01-31 08:51:46,122 INFO L226 Difference]: Without dead ends: 152 [2018-01-31 08:51:46,123 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-01-31 08:51:46,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-01-31 08:51:46,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 117. [2018-01-31 08:51:46,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-01-31 08:51:46,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 125 transitions. [2018-01-31 08:51:46,137 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 125 transitions. Word has length 37 [2018-01-31 08:51:46,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:51:46,138 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 125 transitions. [2018-01-31 08:51:46,138 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 08:51:46,138 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 125 transitions. [2018-01-31 08:51:46,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-31 08:51:46,139 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:51:46,139 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:51:46,139 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-01-31 08:51:46,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1381654811, now seen corresponding path program 1 times [2018-01-31 08:51:46,139 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:51:46,139 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:51:46,141 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:46,141 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:51:46,141 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:46,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:51:46,156 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:51:46,438 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:51:46,438 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:51:46,438 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-31 08:51:46,439 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-31 08:51:46,439 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-31 08:51:46,439 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-01-31 08:51:46,439 INFO L87 Difference]: Start difference. First operand 117 states and 125 transitions. Second operand 12 states. [2018-01-31 08:51:47,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:51:47,308 INFO L93 Difference]: Finished difference Result 161 states and 173 transitions. [2018-01-31 08:51:47,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-31 08:51:47,308 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2018-01-31 08:51:47,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:51:47,309 INFO L225 Difference]: With dead ends: 161 [2018-01-31 08:51:47,310 INFO L226 Difference]: Without dead ends: 159 [2018-01-31 08:51:47,310 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2018-01-31 08:51:47,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-01-31 08:51:47,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 112. [2018-01-31 08:51:47,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-31 08:51:47,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2018-01-31 08:51:47,326 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 37 [2018-01-31 08:51:47,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:51:47,326 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2018-01-31 08:51:47,327 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-31 08:51:47,327 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2018-01-31 08:51:47,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-31 08:51:47,329 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:51:47,329 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:51:47,329 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-01-31 08:51:47,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1636674378, now seen corresponding path program 1 times [2018-01-31 08:51:47,329 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:51:47,330 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:51:47,331 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:47,331 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:51:47,331 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:47,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:51:47,347 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:51:47,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:51:47,502 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:51:47,502 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 08:51:47,502 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 08:51:47,503 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 08:51:47,503 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:51:47,503 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand 4 states. [2018-01-31 08:51:47,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:51:47,572 INFO L93 Difference]: Finished difference Result 136 states and 144 transitions. [2018-01-31 08:51:47,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 08:51:47,572 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-01-31 08:51:47,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:51:47,574 INFO L225 Difference]: With dead ends: 136 [2018-01-31 08:51:47,574 INFO L226 Difference]: Without dead ends: 118 [2018-01-31 08:51:47,574 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:51:47,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-31 08:51:47,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 108. [2018-01-31 08:51:47,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-01-31 08:51:47,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 115 transitions. [2018-01-31 08:51:47,588 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 115 transitions. Word has length 36 [2018-01-31 08:51:47,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:51:47,589 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 115 transitions. [2018-01-31 08:51:47,589 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 08:51:47,589 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 115 transitions. [2018-01-31 08:51:47,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-31 08:51:47,590 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:51:47,592 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:51:47,592 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-01-31 08:51:47,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1768585567, now seen corresponding path program 1 times [2018-01-31 08:51:47,592 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:51:47,592 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:51:47,594 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:47,594 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:51:47,594 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:47,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:51:47,605 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:51:47,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:51:47,655 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:51:47,655 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 08:51:47,655 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 08:51:47,655 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 08:51:47,655 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-31 08:51:47,655 INFO L87 Difference]: Start difference. First operand 108 states and 115 transitions. Second operand 7 states. [2018-01-31 08:51:47,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:51:47,921 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2018-01-31 08:51:47,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 08:51:47,955 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2018-01-31 08:51:47,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:51:47,956 INFO L225 Difference]: With dead ends: 114 [2018-01-31 08:51:47,956 INFO L226 Difference]: Without dead ends: 100 [2018-01-31 08:51:47,956 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-01-31 08:51:47,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-31 08:51:47,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-01-31 08:51:47,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-01-31 08:51:47,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2018-01-31 08:51:47,969 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 37 [2018-01-31 08:51:47,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:51:47,969 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2018-01-31 08:51:47,969 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 08:51:47,969 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2018-01-31 08:51:47,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-31 08:51:47,969 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:51:47,970 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:51:47,970 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-01-31 08:51:47,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1942844188, now seen corresponding path program 1 times [2018-01-31 08:51:47,970 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:51:47,970 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:51:47,971 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:47,971 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:51:47,971 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:47,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:51:47,987 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:51:48,093 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-31 08:51:48,094 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:51:48,094 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:51:48,094 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 08:51:48,094 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 08:51:48,094 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:51:48,094 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 5 states. [2018-01-31 08:51:48,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:51:48,152 INFO L93 Difference]: Finished difference Result 153 states and 160 transitions. [2018-01-31 08:51:48,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:51:48,152 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-01-31 08:51:48,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:51:48,153 INFO L225 Difference]: With dead ends: 153 [2018-01-31 08:51:48,153 INFO L226 Difference]: Without dead ends: 113 [2018-01-31 08:51:48,153 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-01-31 08:51:48,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-01-31 08:51:48,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 106. [2018-01-31 08:51:48,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-01-31 08:51:48,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 112 transitions. [2018-01-31 08:51:48,166 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 112 transitions. Word has length 49 [2018-01-31 08:51:48,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:51:48,167 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 112 transitions. [2018-01-31 08:51:48,167 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 08:51:48,167 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 112 transitions. [2018-01-31 08:51:48,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-31 08:51:48,167 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:51:48,168 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:51:48,168 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-01-31 08:51:48,169 INFO L82 PathProgramCache]: Analyzing trace with hash -869979201, now seen corresponding path program 1 times [2018-01-31 08:51:48,169 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:51:48,169 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:51:48,170 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:48,170 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:51:48,170 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:48,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:51:48,187 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:51:48,527 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 08:51:48,527 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:51:48,527 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:51:48,535 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:51:48,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:51:48,575 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:51:48,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-31 08:51:48,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-31 08:51:48,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:51:48,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:51:48,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:51:48,656 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-01-31 08:51:48,711 WARN L1033 $PredicateComparison]: unable to prove that (exists ((f19_~a.offset Int)) (= (store |c_old(#memory_$Pointer$.offset)| |c_f19_#in~a.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_f19_#in~a.base|) f19_~a.offset 0)) |c_#memory_$Pointer$.offset|)) is different from true [2018-01-31 08:51:48,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-31 08:51:48,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2018-01-31 08:51:48,724 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:51:48,770 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:51:48,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 08:51:48,773 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2018-01-31 08:51:48,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-31 08:51:48,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-31 08:51:48,802 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:51:48,803 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:51:48,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:51:48,804 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-01-31 08:51:48,810 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-31 08:51:48,841 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:51:48,841 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 18 [2018-01-31 08:51:48,842 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-31 08:51:48,842 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-31 08:51:48,842 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=259, Unknown=1, NotChecked=32, Total=342 [2018-01-31 08:51:48,842 INFO L87 Difference]: Start difference. First operand 106 states and 112 transitions. Second operand 19 states. [2018-01-31 08:51:49,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:51:49,405 INFO L93 Difference]: Finished difference Result 106 states and 112 transitions. [2018-01-31 08:51:49,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-31 08:51:49,405 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-01-31 08:51:49,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:51:49,406 INFO L225 Difference]: With dead ends: 106 [2018-01-31 08:51:49,406 INFO L226 Difference]: Without dead ends: 105 [2018-01-31 08:51:49,407 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=130, Invalid=740, Unknown=4, NotChecked=56, Total=930 [2018-01-31 08:51:49,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-01-31 08:51:49,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-01-31 08:51:49,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-01-31 08:51:49,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2018-01-31 08:51:49,415 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 49 [2018-01-31 08:51:49,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:51:49,415 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2018-01-31 08:51:49,415 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-31 08:51:49,415 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2018-01-31 08:51:49,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-31 08:51:49,416 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:51:49,416 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:51:49,416 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-01-31 08:51:49,416 INFO L82 PathProgramCache]: Analyzing trace with hash -869979200, now seen corresponding path program 1 times [2018-01-31 08:51:49,417 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:51:49,417 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:51:49,418 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:49,418 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:51:49,418 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:49,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:51:49,430 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:51:50,141 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:51:50,141 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:51:50,141 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:51:50,147 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:51:50,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:51:50,181 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:51:50,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:51:50,196 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:51:50,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:51:50,218 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-31 08:51:50,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-31 08:51:50,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-31 08:51:50,254 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:51:50,256 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:51:50,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:51:50,259 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-01-31 08:51:50,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-01-31 08:51:50,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 28 [2018-01-31 08:51:50,374 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-31 08:51:50,383 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-31 08:51:50,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-31 08:51:50,392 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:35 [2018-01-31 08:51:50,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2018-01-31 08:51:50,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-31 08:51:50,461 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:51:50,464 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:51:50,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-01-31 08:51:50,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 16 [2018-01-31 08:51:50,484 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-31 08:51:50,490 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:51:50,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-01-31 08:51:50,501 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:53, output treesize:24 [2018-01-31 08:51:50,660 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:51:50,680 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:51:50,680 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 22 [2018-01-31 08:51:50,680 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-31 08:51:50,681 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-31 08:51:50,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=431, Unknown=8, NotChecked=0, Total=506 [2018-01-31 08:51:50,681 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand 23 states. [2018-01-31 08:51:51,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:51:51,725 INFO L93 Difference]: Finished difference Result 137 states and 148 transitions. [2018-01-31 08:51:51,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-31 08:51:51,726 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 49 [2018-01-31 08:51:51,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:51:51,727 INFO L225 Difference]: With dead ends: 137 [2018-01-31 08:51:51,727 INFO L226 Difference]: Without dead ends: 136 [2018-01-31 08:51:51,727 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=157, Invalid=1020, Unknown=13, NotChecked=0, Total=1190 [2018-01-31 08:51:51,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-01-31 08:51:51,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 119. [2018-01-31 08:51:51,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-31 08:51:51,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2018-01-31 08:51:51,740 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 49 [2018-01-31 08:51:51,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:51:51,740 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions. [2018-01-31 08:51:51,741 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-31 08:51:51,741 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2018-01-31 08:51:51,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-31 08:51:51,741 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:51:51,742 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:51:51,742 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-01-31 08:51:51,742 INFO L82 PathProgramCache]: Analyzing trace with hash -903876539, now seen corresponding path program 1 times [2018-01-31 08:51:51,742 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:51:51,742 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:51:51,743 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:51,743 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:51:51,743 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:51,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:51:51,755 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:51:51,863 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-31 08:51:51,863 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:51:51,864 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 08:51:51,864 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 08:51:51,864 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 08:51:51,864 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-31 08:51:51,864 INFO L87 Difference]: Start difference. First operand 119 states and 127 transitions. Second operand 7 states. [2018-01-31 08:51:52,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:51:52,079 INFO L93 Difference]: Finished difference Result 175 states and 185 transitions. [2018-01-31 08:51:52,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 08:51:52,080 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-01-31 08:51:52,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:51:52,081 INFO L225 Difference]: With dead ends: 175 [2018-01-31 08:51:52,081 INFO L226 Difference]: Without dead ends: 114 [2018-01-31 08:51:52,081 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-01-31 08:51:52,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-01-31 08:51:52,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 110. [2018-01-31 08:51:52,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-01-31 08:51:52,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 116 transitions. [2018-01-31 08:51:52,095 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 116 transitions. Word has length 50 [2018-01-31 08:51:52,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:51:52,096 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 116 transitions. [2018-01-31 08:51:52,096 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 08:51:52,096 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 116 transitions. [2018-01-31 08:51:52,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-31 08:51:52,097 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:51:52,097 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:51:52,097 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-01-31 08:51:52,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1267074650, now seen corresponding path program 1 times [2018-01-31 08:51:52,098 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:51:52,098 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:51:52,099 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:52,099 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:51:52,099 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:52,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:51:52,112 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:51:52,444 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 08:51:52,444 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:51:52,444 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 08:51:52,444 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:51:52,445 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:51:52,445 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:51:52,445 INFO L87 Difference]: Start difference. First operand 110 states and 116 transitions. Second operand 6 states. [2018-01-31 08:51:52,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:51:52,617 INFO L93 Difference]: Finished difference Result 170 states and 178 transitions. [2018-01-31 08:51:52,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:51:52,617 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2018-01-31 08:51:52,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:51:52,618 INFO L225 Difference]: With dead ends: 170 [2018-01-31 08:51:52,618 INFO L226 Difference]: Without dead ends: 110 [2018-01-31 08:51:52,619 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:51:52,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-01-31 08:51:52,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-01-31 08:51:52,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-01-31 08:51:52,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 115 transitions. [2018-01-31 08:51:52,639 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 115 transitions. Word has length 59 [2018-01-31 08:51:52,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:51:52,639 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 115 transitions. [2018-01-31 08:51:52,639 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:51:52,640 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 115 transitions. [2018-01-31 08:51:52,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-31 08:51:52,640 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:51:52,640 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:51:52,640 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-01-31 08:51:52,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1858760899, now seen corresponding path program 1 times [2018-01-31 08:51:52,641 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:51:52,642 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:51:52,643 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:52,643 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:51:52,643 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:52,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:51:52,658 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:51:53,023 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:51:53,024 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:51:53,055 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:51:53,055 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:51:53,056 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:51:53,056 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:51:53,056 INFO L87 Difference]: Start difference. First operand 110 states and 115 transitions. Second operand 6 states. [2018-01-31 08:51:53,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:51:53,552 INFO L93 Difference]: Finished difference Result 126 states and 134 transitions. [2018-01-31 08:51:53,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:51:53,553 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2018-01-31 08:51:53,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:51:53,553 INFO L225 Difference]: With dead ends: 126 [2018-01-31 08:51:53,553 INFO L226 Difference]: Without dead ends: 125 [2018-01-31 08:51:53,554 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:51:53,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-01-31 08:51:53,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 117. [2018-01-31 08:51:53,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-01-31 08:51:53,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 126 transitions. [2018-01-31 08:51:53,570 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 126 transitions. Word has length 59 [2018-01-31 08:51:53,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:51:53,571 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 126 transitions. [2018-01-31 08:51:53,571 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:51:53,571 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 126 transitions. [2018-01-31 08:51:53,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-31 08:51:53,572 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:51:53,572 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:51:53,572 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-01-31 08:51:53,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1858760898, now seen corresponding path program 1 times [2018-01-31 08:51:53,572 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:51:53,572 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:51:53,575 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:53,575 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:51:53,575 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:53,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:51:53,589 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:51:53,823 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-31 08:51:53,823 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:51:53,823 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:51:53,824 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 08:51:53,824 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 08:51:53,824 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:51:53,824 INFO L87 Difference]: Start difference. First operand 117 states and 126 transitions. Second operand 5 states. [2018-01-31 08:51:54,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:51:54,176 INFO L93 Difference]: Finished difference Result 168 states and 176 transitions. [2018-01-31 08:51:54,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 08:51:54,177 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2018-01-31 08:51:54,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:51:54,178 INFO L225 Difference]: With dead ends: 168 [2018-01-31 08:51:54,178 INFO L226 Difference]: Without dead ends: 114 [2018-01-31 08:51:54,178 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:51:54,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-01-31 08:51:54,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 110. [2018-01-31 08:51:54,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-01-31 08:51:54,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 114 transitions. [2018-01-31 08:51:54,195 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 114 transitions. Word has length 59 [2018-01-31 08:51:54,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:51:54,195 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 114 transitions. [2018-01-31 08:51:54,195 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 08:51:54,196 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 114 transitions. [2018-01-31 08:51:54,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-31 08:51:54,196 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:51:54,196 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:51:54,197 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-01-31 08:51:54,197 INFO L82 PathProgramCache]: Analyzing trace with hash 212641951, now seen corresponding path program 1 times [2018-01-31 08:51:54,197 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:51:54,197 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:51:54,198 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:54,198 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:51:54,198 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:54,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:51:54,210 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:51:54,430 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-31 08:51:54,430 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:51:54,430 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 08:51:54,431 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 08:51:54,431 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 08:51:54,431 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:51:54,431 INFO L87 Difference]: Start difference. First operand 110 states and 114 transitions. Second operand 8 states. [2018-01-31 08:51:54,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:51:54,654 INFO L93 Difference]: Finished difference Result 119 states and 123 transitions. [2018-01-31 08:51:54,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 08:51:54,656 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2018-01-31 08:51:54,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:51:54,657 INFO L225 Difference]: With dead ends: 119 [2018-01-31 08:51:54,657 INFO L226 Difference]: Without dead ends: 118 [2018-01-31 08:51:54,657 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:51:54,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-31 08:51:54,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 112. [2018-01-31 08:51:54,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-31 08:51:54,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 117 transitions. [2018-01-31 08:51:54,668 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 117 transitions. Word has length 60 [2018-01-31 08:51:54,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:51:54,669 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 117 transitions. [2018-01-31 08:51:54,669 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 08:51:54,669 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 117 transitions. [2018-01-31 08:51:54,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-31 08:51:54,670 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:51:54,670 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:51:54,670 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-01-31 08:51:54,670 INFO L82 PathProgramCache]: Analyzing trace with hash 212641952, now seen corresponding path program 1 times [2018-01-31 08:51:54,670 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:51:54,670 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:51:54,671 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:54,671 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:51:54,671 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:54,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:51:54,687 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:51:54,949 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-31 08:51:54,950 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:51:54,950 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-31 08:51:54,950 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-31 08:51:54,950 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-31 08:51:54,950 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-01-31 08:51:54,951 INFO L87 Difference]: Start difference. First operand 112 states and 117 transitions. Second operand 11 states. [2018-01-31 08:51:55,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:51:55,207 INFO L93 Difference]: Finished difference Result 119 states and 122 transitions. [2018-01-31 08:51:55,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-31 08:51:55,208 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2018-01-31 08:51:55,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:51:55,209 INFO L225 Difference]: With dead ends: 119 [2018-01-31 08:51:55,209 INFO L226 Difference]: Without dead ends: 118 [2018-01-31 08:51:55,209 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-01-31 08:51:55,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-31 08:51:55,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2018-01-31 08:51:55,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-31 08:51:55,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 121 transitions. [2018-01-31 08:51:55,222 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 121 transitions. Word has length 60 [2018-01-31 08:51:55,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:51:55,223 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 121 transitions. [2018-01-31 08:51:55,223 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-31 08:51:55,223 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 121 transitions. [2018-01-31 08:51:55,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-31 08:51:55,224 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:51:55,224 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:51:55,224 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-01-31 08:51:55,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1998034078, now seen corresponding path program 1 times [2018-01-31 08:51:55,225 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:51:55,225 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:51:55,226 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:55,226 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:51:55,226 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:55,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:51:55,243 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:51:55,408 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-31 08:51:55,408 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:51:55,408 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-31 08:51:55,409 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-31 08:51:55,409 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-31 08:51:55,409 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-01-31 08:51:55,409 INFO L87 Difference]: Start difference. First operand 116 states and 121 transitions. Second operand 11 states. [2018-01-31 08:51:55,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:51:55,900 INFO L93 Difference]: Finished difference Result 120 states and 123 transitions. [2018-01-31 08:51:55,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-31 08:51:55,900 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 61 [2018-01-31 08:51:55,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:51:55,901 INFO L225 Difference]: With dead ends: 120 [2018-01-31 08:51:55,902 INFO L226 Difference]: Without dead ends: 119 [2018-01-31 08:51:55,902 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-01-31 08:51:55,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-31 08:51:55,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2018-01-31 08:51:55,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-31 08:51:55,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 120 transitions. [2018-01-31 08:51:55,917 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 120 transitions. Word has length 61 [2018-01-31 08:51:55,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:51:55,918 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 120 transitions. [2018-01-31 08:51:55,920 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-31 08:51:55,920 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 120 transitions. [2018-01-31 08:51:55,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-31 08:51:55,921 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:51:55,921 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:51:55,921 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-01-31 08:51:55,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1998034079, now seen corresponding path program 1 times [2018-01-31 08:51:55,921 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:51:55,921 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:51:55,922 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:55,922 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:51:55,922 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:55,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:51:55,936 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:51:56,055 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-31 08:51:56,055 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:51:56,055 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-31 08:51:56,055 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-31 08:51:56,056 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-31 08:51:56,056 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-01-31 08:51:56,056 INFO L87 Difference]: Start difference. First operand 116 states and 120 transitions. Second operand 11 states. [2018-01-31 08:51:56,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:51:56,837 INFO L93 Difference]: Finished difference Result 117 states and 120 transitions. [2018-01-31 08:51:56,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-31 08:51:56,837 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 61 [2018-01-31 08:51:56,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:51:56,838 INFO L225 Difference]: With dead ends: 117 [2018-01-31 08:51:56,838 INFO L226 Difference]: Without dead ends: 116 [2018-01-31 08:51:56,838 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-01-31 08:51:56,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-31 08:51:56,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-01-31 08:51:56,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-31 08:51:56,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 119 transitions. [2018-01-31 08:51:56,852 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 119 transitions. Word has length 61 [2018-01-31 08:51:56,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:51:56,852 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 119 transitions. [2018-01-31 08:51:56,852 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-31 08:51:56,852 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 119 transitions. [2018-01-31 08:51:56,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-31 08:51:56,853 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:51:56,853 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:51:56,853 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-01-31 08:51:56,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1570401144, now seen corresponding path program 1 times [2018-01-31 08:51:56,854 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:51:56,854 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:51:56,855 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:56,855 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:51:56,855 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:56,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:51:56,869 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:51:56,941 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-31 08:51:56,941 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:51:56,941 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-31 08:51:56,942 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 08:51:56,942 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 08:51:56,942 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:51:56,942 INFO L87 Difference]: Start difference. First operand 116 states and 119 transitions. Second operand 8 states. [2018-01-31 08:51:56,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:51:56,986 INFO L93 Difference]: Finished difference Result 156 states and 159 transitions. [2018-01-31 08:51:56,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 08:51:56,987 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2018-01-31 08:51:56,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:51:56,988 INFO L225 Difference]: With dead ends: 156 [2018-01-31 08:51:56,988 INFO L226 Difference]: Without dead ends: 128 [2018-01-31 08:51:56,988 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-01-31 08:51:56,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-01-31 08:51:56,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 124. [2018-01-31 08:51:56,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-31 08:51:56,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 127 transitions. [2018-01-31 08:51:56,997 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 127 transitions. Word has length 60 [2018-01-31 08:51:56,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:51:56,997 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 127 transitions. [2018-01-31 08:51:56,997 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 08:51:56,997 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 127 transitions. [2018-01-31 08:51:56,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-31 08:51:56,998 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:51:56,998 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:51:56,998 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-01-31 08:51:56,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1690410778, now seen corresponding path program 1 times [2018-01-31 08:51:56,998 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:51:56,999 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:51:57,000 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:57,000 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:51:57,000 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:57,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:51:57,014 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:51:57,570 WARN L146 SmtUtils]: Spent 256ms on a formula simplification. DAG size of input: 21 DAG size of output 16 [2018-01-31 08:51:57,993 WARN L146 SmtUtils]: Spent 351ms on a formula simplification. DAG size of input: 16 DAG size of output 7 [2018-01-31 08:51:58,239 WARN L146 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 26 DAG size of output 24 [2018-01-31 08:51:58,632 WARN L146 SmtUtils]: Spent 237ms on a formula simplification. DAG size of input: 29 DAG size of output 8 [2018-01-31 08:51:58,888 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 08:51:58,889 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:51:58,889 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:51:58,905 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:51:58,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:51:58,937 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:51:59,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-31 08:51:59,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-31 08:51:59,112 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:51:59,114 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:51:59,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:51:59,119 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:34 [2018-01-31 08:51:59,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-01-31 08:51:59,227 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:51:59,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2018-01-31 08:51:59,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:51:59,235 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:51:59,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:51:59,242 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:34 [2018-01-31 08:51:59,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2018-01-31 08:51:59,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 16 [2018-01-31 08:51:59,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:51:59,261 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:51:59,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:51:59,267 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:16 [2018-01-31 08:51:59,445 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 08:51:59,467 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:51:59,467 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 27 [2018-01-31 08:51:59,467 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-31 08:51:59,468 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-31 08:51:59,468 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=644, Unknown=21, NotChecked=0, Total=756 [2018-01-31 08:51:59,468 INFO L87 Difference]: Start difference. First operand 124 states and 127 transitions. Second operand 28 states. [2018-01-31 08:52:00,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:52:00,636 INFO L93 Difference]: Finished difference Result 130 states and 132 transitions. [2018-01-31 08:52:00,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-31 08:52:00,637 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 62 [2018-01-31 08:52:00,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:52:00,638 INFO L225 Difference]: With dead ends: 130 [2018-01-31 08:52:00,638 INFO L226 Difference]: Without dead ends: 98 [2018-01-31 08:52:00,638 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=177, Invalid=1357, Unknown=26, NotChecked=0, Total=1560 [2018-01-31 08:52:00,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-31 08:52:00,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-01-31 08:52:00,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-31 08:52:00,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2018-01-31 08:52:00,650 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 62 [2018-01-31 08:52:00,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:52:00,651 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2018-01-31 08:52:00,651 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-31 08:52:00,651 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2018-01-31 08:52:00,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-01-31 08:52:00,652 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:52:00,652 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:52:00,652 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-01-31 08:52:00,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1105047636, now seen corresponding path program 1 times [2018-01-31 08:52:00,652 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:52:00,652 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:52:00,653 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:52:00,653 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:52:00,654 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:52:00,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:52:00,666 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:52:01,536 WARN L143 SmtUtils]: Spent 111ms on a formula simplification that was a NOOP. DAG size: 14 [2018-01-31 08:52:01,689 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:52:01,690 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:52:01,690 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-31 08:52:01,690 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-31 08:52:01,690 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-31 08:52:01,690 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-01-31 08:52:01,690 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 13 states. [2018-01-31 08:52:02,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:52:02,003 INFO L93 Difference]: Finished difference Result 98 states and 100 transitions. [2018-01-31 08:52:02,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-31 08:52:02,003 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2018-01-31 08:52:02,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:52:02,004 INFO L225 Difference]: With dead ends: 98 [2018-01-31 08:52:02,004 INFO L226 Difference]: Without dead ends: 97 [2018-01-31 08:52:02,004 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2018-01-31 08:52:02,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-01-31 08:52:02,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-01-31 08:52:02,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-31 08:52:02,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 99 transitions. [2018-01-31 08:52:02,014 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 99 transitions. Word has length 65 [2018-01-31 08:52:02,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:52:02,014 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 99 transitions. [2018-01-31 08:52:02,014 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-31 08:52:02,014 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 99 transitions. [2018-01-31 08:52:02,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-01-31 08:52:02,015 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:52:02,015 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:52:02,015 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-01-31 08:52:02,015 INFO L82 PathProgramCache]: Analyzing trace with hash 103261674, now seen corresponding path program 1 times [2018-01-31 08:52:02,016 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:52:02,016 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:52:02,017 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:52:02,017 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:52:02,017 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:52:02,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:52:02,031 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:52:02,633 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:52:02,633 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:52:02,633 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:52:02,639 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:52:02,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:52:02,681 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:52:02,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:52:02,687 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:52:02,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:52:02,688 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-31 08:52:02,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-31 08:52:02,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-31 08:52:02,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:52:02,743 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:52:02,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:52:02,746 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-01-31 08:52:03,382 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:52:03,383 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:52:03,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 39 [2018-01-31 08:52:03,384 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:52:03,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2018-01-31 08:52:03,397 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:52:03,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-01-31 08:52:03,398 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:52:03,403 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:52:03,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:52:03,409 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:38, output treesize:43 [2018-01-31 08:52:03,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 14 [2018-01-31 08:52:03,564 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:52:03,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-31 08:52:03,570 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:26 [2018-01-31 08:52:08,089 WARN L143 SmtUtils]: Spent 4012ms on a formula simplification that was a NOOP. DAG size: 27 [2018-01-31 08:52:08,474 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:52:08,475 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-01-31 08:52:08,475 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:52:08,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-31 08:52:08,484 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:75, output treesize:51 [2018-01-31 08:52:08,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2018-01-31 08:52:08,533 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:52:08,534 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:52:08,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2018-01-31 08:52:08,535 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 08:52:08,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 08:52:08,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 08:52:08,544 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:15 [2018-01-31 08:52:08,585 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:52:08,604 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:52:08,604 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [22] total 35 [2018-01-31 08:52:08,604 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-01-31 08:52:08,605 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-01-31 08:52:08,605 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1144, Unknown=8, NotChecked=0, Total=1260 [2018-01-31 08:52:08,605 INFO L87 Difference]: Start difference. First operand 97 states and 99 transitions. Second operand 36 states. [2018-01-31 08:52:12,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:52:12,049 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2018-01-31 08:52:12,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-31 08:52:12,050 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 66 [2018-01-31 08:52:12,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:52:12,051 INFO L225 Difference]: With dead ends: 112 [2018-01-31 08:52:12,051 INFO L226 Difference]: Without dead ends: 111 [2018-01-31 08:52:12,052 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 50 SyntacticMatches, 5 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=250, Invalid=2498, Unknown=8, NotChecked=0, Total=2756 [2018-01-31 08:52:12,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-31 08:52:12,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 96. [2018-01-31 08:52:12,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-31 08:52:12,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 98 transitions. [2018-01-31 08:52:12,066 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 98 transitions. Word has length 66 [2018-01-31 08:52:12,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:52:12,066 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 98 transitions. [2018-01-31 08:52:12,066 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-01-31 08:52:12,067 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 98 transitions. [2018-01-31 08:52:12,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-01-31 08:52:12,067 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:52:12,067 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:52:12,067 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-01-31 08:52:12,068 INFO L82 PathProgramCache]: Analyzing trace with hash 776927283, now seen corresponding path program 1 times [2018-01-31 08:52:12,068 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:52:12,068 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:52:12,068 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:52:12,069 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:52:12,069 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:52:12,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:52:12,091 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:52:13,141 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-31 08:52:13,141 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:52:13,141 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-31 08:52:13,141 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-31 08:52:13,142 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-31 08:52:13,142 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-31 08:52:13,142 INFO L87 Difference]: Start difference. First operand 96 states and 98 transitions. Second operand 10 states. [2018-01-31 08:52:13,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:52:13,829 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2018-01-31 08:52:13,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-31 08:52:13,829 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2018-01-31 08:52:13,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:52:13,830 INFO L225 Difference]: With dead ends: 111 [2018-01-31 08:52:13,831 INFO L226 Difference]: Without dead ends: 110 [2018-01-31 08:52:13,831 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-01-31 08:52:13,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-01-31 08:52:13,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 105. [2018-01-31 08:52:13,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-01-31 08:52:13,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2018-01-31 08:52:13,846 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 67 [2018-01-31 08:52:13,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:52:13,847 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2018-01-31 08:52:13,847 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-31 08:52:13,847 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2018-01-31 08:52:13,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-01-31 08:52:13,847 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:52:13,848 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:52:13,848 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-01-31 08:52:13,848 INFO L82 PathProgramCache]: Analyzing trace with hash 776927284, now seen corresponding path program 1 times [2018-01-31 08:52:13,848 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:52:13,848 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:52:13,849 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:52:13,849 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:52:13,849 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:52:13,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:52:13,867 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:52:14,224 WARN L146 SmtUtils]: Spent 150ms on a formula simplification. DAG size of input: 15 DAG size of output 12 [2018-01-31 08:52:14,360 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:52:14,360 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:52:14,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-31 08:52:14,361 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-31 08:52:14,361 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-31 08:52:14,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-01-31 08:52:14,361 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand 15 states. [2018-01-31 08:52:14,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:52:14,841 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2018-01-31 08:52:14,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-31 08:52:14,842 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2018-01-31 08:52:14,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:52:14,842 INFO L225 Difference]: With dead ends: 105 [2018-01-31 08:52:14,842 INFO L226 Difference]: Without dead ends: 104 [2018-01-31 08:52:14,843 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=113, Invalid=537, Unknown=0, NotChecked=0, Total=650 [2018-01-31 08:52:14,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-01-31 08:52:14,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-01-31 08:52:14,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-01-31 08:52:14,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 108 transitions. [2018-01-31 08:52:14,851 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 108 transitions. Word has length 67 [2018-01-31 08:52:14,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:52:14,851 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 108 transitions. [2018-01-31 08:52:14,852 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-31 08:52:14,852 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2018-01-31 08:52:14,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-31 08:52:14,852 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:52:14,852 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:52:14,852 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-01-31 08:52:14,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1685058029, now seen corresponding path program 1 times [2018-01-31 08:52:14,853 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:52:14,853 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:52:14,853 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:52:14,854 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:52:14,854 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:52:14,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:52:14,868 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:52:15,628 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-31 08:52:15,629 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:52:15,629 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:52:15,636 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:52:15,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:52:15,667 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:52:15,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-31 08:52:15,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-31 08:52:15,734 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:52:15,736 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:52:15,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:52:15,739 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-01-31 08:52:16,051 WARN L1033 $PredicateComparison]: unable to prove that (exists ((f19_~a.offset Int)) (= (store |c_old(#memory_$Pointer$.offset)| |c_f19_#in~a.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_f19_#in~a.base|) f19_~a.offset 0)) |c_#memory_$Pointer$.offset|)) is different from true [2018-01-31 08:52:16,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-31 08:52:16,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2018-01-31 08:52:16,069 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:52:16,072 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:52:16,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 08:52:16,075 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2018-01-31 08:52:16,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-31 08:52:16,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-31 08:52:16,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:52:16,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:52:16,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:52:16,217 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-01-31 08:52:16,222 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-31 08:52:16,242 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:52:16,242 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [17] total 30 [2018-01-31 08:52:16,242 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-31 08:52:16,243 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-31 08:52:16,243 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=779, Unknown=1, NotChecked=56, Total=930 [2018-01-31 08:52:16,243 INFO L87 Difference]: Start difference. First operand 104 states and 108 transitions. Second operand 31 states. [2018-01-31 08:52:21,543 WARN L146 SmtUtils]: Spent 4030ms on a formula simplification. DAG size of input: 34 DAG size of output 31 [2018-01-31 08:52:21,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:52:21,875 INFO L93 Difference]: Finished difference Result 112 states and 115 transitions. [2018-01-31 08:52:21,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-31 08:52:21,875 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 68 [2018-01-31 08:52:21,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:52:21,876 INFO L225 Difference]: With dead ends: 112 [2018-01-31 08:52:21,876 INFO L226 Difference]: Without dead ends: 111 [2018-01-31 08:52:21,876 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=257, Invalid=2000, Unknown=3, NotChecked=92, Total=2352 [2018-01-31 08:52:21,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-31 08:52:21,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-01-31 08:52:21,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-01-31 08:52:21,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 114 transitions. [2018-01-31 08:52:21,887 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 114 transitions. Word has length 68 [2018-01-31 08:52:21,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:52:21,887 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 114 transitions. [2018-01-31 08:52:21,887 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-01-31 08:52:21,888 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 114 transitions. [2018-01-31 08:52:21,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-31 08:52:21,888 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:52:21,888 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:52:21,888 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-01-31 08:52:21,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1685058028, now seen corresponding path program 1 times [2018-01-31 08:52:21,888 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:52:21,889 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:52:21,889 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:52:21,889 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:52:21,889 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:52:21,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:52:21,904 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:52:22,474 WARN L146 SmtUtils]: Spent 324ms on a formula simplification. DAG size of input: 17 DAG size of output 11 [2018-01-31 08:52:23,181 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:52:23,181 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:52:23,181 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:52:23,186 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:52:23,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:52:23,215 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:52:23,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:52:23,246 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:52:23,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:52:23,247 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-31 08:52:23,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-31 08:52:23,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-31 08:52:23,313 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:52:23,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:52:23,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:52:23,319 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-01-31 08:52:23,422 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|f19_#t~ret2.base| Int) (f19_~a.offset Int)) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_f19_#in~a.base| (store (select |c_old(#memory_$Pointer$.base)| |c_f19_#in~a.base|) f19_~a.offset |f19_#t~ret2.base|))) (= |c_#valid| (store |c_old(#valid)| |f19_#t~ret2.base| 1)))) is different from true [2018-01-31 08:52:23,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-01-31 08:52:23,439 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:52:23,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-01-31 08:52:23,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 28 [2018-01-31 08:52:23,455 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-31 08:52:23,463 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:52:23,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 08:52:23,467 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:29, output treesize:21 [2018-01-31 08:52:23,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-01-31 08:52:23,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-01-31 08:52:23,666 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:52:23,689 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:52:23,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:52:23,690 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2018-01-31 08:52:23,698 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:52:23,717 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:52:23,717 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [21] total 36 [2018-01-31 08:52:23,718 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-01-31 08:52:23,718 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-01-31 08:52:23,718 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1142, Unknown=1, NotChecked=68, Total=1332 [2018-01-31 08:52:23,718 INFO L87 Difference]: Start difference. First operand 111 states and 114 transitions. Second operand 37 states. [2018-01-31 08:52:28,775 WARN L146 SmtUtils]: Spent 4047ms on a formula simplification. DAG size of input: 50 DAG size of output 44 [2018-01-31 08:52:29,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:52:29,244 INFO L93 Difference]: Finished difference Result 114 states and 117 transitions. [2018-01-31 08:52:29,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-31 08:52:29,245 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 68 [2018-01-31 08:52:29,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:52:29,245 INFO L225 Difference]: With dead ends: 114 [2018-01-31 08:52:29,246 INFO L226 Difference]: Without dead ends: 113 [2018-01-31 08:52:29,247 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=313, Invalid=2658, Unknown=3, NotChecked=106, Total=3080 [2018-01-31 08:52:29,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-01-31 08:52:29,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2018-01-31 08:52:29,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-31 08:52:29,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 115 transitions. [2018-01-31 08:52:29,260 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 115 transitions. Word has length 68 [2018-01-31 08:52:29,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:52:29,261 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 115 transitions. [2018-01-31 08:52:29,261 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-01-31 08:52:29,261 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 115 transitions. [2018-01-31 08:52:29,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-31 08:52:29,261 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:52:29,261 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:52:29,261 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-01-31 08:52:29,261 INFO L82 PathProgramCache]: Analyzing trace with hash -628758251, now seen corresponding path program 1 times [2018-01-31 08:52:29,262 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:52:29,262 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:52:29,262 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:52:29,262 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:52:29,262 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:52:29,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:52:29,271 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:52:29,495 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-31 08:52:29,495 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:52:29,495 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:52:29,495 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 08:52:29,496 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 08:52:29,496 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:52:29,496 INFO L87 Difference]: Start difference. First operand 112 states and 115 transitions. Second operand 5 states. [2018-01-31 08:52:29,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:52:29,534 INFO L93 Difference]: Finished difference Result 122 states and 124 transitions. [2018-01-31 08:52:29,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:52:29,534 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-01-31 08:52:29,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:52:29,535 INFO L225 Difference]: With dead ends: 122 [2018-01-31 08:52:29,535 INFO L226 Difference]: Without dead ends: 116 [2018-01-31 08:52:29,535 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:52:29,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-31 08:52:29,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2018-01-31 08:52:29,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-31 08:52:29,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2018-01-31 08:52:29,548 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 69 [2018-01-31 08:52:29,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:52:29,548 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2018-01-31 08:52:29,548 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 08:52:29,548 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2018-01-31 08:52:29,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-01-31 08:52:29,548 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:52:29,549 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:52:29,549 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-01-31 08:52:29,549 INFO L82 PathProgramCache]: Analyzing trace with hash 433831978, now seen corresponding path program 1 times [2018-01-31 08:52:29,549 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:52:29,549 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:52:29,550 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:52:29,550 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:52:29,550 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:52:29,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:52:29,568 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:52:30,406 WARN L146 SmtUtils]: Spent 444ms on a formula simplification. DAG size of input: 21 DAG size of output 14 [2018-01-31 08:52:30,792 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:52:30,792 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:52:30,792 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:52:30,799 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:52:30,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:52:30,829 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:52:30,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:52:30,832 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:52:30,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:52:30,833 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-31 08:52:30,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-31 08:52:30,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-31 08:52:30,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:52:31,018 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:52:31,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:52:31,036 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:28 [2018-01-31 08:52:31,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2018-01-31 08:52:31,161 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:52:31,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-01-31 08:52:31,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:52:31,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:52:31,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:52:31,174 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:27 [2018-01-31 08:52:31,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-01-31 08:52:31,206 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:52:31,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-31 08:52:31,209 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-01-31 08:52:35,809 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:52:35,810 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:52:35,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 10 [2018-01-31 08:52:35,810 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:52:35,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:52:35,814 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2018-01-31 08:52:35,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-01-31 08:52:35,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2018-01-31 08:52:35,922 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:52:35,925 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:52:35,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:52:35,928 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:14 [2018-01-31 08:52:35,958 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:52:35,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 12 treesize of output 21 [2018-01-31 08:52:35,959 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:52:35,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 08:52:35,964 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:15 [2018-01-31 08:52:36,080 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:52:36,099 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:52:36,099 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 38 [2018-01-31 08:52:36,100 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-01-31 08:52:36,100 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-01-31 08:52:36,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1375, Unknown=5, NotChecked=0, Total=1482 [2018-01-31 08:52:36,100 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 39 states. [2018-01-31 08:52:42,595 WARN L146 SmtUtils]: Spent 2018ms on a formula simplification. DAG size of input: 38 DAG size of output 24 [2018-01-31 08:53:00,200 WARN L143 SmtUtils]: Spent 165ms on a formula simplification that was a NOOP. DAG size: 34 [2018-01-31 08:53:00,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:53:00,988 INFO L93 Difference]: Finished difference Result 121 states and 124 transitions. [2018-01-31 08:53:00,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-31 08:53:00,989 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 72 [2018-01-31 08:53:00,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:53:00,990 INFO L225 Difference]: With dead ends: 121 [2018-01-31 08:53:00,990 INFO L226 Difference]: Without dead ends: 120 [2018-01-31 08:53:00,991 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1038 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=356, Invalid=4327, Unknown=9, NotChecked=0, Total=4692 [2018-01-31 08:53:00,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-31 08:53:01,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 116. [2018-01-31 08:53:01,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-31 08:53:01,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 120 transitions. [2018-01-31 08:53:01,003 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 120 transitions. Word has length 72 [2018-01-31 08:53:01,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:53:01,004 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 120 transitions. [2018-01-31 08:53:01,004 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-01-31 08:53:01,004 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 120 transitions. [2018-01-31 08:53:01,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-01-31 08:53:01,005 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:53:01,005 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:53:01,005 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-01-31 08:53:01,005 INFO L82 PathProgramCache]: Analyzing trace with hash 433831979, now seen corresponding path program 1 times [2018-01-31 08:53:01,005 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:53:01,005 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:53:01,007 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:53:01,007 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:53:01,007 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:53:01,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:53:01,019 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:53:01,608 WARN L146 SmtUtils]: Spent 152ms on a formula simplification. DAG size of input: 11 DAG size of output 10 [2018-01-31 08:53:01,948 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-31 08:53:01,949 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:53:01,949 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 08:53:01,949 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 08:53:01,949 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 08:53:01,949 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:53:01,949 INFO L87 Difference]: Start difference. First operand 116 states and 120 transitions. Second operand 8 states. [2018-01-31 08:53:02,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:53:02,070 INFO L93 Difference]: Finished difference Result 116 states and 120 transitions. [2018-01-31 08:53:02,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 08:53:02,070 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 72 [2018-01-31 08:53:02,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:53:02,071 INFO L225 Difference]: With dead ends: 116 [2018-01-31 08:53:02,071 INFO L226 Difference]: Without dead ends: 115 [2018-01-31 08:53:02,072 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-01-31 08:53:02,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-01-31 08:53:02,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-01-31 08:53:02,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-01-31 08:53:02,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 118 transitions. [2018-01-31 08:53:02,086 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 118 transitions. Word has length 72 [2018-01-31 08:53:02,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:53:02,089 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 118 transitions. [2018-01-31 08:53:02,089 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 08:53:02,089 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 118 transitions. [2018-01-31 08:53:02,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-01-31 08:53:02,090 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:53:02,090 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:53:02,090 INFO L371 AbstractCegarLoop]: === Iteration 37 === [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-01-31 08:53:02,090 INFO L82 PathProgramCache]: Analyzing trace with hash 563889463, now seen corresponding path program 1 times [2018-01-31 08:53:02,090 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:53:02,091 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:53:02,091 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:53:02,091 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:53:02,092 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:53:02,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:53:02,117 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:53:02,609 WARN L146 SmtUtils]: Spent 216ms on a formula simplification. DAG size of input: 17 DAG size of output 7 [2018-01-31 08:53:02,791 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 20 DAG size of output 17 [2018-01-31 08:53:03,288 WARN L146 SmtUtils]: Spent 345ms on a formula simplification. DAG size of input: 27 DAG size of output 16 [2018-01-31 08:53:03,690 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:53:03,691 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:53:03,691 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:53:03,701 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:53:03,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:53:03,732 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:53:03,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:53:03,740 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:53:03,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:53:03,743 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:10 [2018-01-31 08:53:03,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-31 08:53:03,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-31 08:53:03,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:53:03,826 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:53:03,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:53:03,836 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:28 [2018-01-31 08:53:04,096 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:53:04,097 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:53:04,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 39 [2018-01-31 08:53:04,098 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:53:04,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 34 [2018-01-31 08:53:04,111 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:53:04,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 45 [2018-01-31 08:53:04,111 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:53:04,117 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:53:04,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:53:04,124 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:44, output treesize:45 [2018-01-31 08:53:04,417 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:53:04,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2018-01-31 08:53:04,418 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:53:04,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:53:04,424 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:60, output treesize:34 [2018-01-31 08:53:04,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2018-01-31 08:53:04,546 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:53:04,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2018-01-31 08:53:04,547 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 08:53:04,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 08:53:04,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 08:53:04,556 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:15 [2018-01-31 08:53:04,605 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:53:04,624 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:53:04,625 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 43 [2018-01-31 08:53:04,625 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-01-31 08:53:04,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-01-31 08:53:04,626 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1756, Unknown=8, NotChecked=0, Total=1892 [2018-01-31 08:53:04,626 INFO L87 Difference]: Start difference. First operand 115 states and 118 transitions. Second operand 44 states. [2018-01-31 08:53:05,750 WARN L146 SmtUtils]: Spent 394ms on a formula simplification. DAG size of input: 31 DAG size of output 27 [2018-01-31 08:53:06,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:53:06,603 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2018-01-31 08:53:06,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-01-31 08:53:06,604 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 73 [2018-01-31 08:53:06,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:53:06,605 INFO L225 Difference]: With dead ends: 118 [2018-01-31 08:53:06,605 INFO L226 Difference]: Without dead ends: 117 [2018-01-31 08:53:06,605 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 944 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=277, Invalid=3497, Unknown=8, NotChecked=0, Total=3782 [2018-01-31 08:53:06,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-01-31 08:53:06,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2018-01-31 08:53:06,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-31 08:53:06,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 120 transitions. [2018-01-31 08:53:06,615 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 120 transitions. Word has length 73 [2018-01-31 08:53:06,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:53:06,615 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 120 transitions. [2018-01-31 08:53:06,615 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-01-31 08:53:06,615 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 120 transitions. [2018-01-31 08:53:06,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-01-31 08:53:06,616 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:53:06,616 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:53:06,616 INFO L371 AbstractCegarLoop]: === Iteration 38 === [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-01-31 08:53:06,617 INFO L82 PathProgramCache]: Analyzing trace with hash 563889462, now seen corresponding path program 1 times [2018-01-31 08:53:06,617 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:53:06,617 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:53:06,618 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:53:06,618 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:53:06,618 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:53:06,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:53:06,628 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:53:07,010 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-31 08:53:07,010 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:53:07,010 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-31 08:53:07,010 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-31 08:53:07,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-31 08:53:07,011 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-01-31 08:53:07,011 INFO L87 Difference]: Start difference. First operand 116 states and 120 transitions. Second operand 15 states. [2018-01-31 08:53:07,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:53:07,200 INFO L93 Difference]: Finished difference Result 116 states and 120 transitions. [2018-01-31 08:53:07,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-31 08:53:07,200 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 73 [2018-01-31 08:53:07,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:53:07,201 INFO L225 Difference]: With dead ends: 116 [2018-01-31 08:53:07,201 INFO L226 Difference]: Without dead ends: 115 [2018-01-31 08:53:07,201 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-01-31 08:53:07,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-01-31 08:53:07,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-01-31 08:53:07,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-01-31 08:53:07,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 118 transitions. [2018-01-31 08:53:07,218 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 118 transitions. Word has length 73 [2018-01-31 08:53:07,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:53:07,218 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 118 transitions. [2018-01-31 08:53:07,218 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-31 08:53:07,218 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 118 transitions. [2018-01-31 08:53:07,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-01-31 08:53:07,219 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:53:07,219 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:53:07,219 INFO L371 AbstractCegarLoop]: === Iteration 39 === [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-01-31 08:53:07,219 INFO L82 PathProgramCache]: Analyzing trace with hash 441242382, now seen corresponding path program 1 times [2018-01-31 08:53:07,220 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:53:07,220 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:53:07,220 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:53:07,221 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:53:07,221 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:53:07,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:53:07,233 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:53:07,693 WARN L146 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 19 DAG size of output 10 [2018-01-31 08:53:07,962 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:53:07,963 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:53:07,963 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:53:07,969 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:53:08,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:53:08,021 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:53:08,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:53:08,025 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:53:08,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:53:08,026 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-31 08:53:08,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-31 08:53:08,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-31 08:53:08,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:53:08,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:53:08,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:53:08,087 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-01-31 08:53:08,283 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:53:08,284 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:53:08,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-31 08:53:08,285 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:53:08,299 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-01-31 08:53:08,302 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:53:08,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-01-31 08:53:08,304 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:53:08,309 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:53:08,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 08:53:08,317 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:49, output treesize:36 [2018-01-31 08:53:08,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-01-31 08:53:08,392 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:53:08,405 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-01-31 08:53:08,405 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:22 [2018-01-31 08:53:12,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-01-31 08:53:12,875 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:53:12,961 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-01-31 08:53:12,961 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:22 [2018-01-31 08:53:16,224 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-01-31 08:53:16,268 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:53:16,273 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-01-31 08:53:16,273 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:53:16,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:53:16,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:53:16,282 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:15 [2018-01-31 08:53:16,317 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:53:16,322 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-01-31 08:53:16,323 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-31 08:53:16,332 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-01-31 08:53:16,332 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:36 [2018-01-31 08:53:16,408 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:53:16,413 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:53:16,414 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 25 treesize of output 19 [2018-01-31 08:53:16,414 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:53:16,425 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-01-31 08:53:16,425 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:15 [2018-01-31 08:53:16,715 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-31 08:53:16,734 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:53:16,734 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21] total 34 [2018-01-31 08:53:16,734 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-01-31 08:53:16,735 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-01-31 08:53:16,735 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1077, Unknown=12, NotChecked=0, Total=1190 [2018-01-31 08:53:16,735 INFO L87 Difference]: Start difference. First operand 115 states and 118 transitions. Second operand 35 states. [2018-01-31 08:53:50,512 WARN L143 SmtUtils]: Spent 2005ms on a formula simplification that was a NOOP. DAG size: 27 [2018-01-31 08:53:50,725 WARN L143 SmtUtils]: Spent 134ms on a formula simplification that was a NOOP. DAG size: 32 [2018-01-31 08:53:52,882 WARN L143 SmtUtils]: Spent 2011ms on a formula simplification that was a NOOP. DAG size: 37 [2018-01-31 08:53:53,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:53:53,061 INFO L93 Difference]: Finished difference Result 116 states and 119 transitions. [2018-01-31 08:53:53,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-31 08:53:53,061 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 77 [2018-01-31 08:53:53,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:53:53,062 INFO L225 Difference]: With dead ends: 116 [2018-01-31 08:53:53,062 INFO L226 Difference]: Without dead ends: 115 [2018-01-31 08:53:53,063 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 59 SyntacticMatches, 5 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 745 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=274, Invalid=2786, Unknown=20, NotChecked=0, Total=3080 [2018-01-31 08:53:53,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-01-31 08:53:53,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2018-01-31 08:53:53,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-31 08:53:53,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 117 transitions. [2018-01-31 08:53:53,075 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 117 transitions. Word has length 77 [2018-01-31 08:53:53,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:53:53,075 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 117 transitions. [2018-01-31 08:53:53,075 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-01-31 08:53:53,075 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 117 transitions. [2018-01-31 08:53:53,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-01-31 08:53:53,076 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:53:53,076 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:53:53,076 INFO L371 AbstractCegarLoop]: === Iteration 40 === [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-01-31 08:53:53,076 INFO L82 PathProgramCache]: Analyzing trace with hash 793611929, now seen corresponding path program 1 times [2018-01-31 08:53:53,076 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:53:53,077 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:53:53,077 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:53:53,078 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:53:53,078 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:53:53,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-31 08:53:53,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-31 08:53:53,152 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-01-31 08:53:53,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 08:53:53 BoogieIcfgContainer [2018-01-31 08:53:53,222 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-31 08:53:53,223 INFO L168 Benchmark]: Toolchain (without parser) took 137224.84 ms. Allocated memory was 303.6 MB in the beginning and 699.4 MB in the end (delta: 395.8 MB). Free memory was 262.3 MB in the beginning and 502.7 MB in the end (delta: -240.4 MB). Peak memory consumption was 155.4 MB. Max. memory is 5.3 GB. [2018-01-31 08:53:53,224 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 303.6 MB. Free memory is still 268.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 08:53:53,226 INFO L168 Benchmark]: CACSL2BoogieTranslator took 302.62 ms. Allocated memory is still 303.6 MB. Free memory was 262.3 MB in the beginning and 248.3 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:53:53,227 INFO L168 Benchmark]: Boogie Preprocessor took 38.90 ms. Allocated memory is still 303.6 MB. Free memory was 248.3 MB in the beginning and 246.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:53:53,227 INFO L168 Benchmark]: RCFGBuilder took 700.15 ms. Allocated memory is still 303.6 MB. Free memory was 246.4 MB in the beginning and 221.4 MB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:53:53,227 INFO L168 Benchmark]: TraceAbstraction took 136169.25 ms. Allocated memory was 303.6 MB in the beginning and 699.4 MB in the end (delta: 395.8 MB). Free memory was 219.4 MB in the beginning and 502.7 MB in the end (delta: -283.4 MB). Peak memory consumption was 112.5 MB. Max. memory is 5.3 GB. [2018-01-31 08:53:53,228 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.10 ms. Allocated memory is still 303.6 MB. Free memory is still 268.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 302.62 ms. Allocated memory is still 303.6 MB. Free memory was 262.3 MB in the beginning and 248.3 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.90 ms. Allocated memory is still 303.6 MB. Free memory was 248.3 MB in the beginning and 246.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 700.15 ms. Allocated memory is still 303.6 MB. Free memory was 246.4 MB in the beginning and 221.4 MB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 136169.25 ms. Allocated memory was 303.6 MB in the beginning and 699.4 MB in the end (delta: 395.8 MB). Free memory was 219.4 MB in the beginning and 502.7 MB in the end (delta: -283.4 MB). Peak memory consumption was 112.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L1492] CALL entry_point() [L1483] FCALL struct A19 a19; VAL [a19={13:0}] [L1484] CALL, EXPR probe_unsafe_19(&a19) VAL [a={13:0}] [L1455] int ret = - -3; VAL [a={13:0}, a={13:0}, ret=3] [L1457] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(size)=4] [L1073] COND TRUE __VERIFIER_nondet_int() VAL [\old(size)=4, __VERIFIER_nondet_int()=1, size=4] [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=4, malloc(size)={11:0}, size=4] [L1074] RET return malloc(size); VAL [\old(size)=4, \result={11:0}, malloc(size)={11:0}, size=4] [L1457] EXPR ldv_malloc(sizeof(int)) VAL [a={13:0}, a={13:0}, ldv_malloc(sizeof(int))={11:0}, ret=3] [L1457] FCALL a->q = (int *)ldv_malloc(sizeof(int)) VAL [a={13:0}, a={13:0}, ldv_malloc(sizeof(int))={11:0}, ret=3] [L1458] EXPR, FCALL a->q VAL [a={13:0}, a={13:0}, a->q={11:0}, ret=3] [L1458] COND FALSE !(!a->q) VAL [a={13:0}, a={13:0}, a->q={11:0}, ret=3] [L1460] CALL, EXPR f19(a) VAL [a={13:0}] [L1440] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(size)=4] [L1073] COND TRUE __VERIFIER_nondet_int() VAL [\old(size)=4, __VERIFIER_nondet_int()=1, size=4] [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=4, malloc(size)={10:0}, size=4] [L1074] RET return malloc(size); VAL [\old(size)=4, \result={10:0}, malloc(size)={10:0}, size=4] [L1440] EXPR ldv_malloc(sizeof(int)) VAL [a={13:0}, a={13:0}, ldv_malloc(sizeof(int))={10:0}] [L1440] FCALL a->p = (int *)ldv_malloc(sizeof(int)) VAL [a={13:0}, a={13:0}, ldv_malloc(sizeof(int))={10:0}] [L1441] FCALL a->p VAL [a={13:0}, a={13:0}, a->p={10:0}] [L1441] COND TRUE a->p VAL [a={13:0}, a={13:0}, a->p={10:0}] [L1442] RET return 0; VAL [\result=0, a={13:0}, a={13:0}] [L1460] EXPR f19(a) VAL [a={13:0}, a={13:0}, f19(a)=0, ret=3] [L1460] ret = f19(a) VAL [a={13:0}, a={13:0}, f19(a)=0, ret=0] [L1461] COND FALSE !(\read(ret)) VAL [a={13:0}, a={13:0}, ret=0] [L1464] CALL, EXPR g19() [L1451] RET return __VERIFIER_nondet_int(); VAL [\result=0, __VERIFIER_nondet_int()=0] [L1464] EXPR g19() VAL [a={13:0}, a={13:0}, g19()=0, ret=0] [L1464] COND TRUE !g19() VAL [a={13:0}, a={13:0}, g19()=0, ret=0] [L1470] CALL f19_undo(a) VAL [a={13:0}] [L1447] EXPR, FCALL a->p VAL [a={13:0}, a={13:0}, a->p={10:0}] [L1447] RET, FCALL free(a->p) VAL [a={13:0}, a={13:0}, a->p={10:0}] [L1470] f19_undo(a) VAL [a={13:0}, a={13:0}, ret=0] [L1472] EXPR, FCALL a->q VAL [a={13:0}, a={13:0}, a->q={11:0}, ret=0] [L1472] FCALL free(a->q) VAL [a={13:0}, a={13:0}, a->q={11:0}, ret=0] [L1474] RET return ret; VAL [\result=0, a={13:0}, a={13:0}, ret=0] [L1484] EXPR probe_unsafe_19(&a19) VAL [a19={13:0}, probe_unsafe_19(&a19)=0] [L1484] int ret = probe_unsafe_19(&a19); VAL [a19={13:0}, probe_unsafe_19(&a19)=0, ret=0] [L1486] COND TRUE ret==0 VAL [a19={13:0}, ret=0] [L1487] CALL disconnect_19(&a19) VAL [a={13:0}] [L1478] EXPR, FCALL a->q VAL [a={13:0}, a={13:0}, a->q={11:0}] [L1478] FCALL free(a->q) VAL [a={13:0}, a={13:0}, a->q={11:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 110 locations, 21 error locations. UNSAFE Result, 136.1s OverallTime, 40 OverallIterations, 2 TraceHistogramMax, 92.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3393 SDtfs, 3721 SDslu, 18555 SDs, 0 SdLazy, 15385 SolverSat, 897 SolverUnsat, 152 SolverUnknown, 0 SolverNotchecked, 63.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1320 GetRequests, 550 SyntacticMatches, 37 SemanticMatches, 733 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 5834 ImplicationChecksByTransitivity, 62.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=140occurred 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.5s AutomataMinimizationTime, 39 MinimizatonAttempts, 562 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 41.0s InterpolantComputationTime, 2712 NumberOfCodeBlocks, 2712 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 2585 ConstructedInterpolants, 151 QuantifiedInterpolants, 1470797 SizeOfPredicates, 118 NumberOfNonLiveVariables, 2170 ConjunctsInSsa, 392 ConjunctsInUnsatCore, 49 InterpolantComputations, 34 PerfectInterpolantSequences, 221/284 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test19_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-31_08-53-53-237.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test19_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-31_08-53-53-237.csv Received shutdown request...