java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 19:02:58,293 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 19:02:58,294 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 19:02:58,305 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 19:02:58,306 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 19:02:58,306 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 19:02:58,307 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 19:02:58,309 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 19:02:58,311 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 19:02:58,311 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 19:02:58,312 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 19:02:58,312 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 19:02:58,313 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 19:02:58,314 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 19:02:58,315 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 19:02:58,316 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 19:02:58,318 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 19:02:58,319 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 19:02:58,320 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 19:02:58,321 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 19:02:58,323 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 19:02:58,323 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 19:02:58,323 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 19:02:58,324 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 19:02:58,325 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 19:02:58,326 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 19:02:58,326 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 19:02:58,327 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 19:02:58,327 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 19:02:58,327 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 19:02:58,327 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 19:02:58,328 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-02 19:02:58,337 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 19:02:58,338 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 19:02:58,338 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 19:02:58,339 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 19:02:58,339 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 19:02:58,339 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 19:02:58,339 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 19:02:58,339 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 19:02:58,340 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 19:02:58,340 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 19:02:58,340 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 19:02:58,340 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 19:02:58,340 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 19:02:58,340 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 19:02:58,341 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 19:02:58,341 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 19:02:58,341 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 19:02:58,341 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 19:02:58,341 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 19:02:58,341 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 19:02:58,341 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 19:02:58,342 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 19:02:58,342 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 19:02:58,342 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 19:02:58,342 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 19:02:58,371 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 19:02:58,383 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 19:02:58,386 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 19:02:58,388 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 19:02:58,388 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 19:02:58,389 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 19:02:58,533 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 19:02:58,534 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 19:02:58,535 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 19:02:58,535 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 19:02:58,538 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 19:02:58,539 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 07:02:58" (1/1) ... [2018-02-02 19:02:58,541 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@282d9c7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:02:58, skipping insertion in model container [2018-02-02 19:02:58,541 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 07:02:58" (1/1) ... [2018-02-02 19:02:58,550 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 19:02:58,575 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 19:02:58,658 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 19:02:58,671 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 19:02:58,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:02:58 WrapperNode [2018-02-02 19:02:58,677 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 19:02:58,677 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 19:02:58,678 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 19:02:58,678 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 19:02:58,690 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:02:58" (1/1) ... [2018-02-02 19:02:58,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:02:58" (1/1) ... [2018-02-02 19:02:58,698 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:02:58" (1/1) ... [2018-02-02 19:02:58,698 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:02:58" (1/1) ... [2018-02-02 19:02:58,702 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:02:58" (1/1) ... [2018-02-02 19:02:58,703 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:02:58" (1/1) ... [2018-02-02 19:02:58,704 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:02:58" (1/1) ... [2018-02-02 19:02:58,706 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 19:02:58,706 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 19:02:58,706 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 19:02:58,706 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 19:02:58,707 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:02:58" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 19:02:58,743 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 19:02:58,744 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 19:02:58,744 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_data [2018-02-02 19:02:58,744 INFO L136 BoogieDeclarations]: Found implementation of procedure free_data [2018-02-02 19:02:58,744 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 19:02:58,744 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 19:02:58,744 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 19:02:58,744 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 19:02:58,744 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 19:02:58,744 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 19:02:58,744 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 19:02:58,744 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 19:02:58,744 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 19:02:58,744 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 19:02:58,745 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_data [2018-02-02 19:02:58,745 INFO L128 BoogieDeclarations]: Found specification of procedure free_data [2018-02-02 19:02:58,745 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 19:02:58,745 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 19:02:58,745 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 19:02:58,933 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 19:02:58,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 07:02:58 BoogieIcfgContainer [2018-02-02 19:02:58,933 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 19:02:58,934 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 19:02:58,934 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 19:02:58,936 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 19:02:58,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 07:02:58" (1/3) ... [2018-02-02 19:02:58,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c8f82b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 07:02:58, skipping insertion in model container [2018-02-02 19:02:58,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:02:58" (2/3) ... [2018-02-02 19:02:58,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c8f82b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 07:02:58, skipping insertion in model container [2018-02-02 19:02:58,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 07:02:58" (3/3) ... [2018-02-02 19:02:58,938 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0019_1_false-valid-memtrack_true-termination.i [2018-02-02 19:02:58,943 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 19:02:58,947 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 29 error locations. [2018-02-02 19:02:58,970 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 19:02:58,970 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 19:02:58,970 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 19:02:58,970 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 19:02:58,970 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 19:02:58,972 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 19:02:58,972 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 19:02:58,972 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 19:02:58,973 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 19:02:58,986 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states. [2018-02-02 19:02:58,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-02 19:02:58,994 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:02:58,995 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:02:58,995 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 19:02:59,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1278130535, now seen corresponding path program 1 times [2018-02-02 19:02:59,001 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:02:59,002 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:02:59,034 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:02:59,034 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:02:59,034 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:02:59,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:02:59,085 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:02:59,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:02:59,241 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:02:59,241 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 19:02:59,242 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 19:02:59,254 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 19:02:59,254 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:02:59,256 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 5 states. [2018-02-02 19:02:59,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:02:59,442 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-02-02 19:02:59,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 19:02:59,443 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-02-02 19:02:59,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:02:59,450 INFO L225 Difference]: With dead ends: 67 [2018-02-02 19:02:59,450 INFO L226 Difference]: Without dead ends: 64 [2018-02-02 19:02:59,451 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 19:02:59,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-02 19:02:59,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-02-02 19:02:59,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-02 19:02:59,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-02-02 19:02:59,475 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 10 [2018-02-02 19:02:59,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:02:59,475 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-02-02 19:02:59,475 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 19:02:59,475 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-02-02 19:02:59,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-02 19:02:59,475 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:02:59,476 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:02:59,476 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 19:02:59,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1278130536, now seen corresponding path program 1 times [2018-02-02 19:02:59,476 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:02:59,476 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:02:59,477 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:02:59,477 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:02:59,477 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:02:59,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:02:59,492 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:02:59,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:02:59,567 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:02:59,567 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 19:02:59,568 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 19:02:59,568 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 19:02:59,569 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 19:02:59,569 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 6 states. [2018-02-02 19:02:59,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:02:59,673 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-02-02 19:02:59,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 19:02:59,673 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-02-02 19:02:59,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:02:59,674 INFO L225 Difference]: With dead ends: 60 [2018-02-02 19:02:59,674 INFO L226 Difference]: Without dead ends: 60 [2018-02-02 19:02:59,675 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 19:02:59,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-02 19:02:59,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-02-02 19:02:59,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-02 19:02:59,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-02-02 19:02:59,679 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 10 [2018-02-02 19:02:59,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:02:59,680 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-02-02 19:02:59,680 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 19:02:59,680 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-02-02 19:02:59,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 19:02:59,680 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:02:59,680 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:02:59,680 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 19:02:59,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1177947157, now seen corresponding path program 1 times [2018-02-02 19:02:59,681 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:02:59,681 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:02:59,681 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:02:59,681 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:02:59,682 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:02:59,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:02:59,696 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:02:59,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:02:59,751 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:02:59,751 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 19:02:59,751 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 19:02:59,751 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 19:02:59,751 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:02:59,751 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 5 states. [2018-02-02 19:02:59,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:02:59,835 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-02-02 19:02:59,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 19:02:59,836 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-02 19:02:59,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:02:59,836 INFO L225 Difference]: With dead ends: 59 [2018-02-02 19:02:59,836 INFO L226 Difference]: Without dead ends: 59 [2018-02-02 19:02:59,836 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 19:02:59,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-02 19:02:59,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-02-02 19:02:59,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-02-02 19:02:59,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-02-02 19:02:59,839 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 14 [2018-02-02 19:02:59,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:02:59,839 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-02-02 19:02:59,839 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 19:02:59,840 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-02-02 19:02:59,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 19:02:59,840 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:02:59,840 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:02:59,840 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 19:02:59,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1177947156, now seen corresponding path program 1 times [2018-02-02 19:02:59,840 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:02:59,840 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:02:59,841 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:02:59,841 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:02:59,841 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:02:59,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:02:59,851 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:02:59,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:02:59,923 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:02:59,924 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 19:02:59,924 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 19:02:59,924 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 19:02:59,924 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 19:02:59,925 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 6 states. [2018-02-02 19:03:00,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:03:00,058 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-02-02 19:03:00,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 19:03:00,059 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-02-02 19:03:00,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:03:00,059 INFO L225 Difference]: With dead ends: 58 [2018-02-02 19:03:00,059 INFO L226 Difference]: Without dead ends: 58 [2018-02-02 19:03:00,060 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 19:03:00,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-02 19:03:00,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-02-02 19:03:00,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-02 19:03:00,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-02-02 19:03:00,064 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 14 [2018-02-02 19:03:00,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:03:00,064 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-02-02 19:03:00,064 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 19:03:00,064 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-02-02 19:03:00,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 19:03:00,065 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:03:00,065 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 19:03:00,065 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 19:03:00,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1954006569, now seen corresponding path program 1 times [2018-02-02 19:03:00,066 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:03:00,066 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:03:00,067 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:00,067 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:03:00,067 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:00,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:03:00,083 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:03:00,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 19:03:00,183 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:03:00,183 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 19:03:00,183 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 19:03:00,183 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 19:03:00,184 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-02 19:03:00,184 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 12 states. [2018-02-02 19:03:00,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:03:00,420 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-02-02 19:03:00,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 19:03:00,420 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-02-02 19:03:00,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:03:00,421 INFO L225 Difference]: With dead ends: 57 [2018-02-02 19:03:00,421 INFO L226 Difference]: Without dead ends: 57 [2018-02-02 19:03:00,421 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 19:03:00,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-02 19:03:00,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-02-02 19:03:00,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-02 19:03:00,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-02-02 19:03:00,425 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 17 [2018-02-02 19:03:00,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:03:00,425 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-02-02 19:03:00,425 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 19:03:00,426 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-02-02 19:03:00,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 19:03:00,426 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:03:00,426 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 19:03:00,426 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 19:03:00,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1954006570, now seen corresponding path program 1 times [2018-02-02 19:03:00,427 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:03:00,427 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:03:00,427 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:00,427 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:03:00,427 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:00,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:03:00,443 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:03:00,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:03:00,571 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:03:00,571 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 19:03:00,571 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 19:03:00,571 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 19:03:00,572 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-02 19:03:00,572 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 12 states. [2018-02-02 19:03:00,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:03:00,856 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-02-02 19:03:00,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 19:03:00,857 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-02-02 19:03:00,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:03:00,858 INFO L225 Difference]: With dead ends: 56 [2018-02-02 19:03:00,858 INFO L226 Difference]: Without dead ends: 56 [2018-02-02 19:03:00,858 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 19:03:00,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-02-02 19:03:00,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-02-02 19:03:00,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-02 19:03:00,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-02-02 19:03:00,862 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 17 [2018-02-02 19:03:00,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:03:00,862 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-02-02 19:03:00,862 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 19:03:00,863 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-02-02 19:03:00,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 19:03:00,863 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:03:00,863 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 19:03:00,863 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 19:03:00,863 INFO L82 PathProgramCache]: Analyzing trace with hash 2079658956, now seen corresponding path program 1 times [2018-02-02 19:03:00,863 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:03:00,864 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:03:00,865 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:00,865 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:03:00,865 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:00,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:03:00,875 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:03:00,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:03:00,920 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:03:00,920 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 19:03:00,921 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 19:03:00,921 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 19:03:00,921 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 19:03:00,921 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 8 states. [2018-02-02 19:03:00,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:03:00,997 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-02-02 19:03:00,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 19:03:00,997 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-02-02 19:03:00,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:03:00,998 INFO L225 Difference]: With dead ends: 61 [2018-02-02 19:03:00,998 INFO L226 Difference]: Without dead ends: 61 [2018-02-02 19:03:00,999 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 19:03:00,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-02-02 19:03:01,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 54. [2018-02-02 19:03:01,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-02 19:03:01,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2018-02-02 19:03:01,002 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 23 [2018-02-02 19:03:01,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:03:01,002 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2018-02-02 19:03:01,002 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 19:03:01,002 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-02-02 19:03:01,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 19:03:01,003 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:03:01,003 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 19:03:01,003 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 19:03:01,003 INFO L82 PathProgramCache]: Analyzing trace with hash 2079658957, now seen corresponding path program 1 times [2018-02-02 19:03:01,003 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:03:01,003 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:03:01,004 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:01,004 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:03:01,004 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:01,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:03:01,014 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:03:01,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:03:01,143 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:03:01,143 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 19:03:01,143 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 19:03:01,143 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 19:03:01,144 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 19:03:01,144 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 9 states. [2018-02-02 19:03:01,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:03:01,251 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-02-02 19:03:01,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 19:03:01,251 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-02-02 19:03:01,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:03:01,252 INFO L225 Difference]: With dead ends: 50 [2018-02-02 19:03:01,252 INFO L226 Difference]: Without dead ends: 50 [2018-02-02 19:03:01,252 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 19:03:01,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-02 19:03:01,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-02 19:03:01,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-02 19:03:01,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-02-02 19:03:01,255 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 23 [2018-02-02 19:03:01,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:03:01,255 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-02-02 19:03:01,255 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 19:03:01,256 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-02-02 19:03:01,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 19:03:01,256 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:03:01,256 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 19:03:01,258 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 19:03:01,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1871479601, now seen corresponding path program 1 times [2018-02-02 19:03:01,258 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:03:01,259 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:03:01,259 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:01,259 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:03:01,260 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:01,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:03:01,275 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:03:01,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:03:01,587 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:03:01,587 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-02-02 19:03:01,587 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 19:03:01,587 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 19:03:01,587 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2018-02-02 19:03:01,587 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 18 states. [2018-02-02 19:03:01,934 WARN L146 SmtUtils]: Spent 171ms on a formula simplification. DAG size of input: 53 DAG size of output 46 [2018-02-02 19:03:02,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:03:02,341 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-02-02 19:03:02,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 19:03:02,341 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 27 [2018-02-02 19:03:02,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:03:02,343 INFO L225 Difference]: With dead ends: 51 [2018-02-02 19:03:02,343 INFO L226 Difference]: Without dead ends: 51 [2018-02-02 19:03:02,343 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=120, Invalid=810, Unknown=0, NotChecked=0, Total=930 [2018-02-02 19:03:02,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-02 19:03:02,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2018-02-02 19:03:02,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-02 19:03:02,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-02-02 19:03:02,345 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 27 [2018-02-02 19:03:02,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:03:02,345 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-02-02 19:03:02,345 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 19:03:02,345 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-02-02 19:03:02,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 19:03:02,346 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:03:02,346 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 19:03:02,346 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 19:03:02,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1871479602, now seen corresponding path program 1 times [2018-02-02 19:03:02,346 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:03:02,346 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:03:02,347 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:02,347 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:03:02,347 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:02,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:03:02,362 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:03:02,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:03:02,570 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:03:02,570 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-02-02 19:03:02,570 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 19:03:02,570 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 19:03:02,570 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2018-02-02 19:03:02,570 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 18 states. [2018-02-02 19:03:03,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:03:03,053 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-02-02 19:03:03,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 19:03:03,053 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 27 [2018-02-02 19:03:03,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:03:03,054 INFO L225 Difference]: With dead ends: 49 [2018-02-02 19:03:03,054 INFO L226 Difference]: Without dead ends: 49 [2018-02-02 19:03:03,055 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=756, Unknown=0, NotChecked=0, Total=870 [2018-02-02 19:03:03,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-02 19:03:03,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-02-02 19:03:03,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-02 19:03:03,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-02-02 19:03:03,057 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 27 [2018-02-02 19:03:03,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:03:03,058 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-02-02 19:03:03,058 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 19:03:03,058 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-02-02 19:03:03,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 19:03:03,058 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:03:03,058 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 19:03:03,058 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 19:03:03,059 INFO L82 PathProgramCache]: Analyzing trace with hash 2113674501, now seen corresponding path program 1 times [2018-02-02 19:03:03,059 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:03:03,059 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:03:03,060 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:03,060 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:03:03,060 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:03,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:03:03,071 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:03:03,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:03:03,380 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:03:03,380 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-02-02 19:03:03,380 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 19:03:03,380 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 19:03:03,381 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-02-02 19:03:03,381 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 18 states. [2018-02-02 19:03:04,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:03:04,093 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-02-02 19:03:04,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 19:03:04,094 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 28 [2018-02-02 19:03:04,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:03:04,094 INFO L225 Difference]: With dead ends: 48 [2018-02-02 19:03:04,094 INFO L226 Difference]: Without dead ends: 48 [2018-02-02 19:03:04,095 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=141, Invalid=851, Unknown=0, NotChecked=0, Total=992 [2018-02-02 19:03:04,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-02 19:03:04,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2018-02-02 19:03:04,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-02 19:03:04,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-02-02 19:03:04,098 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 28 [2018-02-02 19:03:04,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:03:04,098 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-02-02 19:03:04,098 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 19:03:04,099 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-02-02 19:03:04,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 19:03:04,099 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:03:04,099 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 19:03:04,099 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 19:03:04,099 INFO L82 PathProgramCache]: Analyzing trace with hash 2113674502, now seen corresponding path program 1 times [2018-02-02 19:03:04,100 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:03:04,100 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:03:04,100 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:04,100 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:03:04,101 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:04,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:03:04,117 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:03:04,514 WARN L146 SmtUtils]: Spent 223ms on a formula simplification. DAG size of input: 30 DAG size of output 21 [2018-02-02 19:03:04,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:03:04,821 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:03:04,821 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-02-02 19:03:04,822 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 19:03:04,822 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 19:03:04,822 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-02-02 19:03:04,822 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 18 states. [2018-02-02 19:03:05,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:03:05,462 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-02-02 19:03:05,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 19:03:05,462 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 28 [2018-02-02 19:03:05,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:03:05,463 INFO L225 Difference]: With dead ends: 46 [2018-02-02 19:03:05,463 INFO L226 Difference]: Without dead ends: 46 [2018-02-02 19:03:05,463 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=131, Invalid=799, Unknown=0, NotChecked=0, Total=930 [2018-02-02 19:03:05,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-02 19:03:05,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2018-02-02 19:03:05,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-02 19:03:05,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-02-02 19:03:05,471 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 28 [2018-02-02 19:03:05,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:03:05,471 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-02-02 19:03:05,471 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 19:03:05,471 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-02-02 19:03:05,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 19:03:05,471 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:03:05,471 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 19:03:05,471 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 19:03:05,471 INFO L82 PathProgramCache]: Analyzing trace with hash -38443497, now seen corresponding path program 1 times [2018-02-02 19:03:05,472 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:03:05,472 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:03:05,472 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:05,472 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:03:05,472 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:05,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:03:05,487 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:03:06,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:03:06,009 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:03:06,010 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-02-02 19:03:06,010 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 19:03:06,010 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 19:03:06,010 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2018-02-02 19:03:06,011 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 22 states. [2018-02-02 19:03:06,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:03:06,653 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-02-02 19:03:06,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 19:03:06,654 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 31 [2018-02-02 19:03:06,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:03:06,654 INFO L225 Difference]: With dead ends: 45 [2018-02-02 19:03:06,654 INFO L226 Difference]: Without dead ends: 45 [2018-02-02 19:03:06,654 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 19:03:06,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-02 19:03:06,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-02-02 19:03:06,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-02 19:03:06,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-02-02 19:03:06,656 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 31 [2018-02-02 19:03:06,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:03:06,656 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-02-02 19:03:06,657 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 19:03:06,657 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-02-02 19:03:06,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 19:03:06,657 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:03:06,657 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:03:06,657 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 19:03:06,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1191748404, now seen corresponding path program 1 times [2018-02-02 19:03:06,658 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:03:06,658 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:03:06,658 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:06,659 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:03:06,659 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:06,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:03:06,672 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:03:07,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:03:07,118 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:03:07,118 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-02-02 19:03:07,119 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 19:03:07,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 19:03:07,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2018-02-02 19:03:07,119 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 22 states. [2018-02-02 19:03:07,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:03:07,801 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-02-02 19:03:07,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 19:03:07,801 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 32 [2018-02-02 19:03:07,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:03:07,801 INFO L225 Difference]: With dead ends: 44 [2018-02-02 19:03:07,801 INFO L226 Difference]: Without dead ends: 44 [2018-02-02 19:03:07,802 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 19:03:07,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-02 19:03:07,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2018-02-02 19:03:07,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-02 19:03:07,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-02-02 19:03:07,803 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 32 [2018-02-02 19:03:07,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:03:07,803 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-02-02 19:03:07,803 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 19:03:07,803 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-02-02 19:03:07,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 19:03:07,804 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:03:07,804 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 19:03:07,804 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 19:03:07,804 INFO L82 PathProgramCache]: Analyzing trace with hash -718496508, now seen corresponding path program 1 times [2018-02-02 19:03:07,804 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:03:07,804 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:03:07,805 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:07,805 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:03:07,805 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:03:07,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-02 19:03:07,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-02 19:03:07,855 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-02 19:03:07,870 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-02 19:03:07,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 07:03:07 BoogieIcfgContainer [2018-02-02 19:03:07,882 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 19:03:07,883 INFO L168 Benchmark]: Toolchain (without parser) took 9349.08 ms. Allocated memory was 404.2 MB in the beginning and 772.3 MB in the end (delta: 368.1 MB). Free memory was 361.1 MB in the beginning and 613.1 MB in the end (delta: -251.9 MB). Peak memory consumption was 116.1 MB. Max. memory is 5.3 GB. [2018-02-02 19:03:07,883 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 404.2 MB. Free memory is still 367.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 19:03:07,884 INFO L168 Benchmark]: CACSL2BoogieTranslator took 142.54 ms. Allocated memory is still 404.2 MB. Free memory was 361.1 MB in the beginning and 350.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. [2018-02-02 19:03:07,884 INFO L168 Benchmark]: Boogie Preprocessor took 28.29 ms. Allocated memory is still 404.2 MB. Free memory was 350.4 MB in the beginning and 349.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 19:03:07,884 INFO L168 Benchmark]: RCFGBuilder took 227.20 ms. Allocated memory is still 404.2 MB. Free memory was 349.1 MB in the beginning and 325.8 MB in the end (delta: 23.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 5.3 GB. [2018-02-02 19:03:07,884 INFO L168 Benchmark]: TraceAbstraction took 8948.55 ms. Allocated memory was 404.2 MB in the beginning and 772.3 MB in the end (delta: 368.1 MB). Free memory was 325.8 MB in the beginning and 613.1 MB in the end (delta: -287.2 MB). Peak memory consumption was 80.8 MB. Max. memory is 5.3 GB. [2018-02-02 19:03:07,885 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.16 ms. Allocated memory is still 404.2 MB. Free memory is still 367.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 142.54 ms. Allocated memory is still 404.2 MB. Free memory was 361.1 MB in the beginning and 350.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.29 ms. Allocated memory is still 404.2 MB. Free memory was 350.4 MB in the beginning and 349.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 227.20 ms. Allocated memory is still 404.2 MB. Free memory was 349.1 MB in the beginning and 325.8 MB in the end (delta: 23.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 8948.55 ms. Allocated memory was 404.2 MB in the beginning and 772.3 MB in the end (delta: 368.1 MB). Free memory was 325.8 MB in the beginning and 613.1 MB in the end (delta: -287.2 MB). Peak memory consumption was 80.8 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))={12:0}, malloc(sizeof(int))={14:0}, pdata={17:0}, pdata={17:0}] [L626] FCALL pdata->hi = (int *)malloc(sizeof(int)) VAL [malloc(sizeof(int))={12:0}, malloc(sizeof(int))={14:0}, pdata={17:0}, pdata={17:0}] [L627] EXPR, FCALL pdata->lo VAL [malloc(sizeof(int))={12:0}, malloc(sizeof(int))={14:0}, pdata={17:0}, pdata={17:0}, pdata->lo={12:0}] [L627] FCALL *(pdata->lo) = 4 VAL [malloc(sizeof(int))={12:0}, malloc(sizeof(int))={14:0}, pdata={17:0}, pdata={17:0}, pdata->lo={12:0}] [L628] EXPR, FCALL pdata->hi VAL [malloc(sizeof(int))={12:0}, malloc(sizeof(int))={14:0}, pdata={17:0}, pdata={17:0}, pdata->hi={14:0}] [L628] RET, FCALL *(pdata->hi) = 8 VAL [malloc(sizeof(int))={12:0}, malloc(sizeof(int))={14: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.9s OverallTime, 15 OverallIterations, 1 TraceHistogramMax, 5.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 462 SDtfs, 592 SDslu, 2201 SDs, 0 SdLazy, 3624 SolverSat, 266 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 282 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 263 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 811 ImplicationChecksByTransitivity, 5.2s 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.2s 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_19-03-07-891.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_19-03-07-891.csv Received shutdown request...