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/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 09:12:22,198 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 09:12:22,200 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 09:12:22,211 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 09:12:22,211 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 09:12:22,212 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 09:12:22,212 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 09:12:22,214 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 09:12:22,215 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 09:12:22,216 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 09:12:22,216 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 09:12:22,217 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 09:12:22,217 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 09:12:22,218 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 09:12:22,219 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 09:12:22,220 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 09:12:22,222 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 09:12:22,223 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 09:12:22,224 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 09:12:22,225 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 09:12:22,226 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 09:12:22,227 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 09:12:22,227 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 09:12:22,228 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 09:12:22,228 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 09:12:22,229 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 09:12:22,229 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 09:12:22,230 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 09:12:22,230 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 09:12:22,230 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 09:12:22,230 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 09:12:22,230 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-02 09:12:22,239 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 09:12:22,239 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 09:12:22,240 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 09:12:22,240 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 09:12:22,240 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 09:12:22,240 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 09:12:22,240 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 09:12:22,240 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 09:12:22,241 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 09:12:22,241 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 09:12:22,241 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 09:12:22,241 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 09:12:22,241 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 09:12:22,241 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 09:12:22,241 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 09:12:22,241 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 09:12:22,241 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 09:12:22,241 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 09:12:22,242 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 09:12:22,242 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 09:12:22,242 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 09:12:22,242 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 09:12:22,242 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 09:12:22,242 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 09:12:22,242 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 09:12:22,269 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 09:12:22,277 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 09:12:22,280 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 09:12:22,281 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 09:12:22,282 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 09:12:22,282 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.i [2018-02-02 09:12:22,410 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 09:12:22,411 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 09:12:22,411 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 09:12:22,411 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 09:12:22,415 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 09:12:22,416 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:12:22" (1/1) ... [2018-02-02 09:12:22,418 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@730bf9f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:12:22, skipping insertion in model container [2018-02-02 09:12:22,418 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:12:22" (1/1) ... [2018-02-02 09:12:22,429 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:12:22,456 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:12:22,546 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:12:22,562 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:12:22,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:12:22 WrapperNode [2018-02-02 09:12:22,569 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 09:12:22,569 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 09:12:22,569 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 09:12:22,569 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 09:12:22,583 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:12:22" (1/1) ... [2018-02-02 09:12:22,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:12:22" (1/1) ... [2018-02-02 09:12:22,594 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:12:22" (1/1) ... [2018-02-02 09:12:22,594 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:12:22" (1/1) ... [2018-02-02 09:12:22,598 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:12:22" (1/1) ... [2018-02-02 09:12:22,600 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:12:22" (1/1) ... [2018-02-02 09:12:22,601 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:12:22" (1/1) ... [2018-02-02 09:12:22,603 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 09:12:22,604 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 09:12:22,604 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 09:12:22,604 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 09:12:22,605 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:12:22" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 09:12:22,647 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 09:12:22,647 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 09:12:22,648 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_data [2018-02-02 09:12:22,648 INFO L136 BoogieDeclarations]: Found implementation of procedure free_data [2018-02-02 09:12:22,648 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 09:12:22,648 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 09:12:22,648 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 09:12:22,648 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 09:12:22,648 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 09:12:22,648 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 09:12:22,648 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 09:12:22,649 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 09:12:22,649 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 09:12:22,649 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 09:12:22,649 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_data [2018-02-02 09:12:22,649 INFO L128 BoogieDeclarations]: Found specification of procedure free_data [2018-02-02 09:12:22,649 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 09:12:22,649 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 09:12:22,649 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 09:12:22,903 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 09:12:22,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:12:22 BoogieIcfgContainer [2018-02-02 09:12:22,903 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 09:12:22,904 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 09:12:22,904 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 09:12:22,907 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 09:12:22,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:12:22" (1/3) ... [2018-02-02 09:12:22,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fbe4683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:12:22, skipping insertion in model container [2018-02-02 09:12:22,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:12:22" (2/3) ... [2018-02-02 09:12:22,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fbe4683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:12:22, skipping insertion in model container [2018-02-02 09:12:22,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:12:22" (3/3) ... [2018-02-02 09:12:22,910 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0019_1_false-valid-memtrack_true-termination.i [2018-02-02 09:12:22,916 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 09:12:22,922 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 29 error locations. [2018-02-02 09:12:22,949 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 09:12:22,949 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 09:12:22,949 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 09:12:22,950 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 09:12:22,950 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 09:12:22,950 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 09:12:22,950 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 09:12:22,950 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 09:12:22,950 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 09:12:22,960 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states. [2018-02-02 09:12:22,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-02 09:12:22,968 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:12:22,969 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:12:22,969 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-02-02 09:12:22,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1278130535, now seen corresponding path program 1 times [2018-02-02 09:12:22,974 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:12:22,975 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:12:23,005 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:12:23,005 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:12:23,005 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:12:23,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:12:23,044 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:12:23,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:12:23,161 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:12:23,162 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:12:23,163 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:12:23,175 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:12:23,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:12:23,176 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 5 states. [2018-02-02 09:12:23,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:12:23,389 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-02-02 09:12:23,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:12:23,390 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-02-02 09:12:23,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:12:23,396 INFO L225 Difference]: With dead ends: 67 [2018-02-02 09:12:23,397 INFO L226 Difference]: Without dead ends: 64 [2018-02-02 09:12:23,398 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:12:23,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-02 09:12:23,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-02-02 09:12:23,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-02 09:12:23,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-02-02 09:12:23,424 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 10 [2018-02-02 09:12:23,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:12:23,424 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-02-02 09:12:23,424 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:12:23,424 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-02-02 09:12:23,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-02 09:12:23,425 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:12:23,425 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:12:23,425 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-02-02 09:12:23,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1278130536, now seen corresponding path program 1 times [2018-02-02 09:12:23,425 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:12:23,425 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:12:23,426 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:12:23,426 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:12:23,426 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:12:23,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:12:23,439 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:12:23,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:12:23,524 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:12:23,525 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:12:23,526 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:12:23,526 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:12:23,526 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:12:23,527 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 6 states. [2018-02-02 09:12:23,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:12:23,676 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-02-02 09:12:23,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:12:23,677 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-02-02 09:12:23,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:12:23,678 INFO L225 Difference]: With dead ends: 60 [2018-02-02 09:12:23,678 INFO L226 Difference]: Without dead ends: 60 [2018-02-02 09:12:23,679 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:12:23,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-02 09:12:23,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-02-02 09:12:23,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-02 09:12:23,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-02-02 09:12:23,683 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 10 [2018-02-02 09:12:23,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:12:23,683 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-02-02 09:12:23,683 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:12:23,683 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-02-02 09:12:23,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 09:12:23,684 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:12:23,684 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:12:23,684 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-02-02 09:12:23,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1177947157, now seen corresponding path program 1 times [2018-02-02 09:12:23,684 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:12:23,684 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:12:23,685 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:12:23,685 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:12:23,686 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:12:23,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:12:23,702 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:12:23,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:12:23,767 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:12:23,767 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:12:23,768 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:12:23,768 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:12:23,768 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:12:23,768 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 5 states. [2018-02-02 09:12:23,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:12:23,843 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-02-02 09:12:23,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:12:23,844 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-02 09:12:23,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:12:23,844 INFO L225 Difference]: With dead ends: 59 [2018-02-02 09:12:23,844 INFO L226 Difference]: Without dead ends: 59 [2018-02-02 09:12:23,845 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-02-02 09:12:23,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-02 09:12:23,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-02-02 09:12:23,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-02-02 09:12:23,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-02-02 09:12:23,848 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 14 [2018-02-02 09:12:23,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:12:23,849 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-02-02 09:12:23,849 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:12:23,849 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-02-02 09:12:23,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 09:12:23,849 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:12:23,849 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:12:23,849 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-02-02 09:12:23,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1177947156, now seen corresponding path program 1 times [2018-02-02 09:12:23,850 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:12:23,850 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:12:23,850 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:12:23,850 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:12:23,851 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:12:23,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:12:23,861 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:12:23,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:12:23,946 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:12:23,947 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:12:23,948 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:12:23,948 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:12:23,948 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:12:23,948 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 6 states. [2018-02-02 09:12:24,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:12:24,062 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-02-02 09:12:24,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:12:24,063 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-02-02 09:12:24,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:12:24,063 INFO L225 Difference]: With dead ends: 58 [2018-02-02 09:12:24,064 INFO L226 Difference]: Without dead ends: 58 [2018-02-02 09:12:24,064 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:12:24,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-02 09:12:24,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-02-02 09:12:24,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-02 09:12:24,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-02-02 09:12:24,069 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 14 [2018-02-02 09:12:24,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:12:24,069 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-02-02 09:12:24,069 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:12:24,069 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-02-02 09:12:24,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 09:12:24,069 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:12:24,069 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:12:24,069 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-02-02 09:12:24,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1954006569, now seen corresponding path program 1 times [2018-02-02 09:12:24,070 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:12:24,070 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:12:24,070 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:12:24,070 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:12:24,071 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:12:24,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:12:24,094 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:12:24,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:12:24,202 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:12:24,202 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 09:12:24,202 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 09:12:24,202 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 09:12:24,202 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-02 09:12:24,202 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 12 states. [2018-02-02 09:12:24,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:12:24,473 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-02-02 09:12:24,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 09:12:24,473 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-02-02 09:12:24,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:12:24,474 INFO L225 Difference]: With dead ends: 57 [2018-02-02 09:12:24,474 INFO L226 Difference]: Without dead ends: 57 [2018-02-02 09:12:24,474 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2018-02-02 09:12:24,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-02 09:12:24,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-02-02 09:12:24,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-02 09:12:24,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-02-02 09:12:24,477 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 17 [2018-02-02 09:12:24,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:12:24,477 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-02-02 09:12:24,477 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 09:12:24,477 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-02-02 09:12:24,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 09:12:24,478 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:12:24,478 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:12:24,478 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-02-02 09:12:24,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1954006570, now seen corresponding path program 1 times [2018-02-02 09:12:24,478 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:12:24,478 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:12:24,479 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:12:24,479 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:12:24,479 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:12:24,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:12:24,501 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:12:24,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:12:24,644 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:12:24,644 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 09:12:24,644 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 09:12:24,644 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 09:12:24,644 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-02 09:12:24,645 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 12 states. [2018-02-02 09:12:24,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:12:24,926 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-02-02 09:12:24,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 09:12:24,927 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-02-02 09:12:24,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:12:24,927 INFO L225 Difference]: With dead ends: 56 [2018-02-02 09:12:24,927 INFO L226 Difference]: Without dead ends: 56 [2018-02-02 09:12:24,928 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2018-02-02 09:12:24,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-02-02 09:12:24,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-02-02 09:12:24,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-02 09:12:24,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-02-02 09:12:24,930 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 17 [2018-02-02 09:12:24,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:12:24,931 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-02-02 09:12:24,931 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 09:12:24,931 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-02-02 09:12:24,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 09:12:24,931 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:12:24,931 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] [2018-02-02 09:12:24,931 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-02-02 09:12:24,931 INFO L82 PathProgramCache]: Analyzing trace with hash 2079658956, now seen corresponding path program 1 times [2018-02-02 09:12:24,931 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:12:24,931 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:12:24,932 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:12:24,932 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:12:24,932 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:12:24,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:12:24,941 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:12:24,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:12:24,983 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:12:24,983 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 09:12:24,984 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 09:12:24,984 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 09:12:24,984 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:12:24,984 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 8 states. [2018-02-02 09:12:25,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:12:25,076 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-02-02 09:12:25,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 09:12:25,077 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-02-02 09:12:25,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:12:25,078 INFO L225 Difference]: With dead ends: 61 [2018-02-02 09:12:25,078 INFO L226 Difference]: Without dead ends: 61 [2018-02-02 09:12:25,078 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:12:25,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-02-02 09:12:25,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 54. [2018-02-02 09:12:25,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-02 09:12:25,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2018-02-02 09:12:25,081 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 23 [2018-02-02 09:12:25,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:12:25,081 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2018-02-02 09:12:25,081 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 09:12:25,081 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-02-02 09:12:25,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 09:12:25,082 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:12:25,082 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] [2018-02-02 09:12:25,082 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-02-02 09:12:25,082 INFO L82 PathProgramCache]: Analyzing trace with hash 2079658957, now seen corresponding path program 1 times [2018-02-02 09:12:25,082 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:12:25,083 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:12:25,083 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:12:25,083 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:12:25,083 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:12:25,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:12:25,092 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:12:25,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:12:25,182 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:12:25,182 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 09:12:25,182 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 09:12:25,182 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 09:12:25,183 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:12:25,183 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 9 states. [2018-02-02 09:12:25,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:12:25,260 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-02-02 09:12:25,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 09:12:25,260 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-02-02 09:12:25,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:12:25,261 INFO L225 Difference]: With dead ends: 50 [2018-02-02 09:12:25,261 INFO L226 Difference]: Without dead ends: 50 [2018-02-02 09:12:25,261 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:12:25,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-02 09:12:25,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-02 09:12:25,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-02 09:12:25,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-02-02 09:12:25,264 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 23 [2018-02-02 09:12:25,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:12:25,265 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-02-02 09:12:25,265 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 09:12:25,265 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-02-02 09:12:25,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 09:12:25,266 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:12:25,266 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] [2018-02-02 09:12:25,266 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-02-02 09:12:25,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1871479601, now seen corresponding path program 1 times [2018-02-02 09:12:25,266 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:12:25,266 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:12:25,267 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:12:25,267 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:12:25,267 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:12:25,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:12:25,281 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:12:25,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:12:25,600 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:12:25,600 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-02-02 09:12:25,600 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 09:12:25,600 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 09:12:25,600 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2018-02-02 09:12:25,601 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 18 states. [2018-02-02 09:12:26,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:12:26,161 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-02-02 09:12:26,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 09:12:26,161 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 27 [2018-02-02 09:12:26,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:12:26,163 INFO L225 Difference]: With dead ends: 51 [2018-02-02 09:12:26,163 INFO L226 Difference]: Without dead ends: 51 [2018-02-02 09:12:26,163 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=810, Unknown=0, NotChecked=0, Total=930 [2018-02-02 09:12:26,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-02 09:12:26,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2018-02-02 09:12:26,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-02 09:12:26,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-02-02 09:12:26,165 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 27 [2018-02-02 09:12:26,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:12:26,165 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-02-02 09:12:26,165 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 09:12:26,166 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-02-02 09:12:26,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 09:12:26,166 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:12:26,166 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] [2018-02-02 09:12:26,166 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-02-02 09:12:26,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1871479602, now seen corresponding path program 1 times [2018-02-02 09:12:26,166 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:12:26,166 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:12:26,167 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:12:26,167 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:12:26,167 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:12:26,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:12:26,181 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:12:26,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:12:26,449 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:12:26,449 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-02-02 09:12:26,449 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 09:12:26,450 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 09:12:26,450 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2018-02-02 09:12:26,450 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 18 states. [2018-02-02 09:12:26,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:12:26,972 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-02-02 09:12:26,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 09:12:26,972 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 27 [2018-02-02 09:12:26,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:12:26,973 INFO L225 Difference]: With dead ends: 49 [2018-02-02 09:12:26,973 INFO L226 Difference]: Without dead ends: 49 [2018-02-02 09:12:26,974 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=114, Invalid=756, Unknown=0, NotChecked=0, Total=870 [2018-02-02 09:12:26,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-02 09:12:26,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-02-02 09:12:26,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-02 09:12:26,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-02-02 09:12:26,976 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 27 [2018-02-02 09:12:26,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:12:26,976 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-02-02 09:12:26,976 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 09:12:26,976 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-02-02 09:12:26,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 09:12:26,976 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:12:26,977 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] [2018-02-02 09:12:26,977 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-02-02 09:12:26,977 INFO L82 PathProgramCache]: Analyzing trace with hash 2113674501, now seen corresponding path program 1 times [2018-02-02 09:12:26,977 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:12:26,977 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:12:26,978 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:12:26,978 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:12:26,978 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:12:26,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:12:26,994 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:12:27,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:12:27,413 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:12:27,414 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-02-02 09:12:27,414 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 09:12:27,414 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 09:12:27,415 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-02-02 09:12:27,415 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 18 states. [2018-02-02 09:12:28,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:12:28,010 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-02-02 09:12:28,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 09:12:28,010 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 28 [2018-02-02 09:12:28,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:12:28,011 INFO L225 Difference]: With dead ends: 48 [2018-02-02 09:12:28,011 INFO L226 Difference]: Without dead ends: 48 [2018-02-02 09:12:28,011 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=141, Invalid=851, Unknown=0, NotChecked=0, Total=992 [2018-02-02 09:12:28,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-02 09:12:28,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2018-02-02 09:12:28,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-02 09:12:28,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-02-02 09:12:28,013 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 28 [2018-02-02 09:12:28,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:12:28,013 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-02-02 09:12:28,013 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 09:12:28,013 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-02-02 09:12:28,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 09:12:28,014 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:12:28,014 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] [2018-02-02 09:12:28,014 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-02-02 09:12:28,014 INFO L82 PathProgramCache]: Analyzing trace with hash 2113674502, now seen corresponding path program 1 times [2018-02-02 09:12:28,014 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:12:28,014 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:12:28,015 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:12:28,015 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:12:28,015 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:12:28,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:12:28,024 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:12:28,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:12:28,405 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:12:28,405 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-02-02 09:12:28,406 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 09:12:28,406 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 09:12:28,406 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-02-02 09:12:28,406 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 18 states. [2018-02-02 09:12:28,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:12:28,975 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-02-02 09:12:28,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 09:12:28,975 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 28 [2018-02-02 09:12:28,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:12:28,976 INFO L225 Difference]: With dead ends: 46 [2018-02-02 09:12:28,976 INFO L226 Difference]: Without dead ends: 46 [2018-02-02 09:12:28,976 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=131, Invalid=799, Unknown=0, NotChecked=0, Total=930 [2018-02-02 09:12:28,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-02 09:12:28,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2018-02-02 09:12:28,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-02 09:12:28,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-02-02 09:12:28,981 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 28 [2018-02-02 09:12:28,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:12:28,981 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-02-02 09:12:28,981 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 09:12:28,981 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-02-02 09:12:28,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 09:12:28,981 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:12:28,981 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-02-02 09:12:28,981 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-02-02 09:12:28,982 INFO L82 PathProgramCache]: Analyzing trace with hash -38443497, now seen corresponding path program 1 times [2018-02-02 09:12:28,982 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:12:28,982 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:12:28,982 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:12:28,982 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:12:28,982 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:12:28,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:12:28,992 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:12:29,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:12:29,444 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:12:29,444 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-02-02 09:12:29,444 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 09:12:29,444 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 09:12:29,445 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2018-02-02 09:12:29,445 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 22 states. [2018-02-02 09:12:30,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:12:30,154 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-02-02 09:12:30,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 09:12:30,154 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 31 [2018-02-02 09:12:30,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:12:30,154 INFO L225 Difference]: With dead ends: 45 [2018-02-02 09:12:30,154 INFO L226 Difference]: Without dead ends: 45 [2018-02-02 09:12:30,155 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=190, Invalid=1292, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 09:12:30,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-02 09:12:30,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-02-02 09:12:30,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-02 09:12:30,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-02-02 09:12:30,157 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 31 [2018-02-02 09:12:30,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:12:30,157 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-02-02 09:12:30,157 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 09:12:30,157 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-02-02 09:12:30,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 09:12:30,158 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:12:30,158 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:12:30,158 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-02-02 09:12:30,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1191748404, now seen corresponding path program 1 times [2018-02-02 09:12:30,158 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:12:30,158 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:12:30,159 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:12:30,159 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:12:30,159 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:12:30,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:12:30,175 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:12:30,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:12:30,684 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:12:30,684 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-02-02 09:12:30,684 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 09:12:30,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 09:12:30,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2018-02-02 09:12:30,685 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 22 states. [2018-02-02 09:12:31,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:12:31,345 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-02-02 09:12:31,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 09:12:31,346 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 32 [2018-02-02 09:12:31,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:12:31,346 INFO L225 Difference]: With dead ends: 44 [2018-02-02 09:12:31,346 INFO L226 Difference]: Without dead ends: 44 [2018-02-02 09:12:31,347 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=193, Invalid=1289, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 09:12:31,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-02 09:12:31,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2018-02-02 09:12:31,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-02 09:12:31,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-02-02 09:12:31,348 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 32 [2018-02-02 09:12:31,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:12:31,348 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-02-02 09:12:31,348 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 09:12:31,348 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-02-02 09:12:31,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 09:12:31,349 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:12:31,349 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-02-02 09:12:31,349 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-02-02 09:12:31,349 INFO L82 PathProgramCache]: Analyzing trace with hash -718496508, now seen corresponding path program 1 times [2018-02-02 09:12:31,349 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:12:31,349 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:12:31,350 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:12:31,350 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:12:31,350 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:12:31,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-02 09:12:31,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-02 09:12:31,390 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-02 09:12:31,403 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-02 09:12:31,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:12:31 BoogieIcfgContainer [2018-02-02 09:12:31,417 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 09:12:31,417 INFO L168 Benchmark]: Toolchain (without parser) took 9007.26 ms. Allocated memory was 405.3 MB in the beginning and 771.2 MB in the end (delta: 366.0 MB). Free memory was 361.7 MB in the beginning and 613.5 MB in the end (delta: -251.7 MB). Peak memory consumption was 114.2 MB. Max. memory is 5.3 GB. [2018-02-02 09:12:31,418 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 405.3 MB. Free memory is still 368.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 09:12:31,419 INFO L168 Benchmark]: CACSL2BoogieTranslator took 157.59 ms. Allocated memory is still 405.3 MB. Free memory was 361.7 MB in the beginning and 351.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. [2018-02-02 09:12:31,419 INFO L168 Benchmark]: Boogie Preprocessor took 34.15 ms. Allocated memory is still 405.3 MB. Free memory was 351.1 MB in the beginning and 349.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 09:12:31,419 INFO L168 Benchmark]: RCFGBuilder took 299.88 ms. Allocated memory is still 405.3 MB. Free memory was 349.7 MB in the beginning and 325.9 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. [2018-02-02 09:12:31,419 INFO L168 Benchmark]: TraceAbstraction took 8512.59 ms. Allocated memory was 405.3 MB in the beginning and 771.2 MB in the end (delta: 366.0 MB). Free memory was 325.9 MB in the beginning and 613.5 MB in the end (delta: -287.5 MB). Peak memory consumption was 78.4 MB. Max. memory is 5.3 GB. [2018-02-02 09:12:31,420 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 405.3 MB. Free memory is still 368.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 157.59 ms. Allocated memory is still 405.3 MB. Free memory was 361.7 MB in the beginning and 351.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.15 ms. Allocated memory is still 405.3 MB. Free memory was 351.1 MB in the beginning and 349.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 299.88 ms. Allocated memory is still 405.3 MB. Free memory was 349.7 MB in the beginning and 325.9 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 8512.59 ms. Allocated memory was 405.3 MB in the beginning and 771.2 MB in the end (delta: 366.0 MB). Free memory was 325.9 MB in the beginning and 613.5 MB in the end (delta: -287.5 MB). Peak memory consumption was 78.4 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={17:0}] [L643] CALL alloc_data(&data) VAL [pdata={17:0}] [L625] EXPR, FCALL malloc(sizeof(int)) VAL [malloc(sizeof(int))={12:0}, pdata={17:0}, pdata={17:0}] [L625] FCALL pdata->lo = (int *)malloc(sizeof(int)) VAL [malloc(sizeof(int))={12:0}, pdata={17:0}, pdata={17:0}] [L626] EXPR, FCALL malloc(sizeof(int)) VAL [malloc(sizeof(int))={14:0}, malloc(sizeof(int))={12:0}, pdata={17:0}, pdata={17:0}] [L626] FCALL pdata->hi = (int *)malloc(sizeof(int)) VAL [malloc(sizeof(int))={14:0}, malloc(sizeof(int))={12:0}, pdata={17:0}, pdata={17:0}] [L627] EXPR, FCALL pdata->lo VAL [malloc(sizeof(int))={14:0}, malloc(sizeof(int))={12:0}, pdata={17:0}, pdata={17:0}, pdata->lo={12:0}] [L627] FCALL *(pdata->lo) = 4 VAL [malloc(sizeof(int))={14:0}, malloc(sizeof(int))={12:0}, pdata={17:0}, pdata={17:0}, pdata->lo={12:0}] [L628] EXPR, FCALL pdata->hi VAL [malloc(sizeof(int))={14:0}, malloc(sizeof(int))={12:0}, pdata={17:0}, pdata={17:0}, pdata->hi={14:0}] [L628] RET, FCALL *(pdata->hi) = 8 VAL [malloc(sizeof(int))={14:0}, malloc(sizeof(int))={12:0}, pdata={17:0}, pdata={17:0}, pdata->hi={14:0}] [L643] alloc_data(&data) VAL [data={17:0}] [L644] CALL free_data(&data) VAL [data={17:0}] [L632] EXPR, FCALL data->lo VAL [data={17:0}, data={17:0}, data->lo={12:0}] [L632] int *lo = data->lo; [L633] EXPR, FCALL data->hi VAL [data={17:0}, data={17:0}, data->hi={14:0}, lo={12:0}] [L633] int *hi = data->hi; [L634] EXPR, FCALL \read(*lo) VAL [\read(*lo)=4, data={17:0}, data={17:0}, hi={14:0}, lo={12:0}] [L634] EXPR, FCALL \read(*hi) VAL [\read(*hi)=8, \read(*lo)=4, data={17:0}, data={17:0}, hi={14:0}, lo={12:0}] [L634] COND FALSE !(*lo >= *hi) [L638] FCALL data->lo = ((void *)0) VAL [data={17:0}, data={17:0}, hi={14:0}, lo={12:0}] [L639] RET, FCALL data->hi = ((void *)0) VAL [data={17:0}, data={17:0}, hi={14:0}, lo={12:0}] [L644] free_data(&data) VAL [data={17:0}] [L645] return 0; VAL [\result=0, data={17:0}] [L645] return 0; VAL [\result=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 71 locations, 29 error locations. UNSAFE Result, 8.4s OverallTime, 15 OverallIterations, 1 TraceHistogramMax, 4.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 462 SDtfs, 592 SDslu, 2201 SDs, 0 SdLazy, 3624 SolverSat, 266 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 282 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 263 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 811 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred 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.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 26 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 338 NumberOfCodeBlocks, 338 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 287 ConstructedInterpolants, 0 QuantifiedInterpolants, 100248 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 /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0019_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_09-12-31-426.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0019_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_09-12-31-426.csv Received shutdown request...