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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test6_3_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 19:21:14,767 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 19:21:14,768 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 19:21:14,778 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 19:21:14,778 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 19:21:14,779 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 19:21:14,780 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 19:21:14,781 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 19:21:14,783 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 19:21:14,784 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 19:21:14,785 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 19:21:14,785 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 19:21:14,786 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 19:21:14,787 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 19:21:14,787 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 19:21:14,790 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 19:21:14,791 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 19:21:14,793 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 19:21:14,794 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 19:21:14,795 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 19:21:14,797 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 19:21:14,797 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 19:21:14,798 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 19:21:14,799 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 19:21:14,799 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 19:21:14,800 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 19:21:14,801 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 19:21:14,801 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 19:21:14,801 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 19:21:14,802 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 19:21:14,802 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 19:21:14,802 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-02 19:21:14,812 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 19:21:14,812 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 19:21:14,813 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 19:21:14,813 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 19:21:14,814 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 19:21:14,814 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 19:21:14,814 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 19:21:14,814 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 19:21:14,814 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 19:21:14,814 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 19:21:14,815 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 19:21:14,815 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 19:21:14,815 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 19:21:14,815 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 19:21:14,815 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 19:21:14,815 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 19:21:14,815 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 19:21:14,816 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 19:21:14,816 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 19:21:14,816 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 19:21:14,816 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 19:21:14,816 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 19:21:14,816 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 19:21:14,816 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 19:21:14,817 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 19:21:14,843 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 19:21:14,851 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 19:21:14,854 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 19:21:14,855 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 19:21:14,855 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 19:21:14,856 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test6_3_false-valid-memtrack_true-termination.i [2018-02-02 19:21:14,989 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 19:21:14,990 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 19:21:14,991 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 19:21:14,991 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 19:21:14,996 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 19:21:14,997 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 07:21:14" (1/1) ... [2018-02-02 19:21:15,004 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fc89e21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:21:14, skipping insertion in model container [2018-02-02 19:21:15,004 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 07:21:14" (1/1) ... [2018-02-02 19:21:15,018 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 19:21:15,055 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 19:21:15,142 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 19:21:15,155 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 19:21:15,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:21:15 WrapperNode [2018-02-02 19:21:15,162 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 19:21:15,162 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 19:21:15,163 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 19:21:15,163 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 19:21:15,173 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:21:15" (1/1) ... [2018-02-02 19:21:15,173 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:21:15" (1/1) ... [2018-02-02 19:21:15,180 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:21:15" (1/1) ... [2018-02-02 19:21:15,180 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:21:15" (1/1) ... [2018-02-02 19:21:15,183 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:21:15" (1/1) ... [2018-02-02 19:21:15,185 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:21:15" (1/1) ... [2018-02-02 19:21:15,186 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:21:15" (1/1) ... [2018-02-02 19:21:15,187 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 19:21:15,188 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 19:21:15,188 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 19:21:15,188 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 19:21:15,189 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:21:15" (1/1) ... No working directory specified, using /home/ultimate/work/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-02-02 19:21:15,224 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 19:21:15,224 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 19:21:15,224 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 19:21:15,225 INFO L136 BoogieDeclarations]: Found implementation of procedure f6 [2018-02-02 19:21:15,225 INFO L136 BoogieDeclarations]: Found implementation of procedure g6 [2018-02-02 19:21:15,225 INFO L136 BoogieDeclarations]: Found implementation of procedure probe1_6 [2018-02-02 19:21:15,225 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_2_6 [2018-02-02 19:21:15,225 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 19:21:15,225 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 19:21:15,225 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 19:21:15,226 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 19:21:15,226 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 19:21:15,226 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 19:21:15,226 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 19:21:15,226 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 19:21:15,226 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 19:21:15,226 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 19:21:15,226 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 19:21:15,226 INFO L128 BoogieDeclarations]: Found specification of procedure f6 [2018-02-02 19:21:15,226 INFO L128 BoogieDeclarations]: Found specification of procedure g6 [2018-02-02 19:21:15,227 INFO L128 BoogieDeclarations]: Found specification of procedure probe1_6 [2018-02-02 19:21:15,227 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_2_6 [2018-02-02 19:21:15,227 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 19:21:15,227 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 19:21:15,227 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 19:21:15,227 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 19:21:15,365 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 19:21:15,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 07:21:15 BoogieIcfgContainer [2018-02-02 19:21:15,365 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 19:21:15,365 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 19:21:15,366 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 19:21:15,367 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 19:21:15,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 07:21:14" (1/3) ... [2018-02-02 19:21:15,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66dfdd28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 07:21:15, skipping insertion in model container [2018-02-02 19:21:15,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:21:15" (2/3) ... [2018-02-02 19:21:15,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66dfdd28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 07:21:15, skipping insertion in model container [2018-02-02 19:21:15,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 07:21:15" (3/3) ... [2018-02-02 19:21:15,369 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test6_3_false-valid-memtrack_true-termination.i [2018-02-02 19:21:15,374 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 19:21:15,379 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-02 19:21:15,403 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 19:21:15,403 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 19:21:15,403 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 19:21:15,403 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 19:21:15,403 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 19:21:15,404 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 19:21:15,404 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 19:21:15,404 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 19:21:15,405 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 19:21:15,416 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-02-02 19:21:15,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-02 19:21:15,424 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:21:15,424 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-02 19:21:15,425 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-02 19:21:15,429 INFO L82 PathProgramCache]: Analyzing trace with hash 3053611, now seen corresponding path program 1 times [2018-02-02 19:21:15,430 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:21:15,431 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:21:15,463 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:21:15,464 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:21:15,464 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:21:15,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:21:15,495 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:21:15,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:21:15,526 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:21:15,527 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 19:21:15,527 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 19:21:15,535 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 19:21:15,535 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 19:21:15,537 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 3 states. [2018-02-02 19:21:15,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:21:15,594 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2018-02-02 19:21:15,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 19:21:15,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-02 19:21:15,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:21:15,657 INFO L225 Difference]: With dead ends: 68 [2018-02-02 19:21:15,658 INFO L226 Difference]: Without dead ends: 65 [2018-02-02 19:21:15,659 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 19:21:15,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-02 19:21:15,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2018-02-02 19:21:15,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-02 19:21:15,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2018-02-02 19:21:15,685 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 4 [2018-02-02 19:21:15,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:21:15,685 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2018-02-02 19:21:15,685 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 19:21:15,685 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2018-02-02 19:21:15,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-02 19:21:15,685 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:21:15,685 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-02 19:21:15,685 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-02 19:21:15,686 INFO L82 PathProgramCache]: Analyzing trace with hash 3053612, now seen corresponding path program 1 times [2018-02-02 19:21:15,686 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:21:15,686 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:21:15,687 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:21:15,687 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:21:15,688 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:21:15,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:21:15,700 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:21:15,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:21:15,736 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:21:15,736 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 19:21:15,737 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 19:21:15,738 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 19:21:15,738 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 19:21:15,738 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand 3 states. [2018-02-02 19:21:15,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:21:15,790 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions. [2018-02-02 19:21:15,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 19:21:15,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-02 19:21:15,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:21:15,792 INFO L225 Difference]: With dead ends: 110 [2018-02-02 19:21:15,792 INFO L226 Difference]: Without dead ends: 110 [2018-02-02 19:21:15,793 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 19:21:15,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-02-02 19:21:15,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 101. [2018-02-02 19:21:15,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-02-02 19:21:15,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 117 transitions. [2018-02-02 19:21:15,807 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 117 transitions. Word has length 4 [2018-02-02 19:21:15,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:21:15,808 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 117 transitions. [2018-02-02 19:21:15,808 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 19:21:15,808 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 117 transitions. [2018-02-02 19:21:15,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 19:21:15,809 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:21:15,809 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:21:15,809 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-02 19:21:15,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1645066521, now seen corresponding path program 1 times [2018-02-02 19:21:15,809 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:21:15,809 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:21:15,810 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:21:15,812 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:21:15,812 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:21:15,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:21:15,834 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:21:15,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:21:15,892 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:21:15,892 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 19:21:15,893 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 19:21:15,893 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 19:21:15,893 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:21:15,893 INFO L87 Difference]: Start difference. First operand 101 states and 117 transitions. Second operand 5 states. [2018-02-02 19:21:15,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:21:15,911 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2018-02-02 19:21:15,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 19:21:15,912 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-02-02 19:21:15,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:21:15,914 INFO L225 Difference]: With dead ends: 78 [2018-02-02 19:21:15,914 INFO L226 Difference]: Without dead ends: 78 [2018-02-02 19:21:15,914 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:21:15,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-02 19:21:15,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-02-02 19:21:15,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-02 19:21:15,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2018-02-02 19:21:15,918 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 24 [2018-02-02 19:21:15,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:21:15,918 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2018-02-02 19:21:15,919 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 19:21:15,919 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2018-02-02 19:21:15,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 19:21:15,919 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:21:15,919 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:21:15,919 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-02 19:21:15,919 INFO L82 PathProgramCache]: Analyzing trace with hash 995391925, now seen corresponding path program 1 times [2018-02-02 19:21:15,919 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:21:15,920 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:21:15,920 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:21:15,920 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:21:15,921 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:21:15,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:21:15,932 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:21:15,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:21:15,966 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:21:15,966 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 19:21:15,967 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 19:21:15,967 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 19:21:15,967 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 19:21:15,967 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand 6 states. [2018-02-02 19:21:16,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:21:16,010 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2018-02-02 19:21:16,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 19:21:16,011 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-02 19:21:16,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:21:16,012 INFO L225 Difference]: With dead ends: 76 [2018-02-02 19:21:16,012 INFO L226 Difference]: Without dead ends: 76 [2018-02-02 19:21:16,013 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 19:21:16,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-02 19:21:16,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-02-02 19:21:16,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-02 19:21:16,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2018-02-02 19:21:16,020 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 24 [2018-02-02 19:21:16,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:21:16,021 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2018-02-02 19:21:16,021 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 19:21:16,021 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-02-02 19:21:16,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 19:21:16,022 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:21:16,022 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:21:16,022 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-02 19:21:16,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1433763835, now seen corresponding path program 1 times [2018-02-02 19:21:16,022 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:21:16,022 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:21:16,026 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:21:16,026 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:21:16,026 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:21:16,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:21:16,040 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:21:16,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:21:16,082 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:21:16,082 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 19:21:16,082 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 19:21:16,082 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 19:21:16,083 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 19:21:16,083 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 6 states. [2018-02-02 19:21:16,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:21:16,113 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2018-02-02 19:21:16,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 19:21:16,114 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-02 19:21:16,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:21:16,115 INFO L225 Difference]: With dead ends: 75 [2018-02-02 19:21:16,115 INFO L226 Difference]: Without dead ends: 75 [2018-02-02 19:21:16,115 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 19:21:16,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-02 19:21:16,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-02-02 19:21:16,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-02 19:21:16,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2018-02-02 19:21:16,120 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 26 [2018-02-02 19:21:16,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:21:16,121 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2018-02-02 19:21:16,121 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 19:21:16,121 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2018-02-02 19:21:16,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 19:21:16,122 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:21:16,122 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:21:16,122 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-02 19:21:16,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1433763836, now seen corresponding path program 1 times [2018-02-02 19:21:16,122 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:21:16,122 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:21:16,124 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:21:16,124 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:21:16,124 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:21:16,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:21:16,137 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:21:16,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:21:16,185 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:21:16,185 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 19:21:16,185 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 19:21:16,186 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 19:21:16,186 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 19:21:16,186 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand 6 states. [2018-02-02 19:21:16,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:21:16,249 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2018-02-02 19:21:16,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 19:21:16,250 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-02 19:21:16,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:21:16,251 INFO L225 Difference]: With dead ends: 74 [2018-02-02 19:21:16,251 INFO L226 Difference]: Without dead ends: 74 [2018-02-02 19:21:16,251 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 19:21:16,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-02 19:21:16,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-02-02 19:21:16,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-02 19:21:16,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2018-02-02 19:21:16,257 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 26 [2018-02-02 19:21:16,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:21:16,257 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-02-02 19:21:16,257 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 19:21:16,257 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2018-02-02 19:21:16,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 19:21:16,258 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:21:16,258 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:21:16,258 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-02 19:21:16,258 INFO L82 PathProgramCache]: Analyzing trace with hash -772946127, now seen corresponding path program 1 times [2018-02-02 19:21:16,258 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:21:16,258 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:21:16,259 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:21:16,260 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:21:16,260 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:21:16,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:21:16,268 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:21:16,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:21:16,290 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:21:16,290 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 19:21:16,291 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 19:21:16,291 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 19:21:16,291 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 19:21:16,291 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 3 states. [2018-02-02 19:21:16,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:21:16,332 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2018-02-02 19:21:16,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 19:21:16,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-02-02 19:21:16,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:21:16,333 INFO L225 Difference]: With dead ends: 77 [2018-02-02 19:21:16,333 INFO L226 Difference]: Without dead ends: 61 [2018-02-02 19:21:16,333 INFO L554 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-02-02 19:21:16,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-02-02 19:21:16,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-02-02 19:21:16,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-02 19:21:16,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-02-02 19:21:16,337 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 25 [2018-02-02 19:21:16,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:21:16,337 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-02-02 19:21:16,337 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 19:21:16,338 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-02-02 19:21:16,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 19:21:16,338 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:21:16,338 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:21:16,338 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-02 19:21:16,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1279706416, now seen corresponding path program 1 times [2018-02-02 19:21:16,339 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:21:16,339 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:21:16,340 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:21:16,340 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:21:16,340 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:21:16,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:21:16,354 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:21:16,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:21:16,446 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:21:16,446 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 19:21:16,447 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 19:21:16,447 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 19:21:16,447 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 19:21:16,447 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 8 states. [2018-02-02 19:21:16,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:21:16,668 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2018-02-02 19:21:16,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 19:21:16,668 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-02-02 19:21:16,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:21:16,669 INFO L225 Difference]: With dead ends: 65 [2018-02-02 19:21:16,669 INFO L226 Difference]: Without dead ends: 65 [2018-02-02 19:21:16,670 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-02-02 19:21:16,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-02 19:21:16,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2018-02-02 19:21:16,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-02 19:21:16,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-02-02 19:21:16,672 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 32 [2018-02-02 19:21:16,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:21:16,673 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-02-02 19:21:16,673 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 19:21:16,673 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-02-02 19:21:16,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 19:21:16,673 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:21:16,673 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:21:16,673 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-02 19:21:16,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1279706417, now seen corresponding path program 1 times [2018-02-02 19:21:16,674 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:21:16,674 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:21:16,674 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:21:16,674 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:21:16,674 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:21:16,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:21:16,689 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:21:16,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:21:16,821 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:21:16,821 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 19:21:16,822 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 19:21:16,822 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 19:21:16,822 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-02 19:21:16,822 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 10 states. [2018-02-02 19:21:17,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:21:17,152 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2018-02-02 19:21:17,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 19:21:17,153 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-02-02 19:21:17,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:21:17,153 INFO L225 Difference]: With dead ends: 58 [2018-02-02 19:21:17,153 INFO L226 Difference]: Without dead ends: 58 [2018-02-02 19:21:17,154 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2018-02-02 19:21:17,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-02 19:21:17,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-02-02 19:21:17,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-02 19:21:17,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2018-02-02 19:21:17,156 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 32 [2018-02-02 19:21:17,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:21:17,157 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2018-02-02 19:21:17,157 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 19:21:17,157 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-02-02 19:21:17,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 19:21:17,158 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:21:17,158 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:21:17,158 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-02 19:21:17,158 INFO L82 PathProgramCache]: Analyzing trace with hash 2490893, now seen corresponding path program 1 times [2018-02-02 19:21:17,158 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:21:17,158 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:21:17,160 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:21:17,160 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:21:17,160 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:21:17,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:21:17,170 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:21:17,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:21:17,344 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:21:17,344 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 19:21:17,345 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 19:21:17,345 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 19:21:17,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 19:21:17,345 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 8 states. [2018-02-02 19:21:17,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:21:17,627 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-02-02 19:21:17,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 19:21:17,628 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-02-02 19:21:17,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:21:17,628 INFO L225 Difference]: With dead ends: 60 [2018-02-02 19:21:17,628 INFO L226 Difference]: Without dead ends: 46 [2018-02-02 19:21:17,629 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-02-02 19:21:17,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-02 19:21:17,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-02-02 19:21:17,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-02 19:21:17,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-02-02 19:21:17,631 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 32 [2018-02-02 19:21:17,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:21:17,631 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-02-02 19:21:17,632 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 19:21:17,632 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-02-02 19:21:17,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 19:21:17,632 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:21:17,632 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:21:17,633 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-02 19:21:17,633 INFO L82 PathProgramCache]: Analyzing trace with hash 2029507581, now seen corresponding path program 1 times [2018-02-02 19:21:17,633 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:21:17,633 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:21:17,634 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:21:17,634 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:21:17,634 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:21:17,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:21:17,645 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:21:17,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:21:17,670 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:21:17,670 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 19:21:17,671 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 19:21:17,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 19:21:17,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:21:17,671 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 5 states. [2018-02-02 19:21:17,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:21:17,676 INFO L93 Difference]: Finished difference Result 46 states and 45 transitions. [2018-02-02 19:21:17,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 19:21:17,678 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-02-02 19:21:17,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:21:17,678 INFO L225 Difference]: With dead ends: 46 [2018-02-02 19:21:17,678 INFO L226 Difference]: Without dead ends: 46 [2018-02-02 19:21:17,679 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:21:17,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-02 19:21:17,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-02-02 19:21:17,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-02 19:21:17,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 45 transitions. [2018-02-02 19:21:17,681 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 45 transitions. Word has length 41 [2018-02-02 19:21:17,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:21:17,681 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 45 transitions. [2018-02-02 19:21:17,681 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 19:21:17,682 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 45 transitions. [2018-02-02 19:21:17,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 19:21:17,683 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:21:17,683 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:21:17,683 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-02 19:21:17,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1307871834, now seen corresponding path program 1 times [2018-02-02 19:21:17,684 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:21:17,684 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:21:17,685 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:21:17,685 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:21:17,685 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:21:17,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-02 19:21:17,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-02 19:21:17,747 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-02 19:21:17,763 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-02 19:21:17,767 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-02-02 19:21:17,768 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 9 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-02-02 19:21:17,769 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 9 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-02-02 19:21:17,769 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-02-02 19:21:17,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 07:21:17 BoogieIcfgContainer [2018-02-02 19:21:17,776 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 19:21:17,777 INFO L168 Benchmark]: Toolchain (without parser) took 2787.63 ms. Allocated memory was 410.5 MB in the beginning and 663.2 MB in the end (delta: 252.7 MB). Free memory was 367.4 MB in the beginning and 600.2 MB in the end (delta: -232.8 MB). Peak memory consumption was 19.9 MB. Max. memory is 5.3 GB. [2018-02-02 19:21:17,778 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 410.5 MB. Free memory is still 374.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 19:21:17,778 INFO L168 Benchmark]: CACSL2BoogieTranslator took 171.44 ms. Allocated memory is still 410.5 MB. Free memory was 367.4 MB in the beginning and 354.1 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-02 19:21:17,778 INFO L168 Benchmark]: Boogie Preprocessor took 25.06 ms. Allocated memory is still 410.5 MB. Free memory was 354.1 MB in the beginning and 352.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 19:21:17,778 INFO L168 Benchmark]: RCFGBuilder took 177.46 ms. Allocated memory is still 410.5 MB. Free memory was 352.8 MB in the beginning and 332.2 MB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 5.3 GB. [2018-02-02 19:21:17,778 INFO L168 Benchmark]: TraceAbstraction took 2410.78 ms. Allocated memory was 410.5 MB in the beginning and 663.2 MB in the end (delta: 252.7 MB). Free memory was 332.2 MB in the beginning and 600.2 MB in the end (delta: -268.0 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 19:21:17,779 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.14 ms. Allocated memory is still 410.5 MB. Free memory is still 374.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 171.44 ms. Allocated memory is still 410.5 MB. Free memory was 367.4 MB in the beginning and 354.1 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 25.06 ms. Allocated memory is still 410.5 MB. Free memory was 354.1 MB in the beginning and 352.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 177.46 ms. Allocated memory is still 410.5 MB. Free memory was 352.8 MB in the beginning and 332.2 MB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2410.78 ms. Allocated memory was 410.5 MB in the beginning and 663.2 MB in the end (delta: 252.7 MB). Free memory was 332.2 MB in the beginning and 600.2 MB in the end (delta: -268.0 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 9 could not be translated for associated CType STRUCT#?p~$Pointer$# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 9 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={9: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() [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=4, a6={7:0}, malloc(size)={8:0}, size=4] [L1074] RET return malloc(size); VAL [\old(size)=4, \result={8:0}, a6={7:0}, malloc(size)={8:0}, size=4] [L1444] EXPR ldv_malloc(sizeof(int)) VAL [a={7:0}, a={7:0}, a6={7:0}, ldv_malloc(sizeof(int))={8:0}, ret=3] [L1444] int *p = (int *)ldv_malloc(sizeof(int)); [L1445] COND FALSE !(p==0) VAL [a={7:0}, a={7:0}, a6={7:0}, p={8:0}, ret=3] [L1447] CALL, EXPR f6() VAL [a6={7:0}] [L1435] RET return __VERIFIER_nondet_int(); [L1447] EXPR f6() VAL [a={7:0}, a={7:0}, a6={7:0}, f6()=0, p={8:0}, ret=3] [L1447] ret = f6() [L1448] COND FALSE !(ret<0) VAL [a={7:0}, a={7:0}, a6={7:0}, p={8:0}, ret=0] [L1450] CALL, EXPR g6() VAL [a6={7:0}] [L1439] RET return __VERIFIER_nondet_int(); [L1450] EXPR g6() VAL [a={7:0}, a={7:0}, a6={7:0}, g6()=0, p={8:0}, ret=0] [L1450] ret = g6() [L1451] COND FALSE !(ret<0) VAL [a={7:0}, a={7:0}, a6={7:0}, p={8:0}, ret=0] [L1453] FCALL a->p = p VAL [a={7:0}, a={7:0}, a6={7:0}, p={8:0}, ret=0] [L1454] RET return 0; VAL [\result=0, a={7:0}, a={7:0}, a6={7:0}, p={8:0}, ret=0] [L1469] EXPR probe1_6(&a6) VAL [a6={7:0}, probe1_6(&a6)=0] [L1469] int ret = probe1_6(&a6); [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, 59 locations, 9 error locations. UNSAFE Result, 2.3s OverallTime, 12 OverallIterations, 1 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 545 SDtfs, 391 SDslu, 1189 SDs, 0 SdLazy, 717 SolverSat, 120 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=101occurred 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.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 17 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 315 NumberOfCodeBlocks, 315 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 259 ConstructedInterpolants, 0 QuantifiedInterpolants, 32242 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_3_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_19-21-17-786.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_3_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_19-21-17-786.csv Received shutdown request...