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-5f7ec6e [2018-01-31 09:02:48,893 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 09:02:48,895 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 09:02:48,911 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 09:02:48,911 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 09:02:48,912 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 09:02:48,913 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 09:02:48,915 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 09:02:48,918 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 09:02:48,918 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 09:02:48,919 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 09:02:48,920 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 09:02:48,921 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 09:02:48,922 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 09:02:48,923 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 09:02:48,925 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 09:02:48,928 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 09:02:48,930 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 09:02:48,931 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 09:02:48,932 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 09:02:48,935 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 09:02:48,935 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 09:02:48,936 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 09:02:48,937 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 09:02:48,938 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 09:02:48,939 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 09:02:48,939 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 09:02:48,940 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 09:02:48,940 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 09:02:48,941 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 09:02:48,941 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 09:02:48,942 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-31 09:02:48,952 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 09:02:48,953 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 09:02:48,954 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 09:02:48,954 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 09:02:48,954 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 09:02:48,954 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 09:02:48,955 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 09:02:48,955 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 09:02:48,956 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 09:02:48,956 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 09:02:48,956 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 09:02:48,956 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 09:02:48,957 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 09:02:48,957 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 09:02:48,957 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 09:02:48,958 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 09:02:48,958 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 09:02:48,958 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 09:02:48,958 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 09:02:48,959 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 09:02:48,959 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 09:02:48,959 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 09:02:48,960 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 09:02:48,960 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 09:02:48,960 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 09:02:48,960 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 09:02:48,961 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 09:02:48,961 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 09:02:48,961 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 09:02:48,961 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 09:02:48,961 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 09:02:48,962 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 09:02:48,963 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 09:02:48,963 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 09:02:49,001 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 09:02:49,011 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 09:02:49,014 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 09:02:49,016 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 09:02:49,016 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 09:02:49,017 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-31 09:02:49,267 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 09:02:49,274 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-31 09:02:49,276 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 09:02:49,276 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 09:02:49,287 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 09:02:49,288 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:02:49" (1/1) ... [2018-01-31 09:02:49,292 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ad862a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:02:49, skipping insertion in model container [2018-01-31 09:02:49,293 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:02:49" (1/1) ... [2018-01-31 09:02:49,311 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 09:02:49,371 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 09:02:49,557 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 09:02:49,593 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 09:02:49,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:02:49 WrapperNode [2018-01-31 09:02:49,605 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 09:02:49,606 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 09:02:49,606 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 09:02:49,606 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 09:02:49,622 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:02:49" (1/1) ... [2018-01-31 09:02:49,622 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:02:49" (1/1) ... [2018-01-31 09:02:49,633 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:02:49" (1/1) ... [2018-01-31 09:02:49,633 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:02:49" (1/1) ... [2018-01-31 09:02:49,637 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:02:49" (1/1) ... [2018-01-31 09:02:49,639 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:02:49" (1/1) ... [2018-01-31 09:02:49,640 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:02:49" (1/1) ... [2018-01-31 09:02:49,642 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 09:02:49,642 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 09:02:49,642 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 09:02:49,643 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 09:02:49,643 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:02:49" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 09:02:49,720 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 09:02:49,720 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 09:02:49,720 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-31 09:02:49,720 INFO L136 BoogieDeclarations]: Found implementation of procedure f6 [2018-01-31 09:02:49,720 INFO L136 BoogieDeclarations]: Found implementation of procedure g6 [2018-01-31 09:02:49,721 INFO L136 BoogieDeclarations]: Found implementation of procedure probe2_6 [2018-01-31 09:02:49,721 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_6 [2018-01-31 09:02:49,723 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-31 09:02:49,723 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 09:02:49,724 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-31 09:02:49,724 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-31 09:02:49,724 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 09:02:49,724 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 09:02:49,724 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 09:02:49,724 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-31 09:02:49,724 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-31 09:02:49,725 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-31 09:02:49,725 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-31 09:02:49,725 INFO L128 BoogieDeclarations]: Found specification of procedure f6 [2018-01-31 09:02:49,725 INFO L128 BoogieDeclarations]: Found specification of procedure g6 [2018-01-31 09:02:49,725 INFO L128 BoogieDeclarations]: Found specification of procedure probe2_6 [2018-01-31 09:02:49,725 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_6 [2018-01-31 09:02:49,725 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-31 09:02:49,726 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 09:02:49,726 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 09:02:49,726 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 09:02:50,214 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 09:02:50,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:02:50 BoogieIcfgContainer [2018-01-31 09:02:50,215 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 09:02:50,217 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 09:02:50,217 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 09:02:50,221 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 09:02:50,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 09:02:49" (1/3) ... [2018-01-31 09:02:50,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30316d8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:02:50, skipping insertion in model container [2018-01-31 09:02:50,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:02:49" (2/3) ... [2018-01-31 09:02:50,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30316d8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:02:50, skipping insertion in model container [2018-01-31 09:02:50,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:02:50" (3/3) ... [2018-01-31 09:02:50,225 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test6_1_false-valid-memtrack_true-termination.i [2018-01-31 09:02:50,233 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 09:02:50,243 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-01-31 09:02:50,298 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 09:02:50,298 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 09:02:50,298 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 09:02:50,298 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 09:02:50,298 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 09:02:50,298 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 09:02:50,299 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 09:02:50,299 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 09:02:50,299 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 09:02:50,323 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2018-01-31 09:02:50,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-01-31 09:02:50,329 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:02:50,330 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-01-31 09:02:50,330 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-31 09:02:50,335 INFO L82 PathProgramCache]: Analyzing trace with hash 117996226, now seen corresponding path program 1 times [2018-01-31 09:02:50,337 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:02:50,338 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:02:50,393 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:50,393 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:02:50,393 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:50,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:02:50,434 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:02:50,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:02:50,495 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:02:50,495 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-31 09:02:50,497 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-31 09:02:50,511 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-31 09:02:50,511 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 09:02:50,514 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 3 states. [2018-01-31 09:02:50,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:02:50,870 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2018-01-31 09:02:50,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-31 09:02:50,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-01-31 09:02:50,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:02:50,885 INFO L225 Difference]: With dead ends: 102 [2018-01-31 09:02:50,885 INFO L226 Difference]: Without dead ends: 97 [2018-01-31 09:02:50,887 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 09:02:50,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-01-31 09:02:50,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 88. [2018-01-31 09:02:50,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-31 09:02:50,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2018-01-31 09:02:50,938 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 5 [2018-01-31 09:02:50,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:02:50,938 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2018-01-31 09:02:50,938 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-31 09:02:50,939 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2018-01-31 09:02:50,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-01-31 09:02:50,939 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:02:50,939 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-01-31 09:02:50,939 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-31 09:02:50,940 INFO L82 PathProgramCache]: Analyzing trace with hash 117996227, now seen corresponding path program 1 times [2018-01-31 09:02:50,940 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:02:50,940 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:02:50,942 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:50,942 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:02:50,942 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:50,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:02:50,964 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:02:51,168 WARN L146 SmtUtils]: Spent 144ms on a formula simplification. DAG size of input: 13 DAG size of output 9 [2018-01-31 09:02:51,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:02:51,169 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:02:51,170 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-31 09:02:51,171 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-31 09:02:51,171 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-31 09:02:51,171 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 09:02:51,172 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand 3 states. [2018-01-31 09:02:51,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:02:51,364 INFO L93 Difference]: Finished difference Result 154 states and 165 transitions. [2018-01-31 09:02:51,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-31 09:02:51,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-01-31 09:02:51,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:02:51,367 INFO L225 Difference]: With dead ends: 154 [2018-01-31 09:02:51,367 INFO L226 Difference]: Without dead ends: 152 [2018-01-31 09:02:51,368 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 09:02:51,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-01-31 09:02:51,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 139. [2018-01-31 09:02:51,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-01-31 09:02:51,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 159 transitions. [2018-01-31 09:02:51,394 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 159 transitions. Word has length 5 [2018-01-31 09:02:51,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:02:51,394 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 159 transitions. [2018-01-31 09:02:51,395 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-31 09:02:51,395 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 159 transitions. [2018-01-31 09:02:51,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-31 09:02:51,396 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:02:51,397 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:02:51,397 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-31 09:02:51,397 INFO L82 PathProgramCache]: Analyzing trace with hash 239661080, now seen corresponding path program 1 times [2018-01-31 09:02:51,397 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:02:51,397 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:02:51,399 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:51,399 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:02:51,399 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:51,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:02:51,442 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:02:51,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:02:51,698 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:02:51,698 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 09:02:51,704 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:02:51,704 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:02:51,704 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:02:51,704 INFO L87 Difference]: Start difference. First operand 139 states and 159 transitions. Second operand 6 states. [2018-01-31 09:02:52,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:02:52,631 INFO L93 Difference]: Finished difference Result 160 states and 180 transitions. [2018-01-31 09:02:52,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 09:02:52,633 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-01-31 09:02:52,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:02:52,635 INFO L225 Difference]: With dead ends: 160 [2018-01-31 09:02:52,635 INFO L226 Difference]: Without dead ends: 154 [2018-01-31 09:02:52,636 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-01-31 09:02:52,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-31 09:02:52,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 144. [2018-01-31 09:02:52,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-01-31 09:02:52,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 167 transitions. [2018-01-31 09:02:52,657 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 167 transitions. Word has length 33 [2018-01-31 09:02:52,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:02:52,658 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 167 transitions. [2018-01-31 09:02:52,658 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:02:52,658 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 167 transitions. [2018-01-31 09:02:52,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-31 09:02:52,659 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:02:52,660 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:02:52,660 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-31 09:02:52,660 INFO L82 PathProgramCache]: Analyzing trace with hash 239661081, now seen corresponding path program 1 times [2018-01-31 09:02:52,660 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:02:52,660 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:02:52,662 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:52,662 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:02:52,662 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:52,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:02:52,683 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:02:52,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:02:52,756 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:02:52,757 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 09:02:52,757 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:02:52,757 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:02:52,757 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:02:52,758 INFO L87 Difference]: Start difference. First operand 144 states and 167 transitions. Second operand 6 states. [2018-01-31 09:02:52,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:02:52,835 INFO L93 Difference]: Finished difference Result 185 states and 212 transitions. [2018-01-31 09:02:52,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 09:02:52,836 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-01-31 09:02:52,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:02:52,837 INFO L225 Difference]: With dead ends: 185 [2018-01-31 09:02:52,837 INFO L226 Difference]: Without dead ends: 153 [2018-01-31 09:02:52,838 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:02:52,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-01-31 09:02:52,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 149. [2018-01-31 09:02:52,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-01-31 09:02:52,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 171 transitions. [2018-01-31 09:02:52,859 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 171 transitions. Word has length 33 [2018-01-31 09:02:52,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:02:52,859 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 171 transitions. [2018-01-31 09:02:52,859 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:02:52,859 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 171 transitions. [2018-01-31 09:02:52,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-31 09:02:52,861 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:02:52,861 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:02:52,861 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-31 09:02:52,861 INFO L82 PathProgramCache]: Analyzing trace with hash 176960396, now seen corresponding path program 1 times [2018-01-31 09:02:52,861 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:02:52,862 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:02:52,863 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:52,863 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:02:52,863 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:52,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:02:52,884 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:02:52,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:02:52,943 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:02:52,943 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 09:02:52,943 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:02:52,944 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:02:52,944 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:02:52,944 INFO L87 Difference]: Start difference. First operand 149 states and 171 transitions. Second operand 6 states. [2018-01-31 09:02:53,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:02:53,089 INFO L93 Difference]: Finished difference Result 158 states and 176 transitions. [2018-01-31 09:02:53,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 09:02:53,090 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-01-31 09:02:53,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:02:53,091 INFO L225 Difference]: With dead ends: 158 [2018-01-31 09:02:53,092 INFO L226 Difference]: Without dead ends: 145 [2018-01-31 09:02:53,092 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:02:53,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-01-31 09:02:53,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 142. [2018-01-31 09:02:53,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-01-31 09:02:53,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 163 transitions. [2018-01-31 09:02:53,106 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 163 transitions. Word has length 32 [2018-01-31 09:02:53,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:02:53,107 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 163 transitions. [2018-01-31 09:02:53,107 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:02:53,107 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 163 transitions. [2018-01-31 09:02:53,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-31 09:02:53,108 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:02:53,108 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:02:53,108 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-31 09:02:53,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1303163576, now seen corresponding path program 1 times [2018-01-31 09:02:53,109 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:02:53,109 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:02:53,110 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:53,110 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:02:53,110 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:53,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:02:53,126 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:02:53,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:02:53,276 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:02:53,276 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 09:02:53,277 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 09:02:53,277 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 09:02:53,277 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:02:53,277 INFO L87 Difference]: Start difference. First operand 142 states and 163 transitions. Second operand 5 states. [2018-01-31 09:02:53,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:02:53,459 INFO L93 Difference]: Finished difference Result 146 states and 163 transitions. [2018-01-31 09:02:53,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:02:53,460 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-01-31 09:02:53,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:02:53,462 INFO L225 Difference]: With dead ends: 146 [2018-01-31 09:02:53,462 INFO L226 Difference]: Without dead ends: 145 [2018-01-31 09:02:53,462 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:02:53,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-01-31 09:02:53,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 142. [2018-01-31 09:02:53,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-01-31 09:02:53,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 162 transitions. [2018-01-31 09:02:53,500 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 162 transitions. Word has length 34 [2018-01-31 09:02:53,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:02:53,500 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 162 transitions. [2018-01-31 09:02:53,501 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 09:02:53,501 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 162 transitions. [2018-01-31 09:02:53,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-31 09:02:53,502 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:02:53,502 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:02:53,502 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-31 09:02:53,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1303163577, now seen corresponding path program 1 times [2018-01-31 09:02:53,502 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:02:53,503 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:02:53,505 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:53,505 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:02:53,505 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:53,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:02:53,520 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:02:53,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:02:53,586 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:02:53,586 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 09:02:53,586 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 09:02:53,586 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 09:02:53,586 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:02:53,587 INFO L87 Difference]: Start difference. First operand 142 states and 162 transitions. Second operand 5 states. [2018-01-31 09:02:53,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:02:53,635 INFO L93 Difference]: Finished difference Result 145 states and 162 transitions. [2018-01-31 09:02:53,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:02:53,636 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-01-31 09:02:53,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:02:53,637 INFO L225 Difference]: With dead ends: 145 [2018-01-31 09:02:53,638 INFO L226 Difference]: Without dead ends: 144 [2018-01-31 09:02:53,638 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:02:53,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-01-31 09:02:53,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2018-01-31 09:02:53,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-01-31 09:02:53,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 161 transitions. [2018-01-31 09:02:53,649 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 161 transitions. Word has length 34 [2018-01-31 09:02:53,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:02:53,649 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 161 transitions. [2018-01-31 09:02:53,650 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 09:02:53,650 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 161 transitions. [2018-01-31 09:02:53,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-31 09:02:53,651 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:02:53,651 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:02:53,651 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-31 09:02:53,651 INFO L82 PathProgramCache]: Analyzing trace with hash 69584848, now seen corresponding path program 1 times [2018-01-31 09:02:53,651 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:02:53,652 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:02:53,653 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:53,653 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:02:53,653 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:53,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:02:53,667 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:02:53,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:02:53,749 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:02:53,749 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 09:02:53,750 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:02:53,750 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:02:53,750 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:02:53,750 INFO L87 Difference]: Start difference. First operand 142 states and 161 transitions. Second operand 6 states. [2018-01-31 09:02:53,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:02:53,812 INFO L93 Difference]: Finished difference Result 142 states and 161 transitions. [2018-01-31 09:02:53,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 09:02:53,813 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-01-31 09:02:53,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:02:53,815 INFO L225 Difference]: With dead ends: 142 [2018-01-31 09:02:53,815 INFO L226 Difference]: Without dead ends: 141 [2018-01-31 09:02:53,815 INFO L554 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-31 09:02:53,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-01-31 09:02:53,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-01-31 09:02:53,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-01-31 09:02:53,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 160 transitions. [2018-01-31 09:02:53,825 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 160 transitions. Word has length 35 [2018-01-31 09:02:53,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:02:53,826 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 160 transitions. [2018-01-31 09:02:53,826 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:02:53,826 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 160 transitions. [2018-01-31 09:02:53,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-31 09:02:53,827 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:02:53,827 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:02:53,828 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-31 09:02:53,828 INFO L82 PathProgramCache]: Analyzing trace with hash 69584849, now seen corresponding path program 1 times [2018-01-31 09:02:53,828 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:02:53,828 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:02:53,829 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:53,829 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:02:53,829 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:53,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:02:53,843 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:02:53,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:02:53,925 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:02:53,925 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 09:02:53,925 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:02:53,925 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:02:53,925 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:02:53,925 INFO L87 Difference]: Start difference. First operand 141 states and 160 transitions. Second operand 6 states. [2018-01-31 09:02:54,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:02:54,091 INFO L93 Difference]: Finished difference Result 143 states and 160 transitions. [2018-01-31 09:02:54,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 09:02:54,092 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-01-31 09:02:54,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:02:54,093 INFO L225 Difference]: With dead ends: 143 [2018-01-31 09:02:54,093 INFO L226 Difference]: Without dead ends: 142 [2018-01-31 09:02:54,094 INFO L554 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-31 09:02:54,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-01-31 09:02:54,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2018-01-31 09:02:54,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-01-31 09:02:54,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 159 transitions. [2018-01-31 09:02:54,107 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 159 transitions. Word has length 35 [2018-01-31 09:02:54,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:02:54,107 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 159 transitions. [2018-01-31 09:02:54,107 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:02:54,108 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 159 transitions. [2018-01-31 09:02:54,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-31 09:02:54,109 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:02:54,110 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:02:54,110 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-31 09:02:54,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1356739710, now seen corresponding path program 1 times [2018-01-31 09:02:54,110 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:02:54,111 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:02:54,114 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:54,114 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:02:54,114 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:54,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:02:54,125 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:02:54,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:02:54,182 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:02:54,182 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 09:02:54,183 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 09:02:54,183 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 09:02:54,183 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:02:54,183 INFO L87 Difference]: Start difference. First operand 140 states and 159 transitions. Second operand 5 states. [2018-01-31 09:02:54,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:02:54,209 INFO L93 Difference]: Finished difference Result 151 states and 162 transitions. [2018-01-31 09:02:54,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:02:54,209 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-01-31 09:02:54,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:02:54,210 INFO L225 Difference]: With dead ends: 151 [2018-01-31 09:02:54,211 INFO L226 Difference]: Without dead ends: 85 [2018-01-31 09:02:54,211 INFO L554 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-31 09:02:54,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-31 09:02:54,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-01-31 09:02:54,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-31 09:02:54,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2018-01-31 09:02:54,219 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 42 [2018-01-31 09:02:54,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:02:54,220 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2018-01-31 09:02:54,220 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 09:02:54,220 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2018-01-31 09:02:54,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-31 09:02:54,221 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:02:54,221 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:02:54,222 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-31 09:02:54,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1612728474, now seen corresponding path program 1 times [2018-01-31 09:02:54,222 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:02:54,222 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:02:54,223 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:54,223 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:02:54,223 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:54,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:02:54,242 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:02:54,676 WARN L143 SmtUtils]: Spent 163ms on a formula simplification that was a NOOP. DAG size: 16 [2018-01-31 09:02:54,931 WARN L143 SmtUtils]: Spent 161ms on a formula simplification that was a NOOP. DAG size: 16 [2018-01-31 09:02:55,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:02:55,184 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:02:55,184 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 09:02:55,184 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 09:02:55,184 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 09:02:55,185 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:02:55,185 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand 8 states. [2018-01-31 09:02:56,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:02:56,315 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2018-01-31 09:02:56,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-31 09:02:56,316 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2018-01-31 09:02:56,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:02:56,317 INFO L225 Difference]: With dead ends: 93 [2018-01-31 09:02:56,317 INFO L226 Difference]: Without dead ends: 88 [2018-01-31 09:02:56,318 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2018-01-31 09:02:56,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-01-31 09:02:56,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2018-01-31 09:02:56,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-31 09:02:56,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2018-01-31 09:02:56,325 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 43 [2018-01-31 09:02:56,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:02:56,325 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2018-01-31 09:02:56,325 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 09:02:56,325 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2018-01-31 09:02:56,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-31 09:02:56,326 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:02:56,326 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:02:56,326 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-31 09:02:56,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1612728475, now seen corresponding path program 1 times [2018-01-31 09:02:56,326 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:02:56,327 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:02:56,328 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:56,328 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:02:56,328 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:56,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:02:56,343 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:02:56,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:02:56,597 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:02:56,597 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 09:02:56,598 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 09:02:56,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 09:02:56,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-01-31 09:02:56,598 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand 7 states. [2018-01-31 09:02:56,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:02:56,985 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2018-01-31 09:02:56,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 09:02:56,986 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2018-01-31 09:02:56,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:02:56,987 INFO L225 Difference]: With dead ends: 90 [2018-01-31 09:02:56,987 INFO L226 Difference]: Without dead ends: 88 [2018-01-31 09:02:56,987 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-01-31 09:02:56,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-01-31 09:02:56,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2018-01-31 09:02:56,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-31 09:02:56,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2018-01-31 09:02:56,994 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 43 [2018-01-31 09:02:56,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:02:56,994 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2018-01-31 09:02:56,994 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 09:02:56,994 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2018-01-31 09:02:56,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-31 09:02:56,995 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:02:56,995 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:02:56,995 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-31 09:02:56,995 INFO L82 PathProgramCache]: Analyzing trace with hash -651172529, now seen corresponding path program 1 times [2018-01-31 09:02:56,995 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:02:56,995 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:02:56,996 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:56,996 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:02:56,997 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:57,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:02:57,009 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:02:57,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:02:57,112 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:02:57,113 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 09:02:57,113 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:02:57,113 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:02:57,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:02:57,113 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand 6 states. [2018-01-31 09:02:57,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:02:57,143 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2018-01-31 09:02:57,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 09:02:57,143 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-01-31 09:02:57,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:02:57,144 INFO L225 Difference]: With dead ends: 109 [2018-01-31 09:02:57,145 INFO L226 Difference]: Without dead ends: 81 [2018-01-31 09:02:57,145 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:02:57,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-31 09:02:57,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2018-01-31 09:02:57,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-31 09:02:57,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2018-01-31 09:02:57,151 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 45 [2018-01-31 09:02:57,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:02:57,152 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2018-01-31 09:02:57,152 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:02:57,152 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2018-01-31 09:02:57,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-31 09:02:57,153 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:02:57,153 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:02:57,153 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-31 09:02:57,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1396533477, now seen corresponding path program 1 times [2018-01-31 09:02:57,153 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:02:57,153 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:02:57,154 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:57,154 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:02:57,155 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:57,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:02:57,166 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:02:57,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:02:57,447 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:02:57,447 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 09:02:57,447 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 09:02:57,447 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 09:02:57,448 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:02:57,448 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 8 states. [2018-01-31 09:02:57,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:02:57,753 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-01-31 09:02:57,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 09:02:57,754 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2018-01-31 09:02:57,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:02:57,755 INFO L225 Difference]: With dead ends: 82 [2018-01-31 09:02:57,755 INFO L226 Difference]: Without dead ends: 81 [2018-01-31 09:02:57,755 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-01-31 09:02:57,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-31 09:02:57,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2018-01-31 09:02:57,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-31 09:02:57,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2018-01-31 09:02:57,763 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 45 [2018-01-31 09:02:57,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:02:57,764 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2018-01-31 09:02:57,764 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 09:02:57,764 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2018-01-31 09:02:57,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-31 09:02:57,764 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:02:57,765 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:02:57,765 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-31 09:02:57,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1396533478, now seen corresponding path program 1 times [2018-01-31 09:02:57,765 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:02:57,765 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:02:57,766 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:57,766 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:02:57,766 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:57,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:02:57,777 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:02:58,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:02:58,037 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:02:58,037 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-31 09:02:58,038 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-31 09:02:58,038 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-31 09:02:58,038 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-31 09:02:58,038 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 10 states. [2018-01-31 09:02:58,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:02:58,356 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2018-01-31 09:02:58,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-31 09:02:58,356 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2018-01-31 09:02:58,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:02:58,357 INFO L225 Difference]: With dead ends: 77 [2018-01-31 09:02:58,357 INFO L226 Difference]: Without dead ends: 76 [2018-01-31 09:02:58,357 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2018-01-31 09:02:58,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-31 09:02:58,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-01-31 09:02:58,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-31 09:02:58,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2018-01-31 09:02:58,365 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 45 [2018-01-31 09:02:58,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:02:58,365 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2018-01-31 09:02:58,365 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-31 09:02:58,365 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2018-01-31 09:02:58,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-31 09:02:58,366 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:02:58,366 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:02:58,366 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-31 09:02:58,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1316017239, now seen corresponding path program 1 times [2018-01-31 09:02:58,367 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:02:58,367 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:02:58,368 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:58,369 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:02:58,369 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:58,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:02:58,385 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:02:58,725 WARN L146 SmtUtils]: Spent 180ms on a formula simplification. DAG size of input: 13 DAG size of output 10 [2018-01-31 09:02:58,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:02:58,768 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:02:58,768 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 09:02:58,769 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 09:02:58,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 09:02:58,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:02:58,769 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 8 states. [2018-01-31 09:02:58,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:02:58,976 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2018-01-31 09:02:58,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 09:02:58,977 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2018-01-31 09:02:58,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:02:58,977 INFO L225 Difference]: With dead ends: 77 [2018-01-31 09:02:58,978 INFO L226 Difference]: Without dead ends: 76 [2018-01-31 09:02:58,978 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-01-31 09:02:58,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-31 09:02:58,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2018-01-31 09:02:58,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-31 09:02:58,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-01-31 09:02:58,984 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 55 [2018-01-31 09:02:58,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:02:58,984 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-01-31 09:02:58,984 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 09:02:58,984 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-01-31 09:02:58,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-31 09:02:58,985 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:02:58,985 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:02:58,985 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-31 09:02:58,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1914552327, now seen corresponding path program 1 times [2018-01-31 09:02:58,986 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:02:58,986 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:02:58,987 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:58,987 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:02:58,987 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:02:59,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-31 09:02:59,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-31 09:02:59,066 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-01-31 09:02:59,098 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-31 09:02:59,105 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-31 09:02:59,105 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 7 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-31 09:02:59,106 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 7 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-31 09:02:59,106 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-31 09:02:59,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 09:02:59 BoogieIcfgContainer [2018-01-31 09:02:59,120 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-31 09:02:59,121 INFO L168 Benchmark]: Toolchain (without parser) took 9854.06 ms. Allocated memory was 305.1 MB in the beginning and 542.6 MB in the end (delta: 237.5 MB). Free memory was 261.9 MB in the beginning and 459.0 MB in the end (delta: -197.2 MB). Peak memory consumption was 40.3 MB. Max. memory is 5.3 GB. [2018-01-31 09:02:59,123 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 305.1 MB. Free memory is still 267.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 09:02:59,123 INFO L168 Benchmark]: CACSL2BoogieTranslator took 329.42 ms. Allocated memory is still 305.1 MB. Free memory was 261.9 MB in the beginning and 247.9 MB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 5.3 GB. [2018-01-31 09:02:59,123 INFO L168 Benchmark]: Boogie Preprocessor took 36.16 ms. Allocated memory is still 305.1 MB. Free memory was 247.9 MB in the beginning and 245.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:02:59,123 INFO L168 Benchmark]: RCFGBuilder took 573.18 ms. Allocated memory is still 305.1 MB. Free memory was 245.9 MB in the beginning and 224.8 MB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 5.3 GB. [2018-01-31 09:02:59,124 INFO L168 Benchmark]: TraceAbstraction took 8903.96 ms. Allocated memory was 305.1 MB in the beginning and 542.6 MB in the end (delta: 237.5 MB). Free memory was 224.8 MB in the beginning and 459.0 MB in the end (delta: -234.2 MB). Peak memory consumption was 3.3 MB. Max. memory is 5.3 GB. [2018-01-31 09:02:59,125 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.18 ms. Allocated memory is still 305.1 MB. Free memory is still 267.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 329.42 ms. Allocated memory is still 305.1 MB. Free memory was 261.9 MB in the beginning and 247.9 MB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.16 ms. Allocated memory is still 305.1 MB. Free memory was 247.9 MB in the beginning and 245.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 573.18 ms. Allocated memory is still 305.1 MB. Free memory was 245.9 MB in the beginning and 224.8 MB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 8903.96 ms. Allocated memory was 305.1 MB in the beginning and 542.6 MB in the end (delta: 237.5 MB). Free memory was 224.8 MB in the beginning and 459.0 MB in the end (delta: -234.2 MB). Peak memory consumption was 3.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 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, 8.8s OverallTime, 17 OverallIterations, 1 TraceHistogramMax, 4.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1178 SDtfs, 1020 SDslu, 3155 SDs, 0 SdLazy, 1207 SolverSat, 203 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 160 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 3.5s 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.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 60 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.2s 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-31_09-02-59-133.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-31_09-02-59-133.csv Received shutdown request...