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_1_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-30 00:09:23,787 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 00:09:23,789 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 00:09:23,803 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 00:09:23,803 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 00:09:23,804 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 00:09:23,805 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 00:09:23,807 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 00:09:23,808 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 00:09:23,809 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 00:09:23,809 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 00:09:23,809 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 00:09:23,810 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 00:09:23,811 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 00:09:23,812 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 00:09:23,814 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 00:09:23,816 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 00:09:23,819 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 00:09:23,820 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 00:09:23,821 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 00:09:23,823 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 00:09:23,824 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 00:09:23,824 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 00:09:23,825 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 00:09:23,826 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 00:09:23,827 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 00:09:23,827 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 00:09:23,828 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 00:09:23,828 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 00:09:23,829 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 00:09:23,829 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 00:09:23,829 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-30 00:09:23,839 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 00:09:23,840 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 00:09:23,841 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 00:09:23,841 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 00:09:23,841 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 00:09:23,841 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 00:09:23,841 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 00:09:23,842 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 00:09:23,842 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 00:09:23,843 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-30 00:09:23,843 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 00:09:23,843 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 00:09:23,843 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 00:09:23,843 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-30 00:09:23,844 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-30 00:09:23,844 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-30 00:09:23,844 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 00:09:23,844 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 00:09:23,844 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 00:09:23,845 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 00:09:23,845 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 00:09:23,845 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 00:09:23,845 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 00:09:23,845 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 00:09:23,846 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 00:09:23,846 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 00:09:23,846 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 00:09:23,846 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 00:09:23,847 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 00:09:23,847 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 00:09:23,847 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 00:09:23,847 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 00:09:23,848 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 00:09:23,848 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 00:09:23,883 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 00:09:23,896 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 00:09:23,900 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 00:09:23,901 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 00:09:23,902 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 00:09:23,902 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test6_1_false-valid-memtrack_true-termination.i [2018-01-30 00:09:24,099 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 00:09:24,105 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-30 00:09:24,106 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 00:09:24,106 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 00:09:24,111 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 00:09:24,112 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:09:24" (1/1) ... [2018-01-30 00:09:24,115 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13f5e0b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:09:24, skipping insertion in model container [2018-01-30 00:09:24,115 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:09:24" (1/1) ... [2018-01-30 00:09:24,134 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:09:24,186 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:09:24,302 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:09:24,318 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:09:24,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:09:24 WrapperNode [2018-01-30 00:09:24,327 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 00:09:24,328 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 00:09:24,328 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 00:09:24,328 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 00:09:24,346 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:09:24" (1/1) ... [2018-01-30 00:09:24,346 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:09:24" (1/1) ... [2018-01-30 00:09:24,358 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:09:24" (1/1) ... [2018-01-30 00:09:24,358 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:09:24" (1/1) ... [2018-01-30 00:09:24,362 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:09:24" (1/1) ... [2018-01-30 00:09:24,364 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:09:24" (1/1) ... [2018-01-30 00:09:24,365 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:09:24" (1/1) ... [2018-01-30 00:09:24,367 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 00:09:24,367 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 00:09:24,367 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 00:09:24,367 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 00:09:24,368 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:09:24" (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-30 00:09:24,413 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 00:09:24,413 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 00:09:24,413 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-30 00:09:24,413 INFO L136 BoogieDeclarations]: Found implementation of procedure f6 [2018-01-30 00:09:24,414 INFO L136 BoogieDeclarations]: Found implementation of procedure g6 [2018-01-30 00:09:24,414 INFO L136 BoogieDeclarations]: Found implementation of procedure probe2_6 [2018-01-30 00:09:24,414 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_6 [2018-01-30 00:09:24,414 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-30 00:09:24,414 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 00:09:24,414 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-30 00:09:24,414 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-30 00:09:24,414 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-30 00:09:24,414 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-30 00:09:24,415 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-30 00:09:24,415 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-30 00:09:24,415 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-30 00:09:24,415 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 00:09:24,415 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-30 00:09:24,415 INFO L128 BoogieDeclarations]: Found specification of procedure f6 [2018-01-30 00:09:24,415 INFO L128 BoogieDeclarations]: Found specification of procedure g6 [2018-01-30 00:09:24,415 INFO L128 BoogieDeclarations]: Found specification of procedure probe2_6 [2018-01-30 00:09:24,415 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_6 [2018-01-30 00:09:24,416 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-30 00:09:24,416 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 00:09:24,416 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 00:09:24,416 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 00:09:24,691 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 00:09:24,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:09:24 BoogieIcfgContainer [2018-01-30 00:09:24,692 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 00:09:24,693 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 00:09:24,693 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 00:09:24,695 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 00:09:24,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 12:09:24" (1/3) ... [2018-01-30 00:09:24,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@328c7e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:09:24, skipping insertion in model container [2018-01-30 00:09:24,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:09:24" (2/3) ... [2018-01-30 00:09:24,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@328c7e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:09:24, skipping insertion in model container [2018-01-30 00:09:24,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:09:24" (3/3) ... [2018-01-30 00:09:24,699 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test6_1_false-valid-memtrack_true-termination.i [2018-01-30 00:09:24,706 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 00:09:24,713 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-01-30 00:09:24,762 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 00:09:24,762 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 00:09:24,762 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 00:09:24,762 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 00:09:24,762 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 00:09:24,762 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 00:09:24,762 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 00:09:24,762 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 00:09:24,763 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 00:09:24,778 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2018-01-30 00:09:24,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-01-30 00:09:24,782 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:09:24,783 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-01-30 00:09:24,783 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-01-30 00:09:24,786 INFO L82 PathProgramCache]: Analyzing trace with hash 117996226, now seen corresponding path program 1 times [2018-01-30 00:09:24,788 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:09:24,788 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:09:24,834 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:24,834 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:09:24,834 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:24,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:09:24,877 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:09:24,935 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-30 00:09:24,938 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:09:24,938 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-30 00:09:24,939 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 00:09:24,949 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 00:09:24,950 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 00:09:24,952 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 3 states. [2018-01-30 00:09:25,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:09:25,143 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2018-01-30 00:09:25,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 00:09:25,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-01-30 00:09:25,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:09:25,160 INFO L225 Difference]: With dead ends: 102 [2018-01-30 00:09:25,160 INFO L226 Difference]: Without dead ends: 97 [2018-01-30 00:09:25,163 INFO L553 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-30 00:09:25,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-01-30 00:09:25,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 88. [2018-01-30 00:09:25,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-30 00:09:25,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2018-01-30 00:09:25,211 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 5 [2018-01-30 00:09:25,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:09:25,212 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2018-01-30 00:09:25,212 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 00:09:25,212 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2018-01-30 00:09:25,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-01-30 00:09:25,212 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:09:25,212 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-01-30 00:09:25,213 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-01-30 00:09:25,213 INFO L82 PathProgramCache]: Analyzing trace with hash 117996227, now seen corresponding path program 1 times [2018-01-30 00:09:25,213 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:09:25,213 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:09:25,215 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:25,215 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:09:25,216 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:25,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:09:25,233 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:09:25,301 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-30 00:09:25,301 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:09:25,301 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-30 00:09:25,303 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 00:09:25,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 00:09:25,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 00:09:25,304 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand 3 states. [2018-01-30 00:09:25,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:09:25,381 INFO L93 Difference]: Finished difference Result 154 states and 165 transitions. [2018-01-30 00:09:25,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 00:09:25,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-01-30 00:09:25,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:09:25,385 INFO L225 Difference]: With dead ends: 154 [2018-01-30 00:09:25,385 INFO L226 Difference]: Without dead ends: 152 [2018-01-30 00:09:25,386 INFO L553 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-30 00:09:25,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-01-30 00:09:25,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 139. [2018-01-30 00:09:25,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-01-30 00:09:25,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 159 transitions. [2018-01-30 00:09:25,408 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 159 transitions. Word has length 5 [2018-01-30 00:09:25,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:09:25,408 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 159 transitions. [2018-01-30 00:09:25,408 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 00:09:25,408 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 159 transitions. [2018-01-30 00:09:25,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-30 00:09:25,409 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:09:25,410 INFO L350 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-30 00:09:25,410 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-01-30 00:09:25,410 INFO L82 PathProgramCache]: Analyzing trace with hash 239661080, now seen corresponding path program 1 times [2018-01-30 00:09:25,410 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:09:25,410 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:09:25,411 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:25,412 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:09:25,412 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:25,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:09:25,439 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:09:25,581 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-30 00:09:25,581 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:09:25,581 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:09:25,582 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:09:25,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:09:25,582 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:09:25,583 INFO L87 Difference]: Start difference. First operand 139 states and 159 transitions. Second operand 6 states. [2018-01-30 00:09:25,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:09:25,860 INFO L93 Difference]: Finished difference Result 160 states and 180 transitions. [2018-01-30 00:09:25,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 00:09:25,860 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-01-30 00:09:25,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:09:25,863 INFO L225 Difference]: With dead ends: 160 [2018-01-30 00:09:25,863 INFO L226 Difference]: Without dead ends: 154 [2018-01-30 00:09:25,864 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-01-30 00:09:25,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-30 00:09:25,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 144. [2018-01-30 00:09:25,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-01-30 00:09:25,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 167 transitions. [2018-01-30 00:09:25,884 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 167 transitions. Word has length 33 [2018-01-30 00:09:25,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:09:25,885 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 167 transitions. [2018-01-30 00:09:25,885 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:09:25,885 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 167 transitions. [2018-01-30 00:09:25,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-30 00:09:25,886 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:09:25,887 INFO L350 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-30 00:09:25,887 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-01-30 00:09:25,887 INFO L82 PathProgramCache]: Analyzing trace with hash 239661081, now seen corresponding path program 1 times [2018-01-30 00:09:25,887 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:09:25,887 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:09:25,888 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:25,889 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:09:25,889 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:25,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:09:25,913 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:09:25,971 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-30 00:09:25,972 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:09:25,972 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 00:09:25,972 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:09:25,972 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:09:25,972 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:09:25,973 INFO L87 Difference]: Start difference. First operand 144 states and 167 transitions. Second operand 6 states. [2018-01-30 00:09:26,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:09:26,035 INFO L93 Difference]: Finished difference Result 185 states and 212 transitions. [2018-01-30 00:09:26,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:09:26,036 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-01-30 00:09:26,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:09:26,037 INFO L225 Difference]: With dead ends: 185 [2018-01-30 00:09:26,037 INFO L226 Difference]: Without dead ends: 153 [2018-01-30 00:09:26,038 INFO L553 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-30 00:09:26,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-01-30 00:09:26,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 149. [2018-01-30 00:09:26,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-01-30 00:09:26,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 171 transitions. [2018-01-30 00:09:26,056 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 171 transitions. Word has length 33 [2018-01-30 00:09:26,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:09:26,057 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 171 transitions. [2018-01-30 00:09:26,057 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:09:26,057 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 171 transitions. [2018-01-30 00:09:26,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-30 00:09:26,058 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:09:26,058 INFO L350 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-30 00:09:26,059 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-01-30 00:09:26,059 INFO L82 PathProgramCache]: Analyzing trace with hash 176960396, now seen corresponding path program 1 times [2018-01-30 00:09:26,059 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:09:26,059 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:09:26,061 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:26,061 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:09:26,061 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:26,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:09:26,085 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:09:26,153 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-30 00:09:26,153 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:09:26,153 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 00:09:26,154 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:09:26,154 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:09:26,154 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:09:26,154 INFO L87 Difference]: Start difference. First operand 149 states and 171 transitions. Second operand 6 states. [2018-01-30 00:09:26,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:09:26,243 INFO L93 Difference]: Finished difference Result 158 states and 176 transitions. [2018-01-30 00:09:26,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:09:26,244 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-01-30 00:09:26,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:09:26,246 INFO L225 Difference]: With dead ends: 158 [2018-01-30 00:09:26,246 INFO L226 Difference]: Without dead ends: 145 [2018-01-30 00:09:26,247 INFO L553 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-30 00:09:26,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-01-30 00:09:26,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 142. [2018-01-30 00:09:26,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-01-30 00:09:26,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 163 transitions. [2018-01-30 00:09:26,262 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 163 transitions. Word has length 32 [2018-01-30 00:09:26,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:09:26,262 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 163 transitions. [2018-01-30 00:09:26,262 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:09:26,263 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 163 transitions. [2018-01-30 00:09:26,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-30 00:09:26,264 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:09:26,264 INFO L350 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-30 00:09:26,264 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-01-30 00:09:26,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1303163576, now seen corresponding path program 1 times [2018-01-30 00:09:26,265 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:09:26,265 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:09:26,266 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:26,267 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:09:26,267 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:26,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:09:26,282 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:09:26,342 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-30 00:09:26,342 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:09:26,342 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:09:26,343 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:09:26,343 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:09:26,343 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:09:26,343 INFO L87 Difference]: Start difference. First operand 142 states and 163 transitions. Second operand 5 states. [2018-01-30 00:09:26,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:09:26,395 INFO L93 Difference]: Finished difference Result 146 states and 163 transitions. [2018-01-30 00:09:26,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:09:26,395 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-01-30 00:09:26,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:09:26,397 INFO L225 Difference]: With dead ends: 146 [2018-01-30 00:09:26,398 INFO L226 Difference]: Without dead ends: 145 [2018-01-30 00:09:26,398 INFO L553 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-30 00:09:26,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-01-30 00:09:26,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 142. [2018-01-30 00:09:26,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-01-30 00:09:26,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 162 transitions. [2018-01-30 00:09:26,412 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 162 transitions. Word has length 34 [2018-01-30 00:09:26,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:09:26,413 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 162 transitions. [2018-01-30 00:09:26,413 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:09:26,413 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 162 transitions. [2018-01-30 00:09:26,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-30 00:09:26,414 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:09:26,414 INFO L350 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-30 00:09:26,414 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-01-30 00:09:26,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1303163577, now seen corresponding path program 1 times [2018-01-30 00:09:26,415 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:09:26,415 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:09:26,416 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:26,417 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:09:26,417 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:26,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:09:26,431 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:09:26,489 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-30 00:09:26,490 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:09:26,490 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:09:26,490 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:09:26,491 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:09:26,491 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:09:26,491 INFO L87 Difference]: Start difference. First operand 142 states and 162 transitions. Second operand 5 states. [2018-01-30 00:09:26,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:09:26,550 INFO L93 Difference]: Finished difference Result 145 states and 162 transitions. [2018-01-30 00:09:26,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:09:26,551 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-01-30 00:09:26,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:09:26,553 INFO L225 Difference]: With dead ends: 145 [2018-01-30 00:09:26,553 INFO L226 Difference]: Without dead ends: 144 [2018-01-30 00:09:26,554 INFO L553 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-30 00:09:26,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-01-30 00:09:26,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2018-01-30 00:09:26,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-01-30 00:09:26,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 161 transitions. [2018-01-30 00:09:26,564 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 161 transitions. Word has length 34 [2018-01-30 00:09:26,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:09:26,564 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 161 transitions. [2018-01-30 00:09:26,564 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:09:26,564 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 161 transitions. [2018-01-30 00:09:26,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-30 00:09:26,565 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:09:26,565 INFO L350 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-30 00:09:26,566 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-01-30 00:09:26,566 INFO L82 PathProgramCache]: Analyzing trace with hash 69584848, now seen corresponding path program 1 times [2018-01-30 00:09:26,566 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:09:26,566 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:09:26,567 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:26,567 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:09:26,567 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:26,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:09:26,582 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:09:26,630 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-30 00:09:26,631 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:09:26,631 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:09:26,631 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:09:26,632 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:09:26,632 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:09:26,632 INFO L87 Difference]: Start difference. First operand 142 states and 161 transitions. Second operand 6 states. [2018-01-30 00:09:26,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:09:26,703 INFO L93 Difference]: Finished difference Result 142 states and 161 transitions. [2018-01-30 00:09:26,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 00:09:26,704 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-01-30 00:09:26,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:09:26,705 INFO L225 Difference]: With dead ends: 142 [2018-01-30 00:09:26,705 INFO L226 Difference]: Without dead ends: 141 [2018-01-30 00:09:26,705 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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-30 00:09:26,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-01-30 00:09:26,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-01-30 00:09:26,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-01-30 00:09:26,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 160 transitions. [2018-01-30 00:09:26,717 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 160 transitions. Word has length 35 [2018-01-30 00:09:26,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:09:26,717 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 160 transitions. [2018-01-30 00:09:26,717 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:09:26,717 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 160 transitions. [2018-01-30 00:09:26,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-30 00:09:26,719 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:09:26,719 INFO L350 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-30 00:09:26,719 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-01-30 00:09:26,719 INFO L82 PathProgramCache]: Analyzing trace with hash 69584849, now seen corresponding path program 1 times [2018-01-30 00:09:26,719 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:09:26,719 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:09:26,721 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:26,721 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:09:26,721 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:26,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:09:26,735 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:09:26,781 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-30 00:09:26,781 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:09:26,781 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:09:26,781 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:09:26,782 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:09:26,782 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:09:26,782 INFO L87 Difference]: Start difference. First operand 141 states and 160 transitions. Second operand 6 states. [2018-01-30 00:09:26,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:09:26,975 INFO L93 Difference]: Finished difference Result 143 states and 160 transitions. [2018-01-30 00:09:26,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:09:26,976 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-01-30 00:09:26,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:09:26,977 INFO L225 Difference]: With dead ends: 143 [2018-01-30 00:09:26,977 INFO L226 Difference]: Without dead ends: 142 [2018-01-30 00:09:26,978 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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-30 00:09:26,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-01-30 00:09:26,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2018-01-30 00:09:26,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-01-30 00:09:26,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 159 transitions. [2018-01-30 00:09:26,989 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 159 transitions. Word has length 35 [2018-01-30 00:09:26,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:09:26,989 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 159 transitions. [2018-01-30 00:09:26,989 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:09:26,989 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 159 transitions. [2018-01-30 00:09:26,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-30 00:09:26,991 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:09:26,991 INFO L350 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-30 00:09:26,992 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-01-30 00:09:26,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1356739710, now seen corresponding path program 1 times [2018-01-30 00:09:26,992 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:09:26,992 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:09:26,993 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:26,994 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:09:26,994 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:27,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:09:27,006 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:09:27,054 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-30 00:09:27,054 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:09:27,054 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:09:27,055 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:09:27,055 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:09:27,055 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:09:27,055 INFO L87 Difference]: Start difference. First operand 140 states and 159 transitions. Second operand 5 states. [2018-01-30 00:09:27,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:09:27,081 INFO L93 Difference]: Finished difference Result 151 states and 162 transitions. [2018-01-30 00:09:27,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:09:27,081 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-01-30 00:09:27,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:09:27,082 INFO L225 Difference]: With dead ends: 151 [2018-01-30 00:09:27,082 INFO L226 Difference]: Without dead ends: 85 [2018-01-30 00:09:27,082 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:09:27,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-30 00:09:27,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-01-30 00:09:27,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-30 00:09:27,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2018-01-30 00:09:27,088 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 42 [2018-01-30 00:09:27,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:09:27,089 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2018-01-30 00:09:27,089 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:09:27,089 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2018-01-30 00:09:27,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-30 00:09:27,090 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:09:27,090 INFO L350 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-30 00:09:27,090 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-01-30 00:09:27,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1612728474, now seen corresponding path program 1 times [2018-01-30 00:09:27,090 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:09:27,090 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:09:27,091 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:27,091 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:09:27,091 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:27,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:09:27,111 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:09:27,392 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-30 00:09:27,392 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:09:27,393 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-30 00:09:27,393 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 00:09:27,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 00:09:27,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:09:27,394 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand 8 states. [2018-01-30 00:09:27,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:09:27,776 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2018-01-30 00:09:27,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-30 00:09:27,776 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2018-01-30 00:09:27,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:09:27,777 INFO L225 Difference]: With dead ends: 93 [2018-01-30 00:09:27,777 INFO L226 Difference]: Without dead ends: 88 [2018-01-30 00:09:27,778 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2018-01-30 00:09:27,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-01-30 00:09:27,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2018-01-30 00:09:27,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-30 00:09:27,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2018-01-30 00:09:27,784 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 43 [2018-01-30 00:09:27,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:09:27,784 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2018-01-30 00:09:27,784 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 00:09:27,784 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2018-01-30 00:09:27,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-30 00:09:27,785 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:09:27,785 INFO L350 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-30 00:09:27,785 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-01-30 00:09:27,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1612728475, now seen corresponding path program 1 times [2018-01-30 00:09:27,785 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:09:27,785 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:09:27,786 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:27,786 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:09:27,787 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:27,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:09:27,799 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:09:27,963 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-30 00:09:27,963 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:09:27,963 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 00:09:27,963 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 00:09:27,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 00:09:27,964 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:09:27,964 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand 7 states. [2018-01-30 00:09:28,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:09:28,132 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2018-01-30 00:09:28,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-30 00:09:28,132 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2018-01-30 00:09:28,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:09:28,133 INFO L225 Difference]: With dead ends: 90 [2018-01-30 00:09:28,133 INFO L226 Difference]: Without dead ends: 88 [2018-01-30 00:09:28,134 INFO L553 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-30 00:09:28,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-01-30 00:09:28,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2018-01-30 00:09:28,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-30 00:09:28,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2018-01-30 00:09:28,140 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 43 [2018-01-30 00:09:28,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:09:28,140 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2018-01-30 00:09:28,140 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 00:09:28,140 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2018-01-30 00:09:28,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-30 00:09:28,141 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:09:28,141 INFO L350 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-30 00:09:28,141 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-01-30 00:09:28,141 INFO L82 PathProgramCache]: Analyzing trace with hash -651172529, now seen corresponding path program 1 times [2018-01-30 00:09:28,141 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:09:28,141 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:09:28,142 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:28,142 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:09:28,143 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:28,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:09:28,155 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:09:28,207 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-30 00:09:28,207 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:09:28,207 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 00:09:28,208 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:09:28,208 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:09:28,208 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:09:28,208 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand 6 states. [2018-01-30 00:09:28,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:09:28,237 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2018-01-30 00:09:28,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:09:28,237 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-01-30 00:09:28,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:09:28,239 INFO L225 Difference]: With dead ends: 109 [2018-01-30 00:09:28,239 INFO L226 Difference]: Without dead ends: 81 [2018-01-30 00:09:28,239 INFO L553 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-30 00:09:28,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-30 00:09:28,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2018-01-30 00:09:28,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-30 00:09:28,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2018-01-30 00:09:28,246 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 45 [2018-01-30 00:09:28,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:09:28,246 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2018-01-30 00:09:28,246 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:09:28,246 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2018-01-30 00:09:28,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-30 00:09:28,247 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:09:28,247 INFO L350 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-30 00:09:28,247 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-01-30 00:09:28,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1396533477, now seen corresponding path program 1 times [2018-01-30 00:09:28,247 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:09:28,247 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:09:28,248 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:28,248 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:09:28,248 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:28,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:09:28,258 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:09:28,356 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-30 00:09:28,356 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:09:28,356 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-30 00:09:28,356 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 00:09:28,357 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 00:09:28,357 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:09:28,357 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 8 states. [2018-01-30 00:09:28,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:09:28,539 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-01-30 00:09:28,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-30 00:09:28,539 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2018-01-30 00:09:28,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:09:28,540 INFO L225 Difference]: With dead ends: 82 [2018-01-30 00:09:28,540 INFO L226 Difference]: Without dead ends: 81 [2018-01-30 00:09:28,540 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-01-30 00:09:28,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-30 00:09:28,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2018-01-30 00:09:28,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-30 00:09:28,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2018-01-30 00:09:28,545 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 45 [2018-01-30 00:09:28,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:09:28,545 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2018-01-30 00:09:28,546 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 00:09:28,546 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2018-01-30 00:09:28,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-30 00:09:28,546 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:09:28,546 INFO L350 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-30 00:09:28,546 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-01-30 00:09:28,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1396533478, now seen corresponding path program 1 times [2018-01-30 00:09:28,546 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:09:28,546 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:09:28,547 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:28,547 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:09:28,547 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:28,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:09:28,558 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:09:28,686 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-30 00:09:28,686 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:09:28,686 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-30 00:09:28,687 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-30 00:09:28,687 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-30 00:09:28,687 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-30 00:09:28,687 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 10 states. [2018-01-30 00:09:28,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:09:28,967 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2018-01-30 00:09:29,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-30 00:09:29,002 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2018-01-30 00:09:29,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:09:29,003 INFO L225 Difference]: With dead ends: 77 [2018-01-30 00:09:29,003 INFO L226 Difference]: Without dead ends: 76 [2018-01-30 00:09:29,003 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2018-01-30 00:09:29,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-30 00:09:29,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-01-30 00:09:29,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-30 00:09:29,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2018-01-30 00:09:29,009 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 45 [2018-01-30 00:09:29,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:09:29,009 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2018-01-30 00:09:29,009 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-30 00:09:29,009 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2018-01-30 00:09:29,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-30 00:09:29,010 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:09:29,010 INFO L350 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] [2018-01-30 00:09:29,010 INFO L371 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-01-30 00:09:29,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1316017239, now seen corresponding path program 1 times [2018-01-30 00:09:29,011 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:09:29,011 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:09:29,012 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:29,012 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:09:29,013 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:29,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:09:29,026 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:09:29,137 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-30 00:09:29,137 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:09:29,137 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-30 00:09:29,137 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 00:09:29,138 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 00:09:29,138 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:09:29,138 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 8 states. [2018-01-30 00:09:29,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:09:29,350 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2018-01-30 00:09:29,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-30 00:09:29,351 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2018-01-30 00:09:29,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:09:29,351 INFO L225 Difference]: With dead ends: 77 [2018-01-30 00:09:29,351 INFO L226 Difference]: Without dead ends: 76 [2018-01-30 00:09:29,352 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-01-30 00:09:29,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-30 00:09:29,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2018-01-30 00:09:29,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-30 00:09:29,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-01-30 00:09:29,358 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 55 [2018-01-30 00:09:29,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:09:29,358 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-01-30 00:09:29,358 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 00:09:29,358 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-01-30 00:09:29,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-30 00:09:29,359 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:09:29,359 INFO L350 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] [2018-01-30 00:09:29,359 INFO L371 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-01-30 00:09:29,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1914552327, now seen corresponding path program 1 times [2018-01-30 00:09:29,360 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:09:29,360 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:09:29,361 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:29,361 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:09:29,361 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:29,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-30 00:09:29,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-30 00:09:29,434 INFO L409 BasicCegarLoop]: Counterexample might be feasible [2018-01-30 00:09:29,457 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-30 00:09:29,462 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-30 00:09:29,462 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 7 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-30 00:09:29,463 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 7 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-30 00:09:29,464 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-30 00:09:29,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 12:09:29 BoogieIcfgContainer [2018-01-30 00:09:29,480 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 00:09:29,481 INFO L168 Benchmark]: Toolchain (without parser) took 5381.74 ms. Allocated memory was 297.8 MB in the beginning and 544.7 MB in the end (delta: 246.9 MB). Free memory was 256.7 MB in the beginning and 509.1 MB in the end (delta: -252.4 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 00:09:29,483 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 297.8 MB. Free memory is still 262.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 00:09:29,483 INFO L168 Benchmark]: CACSL2BoogieTranslator took 221.72 ms. Allocated memory is still 297.8 MB. Free memory was 256.7 MB in the beginning and 242.7 MB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 5.3 GB. [2018-01-30 00:09:29,483 INFO L168 Benchmark]: Boogie Preprocessor took 38.69 ms. Allocated memory is still 297.8 MB. Free memory was 242.7 MB in the beginning and 240.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-30 00:09:29,483 INFO L168 Benchmark]: RCFGBuilder took 324.88 ms. Allocated memory is still 297.8 MB. Free memory was 240.7 MB in the beginning and 219.6 MB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 5.3 GB. [2018-01-30 00:09:29,484 INFO L168 Benchmark]: TraceAbstraction took 4787.68 ms. Allocated memory was 297.8 MB in the beginning and 544.7 MB in the end (delta: 246.9 MB). Free memory was 219.6 MB in the beginning and 509.1 MB in the end (delta: -289.5 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 00:09:29,485 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.24 ms. Allocated memory is still 297.8 MB. Free memory is still 262.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 221.72 ms. Allocated memory is still 297.8 MB. Free memory was 256.7 MB in the beginning and 242.7 MB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.69 ms. Allocated memory is still 297.8 MB. Free memory was 242.7 MB in the beginning and 240.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 324.88 ms. Allocated memory is still 297.8 MB. Free memory was 240.7 MB in the beginning and 219.6 MB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 4787.68 ms. Allocated memory was 297.8 MB in the beginning and 544.7 MB in the end (delta: 246.9 MB). Free memory was 219.6 MB in the beginning and 509.1 MB in the end (delta: -289.5 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 7 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: - UnprovableResult [Line: 1478]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1478. Possible FailurePath: IVAL [\old(a6)=null, \old(a6)=null, a6={7:5}] [L1467] FCALL struct A a6; VAL [a6={9:0}] [L1479] CALL entry_point() VAL [a6={9:0}] [L1471] CALL, EXPR probe2_6(&a6) VAL [a={9:0}, a6={9:0}] [L1444] int ret = - -3; VAL [a={9:0}, a={9:0}, a6={9:0}, ret=3] [L1445] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(size)=4, a6={9:0}] [L1073] COND TRUE __VERIFIER_nondet_int() VAL [\old(size)=4, __VERIFIER_nondet_int()=1, a6={9:0}, size=4] [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=4, a6={9:0}, malloc(size)={8:0}, size=4] [L1074] RET return malloc(size); VAL [\old(size)=4, \result={8:0}, a6={9:0}, malloc(size)={8:0}, size=4] [L1445] EXPR ldv_malloc(sizeof(int)) VAL [a={9:0}, a={9:0}, a6={9:0}, ldv_malloc(sizeof(int))={8:0}, ret=3] [L1445] int *p = (int *)ldv_malloc(sizeof(int)); VAL [a={9:0}, a={9:0}, a6={9:0}, ldv_malloc(sizeof(int))={8:0}, p={8:0}, ret=3] [L1446] COND FALSE !(p==0) VAL [a={9:0}, a={9:0}, a6={9:0}, p={8:0}, ret=3] [L1448] CALL, EXPR f6() VAL [a6={9:0}] [L1435] RET return __VERIFIER_nondet_int(); VAL [\result=0, __VERIFIER_nondet_int()=0, a6={9:0}] [L1448] EXPR f6() VAL [a={9:0}, a={9:0}, a6={9:0}, f6()=0, p={8:0}, ret=3] [L1448] ret = f6() VAL [a={9:0}, a={9:0}, a6={9:0}, f6()=0, p={8:0}, ret=0] [L1449] COND FALSE !(ret<0) VAL [a={9:0}, a={9:0}, a6={9:0}, p={8:0}, ret=0] [L1451] CALL, EXPR g6() VAL [a6={9:0}] [L1439] RET return __VERIFIER_nondet_int(); VAL [\result=-1, __VERIFIER_nondet_int()=-1, a6={9:0}] [L1451] EXPR g6() VAL [a={9:0}, a={9:0}, a6={9:0}, g6()=-1, p={8:0}, ret=0] [L1451] ret = g6() VAL [a={9:0}, a={9:0}, a6={9:0}, g6()=-1, p={8:0}, ret=-1] [L1452] COND TRUE ret<0 VAL [a={9:0}, a={9:0}, a6={9:0}, p={8:0}, ret=-1] [L1453] RET return ret; VAL [\result=-1, a={9:0}, a={9:0}, a6={9:0}, p={8:0}, ret=-1] [L1471] EXPR probe2_6(&a6) VAL [a6={9:0}, probe2_6(&a6)=-1] [L1471] int ret = probe2_6(&a6); VAL [a6={9:0}, probe2_6(&a6)=-1, ret=-1] [L1472] COND FALSE !(ret==0) VAL [a6={9:0}, ret=-1] [L1475] RET, FCALL a6.p = 0 VAL [a6={9:0}, ret=-1] [L1479] entry_point() VAL [a6={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 85 locations, 13 error locations. UNSAFE Result, 4.7s OverallTime, 17 OverallIterations, 1 TraceHistogramMax, 2.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1178 SDtfs, 1020 SDslu, 3155 SDs, 0 SdLazy, 1207 SolverSat, 203 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 160 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=149occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 60 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 619 NumberOfCodeBlocks, 619 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 548 ConstructedInterpolants, 0 QuantifiedInterpolants, 106912 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-30_00-09-29-494.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_00-09-29-494.csv Received shutdown request...