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_test7_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-30 00:09:38,272 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 00:09:38,274 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 00:09:38,288 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 00:09:38,288 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 00:09:38,289 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 00:09:38,289 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 00:09:38,291 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 00:09:38,292 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 00:09:38,293 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 00:09:38,294 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 00:09:38,294 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 00:09:38,294 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 00:09:38,295 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 00:09:38,296 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 00:09:38,299 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 00:09:38,301 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 00:09:38,303 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 00:09:38,304 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 00:09:38,306 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 00:09:38,308 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 00:09:38,309 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 00:09:38,309 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 00:09:38,310 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 00:09:38,311 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 00:09:38,312 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 00:09:38,312 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 00:09:38,313 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 00:09:38,313 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 00:09:38,313 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 00:09:38,314 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 00:09:38,314 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-30 00:09:38,324 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 00:09:38,325 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 00:09:38,325 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 00:09:38,326 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 00:09:38,326 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 00:09:38,326 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 00:09:38,326 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 00:09:38,327 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 00:09:38,327 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 00:09:38,327 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-30 00:09:38,327 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 00:09:38,328 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 00:09:38,328 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 00:09:38,328 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-30 00:09:38,328 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-30 00:09:38,328 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-30 00:09:38,328 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 00:09:38,329 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 00:09:38,329 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 00:09:38,329 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 00:09:38,329 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 00:09:38,329 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 00:09:38,330 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 00:09:38,330 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 00:09:38,330 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 00:09:38,330 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 00:09:38,330 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 00:09:38,331 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 00:09:38,331 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 00:09:38,331 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 00:09:38,331 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 00:09:38,331 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 00:09:38,332 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 00:09:38,332 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 00:09:38,365 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 00:09:38,376 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 00:09:38,379 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 00:09:38,381 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 00:09:38,381 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 00:09:38,382 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-30 00:09:38,573 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 00:09:38,578 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-30 00:09:38,578 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 00:09:38,579 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 00:09:38,584 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 00:09:38,585 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:09:38" (1/1) ... [2018-01-30 00:09:38,588 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57fba5f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:09:38, skipping insertion in model container [2018-01-30 00:09:38,588 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:09:38" (1/1) ... [2018-01-30 00:09:38,602 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:09:38,652 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:09:38,773 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:09:38,790 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:09:38,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:09:38 WrapperNode [2018-01-30 00:09:38,798 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 00:09:38,799 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 00:09:38,799 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 00:09:38,799 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 00:09:38,816 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:09:38" (1/1) ... [2018-01-30 00:09:38,816 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:09:38" (1/1) ... [2018-01-30 00:09:38,828 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:09:38" (1/1) ... [2018-01-30 00:09:38,828 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:09:38" (1/1) ... [2018-01-30 00:09:38,831 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:09:38" (1/1) ... [2018-01-30 00:09:38,833 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:09:38" (1/1) ... [2018-01-30 00:09:38,834 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:09:38" (1/1) ... [2018-01-30 00:09:38,836 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 00:09:38,836 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 00:09:38,837 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 00:09:38,837 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 00:09:38,838 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:09:38" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 00:09:38,890 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 00:09:38,890 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 00:09:38,890 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-30 00:09:38,890 INFO L136 BoogieDeclarations]: Found implementation of procedure f6 [2018-01-30 00:09:38,890 INFO L136 BoogieDeclarations]: Found implementation of procedure g6 [2018-01-30 00:09:38,891 INFO L136 BoogieDeclarations]: Found implementation of procedure probe1_6 [2018-01-30 00:09:38,891 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_2_6 [2018-01-30 00:09:38,891 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-30 00:09:38,891 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 00:09:38,891 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-30 00:09:38,891 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-30 00:09:38,892 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-30 00:09:38,892 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-30 00:09:38,892 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-30 00:09:38,892 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-30 00:09:38,892 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-30 00:09:38,892 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 00:09:38,893 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-30 00:09:38,893 INFO L128 BoogieDeclarations]: Found specification of procedure f6 [2018-01-30 00:09:38,893 INFO L128 BoogieDeclarations]: Found specification of procedure g6 [2018-01-30 00:09:38,893 INFO L128 BoogieDeclarations]: Found specification of procedure probe1_6 [2018-01-30 00:09:38,893 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_2_6 [2018-01-30 00:09:38,893 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-30 00:09:38,894 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 00:09:38,894 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 00:09:38,894 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 00:09:39,125 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 00:09:39,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:09:39 BoogieIcfgContainer [2018-01-30 00:09:39,143 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 00:09:39,144 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 00:09:39,144 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 00:09:39,146 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 00:09:39,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 12:09:38" (1/3) ... [2018-01-30 00:09:39,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@198c7d35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:09:39, skipping insertion in model container [2018-01-30 00:09:39,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:09:38" (2/3) ... [2018-01-30 00:09:39,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@198c7d35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:09:39, skipping insertion in model container [2018-01-30 00:09:39,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:09:39" (3/3) ... [2018-01-30 00:09:39,149 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test7_false-valid-memtrack_true-termination.i [2018-01-30 00:09:39,155 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 00:09:39,160 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-01-30 00:09:39,202 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 00:09:39,203 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 00:09:39,203 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 00:09:39,203 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 00:09:39,203 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 00:09:39,203 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 00:09:39,203 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 00:09:39,204 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 00:09:39,204 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 00:09:39,224 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2018-01-30 00:09:39,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-30 00:09:39,230 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:09:39,230 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:09:39,231 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-30 00:09:39,234 INFO L82 PathProgramCache]: Analyzing trace with hash -160345570, now seen corresponding path program 1 times [2018-01-30 00:09:39,236 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:09:39,236 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:09:39,282 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:39,283 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:09:39,283 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:39,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:09:39,341 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:09:39,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:09:39,474 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:09:39,475 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:09:39,477 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:09:39,492 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:09:39,493 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:09:39,495 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 5 states. [2018-01-30 00:09:39,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:09:39,653 INFO L93 Difference]: Finished difference Result 98 states and 107 transitions. [2018-01-30 00:09:39,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:09:39,655 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-01-30 00:09:39,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:09:39,667 INFO L225 Difference]: With dead ends: 98 [2018-01-30 00:09:39,667 INFO L226 Difference]: Without dead ends: 94 [2018-01-30 00:09:39,671 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:09:39,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-01-30 00:09:39,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 86. [2018-01-30 00:09:39,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-30 00:09:39,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2018-01-30 00:09:39,715 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 33 [2018-01-30 00:09:39,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:09:39,717 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2018-01-30 00:09:39,717 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:09:39,717 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2018-01-30 00:09:39,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-30 00:09:39,720 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:09:39,720 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:09:39,720 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-30 00:09:39,720 INFO L82 PathProgramCache]: Analyzing trace with hash -160345571, now seen corresponding path program 1 times [2018-01-30 00:09:39,721 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:09:39,721 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:09:39,723 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:39,723 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:09:39,723 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:39,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:09:39,746 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:09:39,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:09:39,841 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:09:39,841 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:09:39,843 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:09:39,843 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:09:39,843 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:09:39,843 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand 5 states. [2018-01-30 00:09:39,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:09:39,908 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2018-01-30 00:09:39,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:09:39,908 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-01-30 00:09:39,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:09:39,910 INFO L225 Difference]: With dead ends: 93 [2018-01-30 00:09:39,911 INFO L226 Difference]: Without dead ends: 92 [2018-01-30 00:09:39,912 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:09:39,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-01-30 00:09:39,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 86. [2018-01-30 00:09:39,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-30 00:09:39,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2018-01-30 00:09:39,924 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 33 [2018-01-30 00:09:39,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:09:39,925 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2018-01-30 00:09:39,925 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:09:39,925 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2018-01-30 00:09:39,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-30 00:09:39,927 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:09:39,927 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:09:39,927 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-30 00:09:39,927 INFO L82 PathProgramCache]: Analyzing trace with hash 88767254, now seen corresponding path program 1 times [2018-01-30 00:09:39,927 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:09:39,927 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:09:39,929 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:39,929 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:09:39,929 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:39,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:09:39,953 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:09:40,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:09:40,036 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:09:40,037 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:09:40,037 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:09:40,037 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:09:40,037 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:09:40,038 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand 6 states. [2018-01-30 00:09:40,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:09:40,181 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2018-01-30 00:09:40,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:09:40,181 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-01-30 00:09:40,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:09:40,183 INFO L225 Difference]: With dead ends: 93 [2018-01-30 00:09:40,183 INFO L226 Difference]: Without dead ends: 92 [2018-01-30 00:09:40,184 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:09:40,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-01-30 00:09:40,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 85. [2018-01-30 00:09:40,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-30 00:09:40,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2018-01-30 00:09:40,194 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 34 [2018-01-30 00:09:40,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:09:40,195 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2018-01-30 00:09:40,195 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:09:40,195 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2018-01-30 00:09:40,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-30 00:09:40,196 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:09:40,196 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:09:40,197 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-30 00:09:40,197 INFO L82 PathProgramCache]: Analyzing trace with hash 88767253, now seen corresponding path program 1 times [2018-01-30 00:09:40,197 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:09:40,197 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:09:40,198 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:40,199 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:09:40,199 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:40,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:09:40,218 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:09:40,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:09:40,273 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:09:40,273 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:09:40,273 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:09:40,274 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:09:40,274 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:09:40,274 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand 6 states. [2018-01-30 00:09:40,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:09:40,316 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2018-01-30 00:09:40,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 00:09:40,318 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-01-30 00:09:40,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:09:40,319 INFO L225 Difference]: With dead ends: 85 [2018-01-30 00:09:40,319 INFO L226 Difference]: Without dead ends: 84 [2018-01-30 00:09:40,320 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:09:40,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-30 00:09:40,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 68. [2018-01-30 00:09:40,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-30 00:09:40,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-01-30 00:09:40,326 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 34 [2018-01-30 00:09:40,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:09:40,326 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-01-30 00:09:40,326 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:09:40,326 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-01-30 00:09:40,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-30 00:09:40,327 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:09:40,327 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:09:40,327 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-30 00:09:40,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1974958590, now seen corresponding path program 1 times [2018-01-30 00:09:40,327 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:09:40,327 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:09:40,328 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:40,329 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:09:40,329 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:40,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:09:40,345 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:09:40,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:09:40,434 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:09:40,434 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 00:09:40,435 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 00:09:40,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 00:09:40,435 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:09:40,435 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 4 states. [2018-01-30 00:09:40,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:09:40,557 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2018-01-30 00:09:40,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 00:09:40,557 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-01-30 00:09:40,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:09:40,559 INFO L225 Difference]: With dead ends: 102 [2018-01-30 00:09:40,559 INFO L226 Difference]: Without dead ends: 87 [2018-01-30 00:09:40,560 INFO L553 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-30 00:09:40,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-30 00:09:40,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2018-01-30 00:09:40,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-30 00:09:40,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2018-01-30 00:09:40,570 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 34 [2018-01-30 00:09:40,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:09:40,571 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2018-01-30 00:09:40,571 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 00:09:40,571 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2018-01-30 00:09:40,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-30 00:09:40,572 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:09:40,572 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:09:40,573 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-30 00:09:40,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1452571658, now seen corresponding path program 1 times [2018-01-30 00:09:40,573 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:09:40,573 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:09:40,574 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:40,574 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:09:40,575 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:40,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:09:40,587 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:09:40,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:09:40,628 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:09:40,628 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 00:09:40,629 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:09:40,629 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:09:40,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:09:40,629 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand 6 states. [2018-01-30 00:09:40,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:09:40,703 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2018-01-30 00:09:40,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:09:40,704 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-01-30 00:09:40,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:09:40,706 INFO L225 Difference]: With dead ends: 106 [2018-01-30 00:09:40,706 INFO L226 Difference]: Without dead ends: 89 [2018-01-30 00:09:40,706 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:09:40,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-01-30 00:09:40,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2018-01-30 00:09:40,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-30 00:09:40,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2018-01-30 00:09:40,717 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 35 [2018-01-30 00:09:40,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:09:40,717 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2018-01-30 00:09:40,717 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:09:40,718 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2018-01-30 00:09:40,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-30 00:09:40,719 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:09:40,720 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:09:40,720 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-30 00:09:40,720 INFO L82 PathProgramCache]: Analyzing trace with hash 562608850, now seen corresponding path program 1 times [2018-01-30 00:09:40,720 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:09:40,720 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:09:40,721 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:40,722 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:09:40,722 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:40,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:09:40,735 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:09:40,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:09:40,798 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:09:40,798 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:09:40,798 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:09:40,799 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:09:40,799 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:09:40,799 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand 5 states. [2018-01-30 00:09:40,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:09:40,837 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2018-01-30 00:09:40,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:09:40,838 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-01-30 00:09:40,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:09:40,839 INFO L225 Difference]: With dead ends: 113 [2018-01-30 00:09:40,840 INFO L226 Difference]: Without dead ends: 65 [2018-01-30 00:09:40,840 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:09:40,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-30 00:09:40,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-01-30 00:09:40,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-30 00:09:40,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2018-01-30 00:09:40,848 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 43 [2018-01-30 00:09:40,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:09:40,848 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2018-01-30 00:09:40,849 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:09:40,849 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2018-01-30 00:09:40,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-30 00:09:40,851 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:09:40,851 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:09:40,853 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-30 00:09:40,854 INFO L82 PathProgramCache]: Analyzing trace with hash 782044618, now seen corresponding path program 1 times [2018-01-30 00:09:40,854 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:09:40,854 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:09:40,855 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:40,855 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:09:40,856 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:40,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:09:40,871 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:09:41,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:09:41,009 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:09:41,010 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-30 00:09:41,010 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 00:09:41,010 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 00:09:41,010 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:09:41,011 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand 8 states. [2018-01-30 00:09:41,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:09:41,359 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-01-30 00:09:41,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 00:09:41,360 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2018-01-30 00:09:41,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:09:41,361 INFO L225 Difference]: With dead ends: 73 [2018-01-30 00:09:41,361 INFO L226 Difference]: Without dead ends: 72 [2018-01-30 00:09:41,361 INFO L553 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-30 00:09:41,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-01-30 00:09:41,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 64. [2018-01-30 00:09:41,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-30 00:09:41,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2018-01-30 00:09:41,368 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 44 [2018-01-30 00:09:41,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:09:41,369 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2018-01-30 00:09:41,369 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 00:09:41,369 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2018-01-30 00:09:41,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-30 00:09:41,370 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:09:41,371 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:09:41,371 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-30 00:09:41,371 INFO L82 PathProgramCache]: Analyzing trace with hash 782044619, now seen corresponding path program 1 times [2018-01-30 00:09:41,371 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:09:41,371 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:09:41,373 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:41,373 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:09:41,373 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:41,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:09:41,388 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:09:41,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:09:41,526 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:09:41,526 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-30 00:09:41,526 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 00:09:41,527 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 00:09:41,527 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-30 00:09:41,527 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 9 states. [2018-01-30 00:09:41,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:09:41,819 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2018-01-30 00:09:41,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-30 00:09:41,819 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 44 [2018-01-30 00:09:41,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:09:41,820 INFO L225 Difference]: With dead ends: 66 [2018-01-30 00:09:41,820 INFO L226 Difference]: Without dead ends: 65 [2018-01-30 00:09:41,821 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-01-30 00:09:41,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-30 00:09:41,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-01-30 00:09:41,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-30 00:09:41,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2018-01-30 00:09:41,827 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 44 [2018-01-30 00:09:41,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:09:41,828 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2018-01-30 00:09:41,828 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 00:09:41,828 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2018-01-30 00:09:41,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-30 00:09:41,829 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:09:41,829 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:09:41,829 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-30 00:09:41,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1804373262, now seen corresponding path program 1 times [2018-01-30 00:09:41,829 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:09:41,829 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:09:41,831 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:41,831 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:09:41,831 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:41,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:09:41,846 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:09:42,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:09:42,134 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:09:42,134 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-30 00:09:42,134 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 00:09:42,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 00:09:42,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-30 00:09:42,135 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 9 states. [2018-01-30 00:09:42,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:09:42,317 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-01-30 00:09:42,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-30 00:09:42,317 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 46 [2018-01-30 00:09:42,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:09:42,318 INFO L225 Difference]: With dead ends: 76 [2018-01-30 00:09:42,318 INFO L226 Difference]: Without dead ends: 61 [2018-01-30 00:09:42,318 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-01-30 00:09:42,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-30 00:09:42,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-01-30 00:09:42,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-30 00:09:42,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-01-30 00:09:42,325 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 46 [2018-01-30 00:09:42,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:09:42,325 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-01-30 00:09:42,325 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 00:09:42,325 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-01-30 00:09:42,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-30 00:09:42,326 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:09:42,326 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:09:42,326 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-30 00:09:42,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1735467719, now seen corresponding path program 1 times [2018-01-30 00:09:42,326 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:09:42,327 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:09:42,327 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:42,327 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:09:42,328 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:42,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:09:42,340 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:09:42,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:09:42,395 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:09:42,395 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:09:42,395 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:09:42,396 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:09:42,396 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:09:42,396 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 5 states. [2018-01-30 00:09:42,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:09:42,444 INFO L93 Difference]: Finished difference Result 67 states and 66 transitions. [2018-01-30 00:09:42,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:09:42,445 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2018-01-30 00:09:42,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:09:42,445 INFO L225 Difference]: With dead ends: 67 [2018-01-30 00:09:42,445 INFO L226 Difference]: Without dead ends: 61 [2018-01-30 00:09:42,446 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:09:42,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-30 00:09:42,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-01-30 00:09:42,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-30 00:09:42,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 60 transitions. [2018-01-30 00:09:42,451 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 60 transitions. Word has length 56 [2018-01-30 00:09:42,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:09:42,452 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 60 transitions. [2018-01-30 00:09:42,452 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:09:42,452 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 60 transitions. [2018-01-30 00:09:42,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-30 00:09:42,453 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:09:42,453 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:09:42,453 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-30 00:09:42,453 INFO L82 PathProgramCache]: Analyzing trace with hash 720686570, now seen corresponding path program 1 times [2018-01-30 00:09:42,453 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:09:42,453 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:09:42,454 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:42,454 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:09:42,454 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:42,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-30 00:09:42,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-30 00:09:42,499 INFO L409 BasicCegarLoop]: Counterexample might be feasible [2018-01-30 00:09:42,518 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-30 00:09:42,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 12:09:42 BoogieIcfgContainer [2018-01-30 00:09:42,537 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 00:09:42,538 INFO L168 Benchmark]: Toolchain (without parser) took 3963.89 ms. Allocated memory was 307.2 MB in the beginning and 522.2 MB in the end (delta: 215.0 MB). Free memory was 266.3 MB in the beginning and 349.0 MB in the end (delta: -82.7 MB). Peak memory consumption was 132.2 MB. Max. memory is 5.3 GB. [2018-01-30 00:09:42,539 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 307.2 MB. Free memory is still 273.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 00:09:42,539 INFO L168 Benchmark]: CACSL2BoogieTranslator took 220.30 ms. Allocated memory is still 307.2 MB. Free memory was 266.3 MB in the beginning and 253.3 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. [2018-01-30 00:09:42,540 INFO L168 Benchmark]: Boogie Preprocessor took 36.98 ms. Allocated memory is still 307.2 MB. Free memory was 253.3 MB in the beginning and 251.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-30 00:09:42,540 INFO L168 Benchmark]: RCFGBuilder took 306.73 ms. Allocated memory is still 307.2 MB. Free memory was 251.3 MB in the beginning and 231.6 MB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 5.3 GB. [2018-01-30 00:09:42,540 INFO L168 Benchmark]: TraceAbstraction took 3393.26 ms. Allocated memory was 307.2 MB in the beginning and 522.2 MB in the end (delta: 215.0 MB). Free memory was 231.6 MB in the beginning and 349.0 MB in the end (delta: -117.4 MB). Peak memory consumption was 97.6 MB. Max. memory is 5.3 GB. [2018-01-30 00:09:42,542 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.17 ms. Allocated memory is still 307.2 MB. Free memory is still 273.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 220.30 ms. Allocated memory is still 307.2 MB. Free memory was 266.3 MB in the beginning and 253.3 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.98 ms. Allocated memory is still 307.2 MB. Free memory was 253.3 MB in the beginning and 251.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 306.73 ms. Allocated memory is still 307.2 MB. Free memory was 251.3 MB in the beginning and 231.6 MB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 3393.26 ms. Allocated memory was 307.2 MB in the beginning and 522.2 MB in the end (delta: 215.0 MB). Free memory was 231.6 MB in the beginning and 349.0 MB in the end (delta: -117.4 MB). Peak memory consumption was 97.6 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.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={6:0}] [L1467] CALL, EXPR probe1_6(&a7) VAL [a={6:0}] [L1443] int ret = - -3; VAL [a={6:0}, a={6:0}, ret=3] [L1444] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(size)=4] [L1073] COND TRUE __VERIFIER_nondet_int() VAL [\old(size)=4, __VERIFIER_nondet_int()=1, size=4] [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=4, malloc(size)={7:0}, size=4] [L1074] RET return malloc(size); VAL [\old(size)=4, \result={7:0}, malloc(size)={7:0}, size=4] [L1444] EXPR ldv_malloc(sizeof(int)) VAL [a={6:0}, a={6:0}, ldv_malloc(sizeof(int))={7:0}, ret=3] [L1444] int *p = (int *)ldv_malloc(sizeof(int)); VAL [a={6:0}, a={6:0}, ldv_malloc(sizeof(int))={7:0}, p={7:0}, ret=3] [L1445] COND FALSE !(p==0) VAL [a={6:0}, a={6:0}, p={7:0}, ret=3] [L1447] CALL, EXPR f6() [L1435] RET return __VERIFIER_nondet_int(); VAL [\result=0, __VERIFIER_nondet_int()=0] [L1447] EXPR f6() VAL [a={6:0}, a={6:0}, f6()=0, p={7:0}, ret=3] [L1447] ret = f6() VAL [a={6:0}, a={6:0}, f6()=0, p={7:0}, ret=0] [L1448] COND FALSE !(ret<0) VAL [a={6:0}, a={6:0}, p={7:0}, ret=0] [L1450] CALL, EXPR g6() [L1439] RET return __VERIFIER_nondet_int(); VAL [\result=0, __VERIFIER_nondet_int()=0] [L1450] EXPR g6() VAL [a={6:0}, a={6:0}, g6()=0, p={7:0}, ret=0] [L1450] ret = g6() VAL [a={6:0}, a={6:0}, g6()=0, p={7:0}, ret=0] [L1451] COND FALSE !(ret<0) VAL [a={6:0}, a={6:0}, p={7:0}, ret=0] [L1453] FCALL a->p = p VAL [a={6:0}, a={6:0}, p={7:0}, ret=0] [L1454] RET return 0; VAL [\result=0, a={6:0}, a={6:0}, p={7:0}, ret=0] [L1467] EXPR probe1_6(&a7) VAL [a7={6:0}, probe1_6(&a7)=0] [L1467] int ret = probe1_6(&a7); VAL [a7={6:0}, probe1_6(&a7)=0, ret=0] [L1468] COND TRUE ret==0 VAL [a7={6:0}, ret=0] [L1469] RET, FCALL disconnect_2_6(&a7) VAL [a7={6:0}, ret=0] [L1474] entry_point() - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 73 locations, 5 error locations. UNSAFE Result, 3.3s OverallTime, 12 OverallIterations, 1 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 754 SDtfs, 269 SDslu, 2237 SDs, 0 SdLazy, 803 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred 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, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 56 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 496 NumberOfCodeBlocks, 496 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 425 ConstructedInterpolants, 0 QuantifiedInterpolants, 66445 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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_test7_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-30_00-09-42-550.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_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_00-09-42-550.csv Received shutdown request...