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/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 09:04:55,719 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 09:04:55,721 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 09:04:55,737 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 09:04:55,737 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 09:04:55,740 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 09:04:55,741 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 09:04:55,743 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 09:04:55,745 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 09:04:55,746 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 09:04:55,746 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 09:04:55,747 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 09:04:55,748 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 09:04:55,749 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 09:04:55,750 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 09:04:55,753 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 09:04:55,755 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 09:04:55,757 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 09:04:55,758 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 09:04:55,759 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 09:04:55,762 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 09:04:55,762 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 09:04:55,762 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 09:04:55,763 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 09:04:55,764 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 09:04:55,765 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 09:04:55,765 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 09:04:55,766 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 09:04:55,766 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 09:04:55,767 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 09:04:55,767 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 09:04:55,768 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-31 09:04:55,778 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 09:04:55,779 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 09:04:55,779 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 09:04:55,780 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 09:04:55,780 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 09:04:55,780 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 09:04:55,780 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 09:04:55,781 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 09:04:55,781 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 09:04:55,781 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 09:04:55,782 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 09:04:55,782 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 09:04:55,782 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 09:04:55,782 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 09:04:55,782 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 09:04:55,783 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 09:04:55,783 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 09:04:55,783 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 09:04:55,783 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 09:04:55,783 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 09:04:55,784 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 09:04:55,784 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 09:04:55,784 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 09:04:55,784 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 09:04:55,784 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 09:04:55,785 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 09:04:55,785 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 09:04:55,785 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 09:04:55,785 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 09:04:55,785 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 09:04:55,785 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 09:04:55,786 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 09:04:55,786 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 09:04:55,787 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 09:04:55,827 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 09:04:55,837 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 09:04:55,839 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 09:04:55,841 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 09:04:55,841 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 09:04:55,842 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.i [2018-01-31 09:04:56,014 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 09:04:56,023 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-31 09:04:56,025 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 09:04:56,025 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 09:04:56,036 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 09:04:56,038 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:04:56" (1/1) ... [2018-01-31 09:04:56,042 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50288e09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:04:56, skipping insertion in model container [2018-01-31 09:04:56,042 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:04:56" (1/1) ... [2018-01-31 09:04:56,061 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 09:04:56,121 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 09:04:56,294 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 09:04:56,330 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 09:04:56,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:04:56 WrapperNode [2018-01-31 09:04:56,352 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 09:04:56,353 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 09:04:56,353 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 09:04:56,353 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 09:04:56,376 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:04:56" (1/1) ... [2018-01-31 09:04:56,376 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:04:56" (1/1) ... [2018-01-31 09:04:56,387 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:04:56" (1/1) ... [2018-01-31 09:04:56,388 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:04:56" (1/1) ... [2018-01-31 09:04:56,394 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:04:56" (1/1) ... [2018-01-31 09:04:56,396 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:04:56" (1/1) ... [2018-01-31 09:04:56,398 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:04:56" (1/1) ... [2018-01-31 09:04:56,400 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 09:04:56,400 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 09:04:56,400 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 09:04:56,401 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 09:04:56,402 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:04:56" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 09:04:56,454 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 09:04:56,455 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 09:04:56,455 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_data [2018-01-31 09:04:56,455 INFO L136 BoogieDeclarations]: Found implementation of procedure free_data [2018-01-31 09:04:56,455 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 09:04:56,455 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-31 09:04:56,455 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-31 09:04:56,455 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-31 09:04:56,456 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-31 09:04:56,456 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 09:04:56,456 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 09:04:56,457 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 09:04:56,457 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-31 09:04:56,457 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-31 09:04:56,457 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_data [2018-01-31 09:04:56,458 INFO L128 BoogieDeclarations]: Found specification of procedure free_data [2018-01-31 09:04:56,458 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 09:04:56,458 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 09:04:56,458 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 09:04:57,054 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 09:04:57,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:04:57 BoogieIcfgContainer [2018-01-31 09:04:57,055 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 09:04:57,058 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 09:04:57,059 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 09:04:57,063 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 09:04:57,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 09:04:56" (1/3) ... [2018-01-31 09:04:57,064 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7df31e9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:04:57, skipping insertion in model container [2018-01-31 09:04:57,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:04:56" (2/3) ... [2018-01-31 09:04:57,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7df31e9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:04:57, skipping insertion in model container [2018-01-31 09:04:57,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:04:57" (3/3) ... [2018-01-31 09:04:57,067 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0019_1_false-valid-memtrack_true-termination.i [2018-01-31 09:04:57,075 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 09:04:57,083 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 29 error locations. [2018-01-31 09:04:57,127 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 09:04:57,127 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 09:04:57,127 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 09:04:57,127 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 09:04:57,127 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 09:04:57,128 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 09:04:57,128 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 09:04:57,128 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 09:04:57,129 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 09:04:57,154 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2018-01-31 09:04:57,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-31 09:04:57,163 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:04:57,164 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:04:57,165 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-31 09:04:57,169 INFO L82 PathProgramCache]: Analyzing trace with hash -498252997, now seen corresponding path program 1 times [2018-01-31 09:04:57,170 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:04:57,171 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:04:57,229 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:04:57,230 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:04:57,230 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:04:57,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:04:57,288 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:04:57,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:04:57,547 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:04:57,547 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 09:04:57,548 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 09:04:57,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 09:04:57,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:04:57,565 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 5 states. [2018-01-31 09:04:58,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:04:58,078 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-01-31 09:04:58,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 09:04:58,080 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-01-31 09:04:58,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:04:58,091 INFO L225 Difference]: With dead ends: 78 [2018-01-31 09:04:58,091 INFO L226 Difference]: Without dead ends: 71 [2018-01-31 09:04:58,095 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:04:58,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-31 09:04:58,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-01-31 09:04:58,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-31 09:04:58,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-01-31 09:04:58,138 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 11 [2018-01-31 09:04:58,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:04:58,138 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-01-31 09:04:58,139 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 09:04:58,139 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-01-31 09:04:58,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-31 09:04:58,139 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:04:58,140 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:04:58,141 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-31 09:04:58,141 INFO L82 PathProgramCache]: Analyzing trace with hash -498252996, now seen corresponding path program 1 times [2018-01-31 09:04:58,141 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:04:58,141 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:04:58,142 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:04:58,143 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:04:58,143 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:04:58,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:04:58,168 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:04:58,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:04:58,401 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:04:58,401 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 09:04:58,403 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:04:58,403 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:04:58,403 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:04:58,404 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 6 states. [2018-01-31 09:04:59,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:04:59,065 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-01-31 09:04:59,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 09:04:59,065 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-01-31 09:04:59,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:04:59,067 INFO L225 Difference]: With dead ends: 71 [2018-01-31 09:04:59,067 INFO L226 Difference]: Without dead ends: 67 [2018-01-31 09:04:59,068 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-31 09:04:59,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-31 09:04:59,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-01-31 09:04:59,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-31 09:04:59,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-01-31 09:04:59,076 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 11 [2018-01-31 09:04:59,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:04:59,076 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-01-31 09:04:59,076 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:04:59,076 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-01-31 09:04:59,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-31 09:04:59,077 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:04:59,077 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:04:59,077 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-31 09:04:59,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1490586689, now seen corresponding path program 1 times [2018-01-31 09:04:59,077 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:04:59,078 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:04:59,079 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:04:59,079 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:04:59,079 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:04:59,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:04:59,100 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:04:59,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:04:59,174 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:04:59,174 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 09:04:59,174 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 09:04:59,175 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 09:04:59,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:04:59,175 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 5 states. [2018-01-31 09:04:59,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:04:59,360 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-01-31 09:04:59,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:04:59,360 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-01-31 09:04:59,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:04:59,361 INFO L225 Difference]: With dead ends: 67 [2018-01-31 09:04:59,362 INFO L226 Difference]: Without dead ends: 66 [2018-01-31 09:04:59,362 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:04:59,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-31 09:04:59,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-01-31 09:04:59,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-31 09:04:59,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-01-31 09:04:59,370 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 15 [2018-01-31 09:04:59,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:04:59,371 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-01-31 09:04:59,371 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 09:04:59,371 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-01-31 09:04:59,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-31 09:04:59,372 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:04:59,372 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:04:59,372 INFO L371 AbstractCegarLoop]: === Iteration 4 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-31 09:04:59,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1490586688, now seen corresponding path program 1 times [2018-01-31 09:04:59,372 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:04:59,373 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:04:59,374 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:04:59,374 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:04:59,374 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:04:59,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:04:59,397 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:04:59,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:04:59,555 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:04:59,555 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 09:04:59,556 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:04:59,556 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:04:59,556 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:04:59,556 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 6 states. [2018-01-31 09:04:59,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:04:59,831 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-01-31 09:04:59,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:04:59,832 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-01-31 09:04:59,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:04:59,833 INFO L225 Difference]: With dead ends: 66 [2018-01-31 09:04:59,833 INFO L226 Difference]: Without dead ends: 65 [2018-01-31 09:04:59,833 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-01-31 09:04:59,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-31 09:04:59,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-01-31 09:04:59,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-31 09:04:59,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-01-31 09:04:59,841 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 15 [2018-01-31 09:04:59,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:04:59,841 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-01-31 09:04:59,841 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:04:59,841 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-01-31 09:04:59,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-31 09:04:59,842 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:04:59,842 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:04:59,842 INFO L371 AbstractCegarLoop]: === Iteration 5 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-31 09:04:59,843 INFO L82 PathProgramCache]: Analyzing trace with hash -401193515, now seen corresponding path program 1 times [2018-01-31 09:04:59,843 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:04:59,843 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:04:59,844 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:04:59,844 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:04:59,844 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:04:59,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:04:59,864 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:05:00,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:05:00,012 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:05:00,012 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-31 09:05:00,012 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-31 09:05:00,012 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-31 09:05:00,013 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-01-31 09:05:00,013 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 12 states. [2018-01-31 09:05:00,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:05:00,435 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-01-31 09:05:00,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-31 09:05:00,436 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-01-31 09:05:00,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:05:00,437 INFO L225 Difference]: With dead ends: 65 [2018-01-31 09:05:00,437 INFO L226 Difference]: Without dead ends: 64 [2018-01-31 09:05:00,437 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2018-01-31 09:05:00,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-31 09:05:00,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-01-31 09:05:00,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-31 09:05:00,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-01-31 09:05:00,444 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 18 [2018-01-31 09:05:00,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:05:00,444 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-01-31 09:05:00,444 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-31 09:05:00,444 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-01-31 09:05:00,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-31 09:05:00,445 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:05:00,445 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:05:00,445 INFO L371 AbstractCegarLoop]: === Iteration 6 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-31 09:05:00,445 INFO L82 PathProgramCache]: Analyzing trace with hash -401193514, now seen corresponding path program 1 times [2018-01-31 09:05:00,445 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:05:00,446 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:05:00,447 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:00,447 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:05:00,447 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:00,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:05:00,470 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:05:00,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:05:00,647 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:05:00,648 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-31 09:05:00,648 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-31 09:05:00,648 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-31 09:05:00,648 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-01-31 09:05:00,649 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 12 states. [2018-01-31 09:05:01,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:05:01,370 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-01-31 09:05:01,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-31 09:05:01,371 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-01-31 09:05:01,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:05:01,371 INFO L225 Difference]: With dead ends: 64 [2018-01-31 09:05:01,372 INFO L226 Difference]: Without dead ends: 63 [2018-01-31 09:05:01,372 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2018-01-31 09:05:01,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-31 09:05:01,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-01-31 09:05:01,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-31 09:05:01,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-01-31 09:05:01,378 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 18 [2018-01-31 09:05:01,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:05:01,378 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-01-31 09:05:01,378 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-31 09:05:01,379 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-01-31 09:05:01,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-31 09:05:01,379 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:05:01,380 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-01-31 09:05:01,380 INFO L371 AbstractCegarLoop]: === Iteration 7 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-31 09:05:01,380 INFO L82 PathProgramCache]: Analyzing trace with hash 53177208, now seen corresponding path program 1 times [2018-01-31 09:05:01,380 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:05:01,380 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:05:01,381 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:01,381 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:05:01,382 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:01,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:05:01,398 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:05:01,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:05:01,766 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:05:01,766 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 09:05:01,767 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 09:05:01,767 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 09:05:01,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:05:01,767 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 8 states. [2018-01-31 09:05:01,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:05:01,954 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2018-01-31 09:05:01,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 09:05:01,957 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-01-31 09:05:01,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:05:01,959 INFO L225 Difference]: With dead ends: 72 [2018-01-31 09:05:01,959 INFO L226 Difference]: Without dead ends: 68 [2018-01-31 09:05:01,959 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-31 09:05:01,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-31 09:05:01,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 61. [2018-01-31 09:05:01,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-31 09:05:01,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2018-01-31 09:05:01,967 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 24 [2018-01-31 09:05:01,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:05:01,968 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-01-31 09:05:01,968 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 09:05:01,968 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-01-31 09:05:01,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-31 09:05:01,969 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:05:01,969 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-01-31 09:05:01,969 INFO L371 AbstractCegarLoop]: === Iteration 8 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-31 09:05:01,969 INFO L82 PathProgramCache]: Analyzing trace with hash 53177209, now seen corresponding path program 1 times [2018-01-31 09:05:01,969 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:05:01,970 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:05:01,970 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:01,971 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:05:01,971 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:01,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:05:01,989 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:05:02,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:05:02,157 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:05:02,157 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-31 09:05:02,157 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 09:05:02,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 09:05:02,157 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-31 09:05:02,158 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 9 states. [2018-01-31 09:05:02,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:05:02,263 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2018-01-31 09:05:02,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 09:05:02,263 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-01-31 09:05:02,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:05:02,264 INFO L225 Difference]: With dead ends: 61 [2018-01-31 09:05:02,264 INFO L226 Difference]: Without dead ends: 57 [2018-01-31 09:05:02,264 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-01-31 09:05:02,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-31 09:05:02,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-01-31 09:05:02,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-31 09:05:02,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-01-31 09:05:02,270 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 24 [2018-01-31 09:05:02,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:05:02,270 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-01-31 09:05:02,270 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 09:05:02,270 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-01-31 09:05:02,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-31 09:05:02,271 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:05:02,271 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] [2018-01-31 09:05:02,271 INFO L371 AbstractCegarLoop]: === Iteration 9 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-31 09:05:02,272 INFO L82 PathProgramCache]: Analyzing trace with hash -757929539, now seen corresponding path program 1 times [2018-01-31 09:05:02,272 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:05:02,272 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:05:02,273 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:02,273 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:05:02,273 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:02,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:05:02,296 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:05:02,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:05:02,773 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:05:02,773 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-01-31 09:05:02,773 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-31 09:05:02,773 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-31 09:05:02,773 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2018-01-31 09:05:02,774 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 18 states. [2018-01-31 09:05:03,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:05:03,427 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-01-31 09:05:03,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-31 09:05:03,427 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 30 [2018-01-31 09:05:03,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:05:03,430 INFO L225 Difference]: With dead ends: 60 [2018-01-31 09:05:03,430 INFO L226 Difference]: Without dead ends: 58 [2018-01-31 09:05:03,431 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=126, Invalid=804, Unknown=0, NotChecked=0, Total=930 [2018-01-31 09:05:03,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-31 09:05:03,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2018-01-31 09:05:03,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-31 09:05:03,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-01-31 09:05:03,440 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 30 [2018-01-31 09:05:03,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:05:03,441 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-01-31 09:05:03,441 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-31 09:05:03,441 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-01-31 09:05:03,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-31 09:05:03,442 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:05:03,442 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] [2018-01-31 09:05:03,442 INFO L371 AbstractCegarLoop]: === Iteration 10 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-31 09:05:03,442 INFO L82 PathProgramCache]: Analyzing trace with hash -757929538, now seen corresponding path program 1 times [2018-01-31 09:05:03,442 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:05:03,443 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:05:03,444 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:03,444 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:05:03,444 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:03,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:05:03,468 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:05:04,114 WARN L143 SmtUtils]: Spent 126ms on a formula simplification that was a NOOP. DAG size: 14 [2018-01-31 09:05:04,504 WARN L146 SmtUtils]: Spent 274ms on a formula simplification. DAG size of input: 28 DAG size of output 23 [2018-01-31 09:05:04,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:05:04,836 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:05:04,837 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-01-31 09:05:04,837 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-31 09:05:04,837 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-31 09:05:04,837 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2018-01-31 09:05:04,838 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 18 states. [2018-01-31 09:05:05,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:05:05,828 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-01-31 09:05:05,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-31 09:05:05,829 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 30 [2018-01-31 09:05:05,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:05:05,830 INFO L225 Difference]: With dead ends: 58 [2018-01-31 09:05:05,831 INFO L226 Difference]: Without dead ends: 56 [2018-01-31 09:05:05,831 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=133, Invalid=859, Unknown=0, NotChecked=0, Total=992 [2018-01-31 09:05:05,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-31 09:05:05,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2018-01-31 09:05:05,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-31 09:05:05,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-01-31 09:05:05,847 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 30 [2018-01-31 09:05:05,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:05:05,847 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-01-31 09:05:05,847 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-31 09:05:05,847 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-01-31 09:05:05,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-31 09:05:05,848 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:05:05,848 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] [2018-01-31 09:05:05,849 INFO L371 AbstractCegarLoop]: === Iteration 11 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-31 09:05:05,849 INFO L82 PathProgramCache]: Analyzing trace with hash -2020979207, now seen corresponding path program 1 times [2018-01-31 09:05:05,849 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:05:05,849 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:05:05,850 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:05,850 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:05:05,850 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:05,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:05:05,888 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:05:06,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:05:06,536 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:05:06,536 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-01-31 09:05:06,536 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-31 09:05:06,537 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-31 09:05:06,537 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2018-01-31 09:05:06,537 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 18 states. [2018-01-31 09:05:08,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:05:08,095 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-01-31 09:05:08,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-31 09:05:08,096 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 31 [2018-01-31 09:05:08,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:05:08,097 INFO L225 Difference]: With dead ends: 56 [2018-01-31 09:05:08,097 INFO L226 Difference]: Without dead ends: 55 [2018-01-31 09:05:08,098 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=141, Invalid=981, Unknown=0, NotChecked=0, Total=1122 [2018-01-31 09:05:08,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-31 09:05:08,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2018-01-31 09:05:08,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-31 09:05:08,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-01-31 09:05:08,112 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 31 [2018-01-31 09:05:08,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:05:08,112 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-01-31 09:05:08,112 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-31 09:05:08,113 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-01-31 09:05:08,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-31 09:05:08,113 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:05:08,113 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] [2018-01-31 09:05:08,114 INFO L371 AbstractCegarLoop]: === Iteration 12 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-31 09:05:08,114 INFO L82 PathProgramCache]: Analyzing trace with hash -2020979206, now seen corresponding path program 1 times [2018-01-31 09:05:08,114 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:05:08,114 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:05:08,115 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:08,115 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:05:08,115 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:08,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:05:08,139 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:05:08,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:05:08,839 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:05:08,839 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-01-31 09:05:08,839 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-31 09:05:08,839 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-31 09:05:08,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-01-31 09:05:08,840 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 18 states. [2018-01-31 09:05:09,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:05:09,778 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-01-31 09:05:09,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-31 09:05:09,778 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 31 [2018-01-31 09:05:09,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:05:09,779 INFO L225 Difference]: With dead ends: 55 [2018-01-31 09:05:09,779 INFO L226 Difference]: Without dead ends: 53 [2018-01-31 09:05:09,780 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=160, Invalid=962, Unknown=0, NotChecked=0, Total=1122 [2018-01-31 09:05:09,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-31 09:05:09,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2018-01-31 09:05:09,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-31 09:05:09,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-01-31 09:05:09,784 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 31 [2018-01-31 09:05:09,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:05:09,784 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-01-31 09:05:09,784 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-31 09:05:09,784 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-01-31 09:05:09,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-31 09:05:09,785 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:05:09,785 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] [2018-01-31 09:05:09,786 INFO L371 AbstractCegarLoop]: === Iteration 13 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-31 09:05:09,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1370608825, now seen corresponding path program 1 times [2018-01-31 09:05:09,786 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:05:09,786 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:05:09,787 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:09,787 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:05:09,787 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:09,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:05:09,807 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:05:10,525 WARN L146 SmtUtils]: Spent 160ms on a formula simplification. DAG size of input: 42 DAG size of output 34 [2018-01-31 09:05:10,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:05:10,800 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:05:10,800 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-01-31 09:05:10,801 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-31 09:05:10,801 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-31 09:05:10,801 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2018-01-31 09:05:10,801 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 22 states. [2018-01-31 09:05:11,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:05:11,786 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-01-31 09:05:11,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-31 09:05:11,787 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 36 [2018-01-31 09:05:11,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:05:11,787 INFO L225 Difference]: With dead ends: 53 [2018-01-31 09:05:11,788 INFO L226 Difference]: Without dead ends: 52 [2018-01-31 09:05:11,788 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=215, Invalid=1425, Unknown=0, NotChecked=0, Total=1640 [2018-01-31 09:05:11,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-31 09:05:11,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2018-01-31 09:05:11,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-31 09:05:11,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-01-31 09:05:11,793 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 36 [2018-01-31 09:05:11,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:05:11,793 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-01-31 09:05:11,793 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-31 09:05:11,793 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-01-31 09:05:11,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-31 09:05:11,800 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:05:11,800 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] [2018-01-31 09:05:11,800 INFO L371 AbstractCegarLoop]: === Iteration 14 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-31 09:05:11,800 INFO L82 PathProgramCache]: Analyzing trace with hash 460799395, now seen corresponding path program 1 times [2018-01-31 09:05:11,800 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:05:11,800 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:05:11,801 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:11,801 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:05:11,801 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:11,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:05:11,841 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:05:12,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:05:12,486 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:05:12,486 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-01-31 09:05:12,486 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-31 09:05:12,486 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-31 09:05:12,487 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2018-01-31 09:05:12,487 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 22 states. [2018-01-31 09:05:13,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:05:13,606 INFO L93 Difference]: Finished difference Result 57 states and 56 transitions. [2018-01-31 09:05:13,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-31 09:05:13,606 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 37 [2018-01-31 09:05:13,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:05:13,607 INFO L225 Difference]: With dead ends: 57 [2018-01-31 09:05:13,607 INFO L226 Difference]: Without dead ends: 43 [2018-01-31 09:05:13,608 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=197, Invalid=1443, Unknown=0, NotChecked=0, Total=1640 [2018-01-31 09:05:13,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-31 09:05:13,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-01-31 09:05:13,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-31 09:05:13,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 42 transitions. [2018-01-31 09:05:13,612 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 42 transitions. Word has length 37 [2018-01-31 09:05:13,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:05:13,612 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 42 transitions. [2018-01-31 09:05:13,612 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-31 09:05:13,612 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 42 transitions. [2018-01-31 09:05:13,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-31 09:05:13,613 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:05:13,613 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:05:13,614 INFO L371 AbstractCegarLoop]: === Iteration 15 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-31 09:05:13,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1799199722, now seen corresponding path program 1 times [2018-01-31 09:05:13,614 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:05:13,614 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:05:13,615 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:13,615 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:05:13,615 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:13,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-31 09:05:13,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-31 09:05:13,697 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-01-31 09:05:13,731 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-31 09:05:13,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 09:05:13 BoogieIcfgContainer [2018-01-31 09:05:13,751 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-31 09:05:13,752 INFO L168 Benchmark]: Toolchain (without parser) took 17737.40 ms. Allocated memory was 305.1 MB in the beginning and 627.0 MB in the end (delta: 321.9 MB). Free memory was 261.9 MB in the beginning and 452.3 MB in the end (delta: -190.5 MB). Peak memory consumption was 131.5 MB. Max. memory is 5.3 GB. [2018-01-31 09:05:13,753 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 305.1 MB. Free memory is still 267.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 09:05:13,753 INFO L168 Benchmark]: CACSL2BoogieTranslator took 327.53 ms. Allocated memory is still 305.1 MB. Free memory was 261.9 MB in the beginning and 251.9 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:05:13,753 INFO L168 Benchmark]: Boogie Preprocessor took 46.80 ms. Allocated memory is still 305.1 MB. Free memory was 251.9 MB in the beginning and 249.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:05:13,754 INFO L168 Benchmark]: RCFGBuilder took 657.07 ms. Allocated memory is still 305.1 MB. Free memory was 249.9 MB in the beginning and 225.0 MB in the end (delta: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 5.3 GB. [2018-01-31 09:05:13,754 INFO L168 Benchmark]: TraceAbstraction took 16692.42 ms. Allocated memory was 305.1 MB in the beginning and 627.0 MB in the end (delta: 321.9 MB). Free memory was 225.0 MB in the beginning and 452.3 MB in the end (delta: -227.4 MB). Peak memory consumption was 94.6 MB. Max. memory is 5.3 GB. [2018-01-31 09:05:13,756 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.11 ms. Allocated memory is still 305.1 MB. Free memory is still 267.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 327.53 ms. Allocated memory is still 305.1 MB. Free memory was 261.9 MB in the beginning and 251.9 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 46.80 ms. Allocated memory is still 305.1 MB. Free memory was 251.9 MB in the beginning and 249.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 657.07 ms. Allocated memory is still 305.1 MB. Free memory was 249.9 MB in the beginning and 225.0 MB in the end (delta: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 16692.42 ms. Allocated memory was 305.1 MB in the beginning and 627.0 MB in the end (delta: 321.9 MB). Free memory was 225.0 MB in the beginning and 452.3 MB in the end (delta: -227.4 MB). Peak memory consumption was 94.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 641]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 641. Possible FailurePath: [L642] FCALL TData data; VAL [data={18:0}] [L643] CALL alloc_data(&data) VAL [pdata={18:0}] [L625] EXPR, FCALL malloc(sizeof(int)) VAL [malloc(sizeof(int))={16:0}, pdata={18:0}, pdata={18:0}] [L625] FCALL pdata->lo = (int *)malloc(sizeof(int)) VAL [malloc(sizeof(int))={16:0}, pdata={18:0}, pdata={18:0}] [L626] EXPR, FCALL malloc(sizeof(int)) VAL [malloc(sizeof(int))={16:0}, malloc(sizeof(int))={10:0}, pdata={18:0}, pdata={18:0}] [L626] FCALL pdata->hi = (int *)malloc(sizeof(int)) VAL [malloc(sizeof(int))={16:0}, malloc(sizeof(int))={10:0}, pdata={18:0}, pdata={18:0}] [L627] EXPR, FCALL pdata->lo VAL [malloc(sizeof(int))={16:0}, malloc(sizeof(int))={10:0}, pdata={18:0}, pdata={18:0}, pdata->lo={16:0}] [L627] FCALL *(pdata->lo) = 4 VAL [malloc(sizeof(int))={16:0}, malloc(sizeof(int))={10:0}, pdata={18:0}, pdata={18:0}, pdata->lo={16:0}] [L628] EXPR, FCALL pdata->hi VAL [malloc(sizeof(int))={16:0}, malloc(sizeof(int))={10:0}, pdata={18:0}, pdata={18:0}, pdata->hi={10:0}] [L628] RET, FCALL *(pdata->hi) = 8 VAL [malloc(sizeof(int))={16:0}, malloc(sizeof(int))={10:0}, pdata={18:0}, pdata={18:0}, pdata->hi={10:0}] [L643] alloc_data(&data) VAL [data={18:0}] [L644] CALL free_data(&data) VAL [data={18:0}] [L632] EXPR, FCALL data->lo VAL [data={18:0}, data={18:0}, data->lo={16:0}] [L632] int *lo = data->lo; VAL [data={18:0}, data={18:0}, data->lo={16:0}, lo={16:0}] [L633] EXPR, FCALL data->hi VAL [data={18:0}, data={18:0}, data->hi={10:0}, lo={16:0}] [L633] int *hi = data->hi; VAL [data={18:0}, data={18:0}, data->hi={10:0}, hi={10:0}, lo={16:0}] [L634] EXPR, FCALL \read(*lo) VAL [\read(*lo)=4, data={18:0}, data={18:0}, hi={10:0}, lo={16:0}] [L634] EXPR, FCALL \read(*hi) VAL [\read(*hi)=8, \read(*lo)=4, data={18:0}, data={18:0}, hi={10:0}, lo={16:0}] [L634] COND FALSE !(*lo >= *hi) VAL [\read(*hi)=8, \read(*lo)=4, data={18:0}, data={18:0}, hi={10:0}, lo={16:0}] [L638] FCALL data->lo = ((void *)0) VAL [data={18:0}, data={18:0}, hi={10:0}, lo={16:0}] [L639] RET, FCALL data->hi = ((void *)0) VAL [data={18:0}, data={18:0}, hi={10:0}, lo={16:0}] [L644] free_data(&data) VAL [data={18:0}] [L645] return 0; VAL [\result=0, data={18:0}] [L645] return 0; VAL [\result=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 78 locations, 29 error locations. UNSAFE Result, 16.6s OverallTime, 15 OverallIterations, 1 TraceHistogramMax, 9.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 557 SDtfs, 790 SDslu, 2951 SDs, 0 SdLazy, 3536 SolverSat, 221 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 294 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 274 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 896 ImplicationChecksByTransitivity, 9.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=0, 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, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 373 NumberOfCodeBlocks, 373 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 317 ConstructedInterpolants, 0 QuantifiedInterpolants, 123989 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/test-0019_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-31_09-05-13-763.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0019_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-31_09-05-13-763.csv Received shutdown request...