java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test6_2_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 09:03:01,339 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 09:03:01,341 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 09:03:01,364 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 09:03:01,364 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 09:03:01,365 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 09:03:01,366 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 09:03:01,369 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 09:03:01,371 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 09:03:01,373 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 09:03:01,374 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 09:03:01,374 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 09:03:01,375 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 09:03:01,376 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 09:03:01,389 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 09:03:01,392 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 09:03:01,393 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 09:03:01,395 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 09:03:01,396 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 09:03:01,401 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 09:03:01,404 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 09:03:01,404 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 09:03:01,404 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 09:03:01,405 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 09:03:01,406 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 09:03:01,407 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 09:03:01,413 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 09:03:01,413 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 09:03:01,413 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 09:03:01,414 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 09:03:01,414 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 09:03:01,414 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-31 09:03:01,431 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 09:03:01,432 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 09:03:01,433 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 09:03:01,433 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 09:03:01,433 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 09:03:01,433 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 09:03:01,433 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 09:03:01,434 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 09:03:01,435 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 09:03:01,435 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 09:03:01,435 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 09:03:01,435 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 09:03:01,435 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 09:03:01,436 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 09:03:01,436 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 09:03:01,436 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 09:03:01,436 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 09:03:01,436 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 09:03:01,437 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 09:03:01,437 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 09:03:01,437 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 09:03:01,437 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 09:03:01,437 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 09:03:01,438 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 09:03:01,438 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 09:03:01,439 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 09:03:01,439 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 09:03:01,440 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 09:03:01,440 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 09:03:01,440 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 09:03:01,440 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 09:03:01,440 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 09:03:01,441 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 09:03:01,441 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 09:03:01,498 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 09:03:01,516 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 09:03:01,521 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 09:03:01,523 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 09:03:01,523 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 09:03:01,524 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test6_2_false-valid-free.i [2018-01-31 09:03:01,811 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 09:03:01,818 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-31 09:03:01,820 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 09:03:01,820 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 09:03:01,826 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 09:03:01,827 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:03:01" (1/1) ... [2018-01-31 09:03:01,831 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46a301ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:03:01, skipping insertion in model container [2018-01-31 09:03:01,832 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:03:01" (1/1) ... [2018-01-31 09:03:01,850 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 09:03:01,921 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 09:03:02,075 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 09:03:02,098 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 09:03:02,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:03:02 WrapperNode [2018-01-31 09:03:02,115 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 09:03:02,116 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 09:03:02,116 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 09:03:02,116 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 09:03:02,132 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:03:02" (1/1) ... [2018-01-31 09:03:02,133 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:03:02" (1/1) ... [2018-01-31 09:03:02,145 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:03:02" (1/1) ... [2018-01-31 09:03:02,146 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:03:02" (1/1) ... [2018-01-31 09:03:02,152 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:03:02" (1/1) ... [2018-01-31 09:03:02,159 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:03:02" (1/1) ... [2018-01-31 09:03:02,160 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:03:02" (1/1) ... [2018-01-31 09:03:02,169 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 09:03:02,170 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 09:03:02,170 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 09:03:02,170 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 09:03:02,171 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:03:02" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 09:03:02,233 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 09:03:02,233 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 09:03:02,233 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-31 09:03:02,233 INFO L136 BoogieDeclarations]: Found implementation of procedure f6 [2018-01-31 09:03:02,233 INFO L136 BoogieDeclarations]: Found implementation of procedure g6 [2018-01-31 09:03:02,233 INFO L136 BoogieDeclarations]: Found implementation of procedure probe3_6 [2018-01-31 09:03:02,234 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_6 [2018-01-31 09:03:02,234 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-31 09:03:02,234 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 09:03:02,234 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-31 09:03:02,234 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-31 09:03:02,234 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 09:03:02,234 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 09:03:02,234 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 09:03:02,235 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-31 09:03:02,235 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-31 09:03:02,235 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-31 09:03:02,235 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-31 09:03:02,235 INFO L128 BoogieDeclarations]: Found specification of procedure f6 [2018-01-31 09:03:02,235 INFO L128 BoogieDeclarations]: Found specification of procedure g6 [2018-01-31 09:03:02,235 INFO L128 BoogieDeclarations]: Found specification of procedure probe3_6 [2018-01-31 09:03:02,236 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_6 [2018-01-31 09:03:02,236 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-31 09:03:02,236 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 09:03:02,236 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 09:03:02,236 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 09:03:02,735 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 09:03:02,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:03:02 BoogieIcfgContainer [2018-01-31 09:03:02,736 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 09:03:02,739 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 09:03:02,740 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 09:03:02,743 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 09:03:02,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 09:03:01" (1/3) ... [2018-01-31 09:03:02,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5899621c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:03:02, skipping insertion in model container [2018-01-31 09:03:02,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:03:02" (2/3) ... [2018-01-31 09:03:02,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5899621c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:03:02, skipping insertion in model container [2018-01-31 09:03:02,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:03:02" (3/3) ... [2018-01-31 09:03:02,746 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test6_2_false-valid-free.i [2018-01-31 09:03:02,757 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 09:03:02,763 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-31 09:03:02,814 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 09:03:02,814 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 09:03:02,814 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 09:03:02,814 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 09:03:02,814 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 09:03:02,814 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 09:03:02,815 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 09:03:02,815 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 09:03:02,815 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 09:03:02,829 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2018-01-31 09:03:02,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-01-31 09:03:02,834 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:03:02,834 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-01-31 09:03:02,835 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-31 09:03:02,838 INFO L82 PathProgramCache]: Analyzing trace with hash 120766789, now seen corresponding path program 1 times [2018-01-31 09:03:02,839 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:03:02,840 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:03:02,902 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:02,902 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:03:02,902 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:02,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:03:02,961 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:03:03,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:03:03,087 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:03:03,087 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-31 09:03:03,089 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-31 09:03:03,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-31 09:03:03,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 09:03:03,106 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 3 states. [2018-01-31 09:03:03,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:03:03,528 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2018-01-31 09:03:03,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-31 09:03:03,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-01-31 09:03:03,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:03:03,543 INFO L225 Difference]: With dead ends: 104 [2018-01-31 09:03:03,543 INFO L226 Difference]: Without dead ends: 99 [2018-01-31 09:03:03,545 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-01-31 09:03:03,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-01-31 09:03:03,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 90. [2018-01-31 09:03:03,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-01-31 09:03:03,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2018-01-31 09:03:03,592 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 5 [2018-01-31 09:03:03,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:03:03,592 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2018-01-31 09:03:03,593 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-31 09:03:03,593 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2018-01-31 09:03:03,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-01-31 09:03:03,594 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:03:03,595 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-01-31 09:03:03,596 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-31 09:03:03,596 INFO L82 PathProgramCache]: Analyzing trace with hash 120766790, now seen corresponding path program 1 times [2018-01-31 09:03:03,597 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:03:03,597 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:03:03,598 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:03,598 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:03:03,599 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:03,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:03:03,621 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:03:03,839 WARN L146 SmtUtils]: Spent 144ms on a formula simplification. DAG size of input: 13 DAG size of output 9 [2018-01-31 09:03:03,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:03:03,840 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:03:03,840 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-31 09:03:03,841 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-31 09:03:03,841 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-31 09:03:03,842 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 09:03:03,842 INFO L87 Difference]: Start difference. First operand 90 states and 96 transitions. Second operand 3 states. [2018-01-31 09:03:04,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:03:04,017 INFO L93 Difference]: Finished difference Result 158 states and 169 transitions. [2018-01-31 09:03:04,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-31 09:03:04,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-01-31 09:03:04,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:03:04,022 INFO L225 Difference]: With dead ends: 158 [2018-01-31 09:03:04,022 INFO L226 Difference]: Without dead ends: 156 [2018-01-31 09:03:04,023 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 09:03:04,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-01-31 09:03:04,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 141. [2018-01-31 09:03:04,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-01-31 09:03:04,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 163 transitions. [2018-01-31 09:03:04,062 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 163 transitions. Word has length 5 [2018-01-31 09:03:04,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:03:04,062 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 163 transitions. [2018-01-31 09:03:04,064 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-31 09:03:04,064 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 163 transitions. [2018-01-31 09:03:04,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-31 09:03:04,066 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:03:04,066 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] [2018-01-31 09:03:04,066 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-31 09:03:04,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1076223657, now seen corresponding path program 1 times [2018-01-31 09:03:04,066 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:03:04,066 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:03:04,069 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:04,069 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:03:04,069 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:04,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:03:04,121 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:03:04,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:03:04,314 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:03:04,315 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 09:03:04,315 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:03:04,315 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:03:04,315 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:03:04,315 INFO L87 Difference]: Start difference. First operand 141 states and 163 transitions. Second operand 6 states. [2018-01-31 09:03:05,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:03:05,089 INFO L93 Difference]: Finished difference Result 164 states and 184 transitions. [2018-01-31 09:03:05,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 09:03:05,089 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-01-31 09:03:05,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:03:05,092 INFO L225 Difference]: With dead ends: 164 [2018-01-31 09:03:05,092 INFO L226 Difference]: Without dead ends: 158 [2018-01-31 09:03:05,092 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-01-31 09:03:05,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-01-31 09:03:05,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 146. [2018-01-31 09:03:05,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-01-31 09:03:05,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 171 transitions. [2018-01-31 09:03:05,113 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 171 transitions. Word has length 33 [2018-01-31 09:03:05,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:03:05,114 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 171 transitions. [2018-01-31 09:03:05,114 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:03:05,115 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 171 transitions. [2018-01-31 09:03:05,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-31 09:03:05,116 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:03:05,116 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] [2018-01-31 09:03:05,116 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-31 09:03:05,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1076223658, now seen corresponding path program 1 times [2018-01-31 09:03:05,117 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:03:05,117 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:03:05,118 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:05,118 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:03:05,119 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:05,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:03:05,142 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:03:05,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:03:05,232 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:03:05,232 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 09:03:05,232 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:03:05,233 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:03:05,233 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:03:05,233 INFO L87 Difference]: Start difference. First operand 146 states and 171 transitions. Second operand 6 states. [2018-01-31 09:03:05,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:03:05,297 INFO L93 Difference]: Finished difference Result 168 states and 191 transitions. [2018-01-31 09:03:05,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 09:03:05,298 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-01-31 09:03:05,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:03:05,299 INFO L225 Difference]: With dead ends: 168 [2018-01-31 09:03:05,299 INFO L226 Difference]: Without dead ends: 136 [2018-01-31 09:03:05,300 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:03:05,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-01-31 09:03:05,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 133. [2018-01-31 09:03:05,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-01-31 09:03:05,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 152 transitions. [2018-01-31 09:03:05,317 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 152 transitions. Word has length 33 [2018-01-31 09:03:05,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:03:05,317 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 152 transitions. [2018-01-31 09:03:05,317 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:03:05,318 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 152 transitions. [2018-01-31 09:03:05,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-31 09:03:05,319 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:03:05,319 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-01-31 09:03:05,319 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-31 09:03:05,320 INFO L82 PathProgramCache]: Analyzing trace with hash -36952508, now seen corresponding path program 1 times [2018-01-31 09:03:05,320 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:03:05,320 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:03:05,322 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:05,322 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:03:05,322 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:05,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:03:05,344 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:03:05,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:03:05,401 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:03:05,401 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 09:03:05,401 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:03:05,402 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:03:05,402 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:03:05,402 INFO L87 Difference]: Start difference. First operand 133 states and 152 transitions. Second operand 6 states. [2018-01-31 09:03:05,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:03:05,776 INFO L93 Difference]: Finished difference Result 142 states and 155 transitions. [2018-01-31 09:03:05,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 09:03:05,777 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-01-31 09:03:05,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:03:05,779 INFO L225 Difference]: With dead ends: 142 [2018-01-31 09:03:05,779 INFO L226 Difference]: Without dead ends: 129 [2018-01-31 09:03:05,780 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:03:05,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-01-31 09:03:05,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 125. [2018-01-31 09:03:05,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-31 09:03:05,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 142 transitions. [2018-01-31 09:03:05,792 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 142 transitions. Word has length 32 [2018-01-31 09:03:05,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:03:05,792 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 142 transitions. [2018-01-31 09:03:05,792 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:03:05,792 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 142 transitions. [2018-01-31 09:03:05,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-31 09:03:05,794 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:03:05,794 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:03:05,794 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-31 09:03:05,794 INFO L82 PathProgramCache]: Analyzing trace with hash -255353602, now seen corresponding path program 1 times [2018-01-31 09:03:05,794 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:03:05,794 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:03:05,796 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:05,797 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:03:05,797 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:05,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:03:05,811 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:03:05,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:03:05,875 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:03:05,875 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 09:03:05,876 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 09:03:05,876 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 09:03:05,877 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:03:05,877 INFO L87 Difference]: Start difference. First operand 125 states and 142 transitions. Second operand 5 states. [2018-01-31 09:03:05,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:03:05,925 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2018-01-31 09:03:05,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:03:05,926 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-01-31 09:03:05,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:03:05,927 INFO L225 Difference]: With dead ends: 131 [2018-01-31 09:03:05,927 INFO L226 Difference]: Without dead ends: 129 [2018-01-31 09:03:05,928 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:03:05,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-01-31 09:03:05,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 125. [2018-01-31 09:03:05,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-31 09:03:05,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 140 transitions. [2018-01-31 09:03:05,940 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 140 transitions. Word has length 34 [2018-01-31 09:03:05,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:03:05,940 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 140 transitions. [2018-01-31 09:03:05,941 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 09:03:05,941 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 140 transitions. [2018-01-31 09:03:05,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-31 09:03:05,942 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:03:05,942 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:03:05,942 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-31 09:03:05,942 INFO L82 PathProgramCache]: Analyzing trace with hash -255353601, now seen corresponding path program 1 times [2018-01-31 09:03:05,942 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:03:05,943 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:03:05,944 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:05,944 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:03:05,944 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:05,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:03:05,958 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:03:06,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-01-31 09:03:06,021 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:03:06,022 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 09:03:06,022 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 09:03:06,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 09:03:06,022 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:03:06,023 INFO L87 Difference]: Start difference. First operand 125 states and 140 transitions. Second operand 5 states. [2018-01-31 09:03:06,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:03:06,069 INFO L93 Difference]: Finished difference Result 129 states and 140 transitions. [2018-01-31 09:03:06,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:03:06,070 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-01-31 09:03:06,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:03:06,071 INFO L225 Difference]: With dead ends: 129 [2018-01-31 09:03:06,071 INFO L226 Difference]: Without dead ends: 127 [2018-01-31 09:03:06,072 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:03:06,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-01-31 09:03:06,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2018-01-31 09:03:06,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-31 09:03:06,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 138 transitions. [2018-01-31 09:03:06,082 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 138 transitions. Word has length 34 [2018-01-31 09:03:06,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:03:06,082 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 138 transitions. [2018-01-31 09:03:06,082 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 09:03:06,083 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 138 transitions. [2018-01-31 09:03:06,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-31 09:03:06,084 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:03:06,084 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:03:06,084 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-31 09:03:06,084 INFO L82 PathProgramCache]: Analyzing trace with hash -601347762, now seen corresponding path program 1 times [2018-01-31 09:03:06,084 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:03:06,085 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:03:06,086 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:06,086 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:03:06,086 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:06,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:03:06,102 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:03:06,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:03:06,252 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:03:06,252 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 09:03:06,252 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:03:06,252 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:03:06,253 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:03:06,253 INFO L87 Difference]: Start difference. First operand 125 states and 138 transitions. Second operand 6 states. [2018-01-31 09:03:06,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:03:06,334 INFO L93 Difference]: Finished difference Result 125 states and 138 transitions. [2018-01-31 09:03:06,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 09:03:06,335 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-01-31 09:03:06,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:03:06,336 INFO L225 Difference]: With dead ends: 125 [2018-01-31 09:03:06,336 INFO L226 Difference]: Without dead ends: 123 [2018-01-31 09:03:06,337 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:03:06,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-01-31 09:03:06,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-01-31 09:03:06,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-01-31 09:03:06,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 136 transitions. [2018-01-31 09:03:06,345 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 136 transitions. Word has length 35 [2018-01-31 09:03:06,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:03:06,345 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 136 transitions. [2018-01-31 09:03:06,345 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:03:06,345 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 136 transitions. [2018-01-31 09:03:06,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-31 09:03:06,346 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:03:06,347 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-01-31 09:03:06,347 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-31 09:03:06,347 INFO L82 PathProgramCache]: Analyzing trace with hash -601347761, now seen corresponding path program 1 times [2018-01-31 09:03:06,347 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:03:06,347 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:03:06,349 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:06,349 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:03:06,349 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:06,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:03:06,361 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:03:06,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:03:06,431 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:03:06,431 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 09:03:06,431 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:03:06,431 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:03:06,431 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:03:06,432 INFO L87 Difference]: Start difference. First operand 123 states and 136 transitions. Second operand 6 states. [2018-01-31 09:03:06,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:03:06,725 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions. [2018-01-31 09:03:06,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 09:03:06,726 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-01-31 09:03:06,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:03:06,727 INFO L225 Difference]: With dead ends: 125 [2018-01-31 09:03:06,727 INFO L226 Difference]: Without dead ends: 123 [2018-01-31 09:03:06,727 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:03:06,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-01-31 09:03:06,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2018-01-31 09:03:06,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-01-31 09:03:06,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 134 transitions. [2018-01-31 09:03:06,735 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 134 transitions. Word has length 35 [2018-01-31 09:03:06,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:03:06,736 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 134 transitions. [2018-01-31 09:03:06,736 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:03:06,736 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 134 transitions. [2018-01-31 09:03:06,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-31 09:03:06,738 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:03:06,738 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:03:06,738 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-31 09:03:06,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1756512775, now seen corresponding path program 1 times [2018-01-31 09:03:06,738 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:03:06,738 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:03:06,740 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:06,740 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:03:06,740 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:06,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:03:06,758 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:03:06,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:03:06,904 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:03:06,904 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 09:03:06,905 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 09:03:06,905 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 09:03:06,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:03:06,905 INFO L87 Difference]: Start difference. First operand 121 states and 134 transitions. Second operand 5 states. [2018-01-31 09:03:06,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:03:06,932 INFO L93 Difference]: Finished difference Result 132 states and 137 transitions. [2018-01-31 09:03:06,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:03:06,932 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-01-31 09:03:06,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:03:06,933 INFO L225 Difference]: With dead ends: 132 [2018-01-31 09:03:06,933 INFO L226 Difference]: Without dead ends: 75 [2018-01-31 09:03:06,934 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:03:06,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-31 09:03:06,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-01-31 09:03:06,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-31 09:03:06,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2018-01-31 09:03:06,939 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 42 [2018-01-31 09:03:06,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:03:06,939 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2018-01-31 09:03:06,939 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 09:03:06,940 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2018-01-31 09:03:06,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-31 09:03:06,941 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:03:06,941 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:03:06,941 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-31 09:03:06,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1238794665, now seen corresponding path program 1 times [2018-01-31 09:03:06,942 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:03:06,942 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:03:06,943 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:06,943 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:03:06,943 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:06,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:03:06,972 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:03:07,440 WARN L146 SmtUtils]: Spent 186ms on a formula simplification. DAG size of input: 19 DAG size of output 16 [2018-01-31 09:03:07,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:03:07,522 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:03:07,523 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 09:03:07,523 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 09:03:07,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 09:03:07,524 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:03:07,524 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand 8 states. [2018-01-31 09:03:07,812 WARN L143 SmtUtils]: Spent 136ms on a formula simplification that was a NOOP. DAG size: 27 [2018-01-31 09:03:08,063 WARN L143 SmtUtils]: Spent 146ms on a formula simplification that was a NOOP. DAG size: 27 [2018-01-31 09:03:08,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:03:08,253 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2018-01-31 09:03:08,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-31 09:03:08,253 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2018-01-31 09:03:08,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:03:08,254 INFO L225 Difference]: With dead ends: 82 [2018-01-31 09:03:08,254 INFO L226 Difference]: Without dead ends: 77 [2018-01-31 09:03:08,254 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2018-01-31 09:03:08,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-31 09:03:08,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2018-01-31 09:03:08,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-31 09:03:08,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2018-01-31 09:03:08,260 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 43 [2018-01-31 09:03:08,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:03:08,261 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2018-01-31 09:03:08,261 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 09:03:08,261 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2018-01-31 09:03:08,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-31 09:03:08,261 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:03:08,261 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:03:08,262 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-31 09:03:08,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1238794664, now seen corresponding path program 1 times [2018-01-31 09:03:08,262 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:03:08,262 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:03:08,263 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:08,263 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:03:08,264 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:08,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:03:08,277 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:03:08,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:03:08,441 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:03:08,441 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 09:03:08,441 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 09:03:08,441 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 09:03:08,441 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-01-31 09:03:08,441 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand 7 states. [2018-01-31 09:03:08,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:03:08,681 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2018-01-31 09:03:08,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 09:03:08,681 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2018-01-31 09:03:08,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:03:08,682 INFO L225 Difference]: With dead ends: 76 [2018-01-31 09:03:08,682 INFO L226 Difference]: Without dead ends: 74 [2018-01-31 09:03:08,682 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-01-31 09:03:08,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-31 09:03:08,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-01-31 09:03:08,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-31 09:03:08,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2018-01-31 09:03:08,689 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 43 [2018-01-31 09:03:08,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:03:08,689 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2018-01-31 09:03:08,689 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 09:03:08,690 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2018-01-31 09:03:08,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-31 09:03:08,690 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:03:08,690 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:03:08,691 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-31 09:03:08,691 INFO L82 PathProgramCache]: Analyzing trace with hash -775804051, now seen corresponding path program 1 times [2018-01-31 09:03:08,691 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:03:08,691 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:03:08,692 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:08,692 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:03:08,692 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:08,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:03:08,704 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:03:08,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:03:08,845 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:03:08,845 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 09:03:08,846 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:03:08,846 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:03:08,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:03:08,846 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 6 states. [2018-01-31 09:03:08,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:03:08,997 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-01-31 09:03:08,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 09:03:08,998 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-01-31 09:03:08,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:03:08,999 INFO L225 Difference]: With dead ends: 97 [2018-01-31 09:03:08,999 INFO L226 Difference]: Without dead ends: 72 [2018-01-31 09:03:08,999 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:03:08,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-01-31 09:03:09,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-01-31 09:03:09,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-31 09:03:09,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 71 transitions. [2018-01-31 09:03:09,006 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 71 transitions. Word has length 45 [2018-01-31 09:03:09,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:03:09,007 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 71 transitions. [2018-01-31 09:03:09,007 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:03:09,007 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 71 transitions. [2018-01-31 09:03:09,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-31 09:03:09,008 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:03:09,008 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:03:09,008 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-31 09:03:09,008 INFO L82 PathProgramCache]: Analyzing trace with hash -464589248, now seen corresponding path program 1 times [2018-01-31 09:03:09,008 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:03:09,008 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:03:09,009 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:09,009 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:03:09,009 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:09,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:03:09,021 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:03:09,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:03:09,396 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:03:09,396 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 09:03:09,396 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 09:03:09,396 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 09:03:09,396 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:03:09,397 INFO L87 Difference]: Start difference. First operand 72 states and 71 transitions. Second operand 8 states. [2018-01-31 09:03:09,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:03:09,717 INFO L93 Difference]: Finished difference Result 72 states and 71 transitions. [2018-01-31 09:03:09,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 09:03:09,717 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2018-01-31 09:03:09,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:03:09,718 INFO L225 Difference]: With dead ends: 72 [2018-01-31 09:03:09,718 INFO L226 Difference]: Without dead ends: 71 [2018-01-31 09:03:09,718 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-01-31 09:03:09,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-31 09:03:09,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-01-31 09:03:09,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-31 09:03:09,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 70 transitions. [2018-01-31 09:03:09,725 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 70 transitions. Word has length 45 [2018-01-31 09:03:09,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:03:09,725 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 70 transitions. [2018-01-31 09:03:09,725 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 09:03:09,725 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 70 transitions. [2018-01-31 09:03:09,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-31 09:03:09,726 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:03:09,726 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:03:09,726 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-31 09:03:09,726 INFO L82 PathProgramCache]: Analyzing trace with hash -464589247, now seen corresponding path program 1 times [2018-01-31 09:03:09,726 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:03:09,727 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:03:09,728 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:09,728 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:03:09,728 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:09,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:03:09,739 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:03:10,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:03:10,326 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:03:10,326 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-31 09:03:10,326 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-31 09:03:10,326 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-31 09:03:10,326 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-31 09:03:10,326 INFO L87 Difference]: Start difference. First operand 71 states and 70 transitions. Second operand 10 states. [2018-01-31 09:03:10,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:03:10,741 INFO L93 Difference]: Finished difference Result 71 states and 70 transitions. [2018-01-31 09:03:10,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-31 09:03:10,741 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2018-01-31 09:03:10,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:03:10,742 INFO L225 Difference]: With dead ends: 71 [2018-01-31 09:03:10,742 INFO L226 Difference]: Without dead ends: 70 [2018-01-31 09:03:10,743 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2018-01-31 09:03:10,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-31 09:03:10,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-01-31 09:03:10,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-31 09:03:10,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 69 transitions. [2018-01-31 09:03:10,750 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 69 transitions. Word has length 45 [2018-01-31 09:03:10,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:03:10,751 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 69 transitions. [2018-01-31 09:03:10,751 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-31 09:03:10,751 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 69 transitions. [2018-01-31 09:03:10,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-31 09:03:10,751 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:03:10,752 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:03:10,752 INFO L371 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-31 09:03:10,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1302902606, now seen corresponding path program 1 times [2018-01-31 09:03:10,752 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:03:10,752 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:03:10,753 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:10,753 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:03:10,753 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:10,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:03:10,767 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:03:11,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:03:11,007 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:03:11,007 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-31 09:03:11,008 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-31 09:03:11,008 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-31 09:03:11,008 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-01-31 09:03:11,008 INFO L87 Difference]: Start difference. First operand 70 states and 69 transitions. Second operand 13 states. [2018-01-31 09:03:11,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:03:11,735 INFO L93 Difference]: Finished difference Result 70 states and 69 transitions. [2018-01-31 09:03:11,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-31 09:03:11,735 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2018-01-31 09:03:11,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:03:11,736 INFO L225 Difference]: With dead ends: 70 [2018-01-31 09:03:11,736 INFO L226 Difference]: Without dead ends: 69 [2018-01-31 09:03:11,736 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2018-01-31 09:03:11,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-31 09:03:11,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-01-31 09:03:11,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-01-31 09:03:11,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 68 transitions. [2018-01-31 09:03:11,743 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 68 transitions. Word has length 56 [2018-01-31 09:03:11,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:03:11,744 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 68 transitions. [2018-01-31 09:03:11,744 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-31 09:03:11,744 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 68 transitions. [2018-01-31 09:03:11,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-31 09:03:11,745 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:03:11,745 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:03:11,745 INFO L371 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-31 09:03:11,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1302902607, now seen corresponding path program 1 times [2018-01-31 09:03:11,745 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:03:11,745 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:03:11,746 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:11,747 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:03:11,747 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:11,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:03:11,763 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:03:12,022 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 13 DAG size of output 10 [2018-01-31 09:03:12,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:03:12,112 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:03:12,112 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 09:03:12,112 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 09:03:12,112 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 09:03:12,112 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:03:12,113 INFO L87 Difference]: Start difference. First operand 69 states and 68 transitions. Second operand 8 states. [2018-01-31 09:03:12,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:03:12,463 INFO L93 Difference]: Finished difference Result 69 states and 68 transitions. [2018-01-31 09:03:12,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 09:03:12,463 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2018-01-31 09:03:12,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:03:12,464 INFO L225 Difference]: With dead ends: 69 [2018-01-31 09:03:12,464 INFO L226 Difference]: Without dead ends: 68 [2018-01-31 09:03:12,464 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-01-31 09:03:12,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-31 09:03:12,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-01-31 09:03:12,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-31 09:03:12,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 67 transitions. [2018-01-31 09:03:12,473 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 67 transitions. Word has length 56 [2018-01-31 09:03:12,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:03:12,473 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 67 transitions. [2018-01-31 09:03:12,474 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 09:03:12,474 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 67 transitions. [2018-01-31 09:03:12,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-01-31 09:03:12,474 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:03:12,475 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:03:12,475 INFO L371 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-31 09:03:12,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1735275129, now seen corresponding path program 1 times [2018-01-31 09:03:12,475 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:03:12,475 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:03:12,476 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:12,476 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:03:12,476 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:12,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:03:12,491 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:03:12,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:03:12,603 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:03:12,603 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-31 09:03:12,603 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-31 09:03:12,603 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-31 09:03:12,603 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-01-31 09:03:12,604 INFO L87 Difference]: Start difference. First operand 68 states and 67 transitions. Second operand 12 states. [2018-01-31 09:03:12,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:03:12,876 INFO L93 Difference]: Finished difference Result 68 states and 67 transitions. [2018-01-31 09:03:12,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-31 09:03:12,907 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2018-01-31 09:03:12,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:03:12,908 INFO L225 Difference]: With dead ends: 68 [2018-01-31 09:03:12,908 INFO L226 Difference]: Without dead ends: 67 [2018-01-31 09:03:12,908 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2018-01-31 09:03:12,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-31 09:03:12,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-01-31 09:03:12,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-31 09:03:12,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 66 transitions. [2018-01-31 09:03:12,915 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 66 transitions. Word has length 57 [2018-01-31 09:03:12,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:03:12,916 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 66 transitions. [2018-01-31 09:03:12,916 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-31 09:03:12,916 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 66 transitions. [2018-01-31 09:03:12,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-01-31 09:03:12,916 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:03:12,917 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:03:12,917 INFO L371 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-31 09:03:12,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1735275130, now seen corresponding path program 1 times [2018-01-31 09:03:12,917 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:03:12,917 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:03:12,918 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:12,918 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:03:12,918 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:12,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-31 09:03:12,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-31 09:03:12,999 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-01-31 09:03:13,030 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 7 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-31 09:03:13,031 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-31 09:03:13,032 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 7 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-31 09:03:13,032 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-31 09:03:13,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 09:03:13 BoogieIcfgContainer [2018-01-31 09:03:13,047 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-31 09:03:13,048 INFO L168 Benchmark]: Toolchain (without parser) took 11236.48 ms. Allocated memory was 308.8 MB in the beginning and 546.8 MB in the end (delta: 238.0 MB). Free memory was 267.5 MB in the beginning and 419.0 MB in the end (delta: -151.5 MB). Peak memory consumption was 86.5 MB. Max. memory is 5.3 GB. [2018-01-31 09:03:13,049 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 308.8 MB. Free memory is still 274.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 09:03:13,050 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.24 ms. Allocated memory is still 308.8 MB. Free memory was 267.5 MB in the beginning and 254.6 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:03:13,050 INFO L168 Benchmark]: Boogie Preprocessor took 53.55 ms. Allocated memory is still 308.8 MB. Free memory was 254.6 MB in the beginning and 252.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:03:13,050 INFO L168 Benchmark]: RCFGBuilder took 565.94 ms. Allocated memory is still 308.8 MB. Free memory was 252.6 MB in the beginning and 230.3 MB in the end (delta: 22.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 5.3 GB. [2018-01-31 09:03:13,051 INFO L168 Benchmark]: TraceAbstraction took 10308.02 ms. Allocated memory was 308.8 MB in the beginning and 546.8 MB in the end (delta: 238.0 MB). Free memory was 229.3 MB in the beginning and 419.0 MB in the end (delta: -189.8 MB). Peak memory consumption was 48.3 MB. Max. memory is 5.3 GB. [2018-01-31 09:03:13,052 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.16 ms. Allocated memory is still 308.8 MB. Free memory is still 274.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 296.24 ms. Allocated memory is still 308.8 MB. Free memory was 267.5 MB in the beginning and 254.6 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 53.55 ms. Allocated memory is still 308.8 MB. Free memory was 254.6 MB in the beginning and 252.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 565.94 ms. Allocated memory is still 308.8 MB. Free memory was 252.6 MB in the beginning and 230.3 MB in the end (delta: 22.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 10308.02 ms. Allocated memory was 308.8 MB in the beginning and 546.8 MB in the end (delta: 238.0 MB). Free memory was 229.3 MB in the beginning and 419.0 MB in the end (delta: -189.8 MB). Peak memory consumption was 48.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 7 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 7 could not be translated for associated CType STRUCT#?p~$Pointer$# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: IVAL [\old(a6)=null, \old(a6)=null, a6={7:5}] [L1468] FCALL struct A a6; VAL [a6={8:0}] [L1480] CALL entry_point() VAL [a6={8:0}] [L1472] CALL, EXPR probe3_6(&a6) VAL [a={8:0}, a6={8:0}] [L1444] int ret = - -3; VAL [a={8:0}, a={8:0}, a6={8:0}, ret=3] [L1445] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(size)=4, a6={8:0}] [L1073] COND TRUE __VERIFIER_nondet_int() VAL [\old(size)=4, __VERIFIER_nondet_int()=1, a6={8:0}, size=4] [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=4, a6={8:0}, malloc(size)={9:0}, size=4] [L1074] RET return malloc(size); VAL [\old(size)=4, \result={9:0}, a6={8:0}, malloc(size)={9:0}, size=4] [L1445] EXPR ldv_malloc(sizeof(int)) VAL [a={8:0}, a={8:0}, a6={8:0}, ldv_malloc(sizeof(int))={9:0}, ret=3] [L1445] int *p = (int *)ldv_malloc(sizeof(int)); VAL [a={8:0}, a={8:0}, a6={8:0}, ldv_malloc(sizeof(int))={9:0}, p={9:0}, ret=3] [L1446] COND FALSE !(p==0) VAL [a={8:0}, a={8:0}, a6={8:0}, p={9:0}, ret=3] [L1448] CALL, EXPR f6() VAL [a6={8:0}] [L1435] RET return __VERIFIER_nondet_int(); VAL [\result=0, __VERIFIER_nondet_int()=0, a6={8:0}] [L1448] EXPR f6() VAL [a={8:0}, a={8:0}, a6={8:0}, f6()=0, p={9:0}, ret=3] [L1448] ret = f6() VAL [a={8:0}, a={8:0}, a6={8:0}, f6()=0, p={9:0}, ret=0] [L1449] COND FALSE !(ret<0) VAL [a={8:0}, a={8:0}, a6={8:0}, p={9:0}, ret=0] [L1451] CALL, EXPR g6() VAL [a6={8:0}] [L1439] RET return __VERIFIER_nondet_int(); VAL [\result=0, __VERIFIER_nondet_int()=0, a6={8:0}] [L1451] EXPR g6() VAL [a={8:0}, a={8:0}, a6={8:0}, g6()=0, p={9:0}, ret=0] [L1451] ret = g6() VAL [a={8:0}, a={8:0}, a6={8:0}, g6()=0, p={9:0}, ret=0] [L1452] COND FALSE !(ret<0) VAL [a={8:0}, a={8:0}, a6={8:0}, p={9:0}, ret=0] [L1454] FCALL a->p = p VAL [a={8:0}, a={8:0}, a6={8:0}, p={9:0}, ret=0] [L1455] FCALL free(p) VAL [a={8:0}, a={8:0}, a6={8:0}, p={9:0}, ret=0] [L1456] RET return 0; VAL [\result=0, a={8:0}, a={8:0}, a6={8:0}, p={9:0}, ret=0] [L1472] EXPR probe3_6(&a6) VAL [a6={8:0}, probe3_6(&a6)=0] [L1472] int ret = probe3_6(&a6); VAL [a6={8:0}, probe3_6(&a6)=0, ret=0] [L1473] COND TRUE ret==0 VAL [a6={8:0}, ret=0] [L1474] CALL disconnect_6(&a6) VAL [a={8:0}, a6={8:0}] [L1464] EXPR, FCALL a->p VAL [a={8:0}, a={8:0}, a->p={9:0}, a6={8:0}] [L1464] FCALL free(a->p) VAL [a={8:0}, a={8:0}, a->p={9:0}, a6={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 87 locations, 15 error locations. UNSAFE Result, 10.2s OverallTime, 19 OverallIterations, 1 TraceHistogramMax, 5.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1257 SDtfs, 1085 SDslu, 3673 SDs, 0 SdLazy, 1711 SolverSat, 231 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 210 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 52 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 735 NumberOfCodeBlocks, 735 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 660 ConstructedInterpolants, 0 QuantifiedInterpolants, 150279 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-31_09-03-13-061.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-31_09-03-13-061.csv Received shutdown request...