java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/memsafety-ext/tree_stack_true-valid-memsafety_false-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:40:16,556 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:40:16,557 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:40:16,568 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:40:16,568 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:40:16,569 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:40:16,570 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:40:16,571 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:40:16,573 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:40:16,573 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:40:16,574 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:40:16,574 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:40:16,575 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:40:16,576 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:40:16,577 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:40:16,579 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:40:16,580 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:40:16,581 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:40:16,582 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:40:16,583 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:40:16,585 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:40:16,585 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:40:16,586 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:40:16,586 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:40:16,587 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:40:16,588 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:40:16,588 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:40:16,589 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:40:16,589 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:40:16,589 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:40:16,589 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:40:16,590 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-02 10:40:16,599 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:40:16,599 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:40:16,600 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:40:16,600 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:40:16,600 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:40:16,601 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:40:16,601 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:40:16,601 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:40:16,601 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:40:16,601 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:40:16,601 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:40:16,601 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:40:16,601 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:40:16,602 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:40:16,602 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:40:16,602 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:40:16,602 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:40:16,602 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:40:16,602 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:40:16,603 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:40:16,603 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:40:16,603 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:40:16,603 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:40:16,603 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol_NoArrayInterpol [2018-02-02 10:40:16,631 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:40:16,640 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:40:16,643 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:40:16,644 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:40:16,645 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:40:16,645 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/tree_stack_true-valid-memsafety_false-termination.i [2018-02-02 10:40:16,750 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:40:16,751 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:40:16,752 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:40:16,752 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:40:16,756 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:40:16,757 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:40:16" (1/1) ... [2018-02-02 10:40:16,758 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@93c6caa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:40:16, skipping insertion in model container [2018-02-02 10:40:16,758 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:40:16" (1/1) ... [2018-02-02 10:40:16,768 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:40:16,793 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:40:16,877 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:40:16,891 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:40:16,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:40:16 WrapperNode [2018-02-02 10:40:16,896 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:40:16,896 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:40:16,897 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:40:16,897 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:40:16,905 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:40:16" (1/1) ... [2018-02-02 10:40:16,905 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:40:16" (1/1) ... [2018-02-02 10:40:16,913 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:40:16" (1/1) ... [2018-02-02 10:40:16,913 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:40:16" (1/1) ... [2018-02-02 10:40:16,917 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:40:16" (1/1) ... [2018-02-02 10:40:16,920 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:40:16" (1/1) ... [2018-02-02 10:40:16,921 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:40:16" (1/1) ... [2018-02-02 10:40:16,923 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:40:16,923 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:40:16,923 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:40:16,923 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:40:16,924 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:40:16" (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 10:40:16,957 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:40:16,957 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:40:16,957 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:40:16,958 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:40:16,958 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:40:16,958 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:40:16,958 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:40:16,958 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:40:16,958 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:40:16,958 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:40:16,958 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:40:16,958 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:40:16,958 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:40:16,958 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:40:17,365 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:40:17,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:40:17 BoogieIcfgContainer [2018-02-02 10:40:17,366 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:40:17,366 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:40:17,367 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:40:17,369 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:40:17,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:40:16" (1/3) ... [2018-02-02 10:40:17,370 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c485e40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:40:17, skipping insertion in model container [2018-02-02 10:40:17,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:40:16" (2/3) ... [2018-02-02 10:40:17,370 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c485e40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:40:17, skipping insertion in model container [2018-02-02 10:40:17,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:40:17" (3/3) ... [2018-02-02 10:40:17,371 INFO L107 eAbstractionObserver]: Analyzing ICFG tree_stack_true-valid-memsafety_false-termination.i [2018-02-02 10:40:17,377 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:40:17,382 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 65 error locations. [2018-02-02 10:40:17,417 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:40:17,417 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:40:17,417 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:40:17,417 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:40:17,417 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:40:17,417 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:40:17,418 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:40:17,418 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:40:17,418 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:40:17,428 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states. [2018-02-02 10:40:17,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 10:40:17,435 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:40:17,436 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:40:17,436 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:40:17,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1338247859, now seen corresponding path program 1 times [2018-02-02 10:40:17,473 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:40:17,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:40:17,506 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:40:17,559 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 10:40:17,561 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:40:17,562 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:40:17,563 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:40:17,563 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 10:40:17,564 INFO L182 omatonBuilderFactory]: Interpolants [150#true, 151#false, 152#(= 1 (select |#valid| |main_#t~malloc0.base|)), 153#(= 1 (select |#valid| main_~root~0.base))] [2018-02-02 10:40:17,564 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 10:40:17,565 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:40:17,577 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:40:17,578 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:40:17,580 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 4 states. [2018-02-02 10:40:17,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:40:17,826 INFO L93 Difference]: Finished difference Result 162 states and 173 transitions. [2018-02-02 10:40:17,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:40:17,827 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 10:40:17,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:40:17,835 INFO L225 Difference]: With dead ends: 162 [2018-02-02 10:40:17,836 INFO L226 Difference]: Without dead ends: 158 [2018-02-02 10:40:17,837 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:40:17,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-02-02 10:40:17,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 142. [2018-02-02 10:40:17,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-02-02 10:40:17,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 152 transitions. [2018-02-02 10:40:17,869 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 152 transitions. Word has length 8 [2018-02-02 10:40:17,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:40:17,869 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 152 transitions. [2018-02-02 10:40:17,869 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:40:17,869 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 152 transitions. [2018-02-02 10:40:17,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 10:40:17,870 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:40:17,870 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:40:17,870 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:40:17,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1338247858, now seen corresponding path program 1 times [2018-02-02 10:40:17,871 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:40:17,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:40:17,885 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:40:17,932 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 10:40:17,932 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:40:17,932 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:40:17,932 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:40:17,933 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 10:40:17,933 INFO L182 omatonBuilderFactory]: Interpolants [460#true, 461#false, 462#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 463#(and (= (select |#length| main_~root~0.base) 8) (= main_~root~0.offset 0))] [2018-02-02 10:40:17,933 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 10:40:17,934 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:40:17,935 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:40:17,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:40:17,935 INFO L87 Difference]: Start difference. First operand 142 states and 152 transitions. Second operand 4 states. [2018-02-02 10:40:18,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:40:18,082 INFO L93 Difference]: Finished difference Result 140 states and 150 transitions. [2018-02-02 10:40:18,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:40:18,083 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 10:40:18,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:40:18,084 INFO L225 Difference]: With dead ends: 140 [2018-02-02 10:40:18,084 INFO L226 Difference]: Without dead ends: 140 [2018-02-02 10:40:18,085 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:40:18,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-02-02 10:40:18,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-02-02 10:40:18,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-02 10:40:18,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 150 transitions. [2018-02-02 10:40:18,092 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 150 transitions. Word has length 8 [2018-02-02 10:40:18,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:40:18,092 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 150 transitions. [2018-02-02 10:40:18,093 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:40:18,093 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 150 transitions. [2018-02-02 10:40:18,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 10:40:18,093 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:40:18,093 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:40:18,093 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:40:18,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1963213562, now seen corresponding path program 1 times [2018-02-02 10:40:18,094 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:40:18,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:40:18,107 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:40:18,129 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 10:40:18,129 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:40:18,130 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:40:18,130 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:40:18,130 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 10:40:18,130 INFO L182 omatonBuilderFactory]: Interpolants [746#true, 747#false, 748#(= 1 (select |#valid| main_~root~0.base)), 749#(= 1 (select |#valid| main_~n~0.base))] [2018-02-02 10:40:18,130 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 10:40:18,131 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:40:18,131 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:40:18,131 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:40:18,131 INFO L87 Difference]: Start difference. First operand 140 states and 150 transitions. Second operand 4 states. [2018-02-02 10:40:18,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:40:18,280 INFO L93 Difference]: Finished difference Result 148 states and 159 transitions. [2018-02-02 10:40:18,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:40:18,283 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-02 10:40:18,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:40:18,284 INFO L225 Difference]: With dead ends: 148 [2018-02-02 10:40:18,284 INFO L226 Difference]: Without dead ends: 148 [2018-02-02 10:40:18,284 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:40:18,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-02-02 10:40:18,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 127. [2018-02-02 10:40:18,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-02-02 10:40:18,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 138 transitions. [2018-02-02 10:40:18,288 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 138 transitions. Word has length 14 [2018-02-02 10:40:18,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:40:18,288 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 138 transitions. [2018-02-02 10:40:18,288 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:40:18,288 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 138 transitions. [2018-02-02 10:40:18,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 10:40:18,289 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:40:18,289 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:40:18,289 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:40:18,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1963213563, now seen corresponding path program 1 times [2018-02-02 10:40:18,289 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:40:18,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:40:18,299 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:40:18,337 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 10:40:18,337 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:40:18,338 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:40:18,338 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:40:18,338 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 10:40:18,338 INFO L182 omatonBuilderFactory]: Interpolants [1027#true, 1028#false, 1029#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 1030#(and (= 0 main_~root~0.offset) (= 8 (select |#length| main_~root~0.base))), 1031#(and (= main_~n~0.offset 0) (= (select |#length| main_~n~0.base) 8))] [2018-02-02 10:40:18,338 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 10:40:18,339 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:40:18,339 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:40:18,339 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:40:18,339 INFO L87 Difference]: Start difference. First operand 127 states and 138 transitions. Second operand 5 states. [2018-02-02 10:40:18,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:40:18,497 INFO L93 Difference]: Finished difference Result 173 states and 191 transitions. [2018-02-02 10:40:18,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:40:18,497 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-02 10:40:18,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:40:18,500 INFO L225 Difference]: With dead ends: 173 [2018-02-02 10:40:18,500 INFO L226 Difference]: Without dead ends: 173 [2018-02-02 10:40:18,500 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:40:18,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-02-02 10:40:18,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 157. [2018-02-02 10:40:18,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-02-02 10:40:18,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 180 transitions. [2018-02-02 10:40:18,508 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 180 transitions. Word has length 14 [2018-02-02 10:40:18,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:40:18,508 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 180 transitions. [2018-02-02 10:40:18,508 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:40:18,508 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 180 transitions. [2018-02-02 10:40:18,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 10:40:18,509 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:40:18,509 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:40:18,509 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:40:18,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1159097560, now seen corresponding path program 1 times [2018-02-02 10:40:18,510 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:40:18,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:40:18,518 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:40:18,540 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 10:40:18,540 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:40:18,540 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:40:18,541 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:40:18,541 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 10:40:18,541 INFO L182 omatonBuilderFactory]: Interpolants [1366#true, 1367#false, 1368#(= 1 (select |#valid| |main_#t~malloc28.base|)), 1369#(= 1 (select |#valid| main_~s~0.base))] [2018-02-02 10:40:18,541 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 10:40:18,541 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:40:18,541 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:40:18,541 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:40:18,542 INFO L87 Difference]: Start difference. First operand 157 states and 180 transitions. Second operand 4 states. [2018-02-02 10:40:18,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:40:18,627 INFO L93 Difference]: Finished difference Result 170 states and 193 transitions. [2018-02-02 10:40:18,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:40:18,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-02 10:40:18,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:40:18,628 INFO L225 Difference]: With dead ends: 170 [2018-02-02 10:40:18,628 INFO L226 Difference]: Without dead ends: 170 [2018-02-02 10:40:18,628 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:40:18,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-02-02 10:40:18,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 158. [2018-02-02 10:40:18,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-02-02 10:40:18,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 183 transitions. [2018-02-02 10:40:18,633 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 183 transitions. Word has length 16 [2018-02-02 10:40:18,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:40:18,634 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 183 transitions. [2018-02-02 10:40:18,634 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:40:18,634 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 183 transitions. [2018-02-02 10:40:18,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 10:40:18,634 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:40:18,634 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:40:18,635 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:40:18,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1159097561, now seen corresponding path program 1 times [2018-02-02 10:40:18,635 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:40:18,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:40:18,645 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:40:18,683 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 10:40:18,683 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:40:18,683 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:40:18,683 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:40:18,683 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 10:40:18,683 INFO L182 omatonBuilderFactory]: Interpolants [1700#true, 1701#false, 1702#(and (= 0 |main_#t~malloc28.offset|) (= 8 (select |#length| |main_#t~malloc28.base|))), 1703#(and (= (select |#length| main_~s~0.base) 8) (= main_~s~0.offset 0))] [2018-02-02 10:40:18,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:40:18,684 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:40:18,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:40:18,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:40:18,684 INFO L87 Difference]: Start difference. First operand 158 states and 183 transitions. Second operand 4 states. [2018-02-02 10:40:18,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:40:18,771 INFO L93 Difference]: Finished difference Result 160 states and 183 transitions. [2018-02-02 10:40:18,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:40:18,771 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-02 10:40:18,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:40:18,772 INFO L225 Difference]: With dead ends: 160 [2018-02-02 10:40:18,772 INFO L226 Difference]: Without dead ends: 160 [2018-02-02 10:40:18,772 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:40:18,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-02-02 10:40:18,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 156. [2018-02-02 10:40:18,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-02-02 10:40:18,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 180 transitions. [2018-02-02 10:40:18,777 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 180 transitions. Word has length 16 [2018-02-02 10:40:18,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:40:18,778 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 180 transitions. [2018-02-02 10:40:18,778 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:40:18,778 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 180 transitions. [2018-02-02 10:40:18,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 10:40:18,778 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:40:18,779 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] [2018-02-02 10:40:18,779 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:40:18,779 INFO L82 PathProgramCache]: Analyzing trace with hash 990226269, now seen corresponding path program 1 times [2018-02-02 10:40:18,780 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:40:18,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:40:18,790 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:40:18,812 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 10:40:18,813 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:40:18,813 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:40:18,813 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:40:18,813 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 10:40:18,813 INFO L182 omatonBuilderFactory]: Interpolants [2022#true, 2023#false, 2024#(not (= 0 |main_#t~malloc28.base|)), 2025#(not (= 0 main_~s~0.base))] [2018-02-02 10:40:18,814 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 10:40:18,814 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:40:18,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:40:18,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:40:18,814 INFO L87 Difference]: Start difference. First operand 156 states and 180 transitions. Second operand 4 states. [2018-02-02 10:40:18,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:40:18,827 INFO L93 Difference]: Finished difference Result 157 states and 180 transitions. [2018-02-02 10:40:18,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:40:18,827 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-02-02 10:40:18,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:40:18,828 INFO L225 Difference]: With dead ends: 157 [2018-02-02 10:40:18,828 INFO L226 Difference]: Without dead ends: 157 [2018-02-02 10:40:18,828 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:40:18,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-02-02 10:40:18,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2018-02-02 10:40:18,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-02-02 10:40:18,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 179 transitions. [2018-02-02 10:40:18,832 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 179 transitions. Word has length 21 [2018-02-02 10:40:18,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:40:18,833 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 179 transitions. [2018-02-02 10:40:18,833 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:40:18,833 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 179 transitions. [2018-02-02 10:40:18,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 10:40:18,833 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:40:18,833 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] [2018-02-02 10:40:18,833 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:40:18,833 INFO L82 PathProgramCache]: Analyzing trace with hash 632244512, now seen corresponding path program 1 times [2018-02-02 10:40:18,834 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:40:18,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:40:18,844 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:40:18,879 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 10:40:18,879 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:40:18,879 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:40:18,880 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:40:18,880 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 10:40:18,880 INFO L182 omatonBuilderFactory]: Interpolants [2341#true, 2342#false, 2343#(= 1 (select |#valid| main_~s~0.base)), 2344#(and (= main_~s~0.base main_~st~0.base) (= 1 (select |#valid| main_~s~0.base))), 2345#(= 1 (select |#valid| main_~st~0.base))] [2018-02-02 10:40:18,880 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 10:40:18,880 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:40:18,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:40:18,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:40:18,881 INFO L87 Difference]: Start difference. First operand 156 states and 179 transitions. Second operand 5 states. [2018-02-02 10:40:18,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:40:18,983 INFO L93 Difference]: Finished difference Result 171 states and 195 transitions. [2018-02-02 10:40:18,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:40:18,984 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-02-02 10:40:18,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:40:18,984 INFO L225 Difference]: With dead ends: 171 [2018-02-02 10:40:18,984 INFO L226 Difference]: Without dead ends: 171 [2018-02-02 10:40:18,985 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:40:18,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-02-02 10:40:18,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 155. [2018-02-02 10:40:18,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-02-02 10:40:18,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 179 transitions. [2018-02-02 10:40:18,988 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 179 transitions. Word has length 22 [2018-02-02 10:40:18,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:40:18,988 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 179 transitions. [2018-02-02 10:40:18,988 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:40:18,988 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 179 transitions. [2018-02-02 10:40:18,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 10:40:18,988 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:40:18,989 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] [2018-02-02 10:40:18,989 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:40:18,989 INFO L82 PathProgramCache]: Analyzing trace with hash 632244513, now seen corresponding path program 1 times [2018-02-02 10:40:18,989 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:40:18,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:40:19,000 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:40:19,125 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 10:40:19,126 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:40:19,126 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:40:19,126 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:40:19,126 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 10:40:19,126 INFO L182 omatonBuilderFactory]: Interpolants [2674#true, 2675#false, 2676#(and (= 0 |main_#t~malloc28.offset|) (= 8 (select |#length| |main_#t~malloc28.base|))), 2677#(and (= 0 main_~s~0.offset) (= 8 (select |#length| main_~s~0.base))), 2678#(and (= (select |#length| main_~st~0.base) 8) (= main_~st~0.offset 0))] [2018-02-02 10:40:19,126 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 10:40:19,126 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:40:19,126 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:40:19,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:40:19,127 INFO L87 Difference]: Start difference. First operand 155 states and 179 transitions. Second operand 5 states. [2018-02-02 10:40:19,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:40:19,250 INFO L93 Difference]: Finished difference Result 175 states and 200 transitions. [2018-02-02 10:40:19,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:40:19,250 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-02-02 10:40:19,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:40:19,251 INFO L225 Difference]: With dead ends: 175 [2018-02-02 10:40:19,251 INFO L226 Difference]: Without dead ends: 175 [2018-02-02 10:40:19,251 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:40:19,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-02-02 10:40:19,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 157. [2018-02-02 10:40:19,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-02-02 10:40:19,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 180 transitions. [2018-02-02 10:40:19,254 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 180 transitions. Word has length 22 [2018-02-02 10:40:19,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:40:19,254 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 180 transitions. [2018-02-02 10:40:19,254 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:40:19,254 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 180 transitions. [2018-02-02 10:40:19,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 10:40:19,257 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:40:19,257 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] [2018-02-02 10:40:19,257 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:40:19,257 INFO L82 PathProgramCache]: Analyzing trace with hash -733762389, now seen corresponding path program 1 times [2018-02-02 10:40:19,258 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:40:19,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:40:19,265 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:40:19,275 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 10:40:19,275 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:40:19,275 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:40:19,275 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:40:19,276 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 10:40:19,276 INFO L182 omatonBuilderFactory]: Interpolants [3017#true, 3018#false, 3019#(not |main_#t~short6|)] [2018-02-02 10:40:19,276 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 10:40:19,276 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:40:19,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:40:19,276 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:40:19,277 INFO L87 Difference]: Start difference. First operand 157 states and 180 transitions. Second operand 3 states. [2018-02-02 10:40:19,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:40:19,284 INFO L93 Difference]: Finished difference Result 159 states and 182 transitions. [2018-02-02 10:40:19,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:40:19,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-02-02 10:40:19,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:40:19,286 INFO L225 Difference]: With dead ends: 159 [2018-02-02 10:40:19,286 INFO L226 Difference]: Without dead ends: 159 [2018-02-02 10:40:19,286 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 10:40:19,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-02-02 10:40:19,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-02-02 10:40:19,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-02-02 10:40:19,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 182 transitions. [2018-02-02 10:40:19,289 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 182 transitions. Word has length 22 [2018-02-02 10:40:19,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:40:19,289 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 182 transitions. [2018-02-02 10:40:19,289 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:40:19,289 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 182 transitions. [2018-02-02 10:40:19,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 10:40:19,290 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:40:19,290 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] [2018-02-02 10:40:19,290 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:40:19,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1797349272, now seen corresponding path program 1 times [2018-02-02 10:40:19,291 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:40:19,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:40:19,306 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:40:19,311 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.FixedTraceAbstractionRefinementStrategy.getTraceCheck(FixedTraceAbstractionRefinementStrategy.java:131) 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 10:40:19,314 INFO L168 Benchmark]: Toolchain (without parser) took 2563.50 ms. Allocated memory was 407.4 MB in the beginning and 635.4 MB in the end (delta: 228.1 MB). Free memory was 364.2 MB in the beginning and 479.2 MB in the end (delta: -114.9 MB). Peak memory consumption was 113.2 MB. Max. memory is 5.3 GB. [2018-02-02 10:40:19,315 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 407.4 MB. Free memory is still 369.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:40:19,316 INFO L168 Benchmark]: CACSL2BoogieTranslator took 144.49 ms. Allocated memory is still 407.4 MB. Free memory was 364.2 MB in the beginning and 353.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:40:19,316 INFO L168 Benchmark]: Boogie Preprocessor took 26.29 ms. Allocated memory is still 407.4 MB. Free memory was 353.7 MB in the beginning and 351.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:40:19,316 INFO L168 Benchmark]: RCFGBuilder took 443.07 ms. Allocated memory is still 407.4 MB. Free memory was 351.0 MB in the beginning and 310.5 MB in the end (delta: 40.5 MB). Peak memory consumption was 40.5 MB. Max. memory is 5.3 GB. [2018-02-02 10:40:19,316 INFO L168 Benchmark]: TraceAbstraction took 1947.41 ms. Allocated memory was 407.4 MB in the beginning and 635.4 MB in the end (delta: 228.1 MB). Free memory was 310.5 MB in the beginning and 479.2 MB in the end (delta: -168.6 MB). Peak memory consumption was 59.4 MB. Max. memory is 5.3 GB. [2018-02-02 10:40:19,318 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.20 ms. Allocated memory is still 407.4 MB. Free memory is still 369.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 144.49 ms. Allocated memory is still 407.4 MB. Free memory was 364.2 MB in the beginning and 353.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 26.29 ms. Allocated memory is still 407.4 MB. Free memory was 353.7 MB in the beginning and 351.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 443.07 ms. Allocated memory is still 407.4 MB. Free memory was 351.0 MB in the beginning and 310.5 MB in the end (delta: 40.5 MB). Peak memory consumption was 40.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1947.41 ms. Allocated memory was 407.4 MB in the beginning and 635.4 MB in the end (delta: 228.1 MB). Free memory was 310.5 MB in the beginning and 479.2 MB in the end (delta: -168.6 MB). Peak memory consumption was 59.4 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/tree_stack_true-valid-memsafety_false-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-40-19-324.csv Received shutdown request...