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_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_2_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 04:17:07,566 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 04:17:07,567 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 04:17:07,577 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 04:17:07,577 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 04:17:07,578 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 04:17:07,578 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 04:17:07,580 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 04:17:07,581 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 04:17:07,582 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 04:17:07,582 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 04:17:07,583 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 04:17:07,583 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 04:17:07,584 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 04:17:07,585 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 04:17:07,587 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 04:17:07,589 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 04:17:07,590 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 04:17:07,591 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 04:17:07,592 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 04:17:07,594 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 04:17:07,594 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 04:17:07,595 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 04:17:07,596 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 04:17:07,596 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 04:17:07,597 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 04:17:07,598 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 04:17:07,598 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 04:17:07,598 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 04:17:07,599 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 04:17:07,599 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 04:17:07,599 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-04 04:17:07,609 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 04:17:07,610 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 04:17:07,611 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 04:17:07,611 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 04:17:07,611 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 04:17:07,611 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 04:17:07,612 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 04:17:07,612 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 04:17:07,612 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 04:17:07,612 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 04:17:07,612 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 04:17:07,612 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 04:17:07,612 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 04:17:07,613 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 04:17:07,613 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 04:17:07,613 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 04:17:07,613 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 04:17:07,613 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 04:17:07,613 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 04:17:07,613 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 04:17:07,614 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 04:17:07,614 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 04:17:07,614 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 04:17:07,614 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 04:17:07,614 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 04:17:07,643 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 04:17:07,653 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 04:17:07,657 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 04:17:07,658 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 04:17:07,658 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 04:17:07,659 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_2_true-valid-memsafety_true-termination.i [2018-02-04 04:17:07,812 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 04:17:07,813 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 04:17:07,814 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 04:17:07,814 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 04:17:07,820 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 04:17:07,821 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:17:07" (1/1) ... [2018-02-04 04:17:07,824 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ab8a954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:17:07, skipping insertion in model container [2018-02-04 04:17:07,824 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:17:07" (1/1) ... [2018-02-04 04:17:07,838 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:17:07,877 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:17:07,961 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:17:07,976 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:17:07,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:17:07 WrapperNode [2018-02-04 04:17:07,981 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 04:17:07,981 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 04:17:07,981 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 04:17:07,981 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 04:17:07,991 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:17:07" (1/1) ... [2018-02-04 04:17:07,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:17:07" (1/1) ... [2018-02-04 04:17:07,999 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:17:07" (1/1) ... [2018-02-04 04:17:07,999 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:17:07" (1/1) ... [2018-02-04 04:17:08,002 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:17:07" (1/1) ... [2018-02-04 04:17:08,004 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:17:07" (1/1) ... [2018-02-04 04:17:08,005 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:17:07" (1/1) ... [2018-02-04 04:17:08,006 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 04:17:08,007 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 04:17:08,007 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 04:17:08,007 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 04:17:08,008 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:17:07" (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-04 04:17:08,043 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 04:17:08,043 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 04:17:08,043 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_positive [2018-02-04 04:17:08,044 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 04:17:08,044 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-02-04 04:17:08,044 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-02-04 04:17:08,044 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 04:17:08,044 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 04:17:08,044 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 04:17:08,044 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 04:17:08,044 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 04:17:08,044 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 04:17:08,044 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 04:17:08,044 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 04:17:08,044 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 04:17:08,044 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 04:17:08,045 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_positive [2018-02-04 04:17:08,045 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 04:17:08,045 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-02-04 04:17:08,045 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-02-04 04:17:08,045 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-02-04 04:17:08,045 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 04:17:08,045 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 04:17:08,045 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 04:17:08,045 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 04:17:08,257 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 04:17:08,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:17:08 BoogieIcfgContainer [2018-02-04 04:17:08,258 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 04:17:08,259 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 04:17:08,259 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 04:17:08,261 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 04:17:08,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 04:17:07" (1/3) ... [2018-02-04 04:17:08,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b7e8a97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:17:08, skipping insertion in model container [2018-02-04 04:17:08,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:17:07" (2/3) ... [2018-02-04 04:17:08,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b7e8a97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:17:08, skipping insertion in model container [2018-02-04 04:17:08,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:17:08" (3/3) ... [2018-02-04 04:17:08,264 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test17_2_true-valid-memsafety_true-termination.i [2018-02-04 04:17:08,271 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 04:17:08,276 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-02-04 04:17:08,308 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 04:17:08,308 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 04:17:08,308 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 04:17:08,309 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 04:17:08,309 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 04:17:08,309 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 04:17:08,309 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 04:17:08,309 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 04:17:08,310 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 04:17:08,322 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2018-02-04 04:17:08,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 04:17:08,332 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:08,333 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-04 04:17:08,333 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 04:17:08,337 INFO L82 PathProgramCache]: Analyzing trace with hash 280514151, now seen corresponding path program 1 times [2018-02-04 04:17:08,339 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:08,339 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:08,389 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:08,390 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:08,390 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:08,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:08,436 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:08,502 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-04 04:17:08,504 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:17:08,504 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 04:17:08,505 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 04:17:08,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 04:17:08,570 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 04:17:08,571 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 3 states. [2018-02-04 04:17:08,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:08,731 INFO L93 Difference]: Finished difference Result 133 states and 154 transitions. [2018-02-04 04:17:08,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 04:17:08,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-02-04 04:17:08,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:08,743 INFO L225 Difference]: With dead ends: 133 [2018-02-04 04:17:08,744 INFO L226 Difference]: Without dead ends: 127 [2018-02-04 04:17:08,745 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 04:17:08,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-04 04:17:08,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 83. [2018-02-04 04:17:08,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-04 04:17:08,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2018-02-04 04:17:08,786 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 23 [2018-02-04 04:17:08,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:08,787 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2018-02-04 04:17:08,787 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 04:17:08,787 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2018-02-04 04:17:08,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 04:17:08,789 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:08,789 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-04 04:17:08,789 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 04:17:08,790 INFO L82 PathProgramCache]: Analyzing trace with hash 279746761, now seen corresponding path program 1 times [2018-02-04 04:17:08,790 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:08,790 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:08,791 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:08,792 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:08,792 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:08,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:08,807 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:08,862 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-04 04:17:08,862 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:17:08,862 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 04:17:08,864 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 04:17:08,864 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 04:17:08,864 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:17:08,865 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand 5 states. [2018-02-04 04:17:08,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:08,887 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2018-02-04 04:17:08,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 04:17:08,887 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-02-04 04:17:08,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:08,888 INFO L225 Difference]: With dead ends: 85 [2018-02-04 04:17:08,889 INFO L226 Difference]: Without dead ends: 83 [2018-02-04 04:17:08,889 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:17:08,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-04 04:17:08,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2018-02-04 04:17:08,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 04:17:08,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2018-02-04 04:17:08,897 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 23 [2018-02-04 04:17:08,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:08,897 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2018-02-04 04:17:08,897 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 04:17:08,898 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2018-02-04 04:17:08,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 04:17:08,898 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:08,898 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:17:08,899 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 04:17:08,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1161746679, now seen corresponding path program 1 times [2018-02-04 04:17:08,899 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:08,899 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:08,900 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:08,901 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:08,901 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:08,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:08,918 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:08,968 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-04 04:17:08,968 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:17:08,968 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 04:17:08,969 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 04:17:08,969 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 04:17:08,969 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:17:08,969 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 6 states. [2018-02-04 04:17:09,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:09,024 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2018-02-04 04:17:09,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 04:17:09,025 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-02-04 04:17:09,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:09,026 INFO L225 Difference]: With dead ends: 81 [2018-02-04 04:17:09,026 INFO L226 Difference]: Without dead ends: 81 [2018-02-04 04:17:09,026 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 04:17:09,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-04 04:17:09,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-02-04 04:17:09,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 04:17:09,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2018-02-04 04:17:09,031 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 25 [2018-02-04 04:17:09,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:09,032 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2018-02-04 04:17:09,032 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 04:17:09,032 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2018-02-04 04:17:09,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 04:17:09,032 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:09,033 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:17:09,033 INFO L371 AbstractCegarLoop]: === Iteration 4 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 04:17:09,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1162514069, now seen corresponding path program 1 times [2018-02-04 04:17:09,033 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:09,033 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:09,035 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:09,035 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:09,035 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:09,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:09,047 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:09,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:17:09,089 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:17:09,089 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 04:17:09,089 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 04:17:09,089 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 04:17:09,089 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:17:09,090 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 6 states. [2018-02-04 04:17:09,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:09,172 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2018-02-04 04:17:09,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 04:17:09,173 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-02-04 04:17:09,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:09,174 INFO L225 Difference]: With dead ends: 80 [2018-02-04 04:17:09,174 INFO L226 Difference]: Without dead ends: 80 [2018-02-04 04:17:09,174 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 04:17:09,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-04 04:17:09,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-02-04 04:17:09,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-04 04:17:09,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2018-02-04 04:17:09,179 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 25 [2018-02-04 04:17:09,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:09,179 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2018-02-04 04:17:09,179 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 04:17:09,179 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2018-02-04 04:17:09,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 04:17:09,180 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:09,180 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:17:09,180 INFO L371 AbstractCegarLoop]: === Iteration 5 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 04:17:09,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1162514068, now seen corresponding path program 1 times [2018-02-04 04:17:09,181 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:09,181 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:09,182 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:09,182 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:09,183 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:09,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:09,206 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:09,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:17:09,432 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:17:09,432 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 04:17:09,433 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 04:17:09,433 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 04:17:09,433 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-02-04 04:17:09,433 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand 11 states. [2018-02-04 04:17:09,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:09,663 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2018-02-04 04:17:09,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 04:17:09,663 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-02-04 04:17:09,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:09,664 INFO L225 Difference]: With dead ends: 84 [2018-02-04 04:17:09,664 INFO L226 Difference]: Without dead ends: 84 [2018-02-04 04:17:09,664 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-02-04 04:17:09,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-04 04:17:09,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2018-02-04 04:17:09,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-04 04:17:09,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2018-02-04 04:17:09,667 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 25 [2018-02-04 04:17:09,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:09,667 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2018-02-04 04:17:09,667 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 04:17:09,667 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2018-02-04 04:17:09,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 04:17:09,668 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:09,668 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 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-04 04:17:09,668 INFO L371 AbstractCegarLoop]: === Iteration 6 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 04:17:09,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1767740413, now seen corresponding path program 1 times [2018-02-04 04:17:09,668 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:09,668 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:09,669 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:09,669 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:09,669 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:09,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:09,687 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:09,946 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:17:09,946 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:17:09,946 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:17:09,949 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:09,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:09,994 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:17:10,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-02-04 04:17:10,038 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:17:10,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-02-04 04:17:10,049 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 04:17:10,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 04:17:10,058 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 04:17:10,470 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:17:10,471 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:17:10,471 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2018-02-04 04:17:10,471 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 04:17:10,472 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 04:17:10,472 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2018-02-04 04:17:10,472 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand 20 states. [2018-02-04 04:17:11,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:11,152 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2018-02-04 04:17:11,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 04:17:11,153 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 29 [2018-02-04 04:17:11,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:11,153 INFO L225 Difference]: With dead ends: 88 [2018-02-04 04:17:11,154 INFO L226 Difference]: Without dead ends: 88 [2018-02-04 04:17:11,154 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=123, Invalid=633, Unknown=0, NotChecked=0, Total=756 [2018-02-04 04:17:11,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-02-04 04:17:11,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 81. [2018-02-04 04:17:11,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 04:17:11,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2018-02-04 04:17:11,157 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 29 [2018-02-04 04:17:11,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:11,157 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2018-02-04 04:17:11,157 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 04:17:11,158 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2018-02-04 04:17:11,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 04:17:11,158 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:11,158 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 04:17:11,158 INFO L371 AbstractCegarLoop]: === Iteration 7 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 04:17:11,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1224527730, now seen corresponding path program 1 times [2018-02-04 04:17:11,159 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:11,159 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:11,160 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:11,160 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:11,160 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:11,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:11,167 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:11,203 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 04:17:11,203 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:17:11,203 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 04:17:11,204 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 04:17:11,204 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 04:17:11,204 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:17:11,204 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 5 states. [2018-02-04 04:17:11,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:11,224 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2018-02-04 04:17:11,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 04:17:11,225 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-02-04 04:17:11,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:11,226 INFO L225 Difference]: With dead ends: 85 [2018-02-04 04:17:11,226 INFO L226 Difference]: Without dead ends: 85 [2018-02-04 04:17:11,226 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:17:11,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-04 04:17:11,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2018-02-04 04:17:11,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-04 04:17:11,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2018-02-04 04:17:11,233 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 40 [2018-02-04 04:17:11,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:11,233 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2018-02-04 04:17:11,233 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 04:17:11,234 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2018-02-04 04:17:11,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 04:17:11,234 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:11,234 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 04:17:11,234 INFO L371 AbstractCegarLoop]: === Iteration 8 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 04:17:11,234 INFO L82 PathProgramCache]: Analyzing trace with hash 755727615, now seen corresponding path program 1 times [2018-02-04 04:17:11,235 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:11,236 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:11,236 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:11,236 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:11,237 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:11,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:11,250 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:11,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:17:11,283 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:17:11,283 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 04:17:11,284 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 04:17:11,284 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 04:17:11,284 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:17:11,284 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand 6 states. [2018-02-04 04:17:11,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:11,377 INFO L93 Difference]: Finished difference Result 126 states and 140 transitions. [2018-02-04 04:17:11,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 04:17:11,377 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-02-04 04:17:11,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:11,378 INFO L225 Difference]: With dead ends: 126 [2018-02-04 04:17:11,378 INFO L226 Difference]: Without dead ends: 126 [2018-02-04 04:17:11,378 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-02-04 04:17:11,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-04 04:17:11,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 108. [2018-02-04 04:17:11,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-04 04:17:11,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 124 transitions. [2018-02-04 04:17:11,384 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 124 transitions. Word has length 41 [2018-02-04 04:17:11,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:11,385 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 124 transitions. [2018-02-04 04:17:11,385 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 04:17:11,385 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 124 transitions. [2018-02-04 04:17:11,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 04:17:11,386 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:11,386 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 04:17:11,386 INFO L371 AbstractCegarLoop]: === Iteration 9 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 04:17:11,386 INFO L82 PathProgramCache]: Analyzing trace with hash 755727616, now seen corresponding path program 1 times [2018-02-04 04:17:11,387 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:11,387 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:11,388 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:11,388 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:11,388 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:11,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:11,398 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:11,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 04:17:11,480 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:17:11,480 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 04:17:11,481 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 04:17:11,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 04:17:11,481 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 04:17:11,481 INFO L87 Difference]: Start difference. First operand 108 states and 124 transitions. Second operand 7 states. [2018-02-04 04:17:11,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:11,525 INFO L93 Difference]: Finished difference Result 133 states and 150 transitions. [2018-02-04 04:17:11,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 04:17:11,526 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-02-04 04:17:11,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:11,528 INFO L225 Difference]: With dead ends: 133 [2018-02-04 04:17:11,528 INFO L226 Difference]: Without dead ends: 130 [2018-02-04 04:17:11,528 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 04:17:11,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-02-04 04:17:11,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 107. [2018-02-04 04:17:11,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-02-04 04:17:11,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 122 transitions. [2018-02-04 04:17:11,539 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 122 transitions. Word has length 41 [2018-02-04 04:17:11,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:11,539 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 122 transitions. [2018-02-04 04:17:11,540 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 04:17:11,540 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 122 transitions. [2018-02-04 04:17:11,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 04:17:11,541 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:11,541 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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-04 04:17:11,541 INFO L371 AbstractCegarLoop]: === Iteration 10 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 04:17:11,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1441386836, now seen corresponding path program 1 times [2018-02-04 04:17:11,541 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:11,541 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:11,542 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:11,543 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:11,543 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:11,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:11,556 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:11,561 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: Unknown lemma type! at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:263) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:132) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:915) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackTraceAbstractionRefinementStrategy.getTraceCheck(MultiTrackTraceAbstractionRefinementStrategy.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-02-04 04:17:11,565 INFO L168 Benchmark]: Toolchain (without parser) took 3752.00 ms. Allocated memory was 394.3 MB in the beginning and 674.2 MB in the end (delta: 280.0 MB). Free memory was 348.2 MB in the beginning and 549.1 MB in the end (delta: -200.8 MB). Peak memory consumption was 79.1 MB. Max. memory is 5.3 GB. [2018-02-04 04:17:11,566 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 394.3 MB. Free memory is still 354.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 04:17:11,566 INFO L168 Benchmark]: CACSL2BoogieTranslator took 167.03 ms. Allocated memory is still 394.3 MB. Free memory was 348.2 MB in the beginning and 335.0 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 04:17:11,566 INFO L168 Benchmark]: Boogie Preprocessor took 25.18 ms. Allocated memory is still 394.3 MB. Free memory was 335.0 MB in the beginning and 333.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 5.3 GB. [2018-02-04 04:17:11,566 INFO L168 Benchmark]: RCFGBuilder took 251.63 ms. Allocated memory is still 394.3 MB. Free memory was 332.3 MB in the beginning and 307.0 MB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 5.3 GB. [2018-02-04 04:17:11,567 INFO L168 Benchmark]: TraceAbstraction took 3305.28 ms. Allocated memory was 394.3 MB in the beginning and 674.2 MB in the end (delta: 280.0 MB). Free memory was 307.0 MB in the beginning and 549.1 MB in the end (delta: -242.1 MB). Peak memory consumption was 37.9 MB. Max. memory is 5.3 GB. [2018-02-04 04:17:11,568 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 394.3 MB. Free memory is still 354.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 167.03 ms. Allocated memory is still 394.3 MB. Free memory was 348.2 MB in the beginning and 335.0 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 25.18 ms. Allocated memory is still 394.3 MB. Free memory was 335.0 MB in the beginning and 333.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 5.3 GB. * RCFGBuilder took 251.63 ms. Allocated memory is still 394.3 MB. Free memory was 332.3 MB in the beginning and 307.0 MB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 3305.28 ms. Allocated memory was 394.3 MB in the beginning and 674.2 MB in the end (delta: 280.0 MB). Free memory was 307.0 MB in the beginning and 549.1 MB in the end (delta: -242.1 MB). Peak memory consumption was 37.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: Unknown lemma type! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: Unknown lemma type!: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_04-17-11-575.csv Received shutdown request...