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-a74eeac-m [2018-02-02 21:08:48,245 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 21:08:48,246 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 21:08:48,257 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 21:08:48,257 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 21:08:48,258 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 21:08:48,259 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 21:08:48,260 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 21:08:48,262 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 21:08:48,262 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 21:08:48,263 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 21:08:48,263 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 21:08:48,264 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 21:08:48,265 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 21:08:48,265 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 21:08:48,267 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 21:08:48,269 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 21:08:48,270 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 21:08:48,271 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 21:08:48,272 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 21:08:48,274 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 21:08:48,274 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 21:08:48,274 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 21:08:48,275 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 21:08:48,276 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 21:08:48,277 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 21:08:48,277 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 21:08:48,277 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 21:08:48,277 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 21:08:48,278 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 21:08:48,278 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 21:08:48,278 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-02 21:08:48,288 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 21:08:48,288 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 21:08:48,289 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 21:08:48,289 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 21:08:48,289 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 21:08:48,289 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 21:08:48,289 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 21:08:48,289 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 21:08:48,290 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 21:08:48,290 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 21:08:48,290 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 21:08:48,290 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 21:08:48,290 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 21:08:48,290 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 21:08:48,290 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 21:08:48,291 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 21:08:48,291 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 21:08:48,291 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 21:08:48,291 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 21:08:48,291 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 21:08:48,291 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 21:08:48,291 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 21:08:48,292 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 21:08:48,292 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 21:08:48,292 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-02 21:08:48,318 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 21:08:48,334 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 21:08:48,341 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 21:08:48,343 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 21:08:48,343 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 21:08:48,344 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-02 21:08:48,500 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 21:08:48,502 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 21:08:48,502 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 21:08:48,503 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 21:08:48,510 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 21:08:48,511 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:08:48" (1/1) ... [2018-02-02 21:08:48,514 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@461e048d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:08:48, skipping insertion in model container [2018-02-02 21:08:48,514 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:08:48" (1/1) ... [2018-02-02 21:08:48,529 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 21:08:48,569 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 21:08:48,669 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 21:08:48,684 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 21:08:48,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:08:48 WrapperNode [2018-02-02 21:08:48,691 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 21:08:48,692 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 21:08:48,692 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 21:08:48,692 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 21:08:48,702 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:08:48" (1/1) ... [2018-02-02 21:08:48,702 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:08:48" (1/1) ... [2018-02-02 21:08:48,714 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:08:48" (1/1) ... [2018-02-02 21:08:48,715 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:08:48" (1/1) ... [2018-02-02 21:08:48,718 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:08:48" (1/1) ... [2018-02-02 21:08:48,721 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:08:48" (1/1) ... [2018-02-02 21:08:48,722 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:08:48" (1/1) ... [2018-02-02 21:08:48,724 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 21:08:48,725 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 21:08:48,725 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 21:08:48,725 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 21:08:48,726 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:08:48" (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 21:08:48,761 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 21:08:48,762 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 21:08:48,762 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_positive [2018-02-02 21:08:48,762 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 21:08:48,762 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-02-02 21:08:48,762 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-02-02 21:08:48,762 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 21:08:48,762 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 21:08:48,762 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 21:08:48,762 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 21:08:48,762 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 21:08:48,762 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 21:08:48,762 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 21:08:48,763 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 21:08:48,763 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 21:08:48,763 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 21:08:48,763 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_positive [2018-02-02 21:08:48,763 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 21:08:48,763 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-02-02 21:08:48,763 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-02-02 21:08:48,763 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-02-02 21:08:48,763 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 21:08:48,763 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 21:08:48,763 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 21:08:48,763 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 21:08:48,988 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 21:08:48,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:08:48 BoogieIcfgContainer [2018-02-02 21:08:48,988 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 21:08:48,989 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 21:08:48,989 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 21:08:48,991 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 21:08:48,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:08:48" (1/3) ... [2018-02-02 21:08:48,992 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ac2c595 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:08:48, skipping insertion in model container [2018-02-02 21:08:48,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:08:48" (2/3) ... [2018-02-02 21:08:48,992 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ac2c595 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:08:48, skipping insertion in model container [2018-02-02 21:08:48,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:08:48" (3/3) ... [2018-02-02 21:08:48,994 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test17_2_true-valid-memsafety_true-termination.i [2018-02-02 21:08:48,999 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 21:08:49,006 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-02-02 21:08:49,037 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 21:08:49,037 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 21:08:49,037 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 21:08:49,037 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 21:08:49,037 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 21:08:49,037 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 21:08:49,037 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 21:08:49,037 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 21:08:49,038 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 21:08:49,051 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2018-02-02 21:08:49,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 21:08:49,059 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:08:49,060 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 21:08:49,060 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-02 21:08:49,064 INFO L82 PathProgramCache]: Analyzing trace with hash 280514151, now seen corresponding path program 1 times [2018-02-02 21:08:49,066 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:08:49,066 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:08:49,115 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:49,115 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:08:49,115 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:49,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:08:49,167 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:08:49,238 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 21:08:49,240 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:08:49,240 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 21:08:49,242 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 21:08:49,251 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 21:08:49,252 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 21:08:49,253 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 3 states. [2018-02-02 21:08:49,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:08:49,441 INFO L93 Difference]: Finished difference Result 133 states and 154 transitions. [2018-02-02 21:08:49,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 21:08:49,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-02-02 21:08:49,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:08:49,449 INFO L225 Difference]: With dead ends: 133 [2018-02-02 21:08:49,449 INFO L226 Difference]: Without dead ends: 127 [2018-02-02 21:08:49,450 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-02 21:08:49,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-02 21:08:49,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 83. [2018-02-02 21:08:49,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-02 21:08:49,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2018-02-02 21:08:49,483 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 23 [2018-02-02 21:08:49,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:08:49,483 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2018-02-02 21:08:49,483 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 21:08:49,483 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2018-02-02 21:08:49,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 21:08:49,485 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:08:49,485 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 21:08:49,485 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-02 21:08:49,486 INFO L82 PathProgramCache]: Analyzing trace with hash 279746761, now seen corresponding path program 1 times [2018-02-02 21:08:49,486 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:08:49,486 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:08:49,487 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:49,487 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:08:49,488 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:49,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:08:49,502 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:08:49,558 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 21:08:49,558 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:08:49,559 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 21:08:49,560 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 21:08:49,560 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 21:08:49,560 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 21:08:49,561 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand 5 states. [2018-02-02 21:08:49,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:08:49,580 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2018-02-02 21:08:49,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 21:08:49,581 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-02-02 21:08:49,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:08:49,581 INFO L225 Difference]: With dead ends: 85 [2018-02-02 21:08:49,582 INFO L226 Difference]: Without dead ends: 83 [2018-02-02 21:08:49,582 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 21:08:49,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-02 21:08:49,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2018-02-02 21:08:49,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-02 21:08:49,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2018-02-02 21:08:49,586 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 23 [2018-02-02 21:08:49,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:08:49,587 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2018-02-02 21:08:49,587 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 21:08:49,587 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2018-02-02 21:08:49,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 21:08:49,587 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:08:49,587 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:08:49,587 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-02 21:08:49,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1161746679, now seen corresponding path program 1 times [2018-02-02 21:08:49,588 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:08:49,588 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:08:49,589 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:49,589 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:08:49,589 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:49,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:08:49,605 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:08:49,679 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 21:08:49,680 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:08:49,680 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 21:08:49,680 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 21:08:49,681 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 21:08:49,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 21:08:49,681 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 6 states. [2018-02-02 21:08:49,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:08:49,728 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2018-02-02 21:08:49,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 21:08:49,728 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-02-02 21:08:49,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:08:49,730 INFO L225 Difference]: With dead ends: 81 [2018-02-02 21:08:49,730 INFO L226 Difference]: Without dead ends: 81 [2018-02-02 21:08:49,730 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 21:08:49,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-02 21:08:49,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-02-02 21:08:49,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-02 21:08:49,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2018-02-02 21:08:49,736 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 25 [2018-02-02 21:08:49,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:08:49,737 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2018-02-02 21:08:49,737 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 21:08:49,737 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2018-02-02 21:08:49,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 21:08:49,738 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:08:49,738 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:08:49,738 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-02 21:08:49,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1162514069, now seen corresponding path program 1 times [2018-02-02 21:08:49,738 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:08:49,739 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:08:49,740 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:49,741 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:08:49,741 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:08:49,755 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:08:49,797 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 21:08:49,798 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:08:49,798 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 21:08:49,798 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 21:08:49,798 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 21:08:49,798 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 21:08:49,798 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 6 states. [2018-02-02 21:08:49,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:08:49,864 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2018-02-02 21:08:49,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 21:08:49,864 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-02-02 21:08:49,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:08:49,865 INFO L225 Difference]: With dead ends: 80 [2018-02-02 21:08:49,865 INFO L226 Difference]: Without dead ends: 80 [2018-02-02 21:08:49,865 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 21:08:49,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-02 21:08:49,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-02-02 21:08:49,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-02 21:08:49,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2018-02-02 21:08:49,872 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 25 [2018-02-02 21:08:49,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:08:49,872 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2018-02-02 21:08:49,872 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 21:08:49,872 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2018-02-02 21:08:49,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 21:08:49,873 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:08:49,873 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:08:49,873 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-02 21:08:49,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1162514068, now seen corresponding path program 1 times [2018-02-02 21:08:49,874 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:08:49,874 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:08:49,875 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:49,875 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:08:49,875 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:49,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:08:49,902 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:08:50,196 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 21:08:50,196 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:08:50,196 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 21:08:50,196 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 21:08:50,197 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 21:08:50,197 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-02-02 21:08:50,197 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand 11 states. [2018-02-02 21:08:50,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:08:50,444 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2018-02-02 21:08:50,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 21:08:50,444 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-02-02 21:08:50,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:08:50,445 INFO L225 Difference]: With dead ends: 84 [2018-02-02 21:08:50,445 INFO L226 Difference]: Without dead ends: 84 [2018-02-02 21:08:50,446 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-02-02 21:08:50,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-02 21:08:50,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2018-02-02 21:08:50,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-02 21:08:50,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2018-02-02 21:08:50,451 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 25 [2018-02-02 21:08:50,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:08:50,451 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2018-02-02 21:08:50,451 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 21:08:50,451 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2018-02-02 21:08:50,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 21:08:50,452 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:08:50,452 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-02 21:08:50,452 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-02 21:08:50,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1767740413, now seen corresponding path program 1 times [2018-02-02 21:08:50,452 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:08:50,453 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:08:50,454 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:50,454 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:08:50,454 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:50,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:08:50,468 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:08:50,675 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-02 21:08:50,675 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:08:50,675 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:08:50,676 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:08:50,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:08:50,712 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:08:50,764 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-02 21:08:50,765 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 21:08:50,777 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-02 21:08:50,777 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 21:08:50,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 21:08:50,788 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-02 21:08:51,278 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-02 21:08:51,278 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:08:51,279 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2018-02-02 21:08:51,279 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 21:08:51,279 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 21:08:51,279 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2018-02-02 21:08:51,279 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand 20 states. [2018-02-02 21:08:52,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:08:52,056 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2018-02-02 21:08:52,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 21:08:52,057 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 29 [2018-02-02 21:08:52,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:08:52,058 INFO L225 Difference]: With dead ends: 88 [2018-02-02 21:08:52,058 INFO L226 Difference]: Without dead ends: 88 [2018-02-02 21:08:52,058 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=123, Invalid=633, Unknown=0, NotChecked=0, Total=756 [2018-02-02 21:08:52,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-02-02 21:08:52,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 81. [2018-02-02 21:08:52,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-02 21:08:52,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2018-02-02 21:08:52,064 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 29 [2018-02-02 21:08:52,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:08:52,064 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2018-02-02 21:08:52,064 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 21:08:52,065 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2018-02-02 21:08:52,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 21:08:52,065 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:08:52,066 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-02 21:08:52,066 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-02 21:08:52,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1224527730, now seen corresponding path program 1 times [2018-02-02 21:08:52,066 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:08:52,066 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:08:52,067 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:52,067 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:08:52,067 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:52,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:08:52,079 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:08:52,121 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-02 21:08:52,121 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:08:52,121 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 21:08:52,122 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 21:08:52,126 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 21:08:52,126 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 21:08:52,126 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 5 states. [2018-02-02 21:08:52,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:08:52,143 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2018-02-02 21:08:52,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 21:08:52,143 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-02-02 21:08:52,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:08:52,144 INFO L225 Difference]: With dead ends: 85 [2018-02-02 21:08:52,144 INFO L226 Difference]: Without dead ends: 85 [2018-02-02 21:08:52,144 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 21:08:52,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-02 21:08:52,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2018-02-02 21:08:52,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-02 21:08:52,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2018-02-02 21:08:52,151 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 40 [2018-02-02 21:08:52,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:08:52,152 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2018-02-02 21:08:52,152 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 21:08:52,152 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2018-02-02 21:08:52,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 21:08:52,153 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:08:52,153 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-02 21:08:52,153 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-02 21:08:52,153 INFO L82 PathProgramCache]: Analyzing trace with hash 755727615, now seen corresponding path program 1 times [2018-02-02 21:08:52,153 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:08:52,153 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:08:52,154 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:52,154 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:08:52,154 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:52,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:08:52,163 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:08:52,195 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-02 21:08:52,196 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:08:52,196 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 21:08:52,196 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 21:08:52,196 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 21:08:52,196 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 21:08:52,196 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand 6 states. [2018-02-02 21:08:52,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:08:52,291 INFO L93 Difference]: Finished difference Result 126 states and 140 transitions. [2018-02-02 21:08:52,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 21:08:52,291 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-02-02 21:08:52,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:08:52,292 INFO L225 Difference]: With dead ends: 126 [2018-02-02 21:08:52,292 INFO L226 Difference]: Without dead ends: 126 [2018-02-02 21:08:52,292 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-02 21:08:52,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-02 21:08:52,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 108. [2018-02-02 21:08:52,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-02 21:08:52,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 124 transitions. [2018-02-02 21:08:52,297 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 124 transitions. Word has length 41 [2018-02-02 21:08:52,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:08:52,297 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 124 transitions. [2018-02-02 21:08:52,297 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 21:08:52,297 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 124 transitions. [2018-02-02 21:08:52,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 21:08:52,297 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:08:52,298 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-02 21:08:52,298 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-02 21:08:52,298 INFO L82 PathProgramCache]: Analyzing trace with hash 755727616, now seen corresponding path program 1 times [2018-02-02 21:08:52,298 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:08:52,298 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:08:52,299 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:52,299 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:08:52,299 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:52,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:08:52,308 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:08:52,352 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-02 21:08:52,353 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:08:52,353 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 21:08:52,353 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 21:08:52,353 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 21:08:52,354 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 21:08:52,354 INFO L87 Difference]: Start difference. First operand 108 states and 124 transitions. Second operand 7 states. [2018-02-02 21:08:52,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:08:52,402 INFO L93 Difference]: Finished difference Result 133 states and 150 transitions. [2018-02-02 21:08:52,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 21:08:52,402 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-02-02 21:08:52,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:08:52,403 INFO L225 Difference]: With dead ends: 133 [2018-02-02 21:08:52,404 INFO L226 Difference]: Without dead ends: 130 [2018-02-02 21:08:52,404 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-02 21:08:52,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-02-02 21:08:52,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 107. [2018-02-02 21:08:52,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-02-02 21:08:52,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 122 transitions. [2018-02-02 21:08:52,409 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 122 transitions. Word has length 41 [2018-02-02 21:08:52,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:08:52,409 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 122 transitions. [2018-02-02 21:08:52,410 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 21:08:52,410 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 122 transitions. [2018-02-02 21:08:52,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 21:08:52,410 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:08:52,411 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-02 21:08:52,411 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-02 21:08:52,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1441386836, now seen corresponding path program 1 times [2018-02-02 21:08:52,411 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:08:52,411 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:08:52,412 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:52,412 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:08:52,412 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:08:52,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:08:52,426 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:08:52,431 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-02 21:08:52,435 INFO L168 Benchmark]: Toolchain (without parser) took 3933.83 ms. Allocated memory was 405.8 MB in the beginning and 666.9 MB in the end (delta: 261.1 MB). Free memory was 362.5 MB in the beginning and 523.2 MB in the end (delta: -160.7 MB). Peak memory consumption was 100.4 MB. Max. memory is 5.3 GB. [2018-02-02 21:08:52,436 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 405.8 MB. Free memory is still 367.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 21:08:52,436 INFO L168 Benchmark]: CACSL2BoogieTranslator took 189.13 ms. Allocated memory is still 405.8 MB. Free memory was 362.5 MB in the beginning and 349.3 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-02 21:08:52,436 INFO L168 Benchmark]: Boogie Preprocessor took 32.95 ms. Allocated memory is still 405.8 MB. Free memory was 349.3 MB in the beginning and 346.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 21:08:52,437 INFO L168 Benchmark]: RCFGBuilder took 263.51 ms. Allocated memory is still 405.8 MB. Free memory was 346.6 MB in the beginning and 321.2 MB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 5.3 GB. [2018-02-02 21:08:52,437 INFO L168 Benchmark]: TraceAbstraction took 3445.16 ms. Allocated memory was 405.8 MB in the beginning and 666.9 MB in the end (delta: 261.1 MB). Free memory was 321.2 MB in the beginning and 523.2 MB in the end (delta: -202.0 MB). Peak memory consumption was 59.1 MB. Max. memory is 5.3 GB. [2018-02-02 21:08:52,438 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.15 ms. Allocated memory is still 405.8 MB. Free memory is still 367.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 189.13 ms. Allocated memory is still 405.8 MB. Free memory was 362.5 MB in the beginning and 349.3 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.95 ms. Allocated memory is still 405.8 MB. Free memory was 349.3 MB in the beginning and 346.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 263.51 ms. Allocated memory is still 405.8 MB. Free memory was 346.6 MB in the beginning and 321.2 MB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 3445.16 ms. Allocated memory was 405.8 MB in the beginning and 666.9 MB in the end (delta: 261.1 MB). Free memory was 321.2 MB in the beginning and 523.2 MB in the end (delta: -202.0 MB). Peak memory consumption was 59.1 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-02_21-08-52-446.csv Received shutdown request...