java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test6_3_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-30 00:09:31,240 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 00:09:31,242 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 00:09:31,254 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 00:09:31,254 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 00:09:31,255 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 00:09:31,256 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 00:09:31,257 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 00:09:31,259 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 00:09:31,260 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 00:09:31,260 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 00:09:31,260 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 00:09:31,261 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 00:09:31,262 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 00:09:31,263 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 00:09:31,266 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 00:09:31,268 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 00:09:31,270 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 00:09:31,271 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 00:09:31,272 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 00:09:31,274 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 00:09:31,275 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 00:09:31,275 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 00:09:31,276 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 00:09:31,277 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 00:09:31,278 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 00:09:31,279 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 00:09:31,279 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 00:09:31,279 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 00:09:31,280 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 00:09:31,280 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 00:09:31,281 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:31,290 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 00:09:31,291 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 00:09:31,292 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 00:09:31,292 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 00:09:31,292 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 00:09:31,292 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 00:09:31,292 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 00:09:31,293 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 00:09:31,293 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 00:09:31,294 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-30 00:09:31,294 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 00:09:31,294 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 00:09:31,294 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 00:09:31,294 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-30 00:09:31,295 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-30 00:09:31,295 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-30 00:09:31,295 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 00:09:31,295 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 00:09:31,295 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 00:09:31,296 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 00:09:31,296 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 00:09:31,296 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 00:09:31,296 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 00:09:31,296 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 00:09:31,297 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 00:09:31,297 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 00:09:31,297 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 00:09:31,297 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 00:09:31,298 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 00:09:31,298 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 00:09:31,298 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 00:09:31,298 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 00:09:31,299 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 00:09:31,299 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 00:09:31,335 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 00:09:31,347 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 00:09:31,351 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 00:09:31,353 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 00:09:31,353 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 00:09:31,354 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test6_3_false-valid-memtrack_true-termination.i [2018-01-30 00:09:31,532 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 00:09:31,540 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-30 00:09:31,541 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 00:09:31,541 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 00:09:31,549 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 00:09:31,550 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:09:31" (1/1) ... [2018-01-30 00:09:31,553 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@715ee194 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:09:31, skipping insertion in model container [2018-01-30 00:09:31,554 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:09:31" (1/1) ... [2018-01-30 00:09:31,568 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:09:31,618 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:09:31,739 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:09:31,755 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:09:31,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:09:31 WrapperNode [2018-01-30 00:09:31,763 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 00:09:31,764 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 00:09:31,764 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 00:09:31,764 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 00:09:31,776 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:31" (1/1) ... [2018-01-30 00:09:31,776 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:31" (1/1) ... [2018-01-30 00:09:31,789 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:31" (1/1) ... [2018-01-30 00:09:31,789 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:31" (1/1) ... [2018-01-30 00:09:31,793 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:31" (1/1) ... [2018-01-30 00:09:31,794 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:31" (1/1) ... [2018-01-30 00:09:31,795 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:31" (1/1) ... [2018-01-30 00:09:31,797 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 00:09:31,797 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 00:09:31,797 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 00:09:31,797 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 00:09:31,798 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:09:31" (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:31,844 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 00:09:31,844 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 00:09:31,845 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-30 00:09:31,845 INFO L136 BoogieDeclarations]: Found implementation of procedure f6 [2018-01-30 00:09:31,845 INFO L136 BoogieDeclarations]: Found implementation of procedure g6 [2018-01-30 00:09:31,845 INFO L136 BoogieDeclarations]: Found implementation of procedure probe1_6 [2018-01-30 00:09:31,845 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_2_6 [2018-01-30 00:09:31,845 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-30 00:09:31,845 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 00:09:31,845 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-30 00:09:31,845 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-30 00:09:31,846 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-30 00:09:31,846 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-30 00:09:31,846 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-30 00:09:31,846 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-30 00:09:31,846 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-30 00:09:31,846 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 00:09:31,846 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-30 00:09:31,846 INFO L128 BoogieDeclarations]: Found specification of procedure f6 [2018-01-30 00:09:31,846 INFO L128 BoogieDeclarations]: Found specification of procedure g6 [2018-01-30 00:09:31,847 INFO L128 BoogieDeclarations]: Found specification of procedure probe1_6 [2018-01-30 00:09:31,847 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_2_6 [2018-01-30 00:09:31,847 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-30 00:09:31,847 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 00:09:31,847 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 00:09:31,847 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 00:09:32,091 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 00:09:32,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:09:32 BoogieIcfgContainer [2018-01-30 00:09:32,091 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 00:09:32,092 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 00:09:32,092 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 00:09:32,095 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 00:09:32,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 12:09:31" (1/3) ... [2018-01-30 00:09:32,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@247bdff0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:09:32, skipping insertion in model container [2018-01-30 00:09:32,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:09:31" (2/3) ... [2018-01-30 00:09:32,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@247bdff0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:09:32, skipping insertion in model container [2018-01-30 00:09:32,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:09:32" (3/3) ... [2018-01-30 00:09:32,098 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test6_3_false-valid-memtrack_true-termination.i [2018-01-30 00:09:32,104 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 00:09:32,112 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-30 00:09:32,153 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 00:09:32,153 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 00:09:32,153 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 00:09:32,153 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 00:09:32,153 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 00:09:32,153 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 00:09:32,154 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 00:09:32,154 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 00:09:32,155 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 00:09:32,176 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states. [2018-01-30 00:09:32,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-01-30 00:09:32,182 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:09:32,183 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-01-30 00:09:32,183 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-30 00:09:32,189 INFO L82 PathProgramCache]: Analyzing trace with hash 111531579, now seen corresponding path program 1 times [2018-01-30 00:09:32,192 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:09:32,192 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:09:32,240 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:32,240 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:09:32,240 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:32,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:09:32,287 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:32,335 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:32,337 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:09:32,338 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-30 00:09:32,339 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 00:09:32,350 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 00:09:32,351 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 00:09:32,353 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 3 states. [2018-01-30 00:09:32,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:09:32,539 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2018-01-30 00:09:32,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 00:09:32,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-01-30 00:09:32,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:09:32,554 INFO L225 Difference]: With dead ends: 90 [2018-01-30 00:09:32,554 INFO L226 Difference]: Without dead ends: 85 [2018-01-30 00:09:32,558 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 00:09:32,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-30 00:09:32,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2018-01-30 00:09:32,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-30 00:09:32,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2018-01-30 00:09:32,592 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 5 [2018-01-30 00:09:32,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:09:32,592 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2018-01-30 00:09:32,592 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 00:09:32,592 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2018-01-30 00:09:32,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-01-30 00:09:32,593 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:09:32,593 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-01-30 00:09:32,593 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-30 00:09:32,593 INFO L82 PathProgramCache]: Analyzing trace with hash 111531580, now seen corresponding path program 1 times [2018-01-30 00:09:32,593 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:09:32,594 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:09:32,595 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:32,595 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:09:32,596 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:32,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:09:32,615 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:32,675 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:32,676 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:09:32,677 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-30 00:09:32,679 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 00:09:32,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 00:09:32,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 00:09:32,680 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand 3 states. [2018-01-30 00:09:32,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:09:32,759 INFO L93 Difference]: Finished difference Result 146 states and 157 transitions. [2018-01-30 00:09:32,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 00:09:32,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-01-30 00:09:32,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:09:32,762 INFO L225 Difference]: With dead ends: 146 [2018-01-30 00:09:32,763 INFO L226 Difference]: Without dead ends: 144 [2018-01-30 00:09:32,764 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 00:09:32,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-01-30 00:09:32,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 135. [2018-01-30 00:09:32,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-30 00:09:32,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 151 transitions. [2018-01-30 00:09:32,787 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 151 transitions. Word has length 5 [2018-01-30 00:09:32,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:09:32,787 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 151 transitions. [2018-01-30 00:09:32,787 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 00:09:32,787 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 151 transitions. [2018-01-30 00:09:32,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-30 00:09:32,789 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:09:32,789 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:09:32,789 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-30 00:09:32,790 INFO L82 PathProgramCache]: Analyzing trace with hash 109318138, now seen corresponding path program 1 times [2018-01-30 00:09:32,790 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:09:32,790 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:09:32,792 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:32,792 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:09:32,792 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:32,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:09:32,825 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:32,921 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:32,921 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:09:32,921 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 00:09:32,922 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:09:32,922 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:09:32,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:09:32,923 INFO L87 Difference]: Start difference. First operand 135 states and 151 transitions. Second operand 6 states. [2018-01-30 00:09:33,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:09:33,031 INFO L93 Difference]: Finished difference Result 154 states and 167 transitions. [2018-01-30 00:09:33,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:09:33,032 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-01-30 00:09:33,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:09:33,035 INFO L225 Difference]: With dead ends: 154 [2018-01-30 00:09:33,035 INFO L226 Difference]: Without dead ends: 137 [2018-01-30 00:09:33,036 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:33,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-30 00:09:33,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 134. [2018-01-30 00:09:33,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-01-30 00:09:33,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 149 transitions. [2018-01-30 00:09:33,051 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 149 transitions. Word has length 32 [2018-01-30 00:09:33,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:09:33,052 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 149 transitions. [2018-01-30 00:09:33,052 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:09:33,052 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 149 transitions. [2018-01-30 00:09:33,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-30 00:09:33,053 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:09:33,054 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:33,054 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-30 00:09:33,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1150010177, now seen corresponding path program 1 times [2018-01-30 00:09:33,054 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:09:33,054 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:09:33,056 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:33,056 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:09:33,056 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:33,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:09:33,074 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:33,133 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:33,133 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:09:33,133 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:09:33,134 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:09:33,134 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:09:33,134 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:09:33,135 INFO L87 Difference]: Start difference. First operand 134 states and 149 transitions. Second operand 5 states. [2018-01-30 00:09:33,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:09:33,208 INFO L93 Difference]: Finished difference Result 138 states and 149 transitions. [2018-01-30 00:09:33,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:09:33,209 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-01-30 00:09:33,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:09:33,211 INFO L225 Difference]: With dead ends: 138 [2018-01-30 00:09:33,211 INFO L226 Difference]: Without dead ends: 137 [2018-01-30 00:09:33,211 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:33,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-30 00:09:33,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 134. [2018-01-30 00:09:33,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-01-30 00:09:33,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 148 transitions. [2018-01-30 00:09:33,224 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 148 transitions. Word has length 34 [2018-01-30 00:09:33,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:09:33,224 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 148 transitions. [2018-01-30 00:09:33,224 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:09:33,224 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 148 transitions. [2018-01-30 00:09:33,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-30 00:09:33,225 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:09:33,225 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:33,226 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-30 00:09:33,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1150010176, now seen corresponding path program 1 times [2018-01-30 00:09:33,226 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:09:33,226 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:09:33,228 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:33,228 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:09:33,228 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:33,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:09:33,248 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:33,311 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:33,312 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:09:33,312 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:09:33,312 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:09:33,312 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:09:33,313 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:09:33,313 INFO L87 Difference]: Start difference. First operand 134 states and 148 transitions. Second operand 5 states. [2018-01-30 00:09:33,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:09:33,349 INFO L93 Difference]: Finished difference Result 137 states and 148 transitions. [2018-01-30 00:09:33,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:09:33,350 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-01-30 00:09:33,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:09:33,351 INFO L225 Difference]: With dead ends: 137 [2018-01-30 00:09:33,352 INFO L226 Difference]: Without dead ends: 136 [2018-01-30 00:09:33,352 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:33,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-01-30 00:09:33,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2018-01-30 00:09:33,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-01-30 00:09:33,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 147 transitions. [2018-01-30 00:09:33,367 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 147 transitions. Word has length 34 [2018-01-30 00:09:33,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:09:33,368 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 147 transitions. [2018-01-30 00:09:33,368 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:09:33,368 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 147 transitions. [2018-01-30 00:09:33,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-30 00:09:33,369 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:09:33,370 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:33,370 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-30 00:09:33,370 INFO L82 PathProgramCache]: Analyzing trace with hash 593232167, now seen corresponding path program 1 times [2018-01-30 00:09:33,370 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:09:33,370 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:09:33,372 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:33,372 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:09:33,372 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:33,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:09:33,390 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:33,432 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:33,432 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:09:33,432 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-30 00:09:33,433 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 00:09:33,433 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 00:09:33,433 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 00:09:33,433 INFO L87 Difference]: Start difference. First operand 134 states and 147 transitions. Second operand 3 states. [2018-01-30 00:09:33,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:09:33,506 INFO L93 Difference]: Finished difference Result 140 states and 150 transitions. [2018-01-30 00:09:33,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 00:09:33,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-01-30 00:09:33,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:09:33,507 INFO L225 Difference]: With dead ends: 140 [2018-01-30 00:09:33,507 INFO L226 Difference]: Without dead ends: 123 [2018-01-30 00:09:33,508 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 00:09:33,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-01-30 00:09:33,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2018-01-30 00:09:33,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-01-30 00:09:33,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 131 transitions. [2018-01-30 00:09:33,517 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 131 transitions. Word has length 34 [2018-01-30 00:09:33,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:09:33,518 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 131 transitions. [2018-01-30 00:09:33,518 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 00:09:33,518 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 131 transitions. [2018-01-30 00:09:33,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-30 00:09:33,519 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:09:33,519 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:33,519 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-30 00:09:33,519 INFO L82 PathProgramCache]: Analyzing trace with hash -631813317, now seen corresponding path program 1 times [2018-01-30 00:09:33,519 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:09:33,519 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:09:33,520 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:33,520 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:09:33,521 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:33,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:09:33,538 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:33,620 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:33,620 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:09:33,620 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:09:33,621 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:09:33,621 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:09:33,621 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:09:33,621 INFO L87 Difference]: Start difference. First operand 121 states and 131 transitions. Second operand 6 states. [2018-01-30 00:09:33,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:09:33,659 INFO L93 Difference]: Finished difference Result 121 states and 131 transitions. [2018-01-30 00:09:33,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 00:09:33,659 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-01-30 00:09:33,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:09:33,661 INFO L225 Difference]: With dead ends: 121 [2018-01-30 00:09:33,661 INFO L226 Difference]: Without dead ends: 120 [2018-01-30 00:09:33,662 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:33,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-30 00:09:33,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-01-30 00:09:33,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-01-30 00:09:33,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 130 transitions. [2018-01-30 00:09:33,674 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 130 transitions. Word has length 35 [2018-01-30 00:09:33,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:09:33,675 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 130 transitions. [2018-01-30 00:09:33,675 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:09:33,675 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 130 transitions. [2018-01-30 00:09:33,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-30 00:09:33,676 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:09:33,677 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:33,677 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-30 00:09:33,677 INFO L82 PathProgramCache]: Analyzing trace with hash -631813316, now seen corresponding path program 1 times [2018-01-30 00:09:33,677 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:09:33,677 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:09:33,679 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:33,679 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:09:33,679 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:33,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:09:33,694 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:33,778 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:33,779 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:09:33,779 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:09:33,779 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:09:33,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:09:33,779 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:09:33,780 INFO L87 Difference]: Start difference. First operand 120 states and 130 transitions. Second operand 6 states. [2018-01-30 00:09:33,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:09:33,923 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2018-01-30 00:09:33,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:09:33,924 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-01-30 00:09:33,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:09:33,925 INFO L225 Difference]: With dead ends: 122 [2018-01-30 00:09:33,925 INFO L226 Difference]: Without dead ends: 121 [2018-01-30 00:09:33,926 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:33,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-30 00:09:33,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2018-01-30 00:09:33,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-30 00:09:33,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 129 transitions. [2018-01-30 00:09:33,940 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 129 transitions. Word has length 35 [2018-01-30 00:09:33,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:09:33,940 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 129 transitions. [2018-01-30 00:09:33,940 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:09:33,940 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 129 transitions. [2018-01-30 00:09:33,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-30 00:09:33,942 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:09:33,943 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:09:33,946 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-30 00:09:33,947 INFO L82 PathProgramCache]: Analyzing trace with hash 30583561, now seen corresponding path program 1 times [2018-01-30 00:09:33,947 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:09:33,947 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:09:33,948 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:33,948 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:09:33,948 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:33,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:09:33,961 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:34,013 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:34,014 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:09:34,015 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:09:34,015 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:09:34,015 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:09:34,015 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:09:34,016 INFO L87 Difference]: Start difference. First operand 119 states and 129 transitions. Second operand 5 states. [2018-01-30 00:09:34,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:09:34,065 INFO L93 Difference]: Finished difference Result 126 states and 132 transitions. [2018-01-30 00:09:34,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:09:34,066 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-01-30 00:09:34,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:09:34,067 INFO L225 Difference]: With dead ends: 126 [2018-01-30 00:09:34,067 INFO L226 Difference]: Without dead ends: 78 [2018-01-30 00:09:34,067 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:34,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-30 00:09:34,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-01-30 00:09:34,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-30 00:09:34,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2018-01-30 00:09:34,073 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 42 [2018-01-30 00:09:34,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:09:34,073 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2018-01-30 00:09:34,073 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:09:34,074 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2018-01-30 00:09:34,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-30 00:09:34,075 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:09:34,075 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:34,075 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-30 00:09:34,075 INFO L82 PathProgramCache]: Analyzing trace with hash 485326214, now seen corresponding path program 1 times [2018-01-30 00:09:34,075 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:09:34,076 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:09:34,077 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:34,077 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:09:34,077 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:34,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:09:34,097 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:34,303 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:34,303 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:09:34,303 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 00:09:34,305 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 00:09:34,305 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 00:09:34,305 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:09:34,305 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand 7 states. [2018-01-30 00:09:34,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:09:34,554 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-01-30 00:09:34,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-30 00:09:34,554 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2018-01-30 00:09:34,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:09:34,555 INFO L225 Difference]: With dead ends: 78 [2018-01-30 00:09:34,555 INFO L226 Difference]: Without dead ends: 77 [2018-01-30 00:09:34,556 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-01-30 00:09:34,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-30 00:09:34,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-01-30 00:09:34,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-30 00:09:34,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2018-01-30 00:09:34,562 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 43 [2018-01-30 00:09:34,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:09:34,563 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2018-01-30 00:09:34,563 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 00:09:34,563 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2018-01-30 00:09:34,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-30 00:09:34,564 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:09:34,564 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:34,564 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-30 00:09:34,564 INFO L82 PathProgramCache]: Analyzing trace with hash 485326213, now seen corresponding path program 1 times [2018-01-30 00:09:34,564 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:09:34,564 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:09:34,565 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:34,565 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:09:34,566 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:34,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:09:34,581 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:34,866 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:34,867 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:09:34,868 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-30 00:09:34,869 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 00:09:34,869 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 00:09:34,869 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:09:34,869 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 8 states. [2018-01-30 00:09:35,140 WARN L143 SmtUtils]: Spent 112ms on a formula simplification that was a NOOP. DAG size: 27 [2018-01-30 00:09:35,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:09:35,393 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2018-01-30 00:09:35,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-30 00:09:35,393 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2018-01-30 00:09:35,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:09:35,394 INFO L225 Difference]: With dead ends: 81 [2018-01-30 00:09:35,394 INFO L226 Difference]: Without dead ends: 63 [2018-01-30 00:09:35,395 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2018-01-30 00:09:35,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-30 00:09:35,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-01-30 00:09:35,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-30 00:09:35,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-01-30 00:09:35,399 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 43 [2018-01-30 00:09:35,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:09:35,400 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-01-30 00:09:35,400 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 00:09:35,400 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-01-30 00:09:35,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-30 00:09:35,400 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:09:35,400 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:09:35,401 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-30 00:09:35,401 INFO L82 PathProgramCache]: Analyzing trace with hash 384174065, now seen corresponding path program 1 times [2018-01-30 00:09:35,401 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:09:35,401 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:09:35,402 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:35,403 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:09:35,403 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:35,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:09:35,414 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:35,640 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:35,640 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:09:35,640 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-30 00:09:35,640 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-30 00:09:35,640 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-30 00:09:35,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-30 00:09:35,641 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 10 states. [2018-01-30 00:09:35,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:09:35,906 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-01-30 00:09:35,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-30 00:09:35,906 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2018-01-30 00:09:35,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:09:35,907 INFO L225 Difference]: With dead ends: 63 [2018-01-30 00:09:35,907 INFO L226 Difference]: Without dead ends: 62 [2018-01-30 00:09:35,908 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-01-30 00:09:35,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-30 00:09:35,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-01-30 00:09:35,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-30 00:09:35,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-01-30 00:09:35,916 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 45 [2018-01-30 00:09:35,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:09:35,917 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-01-30 00:09:35,917 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-30 00:09:35,917 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-01-30 00:09:35,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-30 00:09:35,917 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:09:35,917 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:09:35,917 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-30 00:09:35,918 INFO L82 PathProgramCache]: Analyzing trace with hash 384174064, now seen corresponding path program 1 times [2018-01-30 00:09:35,918 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:09:35,918 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:09:35,924 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:35,924 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:09:35,924 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:35,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:09:35,934 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:36,088 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:36,088 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:09:36,088 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-30 00:09:36,089 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 00:09:36,089 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 00:09:36,089 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:09:36,089 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 8 states. [2018-01-30 00:09:36,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:09:36,245 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-01-30 00:09:36,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-30 00:09:36,245 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2018-01-30 00:09:36,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:09:36,246 INFO L225 Difference]: With dead ends: 62 [2018-01-30 00:09:36,246 INFO L226 Difference]: Without dead ends: 61 [2018-01-30 00:09:36,246 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-01-30 00:09:36,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-30 00:09:36,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-01-30 00:09:36,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-30 00:09:36,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-01-30 00:09:36,253 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 45 [2018-01-30 00:09:36,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:09:36,253 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-01-30 00:09:36,253 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 00:09:36,253 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-01-30 00:09:36,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-30 00:09:36,254 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:09:36,254 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:36,254 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-30 00:09:36,254 INFO L82 PathProgramCache]: Analyzing trace with hash -366146626, now seen corresponding path program 1 times [2018-01-30 00:09:36,254 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:09:36,254 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:09:36,255 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:36,255 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:09:36,256 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:36,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:09:36,269 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:36,300 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:36,300 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:09:36,300 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:09:36,301 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:09:36,301 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:09:36,301 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:09:36,301 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 5 states. [2018-01-30 00:09:36,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:09:36,328 INFO L93 Difference]: Finished difference Result 66 states and 65 transitions. [2018-01-30 00:09:36,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:09:36,328 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2018-01-30 00:09:36,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:09:36,329 INFO L225 Difference]: With dead ends: 66 [2018-01-30 00:09:36,329 INFO L226 Difference]: Without dead ends: 61 [2018-01-30 00:09:36,329 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:36,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-30 00:09:36,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-01-30 00:09:36,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-30 00:09:36,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 60 transitions. [2018-01-30 00:09:36,337 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 60 transitions. Word has length 56 [2018-01-30 00:09:36,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:09:36,337 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 60 transitions. [2018-01-30 00:09:36,337 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:09:36,337 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 60 transitions. [2018-01-30 00:09:36,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-30 00:09:36,338 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:09:36,338 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:36,338 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-30 00:09:36,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1923550661, now seen corresponding path program 1 times [2018-01-30 00:09:36,338 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:09:36,338 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:09:36,339 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:36,339 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:09:36,339 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:36,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-30 00:09:36,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-30 00:09:36,408 INFO L409 BasicCegarLoop]: Counterexample might be feasible [2018-01-30 00:09:36,434 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-30 00:09:36,438 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-30 00:09:36,438 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 8 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-30 00:09:36,439 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 8 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-30 00:09:36,439 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-30 00:09:36,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 12:09:36 BoogieIcfgContainer [2018-01-30 00:09:36,453 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 00:09:36,454 INFO L168 Benchmark]: Toolchain (without parser) took 4920.76 ms. Allocated memory was 308.8 MB in the beginning and 522.7 MB in the end (delta: 213.9 MB). Free memory was 265.7 MB in the beginning and 403.1 MB in the end (delta: -137.4 MB). Peak memory consumption was 76.5 MB. Max. memory is 5.3 GB. [2018-01-30 00:09:36,455 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 308.8 MB. Free memory is still 272.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 00:09:36,455 INFO L168 Benchmark]: CACSL2BoogieTranslator took 222.26 ms. Allocated memory is still 308.8 MB. Free memory was 265.7 MB in the beginning and 252.7 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:36,456 INFO L168 Benchmark]: Boogie Preprocessor took 32.97 ms. Allocated memory is still 308.8 MB. Free memory was 252.7 MB in the beginning and 250.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-30 00:09:36,456 INFO L168 Benchmark]: RCFGBuilder took 294.51 ms. Allocated memory is still 308.8 MB. Free memory was 250.7 MB in the beginning and 229.5 MB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 5.3 GB. [2018-01-30 00:09:36,456 INFO L168 Benchmark]: TraceAbstraction took 4360.69 ms. Allocated memory was 308.8 MB in the beginning and 522.7 MB in the end (delta: 213.9 MB). Free memory was 229.5 MB in the beginning and 403.1 MB in the end (delta: -173.6 MB). Peak memory consumption was 40.3 MB. Max. memory is 5.3 GB. [2018-01-30 00:09:36,458 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.19 ms. Allocated memory is still 308.8 MB. Free memory is still 272.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 222.26 ms. Allocated memory is still 308.8 MB. Free memory was 265.7 MB in the beginning and 252.7 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.97 ms. Allocated memory is still 308.8 MB. Free memory was 252.7 MB in the beginning and 250.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 294.51 ms. Allocated memory is still 308.8 MB. Free memory was 250.7 MB in the beginning and 229.5 MB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 4360.69 ms. Allocated memory was 308.8 MB in the beginning and 522.7 MB in the end (delta: 213.9 MB). Free memory was 229.5 MB in the beginning and 403.1 MB in the end (delta: -173.6 MB). Peak memory consumption was 40.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 8 could not be translated for associated CType STRUCT#?p~$Pointer$# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 8 could not be translated for associated CType STRUCT#?p~$Pointer$# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1476]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1476. Possible FailurePath: IVAL [\old(a6)=null, \old(a6)=null, a6={8:5}] [L1465] FCALL struct A a6; VAL [a6={7:0}] [L1477] CALL entry_point() VAL [a6={7:0}] [L1469] CALL, EXPR probe1_6(&a6) VAL [a={7:0}, a6={7:0}] [L1443] int ret = - -3; VAL [a={7:0}, a={7:0}, a6={7:0}, ret=3] [L1444] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(size)=4, a6={7:0}] [L1073] COND TRUE __VERIFIER_nondet_int() VAL [\old(size)=4, __VERIFIER_nondet_int()=1, a6={7:0}, size=4] [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=4, a6={7:0}, malloc(size)={9:0}, size=4] [L1074] RET return malloc(size); VAL [\old(size)=4, \result={9:0}, a6={7:0}, malloc(size)={9:0}, size=4] [L1444] EXPR ldv_malloc(sizeof(int)) VAL [a={7:0}, a={7:0}, a6={7:0}, ldv_malloc(sizeof(int))={9:0}, ret=3] [L1444] int *p = (int *)ldv_malloc(sizeof(int)); VAL [a={7:0}, a={7:0}, a6={7:0}, ldv_malloc(sizeof(int))={9:0}, p={9:0}, ret=3] [L1445] COND FALSE !(p==0) VAL [a={7:0}, a={7:0}, a6={7:0}, p={9:0}, ret=3] [L1447] CALL, EXPR f6() VAL [a6={7:0}] [L1435] RET return __VERIFIER_nondet_int(); VAL [\result=0, __VERIFIER_nondet_int()=0, a6={7:0}] [L1447] EXPR f6() VAL [a={7:0}, a={7:0}, a6={7:0}, f6()=0, p={9:0}, ret=3] [L1447] ret = f6() VAL [a={7:0}, a={7:0}, a6={7:0}, f6()=0, p={9:0}, ret=0] [L1448] COND FALSE !(ret<0) VAL [a={7:0}, a={7:0}, a6={7:0}, p={9:0}, ret=0] [L1450] CALL, EXPR g6() VAL [a6={7:0}] [L1439] RET return __VERIFIER_nondet_int(); VAL [\result=0, __VERIFIER_nondet_int()=0, a6={7:0}] [L1450] EXPR g6() VAL [a={7:0}, a={7:0}, a6={7:0}, g6()=0, p={9:0}, ret=0] [L1450] ret = g6() VAL [a={7:0}, a={7:0}, a6={7:0}, g6()=0, p={9:0}, ret=0] [L1451] COND FALSE !(ret<0) VAL [a={7:0}, a={7:0}, a6={7:0}, p={9:0}, ret=0] [L1453] FCALL a->p = p VAL [a={7:0}, a={7:0}, a6={7:0}, p={9:0}, ret=0] [L1454] RET return 0; VAL [\result=0, a={7:0}, a={7:0}, a6={7:0}, p={9:0}, ret=0] [L1469] EXPR probe1_6(&a6) VAL [a6={7:0}, probe1_6(&a6)=0] [L1469] int ret = probe1_6(&a6); VAL [a6={7:0}, probe1_6(&a6)=0, ret=0] [L1470] COND TRUE ret==0 VAL [a6={7:0}, ret=0] [L1471] FCALL disconnect_2_6(&a6) VAL [a6={7:0}, ret=0] [L1473] RET, FCALL a6.p = 0 VAL [a6={7:0}, ret=0] [L1477] entry_point() VAL [a6={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 77 locations, 9 error locations. UNSAFE Result, 4.3s OverallTime, 15 OverallIterations, 1 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 946 SDtfs, 713 SDslu, 2165 SDs, 0 SdLazy, 786 SolverSat, 167 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=135occurred in iteration=2, 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, 14 MinimizatonAttempts, 22 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 548 NumberOfCodeBlocks, 548 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 474 ConstructedInterpolants, 0 QuantifiedInterpolants, 88060 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_3_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-36-467.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_3_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-36-467.csv Received shutdown request...