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_1_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 19:14:44,748 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 19:14:44,749 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 19:14:44,760 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 19:14:44,761 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 19:14:44,761 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 19:14:44,762 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 19:14:44,763 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 19:14:44,764 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 19:14:44,765 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 19:14:44,766 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 19:14:44,766 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 19:14:44,767 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 19:14:44,768 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 19:14:44,768 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 19:14:44,770 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 19:14:44,772 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 19:14:44,773 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 19:14:44,774 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 19:14:44,775 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 19:14:44,777 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 19:14:44,777 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 19:14:44,777 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 19:14:44,778 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 19:14:44,779 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 19:14:44,780 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 19:14:44,780 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 19:14:44,781 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 19:14:44,781 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 19:14:44,781 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 19:14:44,781 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 19:14:44,782 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:14:44,792 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 19:14:44,792 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 19:14:44,793 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 19:14:44,793 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 19:14:44,794 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 19:14:44,794 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 19:14:44,794 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 19:14:44,794 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 19:14:44,794 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 19:14:44,794 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 19:14:44,795 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 19:14:44,795 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 19:14:44,795 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 19:14:44,795 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 19:14:44,795 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 19:14:44,795 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 19:14:44,796 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 19:14:44,796 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 19:14:44,796 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 19:14:44,796 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 19:14:44,796 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 19:14:44,796 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 19:14:44,797 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 19:14:44,797 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 19:14:44,826 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 19:14:44,836 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 19:14:44,839 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 19:14:44,840 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 19:14:44,840 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 19:14:44,841 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test6_1_false-valid-memtrack_true-termination.i [2018-02-04 19:14:44,997 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 19:14:44,998 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 19:14:44,999 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 19:14:44,999 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 19:14:45,003 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 19:14:45,003 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 07:14:44" (1/1) ... [2018-02-04 19:14:45,005 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b089594 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:14:45, skipping insertion in model container [2018-02-04 19:14:45,005 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 07:14:44" (1/1) ... [2018-02-04 19:14:45,015 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 19:14:45,049 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 19:14:45,140 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 19:14:45,153 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 19:14:45,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:14:45 WrapperNode [2018-02-04 19:14:45,159 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 19:14:45,160 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 19:14:45,160 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 19:14:45,160 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 19:14:45,172 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:14:45" (1/1) ... [2018-02-04 19:14:45,172 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:14:45" (1/1) ... [2018-02-04 19:14:45,180 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:14:45" (1/1) ... [2018-02-04 19:14:45,180 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:14:45" (1/1) ... [2018-02-04 19:14:45,183 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:14:45" (1/1) ... [2018-02-04 19:14:45,185 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:14:45" (1/1) ... [2018-02-04 19:14:45,186 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:14:45" (1/1) ... [2018-02-04 19:14:45,188 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 19:14:45,188 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 19:14:45,188 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 19:14:45,188 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 19:14:45,189 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:14:45" (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:14:45,225 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 19:14:45,226 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 19:14:45,226 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 19:14:45,226 INFO L136 BoogieDeclarations]: Found implementation of procedure f6 [2018-02-04 19:14:45,226 INFO L136 BoogieDeclarations]: Found implementation of procedure g6 [2018-02-04 19:14:45,226 INFO L136 BoogieDeclarations]: Found implementation of procedure probe2_6 [2018-02-04 19:14:45,226 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_6 [2018-02-04 19:14:45,226 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 19:14:45,226 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 19:14:45,226 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 19:14:45,226 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 19:14:45,226 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 19:14:45,226 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 19:14:45,227 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 19:14:45,227 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 19:14:45,227 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 19:14:45,227 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 19:14:45,227 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 19:14:45,227 INFO L128 BoogieDeclarations]: Found specification of procedure f6 [2018-02-04 19:14:45,227 INFO L128 BoogieDeclarations]: Found specification of procedure g6 [2018-02-04 19:14:45,227 INFO L128 BoogieDeclarations]: Found specification of procedure probe2_6 [2018-02-04 19:14:45,227 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_6 [2018-02-04 19:14:45,227 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 19:14:45,227 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 19:14:45,227 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 19:14:45,227 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 19:14:45,414 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 19:14:45,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 07:14:45 BoogieIcfgContainer [2018-02-04 19:14:45,414 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 19:14:45,415 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 19:14:45,415 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 19:14:45,416 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 19:14:45,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 07:14:44" (1/3) ... [2018-02-04 19:14:45,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18bd9d42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 07:14:45, skipping insertion in model container [2018-02-04 19:14:45,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:14:45" (2/3) ... [2018-02-04 19:14:45,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18bd9d42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 07:14:45, skipping insertion in model container [2018-02-04 19:14:45,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 07:14:45" (3/3) ... [2018-02-04 19:14:45,420 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test6_1_false-valid-memtrack_true-termination.i [2018-02-04 19:14:45,425 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 19:14:45,429 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-02-04 19:14:45,460 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 19:14:45,461 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 19:14:45,461 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 19:14:45,461 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 19:14:45,461 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 19:14:45,461 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 19:14:45,461 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 19:14:45,461 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 19:14:45,462 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 19:14:45,477 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-02-04 19:14:45,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 19:14:45,483 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:14:45,483 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 19:14:45,484 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-02-04 19:14:45,487 INFO L82 PathProgramCache]: Analyzing trace with hash 3232357, now seen corresponding path program 1 times [2018-02-04 19:14:45,488 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:14:45,489 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:14:45,523 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:14:45,523 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:14:45,523 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:14:45,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:14:45,557 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:14:45,588 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:14:45,589 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:14:45,590 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 19:14:45,591 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 19:14:45,599 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 19:14:45,599 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 19:14:45,601 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 3 states. [2018-02-04 19:14:45,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:14:45,689 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2018-02-04 19:14:45,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 19:14:45,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-04 19:14:45,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:14:45,744 INFO L225 Difference]: With dead ends: 79 [2018-02-04 19:14:45,745 INFO L226 Difference]: Without dead ends: 76 [2018-02-04 19:14:45,746 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:14:45,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-04 19:14:45,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 67. [2018-02-04 19:14:45,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-04 19:14:45,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-02-04 19:14:45,775 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 4 [2018-02-04 19:14:45,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:14:45,775 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-02-04 19:14:45,775 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 19:14:45,775 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-02-04 19:14:45,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 19:14:45,775 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:14:45,775 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 19:14:45,775 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-02-04 19:14:45,776 INFO L82 PathProgramCache]: Analyzing trace with hash 3232358, now seen corresponding path program 1 times [2018-02-04 19:14:45,776 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:14:45,776 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:14:45,777 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:14:45,777 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:14:45,777 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:14:45,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:14:45,791 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:14:45,843 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:14:45,844 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:14:45,844 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 19:14:45,845 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 19:14:45,845 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 19:14:45,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 19:14:45,846 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 3 states. [2018-02-04 19:14:45,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:14:45,914 INFO L93 Difference]: Finished difference Result 116 states and 126 transitions. [2018-02-04 19:14:45,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 19:14:45,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-04 19:14:45,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:14:45,916 INFO L225 Difference]: With dead ends: 116 [2018-02-04 19:14:45,916 INFO L226 Difference]: Without dead ends: 116 [2018-02-04 19:14:45,917 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:14:45,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-04 19:14:45,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 103. [2018-02-04 19:14:45,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-04 19:14:45,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 123 transitions. [2018-02-04 19:14:45,926 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 123 transitions. Word has length 4 [2018-02-04 19:14:45,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:14:45,926 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 123 transitions. [2018-02-04 19:14:45,926 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 19:14:45,926 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 123 transitions. [2018-02-04 19:14:45,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 19:14:45,927 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:14:45,927 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:14:45,927 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-02-04 19:14:45,927 INFO L82 PathProgramCache]: Analyzing trace with hash -293037669, now seen corresponding path program 1 times [2018-02-04 19:14:45,928 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:14:45,928 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:14:45,929 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:14:45,929 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:14:45,929 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:14:45,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:14:45,948 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:14:46,021 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:14:46,022 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:14:46,022 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:14:46,022 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:14:46,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:14:46,025 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:14:46,025 INFO L87 Difference]: Start difference. First operand 103 states and 123 transitions. Second operand 6 states. [2018-02-04 19:14:46,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:14:46,178 INFO L93 Difference]: Finished difference Result 122 states and 141 transitions. [2018-02-04 19:14:46,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 19:14:46,178 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-04 19:14:46,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:14:46,180 INFO L225 Difference]: With dead ends: 122 [2018-02-04 19:14:46,180 INFO L226 Difference]: Without dead ends: 118 [2018-02-04 19:14:46,180 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:14:46,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-02-04 19:14:46,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 108. [2018-02-04 19:14:46,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-04 19:14:46,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 131 transitions. [2018-02-04 19:14:46,190 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 131 transitions. Word has length 24 [2018-02-04 19:14:46,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:14:46,190 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 131 transitions. [2018-02-04 19:14:46,190 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:14:46,190 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 131 transitions. [2018-02-04 19:14:46,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 19:14:46,191 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:14:46,191 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:14:46,191 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-02-04 19:14:46,191 INFO L82 PathProgramCache]: Analyzing trace with hash -293037668, now seen corresponding path program 1 times [2018-02-04 19:14:46,192 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:14:46,192 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:14:46,193 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:14:46,193 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:14:46,193 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:14:46,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:14:46,210 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:14:46,254 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:14:46,255 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:14:46,255 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 19:14:46,255 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:14:46,256 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:14:46,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:14:46,256 INFO L87 Difference]: Start difference. First operand 108 states and 131 transitions. Second operand 6 states. [2018-02-04 19:14:46,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:14:46,286 INFO L93 Difference]: Finished difference Result 120 states and 142 transitions. [2018-02-04 19:14:46,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:14:46,287 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-04 19:14:46,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:14:46,288 INFO L225 Difference]: With dead ends: 120 [2018-02-04 19:14:46,288 INFO L226 Difference]: Without dead ends: 116 [2018-02-04 19:14:46,288 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:14:46,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-04 19:14:46,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2018-02-04 19:14:46,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-04 19:14:46,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 134 transitions. [2018-02-04 19:14:46,297 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 134 transitions. Word has length 24 [2018-02-04 19:14:46,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:14:46,298 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 134 transitions. [2018-02-04 19:14:46,298 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:14:46,298 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 134 transitions. [2018-02-04 19:14:46,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 19:14:46,299 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:14:46,299 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:14:46,299 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-02-04 19:14:46,299 INFO L82 PathProgramCache]: Analyzing trace with hash -2126392044, now seen corresponding path program 1 times [2018-02-04 19:14:46,299 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:14:46,299 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:14:46,300 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:14:46,300 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:14:46,300 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:14:46,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:14:46,314 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:14:46,365 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:14:46,365 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:14:46,365 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:14:46,366 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 19:14:46,366 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 19:14:46,366 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:14:46,366 INFO L87 Difference]: Start difference. First operand 112 states and 134 transitions. Second operand 5 states. [2018-02-04 19:14:46,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:14:46,386 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2018-02-04 19:14:46,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 19:14:46,386 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-02-04 19:14:46,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:14:46,387 INFO L225 Difference]: With dead ends: 77 [2018-02-04 19:14:46,387 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 19:14:46,387 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:14:46,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 19:14:46,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-02-04 19:14:46,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-04 19:14:46,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2018-02-04 19:14:46,391 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 24 [2018-02-04 19:14:46,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:14:46,391 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2018-02-04 19:14:46,391 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 19:14:46,391 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2018-02-04 19:14:46,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 19:14:46,392 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:14:46,392 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:14:46,392 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-02-04 19:14:46,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1815899569, now seen corresponding path program 1 times [2018-02-04 19:14:46,392 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:14:46,393 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:14:46,394 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:14:46,394 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:14:46,394 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:14:46,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:14:46,407 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:14:46,444 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:14:46,444 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:14:46,444 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 19:14:46,444 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:14:46,445 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:14:46,445 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:14:46,445 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand 6 states. [2018-02-04 19:14:46,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:14:46,462 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2018-02-04 19:14:46,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:14:46,462 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-04 19:14:46,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:14:46,463 INFO L225 Difference]: With dead ends: 69 [2018-02-04 19:14:46,463 INFO L226 Difference]: Without dead ends: 69 [2018-02-04 19:14:46,463 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:14:46,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-04 19:14:46,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-02-04 19:14:46,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-04 19:14:46,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2018-02-04 19:14:46,467 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 24 [2018-02-04 19:14:46,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:14:46,468 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2018-02-04 19:14:46,468 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:14:46,468 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2018-02-04 19:14:46,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 19:14:46,469 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:14:46,469 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:14:46,469 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-02-04 19:14:46,469 INFO L82 PathProgramCache]: Analyzing trace with hash -510641866, now seen corresponding path program 1 times [2018-02-04 19:14:46,469 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:14:46,469 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:14:46,470 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:14:46,471 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:14:46,471 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:14:46,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:14:46,482 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:14:46,516 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:14:46,516 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:14:46,516 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:14:46,517 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:14:46,517 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:14:46,517 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:14:46,517 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand 6 states. [2018-02-04 19:14:46,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:14:46,542 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2018-02-04 19:14:46,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:14:46,542 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-04 19:14:46,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:14:46,542 INFO L225 Difference]: With dead ends: 68 [2018-02-04 19:14:46,543 INFO L226 Difference]: Without dead ends: 68 [2018-02-04 19:14:46,543 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:14:46,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-04 19:14:46,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-02-04 19:14:46,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-04 19:14:46,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2018-02-04 19:14:46,545 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 26 [2018-02-04 19:14:46,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:14:46,545 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2018-02-04 19:14:46,545 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:14:46,545 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2018-02-04 19:14:46,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 19:14:46,545 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:14:46,545 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:14:46,546 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-02-04 19:14:46,546 INFO L82 PathProgramCache]: Analyzing trace with hash -510641865, now seen corresponding path program 1 times [2018-02-04 19:14:46,546 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:14:46,546 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:14:46,546 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:14:46,547 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:14:46,547 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:14:46,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:14:46,556 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:14:46,597 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:14:46,597 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:14:46,597 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:14:46,598 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:14:46,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:14:46,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:14:46,598 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand 6 states. [2018-02-04 19:14:46,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:14:46,660 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2018-02-04 19:14:46,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:14:46,661 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-04 19:14:46,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:14:46,661 INFO L225 Difference]: With dead ends: 67 [2018-02-04 19:14:46,662 INFO L226 Difference]: Without dead ends: 67 [2018-02-04 19:14:46,662 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:14:46,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-04 19:14:46,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-02-04 19:14:46,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-04 19:14:46,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-02-04 19:14:46,665 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 26 [2018-02-04 19:14:46,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:14:46,665 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-02-04 19:14:46,665 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:14:46,665 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-02-04 19:14:46,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 19:14:46,666 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:14:46,666 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:14:46,666 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-02-04 19:14:46,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1858419564, now seen corresponding path program 1 times [2018-02-04 19:14:46,667 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:14:46,667 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:14:46,668 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:14:46,668 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:14:46,668 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:14:46,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:14:46,683 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:14:46,689 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:14:46,689 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:14:46,690 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:14:46,691 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:14:46,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:14:46,729 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:14:46,758 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:14:46,759 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:46,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:14:46,762 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 19:14:46,800 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:46,801 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:46,803 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:14:46,804 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:46,809 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:14:46,809 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-02-04 19:14:46,901 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:14:46,901 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:14:46,901 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 19:14:46,910 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 19:14:46,910 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 19:14:46,910 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 19:14:46,910 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 9 states. [2018-02-04 19:14:47,232 WARN L143 SmtUtils]: Spent 176ms on a formula simplification that was a NOOP. DAG size: 18 [2018-02-04 19:14:47,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:14:47,632 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2018-02-04 19:14:47,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 19:14:47,632 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-02-04 19:14:47,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:14:47,633 INFO L225 Difference]: With dead ends: 75 [2018-02-04 19:14:47,633 INFO L226 Difference]: Without dead ends: 75 [2018-02-04 19:14:47,633 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:14:47,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-04 19:14:47,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 66. [2018-02-04 19:14:47,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-04 19:14:47,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2018-02-04 19:14:47,636 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 32 [2018-02-04 19:14:47,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:14:47,636 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2018-02-04 19:14:47,636 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 19:14:47,636 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2018-02-04 19:14:47,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 19:14:47,636 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:14:47,637 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:14:47,639 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-02-04 19:14:47,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1858419565, now seen corresponding path program 1 times [2018-02-04 19:14:47,639 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:14:47,639 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:14:47,640 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:14:47,640 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:14:47,640 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:14:47,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:14:47,653 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:14:47,658 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:14:47,658 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:14:47,659 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:14:47,660 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:14:47,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:14:47,685 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:14:47,700 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:14:47,701 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:47,750 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:14:47,750 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:47,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:14:47,755 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 19:14:47,854 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:47,854 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:47,855 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:14:47,855 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:47,880 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:47,880 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:47,881 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:14:47,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:47,906 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:47,907 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:14:47,908 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:47,948 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:47,949 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:47,950 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:14:47,950 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:47,971 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:14:47,971 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:67, output treesize:49 [2018-02-04 19:14:56,068 WARN L143 SmtUtils]: Spent 2014ms on a formula simplification that was a NOOP. DAG size: 32 [2018-02-04 19:14:56,173 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:14:56,174 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:14:56,174 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 19:14:56,174 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 19:14:56,174 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 19:14:56,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=51, Unknown=5, NotChecked=0, Total=72 [2018-02-04 19:14:56,175 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand 9 states. [2018-02-04 19:14:57,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:14:57,034 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2018-02-04 19:14:57,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 19:14:57,035 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-02-04 19:14:57,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:14:57,035 INFO L225 Difference]: With dead ends: 75 [2018-02-04 19:14:57,035 INFO L226 Difference]: Without dead ends: 75 [2018-02-04 19:14:57,035 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=88, Invalid=287, Unknown=5, NotChecked=0, Total=380 [2018-02-04 19:14:57,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-04 19:14:57,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 65. [2018-02-04 19:14:57,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-02-04 19:14:57,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-02-04 19:14:57,038 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 32 [2018-02-04 19:14:57,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:14:57,038 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2018-02-04 19:14:57,038 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 19:14:57,038 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-02-04 19:14:57,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 19:14:57,039 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:14:57,039 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:14:57,039 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-02-04 19:14:57,039 INFO L82 PathProgramCache]: Analyzing trace with hash 758520105, now seen corresponding path program 1 times [2018-02-04 19:14:57,039 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:14:57,040 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:14:57,040 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:14:57,040 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:14:57,040 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:14:57,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:14:57,049 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:14:57,052 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:14:57,053 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:14:57,053 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:14:57,053 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:14:57,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:14:57,072 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:14:57,079 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:14:57,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:57,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:14:57,081 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 19:14:57,084 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:14:57,085 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:57,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:14:57,086 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2018-02-04 19:14:57,140 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:57,141 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:14:57,141 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:57,148 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:57,148 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:14:57,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:57,152 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:14:57,153 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:16 [2018-02-04 19:14:57,200 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:57,203 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:57,205 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:57,206 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:14:57,207 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:57,217 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:14:57,217 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:15 [2018-02-04 19:14:57,240 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:14:57,240 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:14:57,240 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 19:14:57,241 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 19:14:57,241 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 19:14:57,241 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-02-04 19:14:57,241 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 12 states. [2018-02-04 19:14:57,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:14:57,497 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2018-02-04 19:14:57,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 19:14:57,497 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2018-02-04 19:14:57,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:14:57,498 INFO L225 Difference]: With dead ends: 75 [2018-02-04 19:14:57,498 INFO L226 Difference]: Without dead ends: 75 [2018-02-04 19:14:57,498 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2018-02-04 19:14:57,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-04 19:14:57,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 66. [2018-02-04 19:14:57,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-04 19:14:57,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2018-02-04 19:14:57,501 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 32 [2018-02-04 19:14:57,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:14:57,501 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2018-02-04 19:14:57,501 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 19:14:57,501 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2018-02-04 19:14:57,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 19:14:57,502 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:14:57,502 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:14:57,502 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-02-04 19:14:57,502 INFO L82 PathProgramCache]: Analyzing trace with hash 758520106, now seen corresponding path program 1 times [2018-02-04 19:14:57,502 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:14:57,502 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:14:57,503 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:14:57,503 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:14:57,503 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:14:57,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:14:57,511 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:14:57,516 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:14:57,516 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:14:57,516 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:14:57,517 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:14:57,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:14:57,534 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:14:57,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 6 treesize of output 5 [2018-02-04 19:14:57,538 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:57,544 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:14:57,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:57,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:14:57,550 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 19:14:57,561 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:14:57,562 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:57,567 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:14:57,567 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:57,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:14:57,570 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:10 [2018-02-04 19:14:57,620 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:14:57,620 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:57,632 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:14:57,632 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:57,653 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:14:57,654 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:57,691 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:14:57,692 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:57,702 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:14:57,702 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:47, output treesize:35 [2018-02-04 19:14:57,754 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:57,754 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:57,755 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:14:57,756 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:57,776 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:14:57,776 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:57,791 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:57,792 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:57,792 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:14:57,793 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:57,852 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:57,853 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:57,854 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:14:57,854 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:57,868 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:14:57,868 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:67, output treesize:49 [2018-02-04 19:14:57,899 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:14:57,900 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:14:57,900 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 19:14:57,900 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 19:14:57,900 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 19:14:57,900 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 19:14:57,900 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand 7 states. [2018-02-04 19:14:58,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:14:58,330 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-02-04 19:14:58,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 19:14:58,330 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2018-02-04 19:14:58,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:14:58,331 INFO L225 Difference]: With dead ends: 69 [2018-02-04 19:14:58,331 INFO L226 Difference]: Without dead ends: 69 [2018-02-04 19:14:58,331 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-02-04 19:14:58,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-04 19:14:58,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 64. [2018-02-04 19:14:58,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-04 19:14:58,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2018-02-04 19:14:58,333 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 32 [2018-02-04 19:14:58,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:14:58,333 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2018-02-04 19:14:58,333 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 19:14:58,333 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2018-02-04 19:14:58,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 19:14:58,334 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:14:58,334 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:14:58,334 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-02-04 19:14:58,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1206669578, now seen corresponding path program 1 times [2018-02-04 19:14:58,334 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:14:58,334 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:14:58,335 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:14:58,335 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:14:58,335 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:14:58,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:14:58,341 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:14:58,365 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:14:58,365 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:14:58,365 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 19:14:58,366 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:14:58,366 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:14:58,366 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:14:58,366 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand 6 states. [2018-02-04 19:14:58,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:14:58,381 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-02-04 19:14:58,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:14:58,381 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-02-04 19:14:58,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:14:58,381 INFO L225 Difference]: With dead ends: 67 [2018-02-04 19:14:58,382 INFO L226 Difference]: Without dead ends: 67 [2018-02-04 19:14:58,382 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:14:58,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-04 19:14:58,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 60. [2018-02-04 19:14:58,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 19:14:58,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-02-04 19:14:58,384 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 34 [2018-02-04 19:14:58,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:14:58,384 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-02-04 19:14:58,384 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:14:58,384 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-02-04 19:14:58,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 19:14:58,385 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:14:58,385 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:14:58,385 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-02-04 19:14:58,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1249519611, now seen corresponding path program 1 times [2018-02-04 19:14:58,386 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:14:58,386 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:14:58,387 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:14:58,387 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:14:58,387 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:14:58,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:14:58,395 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:14:58,398 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:14:58,398 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:14:58,399 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:14:58,399 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:14:58,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:14:58,418 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:14:58,457 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:58,458 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:14:58,458 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:58,464 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:58,464 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:14:58,464 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:58,469 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:14:58,469 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:16 [2018-02-04 19:14:58,509 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:14:58,509 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:14:58,509 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 19:14:58,509 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 19:14:58,510 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 19:14:58,510 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-02-04 19:14:58,510 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 10 states. [2018-02-04 19:14:58,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:14:58,668 INFO L93 Difference]: Finished difference Result 68 states and 69 transitions. [2018-02-04 19:14:58,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 19:14:58,668 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-02-04 19:14:58,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:14:58,668 INFO L225 Difference]: With dead ends: 68 [2018-02-04 19:14:58,668 INFO L226 Difference]: Without dead ends: 58 [2018-02-04 19:14:58,669 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-02-04 19:14:58,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-04 19:14:58,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-02-04 19:14:58,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-04 19:14:58,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2018-02-04 19:14:58,670 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 35 [2018-02-04 19:14:58,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:14:58,670 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2018-02-04 19:14:58,670 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 19:14:58,670 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-02-04 19:14:58,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 19:14:58,671 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:14:58,671 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:14:58,671 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-02-04 19:14:58,671 INFO L82 PathProgramCache]: Analyzing trace with hash -2099227651, now seen corresponding path program 1 times [2018-02-04 19:14:58,671 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:14:58,672 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:14:58,672 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:14:58,672 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:14:58,672 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:14:58,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 19:14:58,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 19:14:58,705 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 19:14:58,718 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-04 19:14:58,721 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-02-04 19:14:58,722 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 8 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-02-04 19:14:58,722 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-02-04 19:14:58,722 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 8 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-02-04 19:14:58,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 07:14:58 BoogieIcfgContainer [2018-02-04 19:14:58,731 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 19:14:58,732 INFO L168 Benchmark]: Toolchain (without parser) took 13734.31 ms. Allocated memory was 389.0 MB in the beginning and 663.2 MB in the end (delta: 274.2 MB). Free memory was 345.7 MB in the beginning and 542.5 MB in the end (delta: -196.8 MB). Peak memory consumption was 77.4 MB. Max. memory is 5.3 GB. [2018-02-04 19:14:58,733 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 389.0 MB. Free memory is still 352.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 19:14:58,733 INFO L168 Benchmark]: CACSL2BoogieTranslator took 160.98 ms. Allocated memory is still 389.0 MB. Free memory was 345.7 MB in the beginning and 332.4 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:14:58,733 INFO L168 Benchmark]: Boogie Preprocessor took 27.93 ms. Allocated memory is still 389.0 MB. Free memory was 332.4 MB in the beginning and 331.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 19:14:58,733 INFO L168 Benchmark]: RCFGBuilder took 226.18 ms. Allocated memory is still 389.0 MB. Free memory was 331.1 MB in the beginning and 308.6 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:14:58,734 INFO L168 Benchmark]: TraceAbstraction took 13316.56 ms. Allocated memory was 389.0 MB in the beginning and 663.2 MB in the end (delta: 274.2 MB). Free memory was 308.6 MB in the beginning and 542.5 MB in the end (delta: -233.9 MB). Peak memory consumption was 40.3 MB. Max. memory is 5.3 GB. [2018-02-04 19:14:58,734 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.13 ms. Allocated memory is still 389.0 MB. Free memory is still 352.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 160.98 ms. Allocated memory is still 389.0 MB. Free memory was 345.7 MB in the beginning and 332.4 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 27.93 ms. Allocated memory is still 389.0 MB. Free memory was 332.4 MB in the beginning and 331.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 226.18 ms. Allocated memory is still 389.0 MB. Free memory was 331.1 MB in the beginning and 308.6 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 13316.56 ms. Allocated memory was 389.0 MB in the beginning and 663.2 MB in the end (delta: 274.2 MB). Free memory was 308.6 MB in the beginning and 542.5 MB in the end (delta: -233.9 MB). Peak memory consumption was 40.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 8 could not be translated for associated CType STRUCT#?p~$Pointer$# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 8 could not be translated for associated CType STRUCT#?p~$Pointer$# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1478]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: IVAL [\old(a6)=null, \old(a6)=null, a6={8:5}] [L1467] FCALL struct A a6; VAL [a6={9:0}] [L1479] CALL entry_point() VAL [a6={9:0}] [L1471] CALL, EXPR probe2_6(&a6) VAL [a={9:0}, a6={9:0}] [L1444] int ret = - -3; VAL [a={9:0}, a={9:0}, a6={9:0}, ret=3] [L1445] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(size)=4, a6={9:0}] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=4, a6={9:0}, malloc(size)={7:0}, size=4] [L1074] RET return malloc(size); VAL [\old(size)=4, \result={7:0}, a6={9:0}, malloc(size)={7:0}, size=4] [L1445] EXPR ldv_malloc(sizeof(int)) VAL [a={9:0}, a={9:0}, a6={9:0}, ldv_malloc(sizeof(int))={7:0}, ret=3] [L1445] int *p = (int *)ldv_malloc(sizeof(int)); [L1446] COND FALSE !(p==0) VAL [a={9:0}, a={9:0}, a6={9:0}, p={7:0}, ret=3] [L1448] CALL, EXPR f6() VAL [a6={9:0}] [L1435] RET return __VERIFIER_nondet_int(); [L1448] EXPR f6() VAL [a={9:0}, a={9:0}, a6={9:0}, f6()=0, p={7:0}, ret=3] [L1448] ret = f6() [L1449] COND FALSE !(ret<0) VAL [a={9:0}, a={9:0}, a6={9:0}, p={7:0}, ret=0] [L1451] CALL, EXPR g6() VAL [a6={9:0}] [L1439] RET return __VERIFIER_nondet_int(); [L1451] EXPR g6() VAL [a={9:0}, a={9:0}, a6={9:0}, g6()=-1, p={7:0}, ret=0] [L1451] ret = g6() [L1452] COND TRUE ret<0 [L1453] RET return ret; VAL [\result=-1, a={9:0}, a={9:0}, a6={9:0}, p={7:0}, ret=-1] [L1471] EXPR probe2_6(&a6) VAL [a6={9:0}, probe2_6(&a6)=-1] [L1471] int ret = probe2_6(&a6); [L1472] COND FALSE !(ret==0) VAL [a6={9:0}, ret=-1] [L1475] RET, FCALL a6.p = 0 VAL [a6={9:0}, ret=-1] [L1479] entry_point() VAL [a6={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 66 locations, 13 error locations. UNSAFE Result, 13.2s OverallTime, 15 OverallIterations, 1 TraceHistogramMax, 2.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 744 SDtfs, 762 SDslu, 1933 SDs, 0 SdLazy, 1329 SolverSat, 204 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 248 GetRequests, 131 SyntacticMatches, 9 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 9.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, 14 MinimizatonAttempts, 76 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 9.7s InterpolantComputationTime, 555 NumberOfCodeBlocks, 555 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 339 ConstructedInterpolants, 75 QuantifiedInterpolants, 104485 SizeOfPredicates, 32 NumberOfNonLiveVariables, 738 ConjunctsInSsa, 115 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_19-14-58-739.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_19-14-58-739.csv Received shutdown request...