java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test6_2_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 19:01:04,311 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 19:01:04,312 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 19:01:04,324 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 19:01:04,324 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 19:01:04,325 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 19:01:04,326 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 19:01:04,327 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 19:01:04,329 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 19:01:04,329 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 19:01:04,330 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 19:01:04,330 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 19:01:04,331 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 19:01:04,332 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 19:01:04,333 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 19:01:04,334 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 19:01:04,336 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 19:01:04,337 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 19:01:04,338 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 19:01:04,339 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 19:01:04,341 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 19:01:04,341 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 19:01:04,341 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 19:01:04,342 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 19:01:04,343 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 19:01:04,344 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 19:01:04,344 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 19:01:04,344 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 19:01:04,344 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 19:01:04,344 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 19:01:04,345 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 19:01:04,345 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-04 19:01:04,354 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 19:01:04,354 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 19:01:04,355 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 19:01:04,355 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 19:01:04,355 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 19:01:04,355 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 19:01:04,355 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 19:01:04,355 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 19:01:04,355 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 19:01:04,356 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 19:01:04,356 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 19:01:04,356 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 19:01:04,356 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 19:01:04,356 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 19:01:04,356 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 19:01:04,356 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 19:01:04,356 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 19:01:04,356 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 19:01:04,356 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 19:01:04,356 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 19:01:04,357 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 19:01:04,357 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 19:01:04,357 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 19:01:04,357 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 19:01:04,382 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 19:01:04,389 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 19:01:04,392 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 19:01:04,393 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 19:01:04,393 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 19:01:04,393 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test6_2_false-valid-free.i [2018-02-04 19:01:04,518 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 19:01:04,519 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 19:01:04,520 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 19:01:04,520 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 19:01:04,524 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 19:01:04,524 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 07:01:04" (1/1) ... [2018-02-04 19:01:04,526 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f13972f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:01:04, skipping insertion in model container [2018-02-04 19:01:04,527 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 07:01:04" (1/1) ... [2018-02-04 19:01:04,536 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 19:01:04,570 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 19:01:04,665 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 19:01:04,678 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 19:01:04,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:01:04 WrapperNode [2018-02-04 19:01:04,684 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 19:01:04,684 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 19:01:04,684 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 19:01:04,684 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 19:01:04,693 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:01:04" (1/1) ... [2018-02-04 19:01:04,693 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:01:04" (1/1) ... [2018-02-04 19:01:04,700 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:01:04" (1/1) ... [2018-02-04 19:01:04,700 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:01:04" (1/1) ... [2018-02-04 19:01:04,703 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:01:04" (1/1) ... [2018-02-04 19:01:04,705 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:01:04" (1/1) ... [2018-02-04 19:01:04,705 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:01:04" (1/1) ... [2018-02-04 19:01:04,706 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 19:01:04,707 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 19:01:04,707 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 19:01:04,707 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 19:01:04,708 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:01:04" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 19:01:04,742 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 19:01:04,742 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 19:01:04,742 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 19:01:04,742 INFO L136 BoogieDeclarations]: Found implementation of procedure f6 [2018-02-04 19:01:04,742 INFO L136 BoogieDeclarations]: Found implementation of procedure g6 [2018-02-04 19:01:04,742 INFO L136 BoogieDeclarations]: Found implementation of procedure probe3_6 [2018-02-04 19:01:04,743 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_6 [2018-02-04 19:01:04,743 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 19:01:04,743 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 19:01:04,743 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 19:01:04,743 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 19:01:04,743 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 19:01:04,743 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 19:01:04,743 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 19:01:04,743 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 19:01:04,743 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 19:01:04,743 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 19:01:04,743 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 19:01:04,743 INFO L128 BoogieDeclarations]: Found specification of procedure f6 [2018-02-04 19:01:04,744 INFO L128 BoogieDeclarations]: Found specification of procedure g6 [2018-02-04 19:01:04,744 INFO L128 BoogieDeclarations]: Found specification of procedure probe3_6 [2018-02-04 19:01:04,744 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_6 [2018-02-04 19:01:04,744 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 19:01:04,744 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 19:01:04,744 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 19:01:04,744 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 19:01:04,888 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 19:01:04,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 07:01:04 BoogieIcfgContainer [2018-02-04 19:01:04,888 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 19:01:04,889 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 19:01:04,889 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 19:01:04,891 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 19:01:04,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 07:01:04" (1/3) ... [2018-02-04 19:01:04,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47e847ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 07:01:04, skipping insertion in model container [2018-02-04 19:01:04,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:01:04" (2/3) ... [2018-02-04 19:01:04,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47e847ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 07:01:04, skipping insertion in model container [2018-02-04 19:01:04,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 07:01:04" (3/3) ... [2018-02-04 19:01:04,893 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test6_2_false-valid-free.i [2018-02-04 19:01:04,899 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 19:01:04,904 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-02-04 19:01:04,934 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 19:01:04,934 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 19:01:04,934 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 19:01:04,934 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 19:01:04,934 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 19:01:04,935 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 19:01:04,935 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 19:01:04,935 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 19:01:04,936 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 19:01:04,948 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states. [2018-02-04 19:01:04,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 19:01:04,955 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:01:04,956 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 19:01:04,956 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 19:01:04,960 INFO L82 PathProgramCache]: Analyzing trace with hash 3351521, now seen corresponding path program 1 times [2018-02-04 19:01:04,962 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:01:04,962 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:01:05,011 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:01:05,012 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:01:05,012 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:01:05,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:01:05,049 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:01:05,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:01:05,092 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:01:05,093 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 19:01:05,094 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 19:01:05,105 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 19:01:05,106 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 19:01:05,108 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 3 states. [2018-02-04 19:01:05,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:01:05,214 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2018-02-04 19:01:05,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 19:01:05,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-04 19:01:05,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:01:05,274 INFO L225 Difference]: With dead ends: 82 [2018-02-04 19:01:05,274 INFO L226 Difference]: Without dead ends: 79 [2018-02-04 19:01:05,275 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 19:01:05,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-02-04 19:01:05,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 70. [2018-02-04 19:01:05,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-04 19:01:05,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-02-04 19:01:05,307 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 4 [2018-02-04 19:01:05,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:01:05,307 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-02-04 19:01:05,307 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 19:01:05,307 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-02-04 19:01:05,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 19:01:05,308 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:01:05,308 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 19:01:05,308 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 19:01:05,308 INFO L82 PathProgramCache]: Analyzing trace with hash 3351522, now seen corresponding path program 1 times [2018-02-04 19:01:05,308 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:01:05,308 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:01:05,310 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:01:05,310 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:01:05,310 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:01:05,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:01:05,320 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:01:05,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:01:05,354 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:01:05,354 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 19:01:05,355 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 19:01:05,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 19:01:05,356 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 19:01:05,356 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 3 states. [2018-02-04 19:01:05,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:01:05,411 INFO L93 Difference]: Finished difference Result 122 states and 132 transitions. [2018-02-04 19:01:05,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 19:01:05,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-04 19:01:05,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:01:05,413 INFO L225 Difference]: With dead ends: 122 [2018-02-04 19:01:05,413 INFO L226 Difference]: Without dead ends: 122 [2018-02-04 19:01:05,414 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 19:01:05,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-02-04 19:01:05,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 107. [2018-02-04 19:01:05,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-02-04 19:01:05,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 129 transitions. [2018-02-04 19:01:05,422 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 129 transitions. Word has length 4 [2018-02-04 19:01:05,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:01:05,422 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 129 transitions. [2018-02-04 19:01:05,422 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 19:01:05,422 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 129 transitions. [2018-02-04 19:01:05,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 19:01:05,423 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:01:05,423 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] [2018-02-04 19:01:05,423 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 19:01:05,424 INFO L82 PathProgramCache]: Analyzing trace with hash 312821243, now seen corresponding path program 1 times [2018-02-04 19:01:05,424 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:01:05,424 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:01:05,425 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:01:05,425 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:01:05,425 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:01:05,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:01:05,441 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:01:05,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:01:05,508 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:01:05,508 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:01:05,508 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:01:05,508 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:01:05,509 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:01:05,509 INFO L87 Difference]: Start difference. First operand 107 states and 129 transitions. Second operand 6 states. [2018-02-04 19:01:05,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:01:05,663 INFO L93 Difference]: Finished difference Result 128 states and 147 transitions. [2018-02-04 19:01:05,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 19:01:05,663 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-04 19:01:05,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:01:05,664 INFO L225 Difference]: With dead ends: 128 [2018-02-04 19:01:05,664 INFO L226 Difference]: Without dead ends: 124 [2018-02-04 19:01:05,665 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-02-04 19:01:05,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-04 19:01:05,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 112. [2018-02-04 19:01:05,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-04 19:01:05,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 137 transitions. [2018-02-04 19:01:05,674 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 137 transitions. Word has length 24 [2018-02-04 19:01:05,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:01:05,674 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 137 transitions. [2018-02-04 19:01:05,674 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:01:05,674 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 137 transitions. [2018-02-04 19:01:05,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 19:01:05,675 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:01:05,675 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] [2018-02-04 19:01:05,675 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 19:01:05,675 INFO L82 PathProgramCache]: Analyzing trace with hash 312821244, now seen corresponding path program 1 times [2018-02-04 19:01:05,675 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:01:05,675 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:01:05,677 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:01:05,677 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:01:05,677 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:01:05,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:01:05,693 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:01:05,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:01:05,732 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:01:05,732 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 19:01:05,733 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:01:05,733 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:01:05,733 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:01:05,733 INFO L87 Difference]: Start difference. First operand 112 states and 137 transitions. Second operand 6 states. [2018-02-04 19:01:05,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:01:05,760 INFO L93 Difference]: Finished difference Result 109 states and 127 transitions. [2018-02-04 19:01:05,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:01:05,760 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-04 19:01:05,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:01:05,761 INFO L225 Difference]: With dead ends: 109 [2018-02-04 19:01:05,761 INFO L226 Difference]: Without dead ends: 105 [2018-02-04 19:01:05,761 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 19:01:05,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-04 19:01:05,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 102. [2018-02-04 19:01:05,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-02-04 19:01:05,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 121 transitions. [2018-02-04 19:01:05,767 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 121 transitions. Word has length 24 [2018-02-04 19:01:05,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:01:05,768 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 121 transitions. [2018-02-04 19:01:05,768 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:01:05,768 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 121 transitions. [2018-02-04 19:01:05,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 19:01:05,768 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:01:05,768 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] [2018-02-04 19:01:05,769 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 19:01:05,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1854259380, now seen corresponding path program 1 times [2018-02-04 19:01:05,769 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:01:05,769 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:01:05,770 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:01:05,770 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:01:05,770 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:01:05,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:01:05,781 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:01:05,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:01:05,819 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:01:05,819 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:01:05,819 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 19:01:05,819 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 19:01:05,819 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:01:05,819 INFO L87 Difference]: Start difference. First operand 102 states and 121 transitions. Second operand 5 states. [2018-02-04 19:01:05,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:01:05,833 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-02-04 19:01:05,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 19:01:05,833 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-02-04 19:01:05,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:01:05,834 INFO L225 Difference]: With dead ends: 73 [2018-02-04 19:01:05,834 INFO L226 Difference]: Without dead ends: 69 [2018-02-04 19:01:05,834 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:01:05,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-04 19:01:05,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-02-04 19:01:05,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-04 19:01:05,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-02-04 19:01:05,838 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 24 [2018-02-04 19:01:05,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:01:05,838 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-02-04 19:01:05,838 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 19:01:05,838 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-02-04 19:01:05,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 19:01:05,839 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:01:05,839 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] [2018-02-04 19:01:05,839 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 19:01:05,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1628417000, now seen corresponding path program 1 times [2018-02-04 19:01:05,839 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:01:05,840 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:01:05,840 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:01:05,841 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:01:05,841 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:01:05,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:01:05,852 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:01:05,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:01:05,885 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:01:05,885 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 19:01:05,885 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:01:05,885 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:01:05,886 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:01:05,886 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 6 states. [2018-02-04 19:01:05,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:01:05,904 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2018-02-04 19:01:05,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:01:05,904 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-04 19:01:05,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:01:05,905 INFO L225 Difference]: With dead ends: 64 [2018-02-04 19:01:05,905 INFO L226 Difference]: Without dead ends: 64 [2018-02-04 19:01:05,905 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 19:01:05,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-04 19:01:05,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-02-04 19:01:05,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-04 19:01:05,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2018-02-04 19:01:05,907 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 24 [2018-02-04 19:01:05,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:01:05,907 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2018-02-04 19:01:05,908 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:01:05,908 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2018-02-04 19:01:05,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 19:01:05,908 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:01:05,908 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:01:05,908 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 19:01:05,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1212961130, now seen corresponding path program 1 times [2018-02-04 19:01:05,908 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:01:05,908 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:01:05,909 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:01:05,909 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:01:05,909 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:01:05,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:01:05,924 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:01:05,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:01:05,966 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:01:05,966 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:01:05,966 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:01:05,967 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:01:05,967 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:01:05,967 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 6 states. [2018-02-04 19:01:05,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:01:05,989 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-02-04 19:01:05,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:01:05,990 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-04 19:01:05,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:01:05,990 INFO L225 Difference]: With dead ends: 62 [2018-02-04 19:01:05,991 INFO L226 Difference]: Without dead ends: 62 [2018-02-04 19:01:05,991 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 19:01:05,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-02-04 19:01:05,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-02-04 19:01:05,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 19:01:05,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2018-02-04 19:01:05,994 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 26 [2018-02-04 19:01:05,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:01:05,994 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2018-02-04 19:01:05,994 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:01:05,994 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2018-02-04 19:01:05,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 19:01:05,995 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:01:05,995 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:01:05,995 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 19:01:05,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1212961129, now seen corresponding path program 1 times [2018-02-04 19:01:05,995 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:01:05,995 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:01:05,996 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:01:05,996 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:01:05,996 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:01:06,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:01:06,006 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:01:06,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:01:06,038 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:01:06,039 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:01:06,039 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:01:06,039 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:01:06,039 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:01:06,039 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 6 states. [2018-02-04 19:01:06,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:01:06,102 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-02-04 19:01:06,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:01:06,102 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-04 19:01:06,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:01:06,103 INFO L225 Difference]: With dead ends: 60 [2018-02-04 19:01:06,103 INFO L226 Difference]: Without dead ends: 60 [2018-02-04 19:01:06,103 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 19:01:06,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-04 19:01:06,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-02-04 19:01:06,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 19:01:06,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-02-04 19:01:06,106 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 26 [2018-02-04 19:01:06,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:01:06,107 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-02-04 19:01:06,107 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:01:06,107 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-02-04 19:01:06,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 19:01:06,107 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:01:06,108 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] [2018-02-04 19:01:06,108 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 19:01:06,108 INFO L82 PathProgramCache]: Analyzing trace with hash -903148600, now seen corresponding path program 1 times [2018-02-04 19:01:06,108 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:01:06,108 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:01:06,109 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:01:06,109 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:01:06,109 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:01:06,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:01:06,122 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:01:06,127 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:01:06,127 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:01:06,127 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:01:06,128 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:01:06,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:01:06,180 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:01:06,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 19:01:06,207 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:01:06,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:01:06,220 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 19:01:06,260 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:01:06,261 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:01:06,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-04 19:01:06,264 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:01:06,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:01:06,269 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-02-04 19:01:06,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:01:06,376 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:01:06,377 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 19:01:06,377 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 19:01:06,377 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 19:01:06,377 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 19:01:06,377 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 9 states. [2018-02-04 19:01:06,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:01:06,788 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2018-02-04 19:01:06,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 19:01:06,788 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-02-04 19:01:06,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:01:06,789 INFO L225 Difference]: With dead ends: 59 [2018-02-04 19:01:06,789 INFO L226 Difference]: Without dead ends: 59 [2018-02-04 19:01:06,789 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-02-04 19:01:06,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-04 19:01:06,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-02-04 19:01:06,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-02-04 19:01:06,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-02-04 19:01:06,791 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 32 [2018-02-04 19:01:06,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:01:06,792 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-02-04 19:01:06,792 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 19:01:06,792 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-02-04 19:01:06,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 19:01:06,792 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:01:06,792 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] [2018-02-04 19:01:06,792 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 19:01:06,793 INFO L82 PathProgramCache]: Analyzing trace with hash -903148599, now seen corresponding path program 1 times [2018-02-04 19:01:06,793 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:01:06,793 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:01:06,793 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:01:06,793 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:01:06,793 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:01:06,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:01:06,804 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:01:06,810 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:01:06,811 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:01:06,811 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:01:06,812 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:01:06,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:01:06,836 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:01:06,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 19:01:06,840 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:01:06,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 19:01:06,846 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:01:06,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:01:06,849 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 19:01:06,923 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:01:06,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2018-02-04 19:01:06,925 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:01:06,950 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:01:06,951 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:01:06,952 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 31 treesize of output 25 [2018-02-04 19:01:06,952 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:01:06,984 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:01:06,991 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:01:06,992 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 34 treesize of output 47 [2018-02-04 19:01:06,993 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:01:07,019 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:01:07,020 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:01:07,020 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 33 treesize of output 27 [2018-02-04 19:01:07,021 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:01:07,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 19:01:07,039 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:67, output treesize:49 [2018-02-04 19:01:11,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:01:11,323 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:01:11,323 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 19:01:11,323 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 19:01:11,323 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 19:01:11,323 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=53, Unknown=3, NotChecked=0, Total=72 [2018-02-04 19:01:11,323 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 9 states. [2018-02-04 19:01:39,332 WARN L146 SmtUtils]: Spent 20162ms on a formula simplification. DAG size of input: 60 DAG size of output 55 [2018-02-04 19:01:51,710 WARN L143 SmtUtils]: Spent 12362ms on a formula simplification that was a NOOP. DAG size: 59 [2018-02-04 19:01:58,863 WARN L146 SmtUtils]: Spent 6092ms on a formula simplification. DAG size of input: 47 DAG size of output 42 [2018-02-04 19:02:11,236 WARN L143 SmtUtils]: Spent 12331ms on a formula simplification that was a NOOP. DAG size: 50 [2018-02-04 19:02:19,594 WARN L143 SmtUtils]: Spent 8325ms on a formula simplification that was a NOOP. DAG size: 51 [2018-02-04 19:02:44,906 WARN L146 SmtUtils]: Spent 24181ms on a formula simplification. DAG size of input: 61 DAG size of output 61 [2018-02-04 19:02:44,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:02:44,972 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2018-02-04 19:02:44,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 19:02:44,972 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-02-04 19:02:44,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:02:44,973 INFO L225 Difference]: With dead ends: 58 [2018-02-04 19:02:44,973 INFO L226 Difference]: Without dead ends: 58 [2018-02-04 19:02:44,973 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 91.4s TimeCoverageRelationStatistics Valid=81, Invalid=247, Unknown=14, NotChecked=0, Total=342 [2018-02-04 19:02:44,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-04 19:02:44,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-02-04 19:02:44,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-04 19:02:44,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2018-02-04 19:02:44,976 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 32 [2018-02-04 19:02:44,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:02:44,976 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-02-04 19:02:44,976 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 19:02:44,977 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-02-04 19:02:44,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 19:02:44,977 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:02:44,977 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] [2018-02-04 19:02:44,978 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 19:02:44,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1666277088, now seen corresponding path program 1 times [2018-02-04 19:02:44,978 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:02:44,978 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:02:44,979 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:02:44,979 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:02:44,979 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:02:44,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:02:44,989 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:02:44,992 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:02:44,993 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:02:44,993 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:02:44,993 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:02:45,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:02:45,009 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:02:45,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 19:02:45,015 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:02:45,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:02:45,017 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 19:02:45,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 19:02:45,021 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:02:45,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:02:45,022 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2018-02-04 19:02:45,069 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:02:45,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 13 [2018-02-04 19:02:45,070 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:02:45,077 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:02:45,077 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2018-02-04 19:02:45,078 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:02:45,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 19:02:45,082 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:16 [2018-02-04 19:02:45,104 WARN L1033 $PredicateComparison]: unable to prove that (exists ((probe3_6_~p~0.base Int)) (and (not (= 0 probe3_6_~p~0.base)) (= |c_#valid| (store |c_old(#valid)| probe3_6_~p~0.base 0)) (<= (select |c_old(#valid)| probe3_6_~p~0.base) 0))) is different from true [2018-02-04 19:02:45,108 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:02:45,108 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:02:45,109 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:02:45,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 30 [2018-02-04 19:02:45,110 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:02:45,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:02:45,115 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:15 [2018-02-04 19:02:45,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:02:45,130 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:02:45,130 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 19:02:45,130 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 19:02:45,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 19:02:45,131 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=83, Unknown=1, NotChecked=18, Total=132 [2018-02-04 19:02:45,131 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 12 states. [2018-02-04 19:02:45,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:02:45,305 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-02-04 19:02:45,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 19:02:45,306 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2018-02-04 19:02:45,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:02:45,306 INFO L225 Difference]: With dead ends: 76 [2018-02-04 19:02:45,306 INFO L226 Difference]: Without dead ends: 76 [2018-02-04 19:02:45,307 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=268, Unknown=1, NotChecked=34, Total=380 [2018-02-04 19:02:45,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-04 19:02:45,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 63. [2018-02-04 19:02:45,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-04 19:02:45,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2018-02-04 19:02:45,311 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 32 [2018-02-04 19:02:45,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:02:45,311 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-02-04 19:02:45,311 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 19:02:45,311 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-02-04 19:02:45,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 19:02:45,311 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:02:45,311 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] [2018-02-04 19:02:45,311 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 19:02:45,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1666277087, now seen corresponding path program 1 times [2018-02-04 19:02:45,311 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:02:45,312 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:02:45,312 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:02:45,312 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:02:45,312 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:02:45,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:02:45,320 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:02:45,325 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:02:45,325 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:02:45,325 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:02:45,326 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:02:45,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:02:45,342 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:02:45,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 19:02:45,346 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:02:45,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 19:02:45,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:02:45,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:02:45,357 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 19:02:45,368 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 5 treesize of output 1 [2018-02-04 19:02:45,369 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:02:45,376 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 5 treesize of output 1 [2018-02-04 19:02:45,377 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:02:45,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:02:45,382 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:10 [2018-02-04 19:02:45,428 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-02-04 19:02:45,428 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:02:45,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-02-04 19:02:45,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:02:45,460 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 17 treesize of output 16 [2018-02-04 19:02:45,460 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:02:45,480 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-02-04 19:02:45,481 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:02:45,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 19:02:45,494 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:47, output treesize:35 [2018-02-04 19:02:45,575 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:02:45,576 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:02:45,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-02-04 19:02:45,578 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:02:45,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-02-04 19:02:45,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:02:45,617 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:02:45,618 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:02:45,618 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 34 treesize of output 47 [2018-02-04 19:02:45,618 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:02:45,637 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:02:45,638 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:02:45,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-02-04 19:02:45,639 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:02:45,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 19:02:45,653 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:67, output treesize:49 [2018-02-04 19:02:45,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:02:45,696 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:02:45,696 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 19:02:45,697 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 19:02:45,697 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 19:02:45,697 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=25, Unknown=3, NotChecked=0, Total=42 [2018-02-04 19:02:45,697 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 7 states. [2018-02-04 19:03:16,302 WARN L146 SmtUtils]: Spent 26210ms on a formula simplification. DAG size of input: 56 DAG size of output 54 [2018-02-04 19:03:40,933 WARN L146 SmtUtils]: Spent 24542ms on a formula simplification. DAG size of input: 52 DAG size of output 50 [2018-02-04 19:03:41,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:03:41,081 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2018-02-04 19:03:41,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 19:03:41,081 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2018-02-04 19:03:41,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:03:41,082 INFO L225 Difference]: With dead ends: 62 [2018-02-04 19:03:41,082 INFO L226 Difference]: Without dead ends: 62 [2018-02-04 19:03:41,082 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 51.0s TimeCoverageRelationStatistics Valid=44, Invalid=84, Unknown=4, NotChecked=0, Total=132 [2018-02-04 19:03:41,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-02-04 19:03:41,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-02-04 19:03:41,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 19:03:41,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2018-02-04 19:03:41,085 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 32 [2018-02-04 19:03:41,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:03:41,085 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2018-02-04 19:03:41,085 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 19:03:41,085 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2018-02-04 19:03:41,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 19:03:41,086 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:03:41,086 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-02-04 19:03:41,086 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 19:03:41,086 INFO L82 PathProgramCache]: Analyzing trace with hash 730447574, now seen corresponding path program 1 times [2018-02-04 19:03:41,086 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:03:41,086 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:03:41,087 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:03:41,087 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:03:41,088 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:03:41,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:03:41,096 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:03:41,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:03:41,118 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:03:41,118 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 19:03:41,119 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:03:41,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:03:41,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:03:41,119 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand 6 states. [2018-02-04 19:03:41,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:03:41,135 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2018-02-04 19:03:41,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:03:41,135 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-02-04 19:03:41,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:03:41,136 INFO L225 Difference]: With dead ends: 64 [2018-02-04 19:03:41,136 INFO L226 Difference]: Without dead ends: 64 [2018-02-04 19:03:41,136 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 19:03:41,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-04 19:03:41,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2018-02-04 19:03:41,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 19:03:41,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2018-02-04 19:03:41,137 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 34 [2018-02-04 19:03:41,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:03:41,138 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2018-02-04 19:03:41,138 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:03:41,138 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2018-02-04 19:03:41,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 19:03:41,138 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:03:41,138 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] [2018-02-04 19:03:41,138 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 19:03:41,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1171326209, now seen corresponding path program 1 times [2018-02-04 19:03:41,138 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:03:41,139 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:03:41,139 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:03:41,139 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:03:41,139 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:03:41,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:03:41,145 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:03:41,146 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:03:41,146 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:03:41,146 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:03:41,147 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:03:41,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:03:41,165 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:03:41,206 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:03:41,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-02-04 19:03:41,207 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:03:41,217 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:03:41,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-02-04 19:03:41,217 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:03:41,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 19:03:41,222 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:16 [2018-02-04 19:03:41,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:03:41,268 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:03:41,268 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 19:03:41,268 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 19:03:41,268 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 19:03:41,268 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=61, Unknown=5, NotChecked=0, Total=90 [2018-02-04 19:03:41,268 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 10 states. [2018-02-04 19:03:41,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:03:41,433 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2018-02-04 19:03:41,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 19:03:41,433 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-02-04 19:03:41,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:03:41,433 INFO L225 Difference]: With dead ends: 67 [2018-02-04 19:03:41,433 INFO L226 Difference]: Without dead ends: 57 [2018-02-04 19:03:41,434 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=112, Unknown=5, NotChecked=0, Total=156 [2018-02-04 19:03:41,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-04 19:03:41,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-02-04 19:03:41,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-04 19:03:41,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-02-04 19:03:41,436 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 35 [2018-02-04 19:03:41,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:03:41,436 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-02-04 19:03:41,436 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 19:03:41,436 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-02-04 19:03:41,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 19:03:41,437 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:03:41,437 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, 1, 1] [2018-02-04 19:03:41,437 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 19:03:41,437 INFO L82 PathProgramCache]: Analyzing trace with hash 500251553, now seen corresponding path program 1 times [2018-02-04 19:03:41,437 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:03:41,437 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:03:41,438 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:03:41,438 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:03:41,438 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:03:41,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:03:41,446 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:03:41,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:03:41,490 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:03:41,490 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:03:41,490 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 19:03:41,490 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 19:03:41,491 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:03:41,491 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 5 states. [2018-02-04 19:03:41,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:03:41,494 INFO L93 Difference]: Finished difference Result 55 states and 54 transitions. [2018-02-04 19:03:41,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 19:03:41,495 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-02-04 19:03:41,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:03:41,495 INFO L225 Difference]: With dead ends: 55 [2018-02-04 19:03:41,495 INFO L226 Difference]: Without dead ends: 55 [2018-02-04 19:03:41,495 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:03:41,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-02-04 19:03:41,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-02-04 19:03:41,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-04 19:03:41,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 54 transitions. [2018-02-04 19:03:41,496 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 54 transitions. Word has length 39 [2018-02-04 19:03:41,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:03:41,497 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 54 transitions. [2018-02-04 19:03:41,497 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 19:03:41,497 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 54 transitions. [2018-02-04 19:03:41,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 19:03:41,497 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:03:41,497 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, 1, 1, 1, 1] [2018-02-04 19:03:41,497 INFO L371 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 19:03:41,497 INFO L82 PathProgramCache]: Analyzing trace with hash -294666985, now seen corresponding path program 1 times [2018-02-04 19:03:41,497 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:03:41,497 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:03:41,498 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:03:41,498 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:03:41,498 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:03:41,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:03:41,503 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:03:41,506 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:03:41,506 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:03:41,506 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:03:41,507 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:03:41,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:03:41,525 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:03:41,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 19:03:41,529 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:03:41,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:03:41,530 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 19:03:41,535 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 5 treesize of output 1 [2018-02-04 19:03:41,535 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:03:41,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:03:41,536 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2018-02-04 19:03:41,570 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:03:41,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-02-04 19:03:41,571 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:03:41,577 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:03:41,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-02-04 19:03:41,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:03:41,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 19:03:41,581 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:16 [2018-02-04 19:03:41,603 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:03:41,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-02-04 19:03:41,604 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:03:41,610 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:03:41,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-02-04 19:03:41,610 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:03:41,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 19:03:41,613 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:16 [2018-02-04 19:03:41,639 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:03:41,639 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:03:41,640 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 17 treesize of output 21 [2018-02-04 19:03:41,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:03:41,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:03:41,645 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:15 [2018-02-04 19:03:41,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:03:41,678 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:03:41,678 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-04 19:03:41,678 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 19:03:41,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 19:03:41,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=140, Unknown=5, NotChecked=0, Total=182 [2018-02-04 19:03:41,679 INFO L87 Difference]: Start difference. First operand 55 states and 54 transitions. Second operand 14 states. [2018-02-04 19:03:41,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:03:41,936 INFO L93 Difference]: Finished difference Result 54 states and 53 transitions. [2018-02-04 19:03:41,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 19:03:41,936 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 41 [2018-02-04 19:03:41,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:03:41,937 INFO L225 Difference]: With dead ends: 54 [2018-02-04 19:03:41,937 INFO L226 Difference]: Without dead ends: 54 [2018-02-04 19:03:41,937 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=400, Unknown=5, NotChecked=0, Total=506 [2018-02-04 19:03:41,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-04 19:03:41,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-02-04 19:03:41,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 19:03:41,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 53 transitions. [2018-02-04 19:03:41,938 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 53 transitions. Word has length 41 [2018-02-04 19:03:41,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:03:41,938 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 53 transitions. [2018-02-04 19:03:41,939 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 19:03:41,939 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 53 transitions. [2018-02-04 19:03:41,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 19:03:41,939 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:03:41,939 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, 1, 1, 1, 1] [2018-02-04 19:03:41,939 INFO L371 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 19:03:41,939 INFO L82 PathProgramCache]: Analyzing trace with hash -294666984, now seen corresponding path program 1 times [2018-02-04 19:03:41,939 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:03:41,939 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:03:41,940 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:03:41,940 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:03:41,940 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:03:41,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:03:41,946 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:03:42,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:03:42,004 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:03:42,004 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 19:03:42,005 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 19:03:42,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 19:03:42,005 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-04 19:03:42,005 INFO L87 Difference]: Start difference. First operand 54 states and 53 transitions. Second operand 8 states. [2018-02-04 19:03:42,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:03:42,080 INFO L93 Difference]: Finished difference Result 53 states and 52 transitions. [2018-02-04 19:03:42,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 19:03:42,081 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2018-02-04 19:03:42,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:03:42,081 INFO L225 Difference]: With dead ends: 53 [2018-02-04 19:03:42,081 INFO L226 Difference]: Without dead ends: 53 [2018-02-04 19:03:42,081 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-02-04 19:03:42,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-04 19:03:42,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-02-04 19:03:42,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-04 19:03:42,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 52 transitions. [2018-02-04 19:03:42,083 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 52 transitions. Word has length 41 [2018-02-04 19:03:42,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:03:42,083 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 52 transitions. [2018-02-04 19:03:42,083 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 19:03:42,083 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 52 transitions. [2018-02-04 19:03:42,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 19:03:42,084 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:03:42,084 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, 1, 1, 1, 1, 1] [2018-02-04 19:03:42,084 INFO L371 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 19:03:42,084 INFO L82 PathProgramCache]: Analyzing trace with hash -544741945, now seen corresponding path program 1 times [2018-02-04 19:03:42,084 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:03:42,084 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:03:42,084 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:03:42,084 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:03:42,085 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:03:42,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:03:42,091 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:03:42,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:03:42,175 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:03:42,175 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 19:03:42,175 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 19:03:42,175 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 19:03:42,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-02-04 19:03:42,175 INFO L87 Difference]: Start difference. First operand 53 states and 52 transitions. Second operand 12 states. [2018-02-04 19:03:42,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:03:42,311 INFO L93 Difference]: Finished difference Result 52 states and 51 transitions. [2018-02-04 19:03:42,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 19:03:42,311 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-02-04 19:03:42,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:03:42,312 INFO L225 Difference]: With dead ends: 52 [2018-02-04 19:03:42,312 INFO L226 Difference]: Without dead ends: 52 [2018-02-04 19:03:42,312 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2018-02-04 19:03:42,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-04 19:03:42,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-02-04 19:03:42,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 19:03:42,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 51 transitions. [2018-02-04 19:03:42,313 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 51 transitions. Word has length 42 [2018-02-04 19:03:42,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:03:42,313 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 51 transitions. [2018-02-04 19:03:42,313 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 19:03:42,313 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 51 transitions. [2018-02-04 19:03:42,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 19:03:42,314 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:03:42,314 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, 1, 1, 1, 1, 1] [2018-02-04 19:03:42,314 INFO L371 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 19:03:42,314 INFO L82 PathProgramCache]: Analyzing trace with hash -544741944, now seen corresponding path program 1 times [2018-02-04 19:03:42,314 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:03:42,314 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:03:42,314 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:03:42,315 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:03:42,315 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:03:42,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 19:03:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 19:03:42,348 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 19:03:42,364 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 8 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-02-04 19:03:42,364 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-02-04 19:03:42,365 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 8 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-02-04 19:03:42,365 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-02-04 19:03:42,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 07:03:42 BoogieIcfgContainer [2018-02-04 19:03:42,374 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 19:03:42,375 INFO L168 Benchmark]: Toolchain (without parser) took 157856.24 ms. Allocated memory was 403.2 MB in the beginning and 662.2 MB in the end (delta: 259.0 MB). Free memory was 359.8 MB in the beginning and 484.7 MB in the end (delta: -124.9 MB). Peak memory consumption was 134.1 MB. Max. memory is 5.3 GB. [2018-02-04 19:03:42,376 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 403.2 MB. Free memory is still 366.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 19:03:42,376 INFO L168 Benchmark]: CACSL2BoogieTranslator took 164.19 ms. Allocated memory is still 403.2 MB. Free memory was 359.8 MB in the beginning and 346.6 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 19:03:42,376 INFO L168 Benchmark]: Boogie Preprocessor took 22.32 ms. Allocated memory is still 403.2 MB. Free memory was 346.6 MB in the beginning and 345.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 19:03:42,377 INFO L168 Benchmark]: RCFGBuilder took 181.48 ms. Allocated memory is still 403.2 MB. Free memory was 345.3 MB in the beginning and 322.8 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 5.3 GB. [2018-02-04 19:03:42,377 INFO L168 Benchmark]: TraceAbstraction took 157485.75 ms. Allocated memory was 403.2 MB in the beginning and 662.2 MB in the end (delta: 259.0 MB). Free memory was 322.8 MB in the beginning and 484.7 MB in the end (delta: -161.9 MB). Peak memory consumption was 97.1 MB. Max. memory is 5.3 GB. [2018-02-04 19:03:42,378 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.09 ms. Allocated memory is still 403.2 MB. Free memory is still 366.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 164.19 ms. Allocated memory is still 403.2 MB. Free memory was 359.8 MB in the beginning and 346.6 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 22.32 ms. Allocated memory is still 403.2 MB. Free memory was 346.6 MB in the beginning and 345.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 181.48 ms. Allocated memory is still 403.2 MB. Free memory was 345.3 MB in the beginning and 322.8 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 157485.75 ms. Allocated memory was 403.2 MB in the beginning and 662.2 MB in the end (delta: 259.0 MB). Free memory was 322.8 MB in the beginning and 484.7 MB in the end (delta: -161.9 MB). Peak memory consumption was 97.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 8 could not be translated for associated CType STRUCT#?p~$Pointer$# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 8 could not be translated for associated CType STRUCT#?p~$Pointer$# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# * 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: IVAL [\old(a6)=null, \old(a6)=null, a6={8:5}] [L1468] FCALL struct A a6; VAL [a6={9:0}] [L1480] CALL entry_point() VAL [a6={9:0}] [L1472] CALL, EXPR probe3_6(&a6) VAL [a={9:0}, a6={9:0}] [L1444] int ret = - -3; VAL [a={9:0}, a={9:0}, a6={9:0}, ret=3] [L1445] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(size)=4, a6={9:0}] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=4, a6={9:0}, malloc(size)={7:0}, size=4] [L1074] RET return malloc(size); VAL [\old(size)=4, \result={7:0}, a6={9:0}, malloc(size)={7:0}, size=4] [L1445] EXPR ldv_malloc(sizeof(int)) VAL [a={9:0}, a={9:0}, a6={9:0}, ldv_malloc(sizeof(int))={7:0}, ret=3] [L1445] int *p = (int *)ldv_malloc(sizeof(int)); [L1446] COND FALSE !(p==0) VAL [a={9:0}, a={9:0}, a6={9:0}, p={7:0}, ret=3] [L1448] CALL, EXPR f6() VAL [a6={9:0}] [L1435] RET return __VERIFIER_nondet_int(); [L1448] EXPR f6() VAL [a={9:0}, a={9:0}, a6={9:0}, f6()=0, p={7:0}, ret=3] [L1448] ret = f6() [L1449] COND FALSE !(ret<0) VAL [a={9:0}, a={9:0}, a6={9:0}, p={7:0}, ret=0] [L1451] CALL, EXPR g6() VAL [a6={9:0}] [L1439] RET return __VERIFIER_nondet_int(); [L1451] EXPR g6() VAL [a={9:0}, a={9:0}, a6={9:0}, g6()=0, p={7:0}, ret=0] [L1451] ret = g6() [L1452] COND FALSE !(ret<0) VAL [a={9:0}, a={9:0}, a6={9:0}, p={7:0}, ret=0] [L1454] FCALL a->p = p VAL [a={9:0}, a={9:0}, a6={9:0}, p={7:0}, ret=0] [L1455] FCALL free(p) VAL [a={9:0}, a={9:0}, a6={9:0}, p={7:0}, ret=0] [L1456] RET return 0; VAL [\result=0, a={9:0}, a={9:0}, a6={9:0}, p={7:0}, ret=0] [L1472] EXPR probe3_6(&a6) VAL [a6={9:0}, probe3_6(&a6)=0] [L1472] int ret = probe3_6(&a6); [L1473] COND TRUE ret==0 VAL [a6={9:0}, ret=0] [L1474] CALL disconnect_6(&a6) VAL [a={9:0}, a6={9:0}] [L1464] EXPR, FCALL a->p VAL [a={9:0}, a={9:0}, a->p={7:0}, a6={9:0}] [L1464] FCALL free(a->p) VAL [a={9:0}, a={9:0}, a->p={7:0}, a6={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 69 locations, 15 error locations. UNSAFE Result, 157.4s OverallTime, 19 OverallIterations, 1 TraceHistogramMax, 150.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 887 SDtfs, 910 SDslu, 2466 SDs, 0 SdLazy, 1684 SolverSat, 256 SolverUnsat, 23 SolverUnknown, 0 SolverNotchecked, 11.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 334 GetRequests, 160 SyntacticMatches, 12 SemanticMatches, 162 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 143.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=3, 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.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 55 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 762 NumberOfCodeBlocks, 762 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 498 ConstructedInterpolants, 89 QuantifiedInterpolants, 141023 SizeOfPredicates, 40 NumberOfNonLiveVariables, 916 ConjunctsInSsa, 144 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_19-03-42-384.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_19-03-42-384.csv Received shutdown request...