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_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 19:32:09,868 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 19:32:09,869 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 19:32:09,880 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 19:32:09,880 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 19:32:09,881 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 19:32:09,882 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 19:32:09,884 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 19:32:09,885 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 19:32:09,885 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 19:32:09,886 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 19:32:09,886 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 19:32:09,887 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 19:32:09,888 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 19:32:09,889 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 19:32:09,890 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 19:32:09,892 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 19:32:09,893 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 19:32:09,894 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 19:32:09,895 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 19:32:09,896 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 19:32:09,897 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 19:32:09,897 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 19:32:09,897 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 19:32:09,898 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 19:32:09,899 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 19:32:09,899 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 19:32:09,900 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 19:32:09,900 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 19:32:09,900 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 19:32:09,900 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 19:32:09,901 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:32:09,910 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 19:32:09,910 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 19:32:09,911 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 19:32:09,911 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 19:32:09,911 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 19:32:09,912 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 19:32:09,912 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 19:32:09,912 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 19:32:09,912 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 19:32:09,912 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 19:32:09,912 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 19:32:09,913 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 19:32:09,913 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 19:32:09,913 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 19:32:09,913 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 19:32:09,913 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 19:32:09,913 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 19:32:09,913 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 19:32:09,914 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 19:32:09,914 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 19:32:09,914 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 19:32:09,914 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 19:32:09,914 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 19:32:09,914 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 19:32:09,942 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 19:32:09,952 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 19:32:09,955 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 19:32:09,956 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 19:32:09,957 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 19:32:09,957 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test6_true-valid-memsafety_true-termination.i [2018-02-04 19:32:10,102 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 19:32:10,103 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 19:32:10,104 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 19:32:10,104 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 19:32:10,110 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 19:32:10,111 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 07:32:10" (1/1) ... [2018-02-04 19:32:10,114 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bd0c2da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:32:10, skipping insertion in model container [2018-02-04 19:32:10,114 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 07:32:10" (1/1) ... [2018-02-04 19:32:10,129 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 19:32:10,167 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 19:32:10,253 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 19:32:10,266 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 19:32:10,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:32:10 WrapperNode [2018-02-04 19:32:10,271 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 19:32:10,271 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 19:32:10,272 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 19:32:10,272 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 19:32:10,284 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:32:10" (1/1) ... [2018-02-04 19:32:10,284 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:32:10" (1/1) ... [2018-02-04 19:32:10,292 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:32:10" (1/1) ... [2018-02-04 19:32:10,292 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:32:10" (1/1) ... [2018-02-04 19:32:10,294 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:32:10" (1/1) ... [2018-02-04 19:32:10,296 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:32:10" (1/1) ... [2018-02-04 19:32:10,297 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:32:10" (1/1) ... [2018-02-04 19:32:10,298 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 19:32:10,298 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 19:32:10,298 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 19:32:10,298 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 19:32:10,299 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:32:10" (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:32:10,335 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 19:32:10,335 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 19:32:10,335 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 19:32:10,335 INFO L136 BoogieDeclarations]: Found implementation of procedure f6 [2018-02-04 19:32:10,335 INFO L136 BoogieDeclarations]: Found implementation of procedure g6 [2018-02-04 19:32:10,335 INFO L136 BoogieDeclarations]: Found implementation of procedure probe1_6 [2018-02-04 19:32:10,335 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_6 [2018-02-04 19:32:10,336 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 19:32:10,336 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 19:32:10,336 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 19:32:10,336 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 19:32:10,336 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 19:32:10,336 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 19:32:10,336 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 19:32:10,336 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 19:32:10,336 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 19:32:10,336 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 19:32:10,336 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 19:32:10,336 INFO L128 BoogieDeclarations]: Found specification of procedure f6 [2018-02-04 19:32:10,336 INFO L128 BoogieDeclarations]: Found specification of procedure g6 [2018-02-04 19:32:10,336 INFO L128 BoogieDeclarations]: Found specification of procedure probe1_6 [2018-02-04 19:32:10,336 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_6 [2018-02-04 19:32:10,337 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 19:32:10,337 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 19:32:10,337 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 19:32:10,337 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 19:32:10,503 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 19:32:10,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 07:32:10 BoogieIcfgContainer [2018-02-04 19:32:10,504 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 19:32:10,504 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 19:32:10,504 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 19:32:10,507 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 19:32:10,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 07:32:10" (1/3) ... [2018-02-04 19:32:10,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15b80b4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 07:32:10, skipping insertion in model container [2018-02-04 19:32:10,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:32:10" (2/3) ... [2018-02-04 19:32:10,509 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15b80b4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 07:32:10, skipping insertion in model container [2018-02-04 19:32:10,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 07:32:10" (3/3) ... [2018-02-04 19:32:10,510 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test6_true-valid-memsafety_true-termination.i [2018-02-04 19:32:10,517 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 19:32:10,521 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-02-04 19:32:10,543 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 19:32:10,543 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 19:32:10,543 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 19:32:10,543 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 19:32:10,543 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 19:32:10,543 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 19:32:10,543 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 19:32:10,543 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 19:32:10,544 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 19:32:10,553 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-02-04 19:32:10,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 19:32:10,560 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:32:10,560 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 19:32:10,560 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 19:32:10,563 INFO L82 PathProgramCache]: Analyzing trace with hash 3262148, now seen corresponding path program 1 times [2018-02-04 19:32:10,564 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:32:10,564 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:32:10,598 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:32:10,598 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:32:10,599 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:32:10,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:32:10,630 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:32:10,671 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:32:10,673 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:32:10,673 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 19:32:10,674 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 19:32:10,681 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 19:32:10,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 19:32:10,683 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 3 states. [2018-02-04 19:32:10,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:32:10,850 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2018-02-04 19:32:10,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 19:32:10,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-04 19:32:10,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:32:10,861 INFO L225 Difference]: With dead ends: 79 [2018-02-04 19:32:10,861 INFO L226 Difference]: Without dead ends: 76 [2018-02-04 19:32:10,862 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:32:10,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-04 19:32:10,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 67. [2018-02-04 19:32:10,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-04 19:32:10,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-02-04 19:32:10,892 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 4 [2018-02-04 19:32:10,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:32:10,892 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-02-04 19:32:10,892 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 19:32:10,893 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-02-04 19:32:10,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 19:32:10,893 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:32:10,893 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 19:32:10,893 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 19:32:10,893 INFO L82 PathProgramCache]: Analyzing trace with hash 3262149, now seen corresponding path program 1 times [2018-02-04 19:32:10,893 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:32:10,893 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:32:10,895 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:32:10,895 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:32:10,895 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:32:10,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:32:10,907 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:32:10,939 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:32:10,939 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:32:10,939 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 19:32:10,940 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 19:32:10,940 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 19:32:10,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 19:32:10,941 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 3 states. [2018-02-04 19:32:10,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:32:10,985 INFO L93 Difference]: Finished difference Result 116 states and 126 transitions. [2018-02-04 19:32:10,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 19:32:10,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-04 19:32:10,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:32:10,987 INFO L225 Difference]: With dead ends: 116 [2018-02-04 19:32:10,987 INFO L226 Difference]: Without dead ends: 116 [2018-02-04 19:32:10,987 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:32:10,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-04 19:32:10,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 103. [2018-02-04 19:32:10,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-04 19:32:10,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 123 transitions. [2018-02-04 19:32:10,996 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 123 transitions. Word has length 4 [2018-02-04 19:32:10,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:32:10,997 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 123 transitions. [2018-02-04 19:32:10,997 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 19:32:10,997 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 123 transitions. [2018-02-04 19:32:10,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 19:32:10,998 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:32:10,998 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:32:10,998 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 19:32:10,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1144751463, now seen corresponding path program 1 times [2018-02-04 19:32:10,998 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:32:10,998 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:32:11,000 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:32:11,000 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:32:11,000 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:32:11,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:32:11,018 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:32:11,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:32:11,090 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:32:11,090 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:32:11,091 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:32:11,091 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:32:11,091 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:32:11,091 INFO L87 Difference]: Start difference. First operand 103 states and 123 transitions. Second operand 6 states. [2018-02-04 19:32:11,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:32:11,261 INFO L93 Difference]: Finished difference Result 122 states and 141 transitions. [2018-02-04 19:32:11,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 19:32:11,262 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-04 19:32:11,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:32:11,263 INFO L225 Difference]: With dead ends: 122 [2018-02-04 19:32:11,263 INFO L226 Difference]: Without dead ends: 118 [2018-02-04 19:32:11,263 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:32:11,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-02-04 19:32:11,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 108. [2018-02-04 19:32:11,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-04 19:32:11,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 131 transitions. [2018-02-04 19:32:11,272 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 131 transitions. Word has length 24 [2018-02-04 19:32:11,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:32:11,273 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 131 transitions. [2018-02-04 19:32:11,273 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:32:11,273 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 131 transitions. [2018-02-04 19:32:11,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 19:32:11,273 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:32:11,274 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:32:11,274 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 19:32:11,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1144751462, now seen corresponding path program 1 times [2018-02-04 19:32:11,274 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:32:11,274 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:32:11,276 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:32:11,276 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:32:11,276 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:32:11,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:32:11,292 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:32:11,333 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:32:11,333 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:32:11,333 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 19:32:11,333 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:32:11,334 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:32:11,334 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:32:11,334 INFO L87 Difference]: Start difference. First operand 108 states and 131 transitions. Second operand 6 states. [2018-02-04 19:32:11,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:32:11,360 INFO L93 Difference]: Finished difference Result 120 states and 142 transitions. [2018-02-04 19:32:11,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:32:11,360 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-04 19:32:11,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:32:11,361 INFO L225 Difference]: With dead ends: 120 [2018-02-04 19:32:11,361 INFO L226 Difference]: Without dead ends: 116 [2018-02-04 19:32:11,362 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:32:11,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-04 19:32:11,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2018-02-04 19:32:11,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-04 19:32:11,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 134 transitions. [2018-02-04 19:32:11,368 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 134 transitions. Word has length 24 [2018-02-04 19:32:11,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:32:11,369 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 134 transitions. [2018-02-04 19:32:11,369 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:32:11,369 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 134 transitions. [2018-02-04 19:32:11,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 19:32:11,370 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:32:11,370 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:32:11,370 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 19:32:11,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1288261138, now seen corresponding path program 1 times [2018-02-04 19:32:11,370 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:32:11,370 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:32:11,371 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:32:11,371 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:32:11,371 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:32:11,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:32:11,392 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:32:11,447 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:32:11,447 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:32:11,447 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:32:11,447 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 19:32:11,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 19:32:11,448 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:32:11,448 INFO L87 Difference]: Start difference. First operand 112 states and 134 transitions. Second operand 5 states. [2018-02-04 19:32:11,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:32:11,460 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2018-02-04 19:32:11,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 19:32:11,460 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-02-04 19:32:11,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:32:11,461 INFO L225 Difference]: With dead ends: 77 [2018-02-04 19:32:11,461 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 19:32:11,461 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:32:11,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 19:32:11,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-02-04 19:32:11,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-04 19:32:11,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2018-02-04 19:32:11,465 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 24 [2018-02-04 19:32:11,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:32:11,465 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2018-02-04 19:32:11,466 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 19:32:11,466 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2018-02-04 19:32:11,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 19:32:11,466 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:32:11,466 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:32:11,466 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 19:32:11,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1988329134, now seen corresponding path program 1 times [2018-02-04 19:32:11,467 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:32:11,467 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:32:11,468 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:32:11,468 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:32:11,468 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:32:11,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:32:11,480 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:32:11,510 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:32:11,510 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:32:11,510 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 19:32:11,510 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:32:11,511 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:32:11,511 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:32:11,511 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand 6 states. [2018-02-04 19:32:11,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:32:11,527 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2018-02-04 19:32:11,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:32:11,529 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-04 19:32:11,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:32:11,529 INFO L225 Difference]: With dead ends: 69 [2018-02-04 19:32:11,529 INFO L226 Difference]: Without dead ends: 69 [2018-02-04 19:32:11,529 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:32:11,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-04 19:32:11,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-02-04 19:32:11,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-04 19:32:11,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2018-02-04 19:32:11,533 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 24 [2018-02-04 19:32:11,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:32:11,534 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2018-02-04 19:32:11,534 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:32:11,534 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2018-02-04 19:32:11,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 19:32:11,535 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:32:11,535 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:32:11,535 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 19:32:11,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1956813492, now seen corresponding path program 1 times [2018-02-04 19:32:11,535 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:32:11,535 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:32:11,536 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:32:11,536 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:32:11,536 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:32:11,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:32:11,547 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:32:11,576 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:32:11,576 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:32:11,576 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:32:11,576 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:32:11,576 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:32:11,576 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:32:11,576 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand 6 states. [2018-02-04 19:32:11,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:32:11,597 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2018-02-04 19:32:11,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:32:11,597 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-04 19:32:11,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:32:11,597 INFO L225 Difference]: With dead ends: 68 [2018-02-04 19:32:11,597 INFO L226 Difference]: Without dead ends: 68 [2018-02-04 19:32:11,598 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:32:11,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-04 19:32:11,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-02-04 19:32:11,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-04 19:32:11,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2018-02-04 19:32:11,602 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 26 [2018-02-04 19:32:11,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:32:11,602 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2018-02-04 19:32:11,603 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:32:11,603 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2018-02-04 19:32:11,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 19:32:11,603 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:32:11,603 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:32:11,603 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 19:32:11,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1956813493, now seen corresponding path program 1 times [2018-02-04 19:32:11,603 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:32:11,603 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:32:11,604 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:32:11,604 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:32:11,604 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:32:11,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:32:11,612 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:32:11,642 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:32:11,643 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:32:11,643 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:32:11,643 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:32:11,643 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:32:11,643 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:32:11,643 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand 6 states. [2018-02-04 19:32:11,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:32:11,720 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2018-02-04 19:32:11,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:32:11,721 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-04 19:32:11,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:32:11,721 INFO L225 Difference]: With dead ends: 67 [2018-02-04 19:32:11,721 INFO L226 Difference]: Without dead ends: 67 [2018-02-04 19:32:11,722 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:32:11,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-04 19:32:11,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-02-04 19:32:11,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-04 19:32:11,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-02-04 19:32:11,724 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 26 [2018-02-04 19:32:11,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:32:11,724 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-02-04 19:32:11,724 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:32:11,724 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-02-04 19:32:11,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 19:32:11,725 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:32:11,725 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:32:11,725 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 19:32:11,725 INFO L82 PathProgramCache]: Analyzing trace with hash 840727273, now seen corresponding path program 1 times [2018-02-04 19:32:11,725 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:32:11,725 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:32:11,726 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:32:11,726 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:32:11,726 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:32:11,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:32:11,740 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:32:11,745 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:32:11,745 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:32:11,746 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:32:11,746 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:32:11,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:32:11,783 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:32:11,811 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:32:11,812 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:32:11,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:32:11,813 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 19:32:11,861 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:32:11,862 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:32:11,864 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:32:11,865 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:32:11,871 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:32:11,871 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-02-04 19:32:11,973 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:32:11,974 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:32:11,974 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 19:32:11,974 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 19:32:11,974 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 19:32:11,974 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 19:32:11,975 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 9 states. [2018-02-04 19:32:12,254 WARN L143 SmtUtils]: Spent 170ms on a formula simplification that was a NOOP. DAG size: 18 [2018-02-04 19:32:12,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:32:12,613 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2018-02-04 19:32:12,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 19:32:12,613 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-02-04 19:32:12,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:32:12,614 INFO L225 Difference]: With dead ends: 75 [2018-02-04 19:32:12,614 INFO L226 Difference]: Without dead ends: 75 [2018-02-04 19:32:12,614 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-02-04 19:32:12,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-04 19:32:12,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 66. [2018-02-04 19:32:12,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-04 19:32:12,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2018-02-04 19:32:12,616 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 32 [2018-02-04 19:32:12,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:32:12,616 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2018-02-04 19:32:12,616 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 19:32:12,617 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2018-02-04 19:32:12,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 19:32:12,617 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:32:12,617 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:32:12,617 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 19:32:12,617 INFO L82 PathProgramCache]: Analyzing trace with hash 840727274, now seen corresponding path program 1 times [2018-02-04 19:32:12,617 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:32:12,617 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:32:12,618 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:32:12,618 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:32:12,618 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:32:12,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:32:12,625 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:32:12,631 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:32:12,631 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:32:12,631 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:32:12,632 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:32:12,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:32:12,657 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:32:12,664 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:32:12,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:32:12,668 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:32:12,668 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:32:12,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:32:12,671 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 19:32:12,756 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:32:12,758 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:32:12,759 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:32:12,788 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:32:12,789 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:32:12,789 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:32:12,790 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:32:12,822 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:32:12,822 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:32:12,823 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:32:12,823 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:32:12,846 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:32:12,846 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:32:12,847 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:32:12,847 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:32:12,864 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:32:12,864 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:67, output treesize:49 [2018-02-04 19:32:14,726 WARN L143 SmtUtils]: Spent 621ms on a formula simplification that was a NOOP. DAG size: 32 [2018-02-04 19:32:18,883 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:32:18,883 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:32:18,883 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 19:32:18,884 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 19:32:18,884 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 19:32:18,884 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=53, Unknown=3, NotChecked=0, Total=72 [2018-02-04 19:32:18,884 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand 9 states. [2018-02-04 19:32:46,746 WARN L146 SmtUtils]: Spent 20176ms on a formula simplification. DAG size of input: 60 DAG size of output 55 [2018-02-04 19:32:59,043 WARN L143 SmtUtils]: Spent 12282ms on a formula simplification that was a NOOP. DAG size: 59 [2018-02-04 19:33:00,352 WARN L146 SmtUtils]: Spent 289ms on a formula simplification. DAG size of input: 47 DAG size of output 42 [2018-02-04 19:33:12,470 WARN L143 SmtUtils]: Spent 12074ms on a formula simplification that was a NOOP. DAG size: 50 [2018-02-04 19:33:20,569 WARN L143 SmtUtils]: Spent 8057ms on a formula simplification that was a NOOP. DAG size: 51 [2018-02-04 19:33:41,940 WARN L146 SmtUtils]: Spent 20305ms on a formula simplification. DAG size of input: 61 DAG size of output 61 [2018-02-04 19:33:42,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:33:42,066 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2018-02-04 19:33:42,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 19:33:42,104 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-02-04 19:33:42,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:33:42,105 INFO L225 Difference]: With dead ends: 73 [2018-02-04 19:33:42,105 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 19:33:42,105 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 82.6s TimeCoverageRelationStatistics Valid=81, Invalid=247, Unknown=14, NotChecked=0, Total=342 [2018-02-04 19:33:42,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 19:33:42,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 65. [2018-02-04 19:33:42,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-02-04 19:33:42,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-02-04 19:33:42,107 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 32 [2018-02-04 19:33:42,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:33:42,107 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2018-02-04 19:33:42,107 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 19:33:42,108 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-02-04 19:33:42,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 19:33:42,108 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:33:42,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:33:42,108 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 19:33:42,108 INFO L82 PathProgramCache]: Analyzing trace with hash -229619546, now seen corresponding path program 1 times [2018-02-04 19:33:42,108 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:33:42,108 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:33:42,109 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:33:42,109 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:33:42,109 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:33:42,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:33:42,115 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:33:42,118 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:33:42,118 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:33:42,118 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:33:42,119 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:33:42,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:33:42,130 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:33:42,139 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:33:42,139 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:33:42,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:33:42,141 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 19:33:42,145 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:33:42,146 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:33:42,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:33:42,147 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2018-02-04 19:33:42,183 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:33:42,184 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:33:42,184 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:33:42,189 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:33:42,190 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:33:42,190 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:33:42,193 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:33:42,194 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:16 [2018-02-04 19:33:42,213 WARN L1033 $PredicateComparison]: unable to prove that (exists ((probe1_6_~p~0.base Int)) (and (<= (select |c_old(#valid)| probe1_6_~p~0.base) 0) (= |c_#valid| (store |c_old(#valid)| probe1_6_~p~0.base 0)) (not (= probe1_6_~p~0.base 0)))) is different from true [2018-02-04 19:33:42,219 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:33:42,219 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:33:42,220 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:33:42,221 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:33:42,221 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:33:42,226 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:33:42,226 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:15 [2018-02-04 19:33:42,235 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:33:42,236 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:33:42,236 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 19:33:42,236 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 19:33:42,236 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 19:33:42,236 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=83, Unknown=1, NotChecked=18, Total=132 [2018-02-04 19:33:42,236 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 12 states. [2018-02-04 19:33:42,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:33:42,397 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2018-02-04 19:33:42,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 19:33:42,398 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2018-02-04 19:33:42,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:33:42,398 INFO L225 Difference]: With dead ends: 75 [2018-02-04 19:33:42,398 INFO L226 Difference]: Without dead ends: 75 [2018-02-04 19:33:42,398 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=238, Unknown=1, NotChecked=32, Total=342 [2018-02-04 19:33:42,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-04 19:33:42,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 66. [2018-02-04 19:33:42,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-04 19:33:42,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2018-02-04 19:33:42,400 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 32 [2018-02-04 19:33:42,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:33:42,400 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2018-02-04 19:33:42,400 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 19:33:42,400 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2018-02-04 19:33:42,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 19:33:42,401 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:33:42,401 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:33:42,401 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 19:33:42,401 INFO L82 PathProgramCache]: Analyzing trace with hash -229619545, now seen corresponding path program 1 times [2018-02-04 19:33:42,401 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:33:42,401 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:33:42,402 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:33:42,402 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:33:42,402 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:33:42,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:33:42,411 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:33:42,416 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:33:42,416 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:33:42,416 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:33:42,417 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:33:42,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:33:42,433 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:33:42,437 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:33:42,437 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:33:42,443 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:33:42,443 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:33:42,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:33:42,450 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 19:33:42,459 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:33:42,459 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:33:42,466 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:33:42,466 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:33:42,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:33:42,470 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:10 [2018-02-04 19:33:42,513 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:33:42,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:33:42,526 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:33:42,526 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:33:42,538 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:33:42,538 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:33:42,555 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:33:42,556 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:33:42,563 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:33:42,564 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:47, output treesize:35 [2018-02-04 19:33:42,661 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:33:42,662 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:33:42,663 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:33:42,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:33:42,692 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:33:42,692 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:33:42,717 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:33:42,718 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:33:42,718 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:33:42,719 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:33:42,739 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:33:42,740 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:33:42,741 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:33:42,741 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:33:42,756 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:33:42,756 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:67, output treesize:49 [2018-02-04 19:33:42,787 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:33:42,787 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:33:42,787 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 19:33:42,788 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 19:33:42,788 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 19:33:42,788 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=24, Unknown=4, NotChecked=0, Total=42 [2018-02-04 19:33:42,788 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand 7 states. [2018-02-04 19:34:13,584 WARN L146 SmtUtils]: Spent 26411ms on a formula simplification. DAG size of input: 56 DAG size of output 54 [2018-02-04 19:34:38,073 WARN L146 SmtUtils]: Spent 24409ms on a formula simplification. DAG size of input: 52 DAG size of output 50 [2018-02-04 19:34:38,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:34:38,214 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-02-04 19:34:38,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 19:34:38,215 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2018-02-04 19:34:38,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:34:38,215 INFO L225 Difference]: With dead ends: 69 [2018-02-04 19:34:38,215 INFO L226 Difference]: Without dead ends: 69 [2018-02-04 19:34:38,216 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=83, Unknown=5, NotChecked=0, Total=132 [2018-02-04 19:34:38,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-04 19:34:38,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 64. [2018-02-04 19:34:38,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-04 19:34:38,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2018-02-04 19:34:38,218 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 32 [2018-02-04 19:34:38,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:34:38,218 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2018-02-04 19:34:38,218 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 19:34:38,218 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2018-02-04 19:34:38,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 19:34:38,219 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:34:38,219 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:34:38,220 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 19:34:38,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1621100812, now seen corresponding path program 1 times [2018-02-04 19:34:38,220 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:34:38,220 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:34:38,220 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:34:38,220 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:34:38,221 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:34:38,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:34:38,228 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:34:38,255 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:34:38,255 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:34:38,255 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 19:34:38,256 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:34:38,256 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:34:38,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:34:38,256 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand 6 states. [2018-02-04 19:34:38,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:34:38,277 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-02-04 19:34:38,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:34:38,277 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-02-04 19:34:38,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:34:38,278 INFO L225 Difference]: With dead ends: 63 [2018-02-04 19:34:38,278 INFO L226 Difference]: Without dead ends: 63 [2018-02-04 19:34:38,278 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:34:38,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-02-04 19:34:38,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2018-02-04 19:34:38,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 19:34:38,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-02-04 19:34:38,279 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 34 [2018-02-04 19:34:38,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:34:38,279 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-02-04 19:34:38,279 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:34:38,279 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-02-04 19:34:38,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 19:34:38,280 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:34:38,280 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:34:38,280 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 19:34:38,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1287023485, now seen corresponding path program 1 times [2018-02-04 19:34:38,280 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:34:38,280 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:34:38,281 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:34:38,281 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:34:38,281 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:34:38,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:34:38,289 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:34:38,292 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:34:38,292 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:34:38,292 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:34:38,293 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:34:38,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:34:38,309 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:34:38,363 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:34:38,364 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:34:38,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:34:38,374 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:34:38,375 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:34:38,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:34:38,381 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:34:38,381 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:16 [2018-02-04 19:34:38,438 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:34:38,439 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:34:38,439 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 19:34:38,439 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 19:34:38,439 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 19:34:38,439 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=61, Unknown=5, NotChecked=0, Total=90 [2018-02-04 19:34:38,439 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 10 states. [2018-02-04 19:34:38,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:34:38,588 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2018-02-04 19:34:38,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 19:34:38,588 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-02-04 19:34:38,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:34:38,589 INFO L225 Difference]: With dead ends: 64 [2018-02-04 19:34:38,589 INFO L226 Difference]: Without dead ends: 54 [2018-02-04 19:34:38,589 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=112, Unknown=5, NotChecked=0, Total=156 [2018-02-04 19:34:38,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-04 19:34:38,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-02-04 19:34:38,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 19:34:38,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-02-04 19:34:38,591 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 35 [2018-02-04 19:34:38,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:34:38,591 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-02-04 19:34:38,591 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 19:34:38,591 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-02-04 19:34:38,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 19:34:38,592 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:34:38,592 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:34:38,592 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 19:34:38,592 INFO L82 PathProgramCache]: Analyzing trace with hash -945807698, now seen corresponding path program 1 times [2018-02-04 19:34:38,592 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:34:38,593 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:34:38,593 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:34:38,593 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:34:38,594 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:34:38,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:34:38,601 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:34:38,685 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:34:38,685 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:34:38,685 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 19:34:38,686 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 19:34:38,686 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 19:34:38,686 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-04 19:34:38,686 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 8 states. [2018-02-04 19:34:38,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:34:38,804 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-02-04 19:34:38,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 19:34:38,804 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-02-04 19:34:38,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:34:38,804 INFO L225 Difference]: With dead ends: 53 [2018-02-04 19:34:38,804 INFO L226 Difference]: Without dead ends: 53 [2018-02-04 19:34:38,805 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-02-04 19:34:38,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-04 19:34:38,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-02-04 19:34:38,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-04 19:34:38,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-02-04 19:34:38,807 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 40 [2018-02-04 19:34:38,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:34:38,807 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-02-04 19:34:38,807 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 19:34:38,807 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-02-04 19:34:38,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 19:34:38,807 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:34:38,808 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:34:38,808 INFO L371 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 19:34:38,808 INFO L82 PathProgramCache]: Analyzing trace with hash 744732401, now seen corresponding path program 1 times [2018-02-04 19:34:38,808 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:34:38,808 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:34:38,809 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:34:38,809 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:34:38,809 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:34:38,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:34:38,816 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:34:38,904 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:34:38,905 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:34:38,905 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 19:34:38,905 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 19:34:38,905 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 19:34:38,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-02-04 19:34:38,905 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 12 states. [2018-02-04 19:34:39,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:34:39,077 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-02-04 19:34:39,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 19:34:39,077 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-02-04 19:34:39,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:34:39,078 INFO L225 Difference]: With dead ends: 52 [2018-02-04 19:34:39,078 INFO L226 Difference]: Without dead ends: 52 [2018-02-04 19:34:39,078 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:34:39,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-04 19:34:39,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-02-04 19:34:39,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 19:34:39,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-02-04 19:34:39,079 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 41 [2018-02-04 19:34:39,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:34:39,080 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-02-04 19:34:39,080 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 19:34:39,080 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-02-04 19:34:39,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 19:34:39,080 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:34:39,080 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:34:39,080 INFO L371 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 19:34:39,080 INFO L82 PathProgramCache]: Analyzing trace with hash 744732402, now seen corresponding path program 1 times [2018-02-04 19:34:39,080 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:34:39,080 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:34:39,081 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:34:39,081 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:34:39,081 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:34:39,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:34:39,088 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:34:39,186 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:34:39,187 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:34:39,187 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 19:34:39,187 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 19:34:39,187 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 19:34:39,187 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-02-04 19:34:39,188 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 12 states. [2018-02-04 19:34:39,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:34:39,347 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-02-04 19:34:39,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 19:34:39,347 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-02-04 19:34:39,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:34:39,348 INFO L225 Difference]: With dead ends: 51 [2018-02-04 19:34:39,348 INFO L226 Difference]: Without dead ends: 51 [2018-02-04 19:34:39,348 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2018-02-04 19:34:39,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-04 19:34:39,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-04 19:34:39,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 19:34:39,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-02-04 19:34:39,350 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 41 [2018-02-04 19:34:39,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:34:39,350 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-02-04 19:34:39,350 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 19:34:39,351 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-02-04 19:34:39,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 19:34:39,351 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:34:39,351 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:34:39,351 INFO L371 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 19:34:39,351 INFO L82 PathProgramCache]: Analyzing trace with hash 746273508, now seen corresponding path program 1 times [2018-02-04 19:34:39,351 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:34:39,351 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:34:39,352 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:34:39,352 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:34:39,352 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:34:39,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:34:39,360 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:34:39,379 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:34:39,379 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:34:39,379 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:34:39,379 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 19:34:39,380 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 19:34:39,380 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:34:39,380 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 5 states. [2018-02-04 19:34:39,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:34:39,385 INFO L93 Difference]: Finished difference Result 50 states and 49 transitions. [2018-02-04 19:34:39,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 19:34:39,387 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-02-04 19:34:39,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:34:39,388 INFO L225 Difference]: With dead ends: 50 [2018-02-04 19:34:39,388 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 19:34:39,388 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:34:39,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 19:34:39,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-04 19:34:39,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 19:34:39,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 49 transitions. [2018-02-04 19:34:39,390 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 49 transitions. Word has length 41 [2018-02-04 19:34:39,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:34:39,390 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 49 transitions. [2018-02-04 19:34:39,390 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 19:34:39,390 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 49 transitions. [2018-02-04 19:34:39,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 19:34:39,390 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:34:39,391 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, 1, 1, 1] [2018-02-04 19:34:39,391 INFO L371 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 19:34:39,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1423792391, now seen corresponding path program 1 times [2018-02-04 19:34:39,391 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:34:39,391 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:34:39,392 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:34:39,392 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:34:39,392 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:34:39,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:34:39,400 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:34:39,404 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:34:39,404 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:34:39,404 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:34:39,405 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:34:39,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:34:39,424 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:34:39,431 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:34:39,431 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:34:39,436 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:34:39,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:34:39,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:34:39,440 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 19:34:39,449 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:34:39,449 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:34:39,455 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:34:39,455 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:34:39,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:34:39,459 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:10 [2018-02-04 19:34:39,632 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:34:39,633 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 30 treesize of output 31 [2018-02-04 19:34:39,633 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:34:39,645 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:34:39,645 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:34:39,658 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:34:39,659 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 28 treesize of output 29 [2018-02-04 19:34:39,659 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:34:39,671 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 22 treesize of output 21 [2018-02-04 19:34:39,671 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:34:39,682 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:34:39,683 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:59, output treesize:45 [2018-02-04 19:34:39,735 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 28 treesize of output 27 [2018-02-04 19:34:39,736 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:34:39,751 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:34:39,752 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 27 treesize of output 28 [2018-02-04 19:34:39,752 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:34:39,767 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:34:39,768 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 30 treesize of output 31 [2018-02-04 19:34:39,768 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:34:39,781 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:34:39,781 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:34:39,792 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:34:39,793 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:59, output treesize:45 [2018-02-04 19:34:39,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 44 [2018-02-04 19:34:39,863 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 8 treesize of output 7 [2018-02-04 19:34:39,864 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:34:39,873 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:34:39,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 42 [2018-02-04 19:34:39,902 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 8 treesize of output 7 [2018-02-04 19:34:39,902 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:34:39,912 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:34:39,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 19:34:39,937 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:93, output treesize:95 [2018-02-04 19:34:39,977 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:34:39,978 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:34:39,978 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 55 treesize of output 72 [2018-02-04 19:34:39,979 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:34:40,009 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:34:40,009 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:34:40,010 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 61 [2018-02-04 19:34:40,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:34:40,035 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:34:40,036 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 53 treesize of output 60 [2018-02-04 19:34:40,036 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:34:40,059 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:34:40,060 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:34:40,061 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 59 [2018-02-04 19:34:40,061 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:34:40,082 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:34:40,082 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:109, output treesize:95 [2018-02-04 19:34:40,120 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:34:40,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2018-02-04 19:34:40,121 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:34:40,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 39 [2018-02-04 19:34:40,145 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:34:40,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 19:34:40,187 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:101, output treesize:73 [2018-02-04 19:34:40,587 WARN L146 SmtUtils]: Spent 171ms on a formula simplification. DAG size of input: 129 DAG size of output 109 [2018-02-04 19:34:40,618 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:34:40,618 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:34:40,619 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:34:40,619 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 96 treesize of output 105 [2018-02-04 19:34:40,620 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:34:40,843 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:34:40,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 79 [2018-02-04 19:34:40,846 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:34:40,931 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:34:40,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 90 [2018-02-04 19:34:40,933 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:34:41,017 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:34:41,017 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:34:41,018 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:34:41,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 80 [2018-02-04 19:34:41,019 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:34:41,295 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:34:41,296 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:34:41,296 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:34:41,297 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 71 treesize of output 80 [2018-02-04 19:34:41,297 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 19:34:41,473 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:34:41,473 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:34:41,474 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:34:41,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 79 [2018-02-04 19:34:41,475 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 19:34:41,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2018-02-04 19:34:41,652 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:34:41,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-02-04 19:34:41,652 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:34:41,663 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:34:41,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 54 [2018-02-04 19:34:41,723 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:34:41,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-02-04 19:34:41,724 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 19:34:41,734 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:34:41,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 54 [2018-02-04 19:34:41,844 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:34:41,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-02-04 19:34:41,844 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 19:34:41,853 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:34:41,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2018-02-04 19:34:41,974 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:34:41,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-02-04 19:34:41,974 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:34:41,986 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:34:42,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 40 dim-0 vars, 12 dim-1 vars, 8 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 19:34:42,037 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 60 variables, input treesize:773, output treesize:46 [2018-02-04 19:34:42,081 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:34:42,081 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:34:42,081 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-02-04 19:34:42,081 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 19:34:42,082 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 19:34:42,082 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=227, Unknown=5, NotChecked=0, Total=272 [2018-02-04 19:34:42,082 INFO L87 Difference]: Start difference. First operand 50 states and 49 transitions. Second operand 17 states. [2018-02-04 19:34:47,674 WARN L143 SmtUtils]: Spent 2084ms on a formula simplification that was a NOOP. DAG size: 131 [2018-02-04 19:34:47,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:34:47,786 INFO L93 Difference]: Finished difference Result 49 states and 48 transitions. [2018-02-04 19:34:47,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 19:34:47,786 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 45 [2018-02-04 19:34:47,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:34:47,786 INFO L225 Difference]: With dead ends: 49 [2018-02-04 19:34:47,786 INFO L226 Difference]: Without dead ends: 49 [2018-02-04 19:34:47,787 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=128, Invalid=718, Unknown=24, NotChecked=0, Total=870 [2018-02-04 19:34:47,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-04 19:34:47,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-04 19:34:47,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 19:34:47,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 48 transitions. [2018-02-04 19:34:47,788 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 48 transitions. Word has length 45 [2018-02-04 19:34:47,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:34:47,788 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 48 transitions. [2018-02-04 19:34:47,788 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 19:34:47,788 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 48 transitions. [2018-02-04 19:34:47,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 19:34:47,788 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:34:47,788 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, 1, 1, 1, 1, 1, 1] [2018-02-04 19:34:47,788 INFO L371 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 19:34:47,789 INFO L82 PathProgramCache]: Analyzing trace with hash -897879172, now seen corresponding path program 1 times [2018-02-04 19:34:47,789 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:34:47,789 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:34:47,789 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:34:47,789 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:34:47,789 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:34:47,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:34:47,798 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:34:47,801 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:34:47,801 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:34:47,801 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:34:47,802 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:34:47,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:34:47,832 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:34:47,852 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:34:47,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:34:47,859 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:34:47,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:34:47,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:34:47,864 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 19:34:47,880 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:34:47,880 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:34:47,886 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:34:47,887 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:34:47,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:34:47,890 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:10 [2018-02-04 19:34:48,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-02-04 19:34:48,099 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:34:48,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-02-04 19:34:48,115 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:34:48,134 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:34:48,135 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 33 treesize of output 27 [2018-02-04 19:34:48,135 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:34:48,149 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:34:48,150 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 31 treesize of output 25 [2018-02-04 19:34:48,150 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:34:48,163 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:34:48,163 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:67, output treesize:53 [2018-02-04 19:34:48,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-02-04 19:34:48,225 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:34:48,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-02-04 19:34:48,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:34:48,257 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:34:48,257 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 33 treesize of output 27 [2018-02-04 19:34:48,257 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:34:48,271 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:34:48,272 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 31 treesize of output 25 [2018-02-04 19:34:48,272 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:34:48,284 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:34:48,284 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:67, output treesize:53 [2018-02-04 19:34:48,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2018-02-04 19:34:48,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:34:48,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:34:48,366 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:34:48,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 46 [2018-02-04 19:34:48,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:34:48,391 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:34:48,399 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:34:48,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 19:34:48,422 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:101, output treesize:111 [2018-02-04 19:34:48,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 46 [2018-02-04 19:34:48,504 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:34:48,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 40 [2018-02-04 19:34:48,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:34:48,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 37 [2018-02-04 19:34:48,557 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:34:48,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 39 [2018-02-04 19:34:48,588 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:34:48,608 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:34:48,608 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:97, output treesize:77 [2018-02-04 19:34:48,897 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 19:34:48,898 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:34:49,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 72 [2018-02-04 19:34:49,385 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:34:49,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2018-02-04 19:34:49,386 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:34:49,402 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:34:49,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 68 [2018-02-04 19:34:49,808 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:34:49,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2018-02-04 19:34:49,809 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:34:49,824 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:34:49,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 80 [2018-02-04 19:34:49,938 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:34:49,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 49 [2018-02-04 19:34:49,945 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-02-04 19:34:49,975 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-02-04 19:34:50,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 76 [2018-02-04 19:34:50,138 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:34:50,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 45 [2018-02-04 19:34:50,151 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-02-04 19:34:50,180 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-02-04 19:34:50,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 40 dim-0 vars, 8 dim-2 vars, End of recursive call: 20 dim-0 vars, and 6 xjuncts. [2018-02-04 19:34:50,369 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 48 variables, input treesize:785, output treesize:371 [2018-02-04 19:34:50,747 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 38 treesize of output 33 [2018-02-04 19:34:50,747 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:34:50,765 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 38 treesize of output 33 [2018-02-04 19:34:50,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:34:50,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 19:34:50,785 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 17 variables, input treesize:185, output treesize:43 [2018-02-04 19:34:50,842 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:34:50,842 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:34:50,842 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-02-04 19:34:50,843 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 19:34:50,843 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 19:34:50,843 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=319, Unknown=17, NotChecked=0, Total=380 [2018-02-04 19:34:50,843 INFO L87 Difference]: Start difference. First operand 49 states and 48 transitions. Second operand 20 states. [2018-02-04 19:34:52,433 WARN L146 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 73 DAG size of output 71 [2018-02-04 19:34:52,626 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 76 DAG size of output 74 [2018-02-04 19:34:52,819 WARN L146 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 98 DAG size of output 85 [2018-02-04 19:34:53,074 WARN L146 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 133 DAG size of output 88 [2018-02-04 19:34:56,115 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 138 DAG size of output 88 [2018-02-04 19:34:56,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:34:56,115 INFO L93 Difference]: Finished difference Result 48 states and 47 transitions. [2018-02-04 19:34:56,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 19:34:56,116 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 48 [2018-02-04 19:34:56,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:34:56,116 INFO L225 Difference]: With dead ends: 48 [2018-02-04 19:34:56,116 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 19:34:56,116 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 24 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=164, Invalid=1061, Unknown=35, NotChecked=0, Total=1260 [2018-02-04 19:34:56,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 19:34:56,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 19:34:56,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 19:34:56,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 19:34:56,117 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2018-02-04 19:34:56,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:34:56,117 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 19:34:56,117 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 19:34:56,117 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 19:34:56,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 19:34:56,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 07:34:56 BoogieIcfgContainer [2018-02-04 19:34:56,120 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 19:34:56,121 INFO L168 Benchmark]: Toolchain (without parser) took 166018.04 ms. Allocated memory was 400.0 MB in the beginning and 626.0 MB in the end (delta: 226.0 MB). Free memory was 356.7 MB in the beginning and 475.3 MB in the end (delta: -118.6 MB). Peak memory consumption was 107.3 MB. Max. memory is 5.3 GB. [2018-02-04 19:34:56,121 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 400.0 MB. Free memory is still 362.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 19:34:56,122 INFO L168 Benchmark]: CACSL2BoogieTranslator took 166.99 ms. Allocated memory is still 400.0 MB. Free memory was 356.7 MB in the beginning and 343.5 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:34:56,122 INFO L168 Benchmark]: Boogie Preprocessor took 26.44 ms. Allocated memory is still 400.0 MB. Free memory was 343.5 MB in the beginning and 340.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 19:34:56,122 INFO L168 Benchmark]: RCFGBuilder took 205.82 ms. Allocated memory is still 400.0 MB. Free memory was 340.9 MB in the beginning and 318.4 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:34:56,122 INFO L168 Benchmark]: TraceAbstraction took 165615.88 ms. Allocated memory was 400.0 MB in the beginning and 626.0 MB in the end (delta: 226.0 MB). Free memory was 318.4 MB in the beginning and 475.3 MB in the end (delta: -157.0 MB). Peak memory consumption was 69.0 MB. Max. memory is 5.3 GB. [2018-02-04 19:34:56,123 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 400.0 MB. Free memory is still 362.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 166.99 ms. Allocated memory is still 400.0 MB. Free memory was 356.7 MB in the beginning and 343.5 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 26.44 ms. Allocated memory is still 400.0 MB. Free memory was 343.5 MB in the beginning and 340.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 205.82 ms. Allocated memory is still 400.0 MB. Free memory was 340.9 MB in the beginning and 318.4 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 165615.88 ms. Allocated memory was 400.0 MB in the beginning and 626.0 MB in the end (delta: 226.0 MB). Free memory was 318.4 MB in the beginning and 475.3 MB in the end (delta: -157.0 MB). Peak memory consumption was 69.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1476]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 13 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 66 locations, 13 error locations. SAFE Result, 165.5s OverallTime, 20 OverallIterations, 1 TraceHistogramMax, 151.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 968 SDtfs, 1001 SDslu, 2891 SDs, 0 SdLazy, 2395 SolverSat, 285 SolverUnsat, 101 SolverUnknown, 0 SolverNotchecked, 15.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 421 GetRequests, 187 SyntacticMatches, 17 SemanticMatches, 217 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 143.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=4, 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, 20 MinimizatonAttempts, 70 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 13.3s InterpolantComputationTime, 865 NumberOfCodeBlocks, 865 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 589 ConstructedInterpolants, 140 QuantifiedInterpolants, 437739 SizeOfPredicates, 62 NumberOfNonLiveVariables, 1124 ConjunctsInSsa, 222 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_19-34-56-130.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_19-34-56-130.csv Received shutdown request...