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_Taipan+AI_EQ_precise.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test7_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 00:07:00,178 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 00:07:00,180 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 00:07:00,193 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 00:07:00,194 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 00:07:00,194 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 00:07:00,195 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 00:07:00,196 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 00:07:00,198 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 00:07:00,198 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 00:07:00,199 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 00:07:00,199 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 00:07:00,200 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 00:07:00,200 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 00:07:00,201 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 00:07:00,204 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 00:07:00,206 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 00:07:00,208 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 00:07:00,209 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 00:07:00,210 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 00:07:00,212 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 00:07:00,213 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 00:07:00,213 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 00:07:00,214 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 00:07:00,215 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 00:07:00,216 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 00:07:00,216 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 00:07:00,217 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 00:07:00,217 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 00:07:00,217 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 00:07:00,218 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 00:07:00,218 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf [2018-01-25 00:07:00,228 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 00:07:00,228 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 00:07:00,229 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 00:07:00,229 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 00:07:00,229 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 00:07:00,230 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 00:07:00,230 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 00:07:00,230 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 00:07:00,231 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 00:07:00,231 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 00:07:00,231 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 00:07:00,231 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 00:07:00,231 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 00:07:00,232 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 00:07:00,232 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 00:07:00,232 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 00:07:00,232 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 00:07:00,232 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 00:07:00,233 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 00:07:00,233 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 00:07:00,233 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 00:07:00,233 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 00:07:00,233 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 00:07:00,234 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 00:07:00,234 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 00:07:00,234 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 00:07:00,234 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 00:07:00,234 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 00:07:00,235 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 00:07:00,235 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 00:07:00,235 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 00:07:00,235 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 00:07:00,235 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 00:07:00,236 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 00:07:00,236 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 00:07:00,237 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 00:07:00,272 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 00:07:00,284 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 00:07:00,288 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 00:07:00,290 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 00:07:00,290 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 00:07:00,291 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test7_false-valid-memtrack_true-termination.i [2018-01-25 00:07:00,472 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 00:07:00,478 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 00:07:00,479 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 00:07:00,479 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 00:07:00,484 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 00:07:00,485 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 12:07:00" (1/1) ... [2018-01-25 00:07:00,489 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d434187 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:07:00, skipping insertion in model container [2018-01-25 00:07:00,489 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 12:07:00" (1/1) ... [2018-01-25 00:07:00,509 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 00:07:00,561 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 00:07:00,664 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 00:07:00,680 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 00:07:00,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:07:00 WrapperNode [2018-01-25 00:07:00,688 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 00:07:00,689 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 00:07:00,689 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 00:07:00,690 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 00:07:00,706 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:07:00" (1/1) ... [2018-01-25 00:07:00,707 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:07:00" (1/1) ... [2018-01-25 00:07:00,717 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:07:00" (1/1) ... [2018-01-25 00:07:00,718 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:07:00" (1/1) ... [2018-01-25 00:07:00,721 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:07:00" (1/1) ... [2018-01-25 00:07:00,722 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:07:00" (1/1) ... [2018-01-25 00:07:00,723 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:07:00" (1/1) ... [2018-01-25 00:07:00,725 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 00:07:00,725 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 00:07:00,725 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 00:07:00,725 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 00:07:00,726 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:07:00" (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-25 00:07:00,772 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 00:07:00,772 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 00:07:00,772 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-25 00:07:00,772 INFO L136 BoogieDeclarations]: Found implementation of procedure f6 [2018-01-25 00:07:00,772 INFO L136 BoogieDeclarations]: Found implementation of procedure g6 [2018-01-25 00:07:00,772 INFO L136 BoogieDeclarations]: Found implementation of procedure probe1_6 [2018-01-25 00:07:00,772 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_2_6 [2018-01-25 00:07:00,772 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-25 00:07:00,772 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 00:07:00,773 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 00:07:00,773 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 00:07:00,773 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 00:07:00,773 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 00:07:00,773 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 00:07:00,773 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 00:07:00,773 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 00:07:00,773 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 00:07:00,773 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-25 00:07:00,774 INFO L128 BoogieDeclarations]: Found specification of procedure f6 [2018-01-25 00:07:00,774 INFO L128 BoogieDeclarations]: Found specification of procedure g6 [2018-01-25 00:07:00,774 INFO L128 BoogieDeclarations]: Found specification of procedure probe1_6 [2018-01-25 00:07:00,774 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_2_6 [2018-01-25 00:07:00,774 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-25 00:07:00,774 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 00:07:00,775 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 00:07:00,775 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 00:07:00,970 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 00:07:00,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 12:07:00 BoogieIcfgContainer [2018-01-25 00:07:00,970 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 00:07:00,971 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 00:07:00,971 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 00:07:00,973 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 00:07:00,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 12:07:00" (1/3) ... [2018-01-25 00:07:00,974 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dd21cc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 12:07:00, skipping insertion in model container [2018-01-25 00:07:00,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:07:00" (2/3) ... [2018-01-25 00:07:00,974 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dd21cc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 12:07:00, skipping insertion in model container [2018-01-25 00:07:00,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 12:07:00" (3/3) ... [2018-01-25 00:07:00,976 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test7_false-valid-memtrack_true-termination.i [2018-01-25 00:07:00,982 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 00:07:00,988 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-01-25 00:07:01,035 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 00:07:01,035 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 00:07:01,036 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 00:07:01,036 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 00:07:01,036 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 00:07:01,036 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 00:07:01,036 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 00:07:01,037 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 00:07:01,038 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 00:07:01,059 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-01-25 00:07:01,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 00:07:01,067 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:07:01,068 INFO L322 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] [2018-01-25 00:07:01,069 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 00:07:01,073 INFO L82 PathProgramCache]: Analyzing trace with hash 2071706780, now seen corresponding path program 1 times [2018-01-25 00:07:01,075 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:07:01,122 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:07:01,123 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:07:01,123 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:07:01,123 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:07:01,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:07:01,181 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:07:01,364 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-25 00:07:01,366 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:07:01,366 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 00:07:01,366 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:07:01,368 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 00:07:01,378 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 00:07:01,379 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 00:07:01,380 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 5 states. [2018-01-25 00:07:01,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:07:01,490 INFO L93 Difference]: Finished difference Result 98 states and 105 transitions. [2018-01-25 00:07:01,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 00:07:01,492 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-01-25 00:07:01,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:07:01,504 INFO L225 Difference]: With dead ends: 98 [2018-01-25 00:07:01,504 INFO L226 Difference]: Without dead ends: 58 [2018-01-25 00:07:01,508 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 00:07:01,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-25 00:07:01,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2018-01-25 00:07:01,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-25 00:07:01,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-01-25 00:07:01,544 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 23 [2018-01-25 00:07:01,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:07:01,544 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-01-25 00:07:01,545 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 00:07:01,545 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-01-25 00:07:01,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-25 00:07:01,546 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:07:01,546 INFO L322 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] [2018-01-25 00:07:01,547 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 00:07:01,547 INFO L82 PathProgramCache]: Analyzing trace with hash -776458562, now seen corresponding path program 1 times [2018-01-25 00:07:01,547 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:07:01,549 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:07:01,549 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:07:01,549 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:07:01,549 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:07:01,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:07:01,580 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:07:01,646 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-25 00:07:01,646 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:07:01,647 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 00:07:01,647 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:07:01,648 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 00:07:01,648 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 00:07:01,649 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 00:07:01,649 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 6 states. [2018-01-25 00:07:01,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:07:01,728 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2018-01-25 00:07:01,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 00:07:01,729 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-25 00:07:01,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:07:01,731 INFO L225 Difference]: With dead ends: 56 [2018-01-25 00:07:01,731 INFO L226 Difference]: Without dead ends: 55 [2018-01-25 00:07:01,732 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 00:07:01,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-25 00:07:01,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-01-25 00:07:01,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-25 00:07:01,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-01-25 00:07:01,738 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 25 [2018-01-25 00:07:01,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:07:01,738 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-01-25 00:07:01,739 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 00:07:01,739 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-01-25 00:07:01,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-25 00:07:01,740 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:07:01,740 INFO L322 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] [2018-01-25 00:07:01,740 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 00:07:01,741 INFO L82 PathProgramCache]: Analyzing trace with hash -776458561, now seen corresponding path program 1 times [2018-01-25 00:07:01,741 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:07:01,742 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:07:01,743 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:07:01,743 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:07:01,743 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:07:01,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:07:01,764 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:07:01,823 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-25 00:07:01,824 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:07:01,824 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 00:07:01,824 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:07:01,824 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 00:07:01,825 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 00:07:01,825 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 00:07:01,825 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 6 states. [2018-01-25 00:07:01,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:07:01,943 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-01-25 00:07:01,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 00:07:01,943 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-25 00:07:01,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:07:01,945 INFO L225 Difference]: With dead ends: 57 [2018-01-25 00:07:01,945 INFO L226 Difference]: Without dead ends: 56 [2018-01-25 00:07:01,945 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 00:07:01,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-25 00:07:01,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2018-01-25 00:07:01,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-25 00:07:01,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-01-25 00:07:01,953 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 25 [2018-01-25 00:07:01,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:07:01,953 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-01-25 00:07:01,954 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 00:07:01,954 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-01-25 00:07:01,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-25 00:07:01,955 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:07:01,955 INFO L322 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] [2018-01-25 00:07:01,955 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 00:07:01,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1521421354, now seen corresponding path program 1 times [2018-01-25 00:07:01,955 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:07:01,957 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:07:01,957 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:07:01,957 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:07:01,957 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:07:01,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:07:01,975 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:07:02,063 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-25 00:07:02,063 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:07:02,063 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 00:07:02,064 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:07:02,064 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 00:07:02,064 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 00:07:02,064 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 00:07:02,065 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 4 states. [2018-01-25 00:07:02,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:07:02,186 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2018-01-25 00:07:02,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 00:07:02,187 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-01-25 00:07:02,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:07:02,188 INFO L225 Difference]: With dead ends: 65 [2018-01-25 00:07:02,188 INFO L226 Difference]: Without dead ends: 50 [2018-01-25 00:07:02,188 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 00:07:02,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-25 00:07:02,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-25 00:07:02,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-25 00:07:02,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-01-25 00:07:02,199 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 25 [2018-01-25 00:07:02,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:07:02,199 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-01-25 00:07:02,199 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 00:07:02,199 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-01-25 00:07:02,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 00:07:02,200 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:07:02,201 INFO L322 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] [2018-01-25 00:07:02,201 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 00:07:02,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1580819832, now seen corresponding path program 1 times [2018-01-25 00:07:02,201 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:07:02,202 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:07:02,203 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:07:02,203 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:07:02,203 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:07:02,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:07:02,213 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:07:02,273 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-25 00:07:02,274 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:07:02,274 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 00:07:02,274 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:07:02,274 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 00:07:02,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 00:07:02,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 00:07:02,275 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 6 states. [2018-01-25 00:07:02,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:07:02,324 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-01-25 00:07:02,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 00:07:02,325 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-01-25 00:07:02,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:07:02,326 INFO L225 Difference]: With dead ends: 64 [2018-01-25 00:07:02,326 INFO L226 Difference]: Without dead ends: 50 [2018-01-25 00:07:02,326 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 00:07:02,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-25 00:07:02,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-25 00:07:02,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-25 00:07:02,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2018-01-25 00:07:02,332 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 27 [2018-01-25 00:07:02,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:07:02,332 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2018-01-25 00:07:02,332 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 00:07:02,332 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2018-01-25 00:07:02,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-25 00:07:02,333 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:07:02,333 INFO L322 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] [2018-01-25 00:07:02,333 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 00:07:02,333 INFO L82 PathProgramCache]: Analyzing trace with hash -693357389, now seen corresponding path program 1 times [2018-01-25 00:07:02,333 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:07:02,334 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:07:02,335 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:07:02,335 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:07:02,335 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:07:02,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:07:02,351 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:07:02,543 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-25 00:07:02,543 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:07:02,543 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 00:07:02,543 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:07:02,543 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 00:07:02,544 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 00:07:02,544 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-25 00:07:02,544 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand 8 states. [2018-01-25 00:07:02,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:07:02,735 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2018-01-25 00:07:02,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 00:07:02,736 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-01-25 00:07:02,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:07:02,737 INFO L225 Difference]: With dead ends: 56 [2018-01-25 00:07:02,737 INFO L226 Difference]: Without dead ends: 55 [2018-01-25 00:07:02,737 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-01-25 00:07:02,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-25 00:07:02,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2018-01-25 00:07:02,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-25 00:07:02,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2018-01-25 00:07:02,747 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 31 [2018-01-25 00:07:02,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:07:02,747 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2018-01-25 00:07:02,748 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 00:07:02,748 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2018-01-25 00:07:02,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-25 00:07:02,749 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:07:02,749 INFO L322 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] [2018-01-25 00:07:02,749 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 00:07:02,749 INFO L82 PathProgramCache]: Analyzing trace with hash -693357388, now seen corresponding path program 1 times [2018-01-25 00:07:02,750 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:07:02,751 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:07:02,751 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:07:02,751 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:07:02,751 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:07:02,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:07:02,767 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:07:02,957 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-25 00:07:02,957 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:07:02,957 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 00:07:02,958 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:07:02,958 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 00:07:02,958 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 00:07:02,958 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-25 00:07:02,958 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 9 states. [2018-01-25 00:07:03,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:07:03,344 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2018-01-25 00:07:03,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 00:07:03,344 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-01-25 00:07:03,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:07:03,345 INFO L225 Difference]: With dead ends: 51 [2018-01-25 00:07:03,345 INFO L226 Difference]: Without dead ends: 50 [2018-01-25 00:07:03,346 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-01-25 00:07:03,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-25 00:07:03,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2018-01-25 00:07:03,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-25 00:07:03,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-01-25 00:07:03,355 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 31 [2018-01-25 00:07:03,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:07:03,355 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-01-25 00:07:03,355 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 00:07:03,355 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-01-25 00:07:03,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-25 00:07:03,356 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:07:03,356 INFO L322 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-25 00:07:03,356 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 00:07:03,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1580514095, now seen corresponding path program 1 times [2018-01-25 00:07:03,357 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:07:03,358 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:07:03,358 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:07:03,358 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:07:03,358 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:07:03,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:07:03,373 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:07:03,667 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-25 00:07:03,668 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:07:03,668 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 00:07:03,668 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:07:03,669 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 00:07:03,669 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 00:07:03,669 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-25 00:07:03,669 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 9 states. [2018-01-25 00:07:03,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:07:03,899 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2018-01-25 00:07:03,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 00:07:03,899 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-01-25 00:07:03,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:07:03,900 INFO L225 Difference]: With dead ends: 59 [2018-01-25 00:07:03,900 INFO L226 Difference]: Without dead ends: 46 [2018-01-25 00:07:03,901 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-01-25 00:07:03,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-25 00:07:03,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-01-25 00:07:03,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-25 00:07:03,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-01-25 00:07:03,910 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 35 [2018-01-25 00:07:03,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:07:03,910 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-01-25 00:07:03,910 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 00:07:03,910 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-01-25 00:07:03,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-25 00:07:03,912 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:07:03,945 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:07:03,945 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 00:07:03,945 INFO L82 PathProgramCache]: Analyzing trace with hash 720787466, now seen corresponding path program 1 times [2018-01-25 00:07:03,945 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:07:03,946 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:07:03,946 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:07:03,946 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:07:03,947 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:07:03,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:07:03,958 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:07:04,003 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-25 00:07:04,003 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:07:04,003 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 00:07:04,003 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:07:04,003 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 00:07:04,004 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 00:07:04,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 00:07:04,004 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 5 states. [2018-01-25 00:07:04,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:07:04,012 INFO L93 Difference]: Finished difference Result 52 states and 51 transitions. [2018-01-25 00:07:04,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 00:07:04,013 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-01-25 00:07:04,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:07:04,014 INFO L225 Difference]: With dead ends: 52 [2018-01-25 00:07:04,014 INFO L226 Difference]: Without dead ends: 46 [2018-01-25 00:07:04,014 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 00:07:04,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-25 00:07:04,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-01-25 00:07:04,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-25 00:07:04,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 45 transitions. [2018-01-25 00:07:04,022 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 45 transitions. Word has length 41 [2018-01-25 00:07:04,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:07:04,023 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 45 transitions. [2018-01-25 00:07:04,023 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 00:07:04,023 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 45 transitions. [2018-01-25 00:07:04,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-25 00:07:04,024 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:07:04,024 INFO L322 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-25 00:07:04,024 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 00:07:04,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1114160435, now seen corresponding path program 1 times [2018-01-25 00:07:04,025 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:07:04,026 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:07:04,026 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:07:04,026 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:07:04,026 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:07:04,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-25 00:07:04,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-25 00:07:04,077 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-25 00:07:04,093 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-25 00:07:04,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 12:07:04 BoogieIcfgContainer [2018-01-25 00:07:04,112 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 00:07:04,113 INFO L168 Benchmark]: Toolchain (without parser) took 3639.78 ms. Allocated memory was 305.1 MB in the beginning and 507.5 MB in the end (delta: 202.4 MB). Free memory was 264.1 MB in the beginning and 434.1 MB in the end (delta: -170.0 MB). Peak memory consumption was 32.3 MB. Max. memory is 5.3 GB. [2018-01-25 00:07:04,114 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 305.1 MB. Free memory is still 271.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 00:07:04,114 INFO L168 Benchmark]: CACSL2BoogieTranslator took 209.95 ms. Allocated memory is still 305.1 MB. Free memory was 264.1 MB in the beginning and 251.0 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 5.3 GB. [2018-01-25 00:07:04,114 INFO L168 Benchmark]: Boogie Preprocessor took 35.61 ms. Allocated memory is still 305.1 MB. Free memory was 251.0 MB in the beginning and 249.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 00:07:04,115 INFO L168 Benchmark]: RCFGBuilder took 245.29 ms. Allocated memory is still 305.1 MB. Free memory was 249.0 MB in the beginning and 231.0 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB. [2018-01-25 00:07:04,115 INFO L168 Benchmark]: TraceAbstraction took 3140.63 ms. Allocated memory was 305.1 MB in the beginning and 507.5 MB in the end (delta: 202.4 MB). Free memory was 231.0 MB in the beginning and 434.1 MB in the end (delta: -203.1 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 00:07:04,117 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 271.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 209.95 ms. Allocated memory is still 305.1 MB. Free memory was 264.1 MB in the beginning and 251.0 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.61 ms. Allocated memory is still 305.1 MB. Free memory was 251.0 MB in the beginning and 249.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 245.29 ms. Allocated memory is still 305.1 MB. Free memory was 249.0 MB in the beginning and 231.0 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 3140.63 ms. Allocated memory was 305.1 MB in the beginning and 507.5 MB in the end (delta: 202.4 MB). Free memory was 231.0 MB in the beginning and 434.1 MB in the end (delta: -203.1 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1473]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1473. Possible FailurePath: [L1474] CALL entry_point() [L1466] FCALL struct A a7; VAL [a7={7:0}] [L1467] CALL, EXPR probe1_6(&a7) VAL [a={7:0}] [L1443] int ret = - -3; VAL [a={7:0}, a={7:0}, ret=3] [L1444] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(size)=4] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=4, malloc(size)={6:0}, size=4] [L1074] RET return malloc(size); VAL [\old(size)=4, \result={6:0}, malloc(size)={6:0}, size=4] [L1444] EXPR ldv_malloc(sizeof(int)) VAL [a={7:0}, a={7:0}, ldv_malloc(sizeof(int))={6:0}, ret=3] [L1444] int *p = (int *)ldv_malloc(sizeof(int)); [L1445] COND FALSE !(p==0) VAL [a={7:0}, a={7:0}, p={6:0}, ret=3] [L1447] CALL, EXPR f6() [L1435] RET return __VERIFIER_nondet_int(); [L1447] EXPR f6() VAL [a={7:0}, a={7:0}, f6()=0, p={6:0}, ret=3] [L1447] ret = f6() [L1448] COND FALSE !(ret<0) VAL [a={7:0}, a={7:0}, p={6:0}, ret=0] [L1450] CALL, EXPR g6() [L1439] RET return __VERIFIER_nondet_int(); [L1450] EXPR g6() VAL [a={7:0}, a={7:0}, g6()=0, p={6:0}, ret=0] [L1450] ret = g6() [L1451] COND FALSE !(ret<0) VAL [a={7:0}, a={7:0}, p={6:0}, ret=0] [L1453] FCALL a->p = p VAL [a={7:0}, a={7:0}, p={6:0}, ret=0] [L1454] RET return 0; VAL [\result=0, a={7:0}, a={7:0}, p={6:0}, ret=0] [L1467] EXPR probe1_6(&a7) VAL [a7={7:0}, probe1_6(&a7)=0] [L1467] int ret = probe1_6(&a7); [L1468] COND TRUE ret==0 VAL [a7={7:0}, ret=0] [L1469] RET, FCALL disconnect_2_6(&a7) VAL [a7={7:0}, ret=0] [L1474] entry_point() - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 55 locations, 5 error locations. UNSAFE Result, 3.0s OverallTime, 10 OverallIterations, 1 TraceHistogramMax, 1.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 420 SDtfs, 155 SDslu, 1215 SDs, 0 SdLazy, 698 SolverSat, 50 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 21 SyntacticMatches, 5 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=1, 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, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 12 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 308 NumberOfCodeBlocks, 308 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 254 ConstructedInterpolants, 0 QuantifiedInterpolants, 31222 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: 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_test7_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_00-07-04-124.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test7_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_00-07-04-124.csv Received shutdown request...