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_Array.epf -i ../../../trunk/examples/svcomp/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 15:54:32,908 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 15:54:32,910 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 15:54:32,921 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 15:54:32,921 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 15:54:32,922 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 15:54:32,923 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 15:54:32,924 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 15:54:32,926 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 15:54:32,927 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 15:54:32,927 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 15:54:32,928 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 15:54:32,928 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 15:54:32,929 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 15:54:32,930 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 15:54:32,932 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 15:54:32,934 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 15:54:32,935 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 15:54:32,936 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 15:54:32,937 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 15:54:32,939 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 15:54:32,939 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 15:54:32,939 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 15:54:32,940 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 15:54:32,940 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 15:54:32,941 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 15:54:32,942 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 15:54:32,942 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 15:54:32,942 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 15:54:32,942 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 15:54:32,943 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 15:54:32,943 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_Array.epf [2018-02-04 15:54:32,953 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 15:54:32,953 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 15:54:32,954 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 15:54:32,954 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 15:54:32,954 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 15:54:32,954 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 15:54:32,954 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 15:54:32,955 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 15:54:32,955 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 15:54:32,955 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 15:54:32,955 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 15:54:32,955 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 15:54:32,955 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 15:54:32,956 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 15:54:32,956 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 15:54:32,956 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 15:54:32,956 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 15:54:32,956 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 15:54:32,956 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 15:54:32,956 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 15:54:32,957 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 15:54:32,957 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 15:54:32,986 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 15:54:32,996 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 15:54:32,999 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 15:54:33,000 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 15:54:33,001 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 15:54:33,001 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i [2018-02-04 15:54:33,138 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 15:54:33,139 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 15:54:33,140 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 15:54:33,140 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 15:54:33,145 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 15:54:33,145 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:54:33" (1/1) ... [2018-02-04 15:54:33,147 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1570a244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:54:33, skipping insertion in model container [2018-02-04 15:54:33,147 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:54:33" (1/1) ... [2018-02-04 15:54:33,156 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 15:54:33,183 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 15:54:33,271 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 15:54:33,289 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 15:54:33,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:54:33 WrapperNode [2018-02-04 15:54:33,295 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 15:54:33,296 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 15:54:33,296 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 15:54:33,296 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 15:54:33,307 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:54:33" (1/1) ... [2018-02-04 15:54:33,307 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:54:33" (1/1) ... [2018-02-04 15:54:33,314 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:54:33" (1/1) ... [2018-02-04 15:54:33,314 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:54:33" (1/1) ... [2018-02-04 15:54:33,319 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:54:33" (1/1) ... [2018-02-04 15:54:33,322 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:54:33" (1/1) ... [2018-02-04 15:54:33,323 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:54:33" (1/1) ... [2018-02-04 15:54:33,325 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 15:54:33,325 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 15:54:33,325 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 15:54:33,325 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 15:54:33,326 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:54:33" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 15:54:33,362 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 15:54:33,362 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 15:54:33,362 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-02-04 15:54:33,362 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 15:54:33,362 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 15:54:33,362 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 15:54:33,362 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 15:54:33,363 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 15:54:33,363 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 15:54:33,363 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 15:54:33,363 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 15:54:33,363 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 15:54:33,363 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-02-04 15:54:33,364 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 15:54:33,364 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 15:54:33,364 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 15:54:33,612 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 15:54:33,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:54:33 BoogieIcfgContainer [2018-02-04 15:54:33,613 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 15:54:33,614 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 15:54:33,614 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 15:54:33,616 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 15:54:33,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 03:54:33" (1/3) ... [2018-02-04 15:54:33,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ecd96df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:54:33, skipping insertion in model container [2018-02-04 15:54:33,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:54:33" (2/3) ... [2018-02-04 15:54:33,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ecd96df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:54:33, skipping insertion in model container [2018-02-04 15:54:33,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:54:33" (3/3) ... [2018-02-04 15:54:33,619 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0232_1_false-valid-memtrack_true-termination.i [2018-02-04 15:54:33,627 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 15:54:33,632 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 43 error locations. [2018-02-04 15:54:33,663 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 15:54:33,664 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 15:54:33,664 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 15:54:33,664 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 15:54:33,664 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 15:54:33,664 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 15:54:33,664 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 15:54:33,665 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 15:54:33,665 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 15:54:33,677 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states. [2018-02-04 15:54:33,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-04 15:54:33,686 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:54:33,687 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:54:33,687 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 15:54:33,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1218068532, now seen corresponding path program 1 times [2018-02-04 15:54:33,730 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:54:33,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:54:33,768 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:54:33,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:33,818 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:54:33,818 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 15:54:33,819 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:54:33,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:33,820 INFO L182 omatonBuilderFactory]: Interpolants [108#true, 109#false, 110#(= 1 (select |#valid| |main_~#list~0.base|))] [2018-02-04 15:54:33,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:33,821 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 15:54:33,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 15:54:33,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 15:54:33,834 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 3 states. [2018-02-04 15:54:33,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:54:33,991 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2018-02-04 15:54:33,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 15:54:33,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-04 15:54:33,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:54:34,001 INFO L225 Difference]: With dead ends: 110 [2018-02-04 15:54:34,001 INFO L226 Difference]: Without dead ends: 107 [2018-02-04 15:54:34,002 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 15:54:34,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-02-04 15:54:34,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 102. [2018-02-04 15:54:34,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-02-04 15:54:34,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2018-02-04 15:54:34,033 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 7 [2018-02-04 15:54:34,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:54:34,034 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2018-02-04 15:54:34,034 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 15:54:34,034 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2018-02-04 15:54:34,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-04 15:54:34,034 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:54:34,034 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:54:34,034 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 15:54:34,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1218068531, now seen corresponding path program 1 times [2018-02-04 15:54:34,035 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:54:34,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:54:34,047 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:54:34,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:34,079 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:54:34,079 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 15:54:34,080 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:54:34,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:34,080 INFO L182 omatonBuilderFactory]: Interpolants [323#true, 324#false, 325#(and (= (select |#length| |main_~#list~0.base|) 4) (= |main_~#list~0.offset| 0))] [2018-02-04 15:54:34,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:34,082 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 15:54:34,082 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 15:54:34,082 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 15:54:34,082 INFO L87 Difference]: Start difference. First operand 102 states and 108 transitions. Second operand 3 states. [2018-02-04 15:54:34,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:54:34,163 INFO L93 Difference]: Finished difference Result 103 states and 110 transitions. [2018-02-04 15:54:34,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 15:54:34,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-04 15:54:34,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:54:34,172 INFO L225 Difference]: With dead ends: 103 [2018-02-04 15:54:34,172 INFO L226 Difference]: Without dead ends: 103 [2018-02-04 15:54:34,173 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 15:54:34,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-02-04 15:54:34,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2018-02-04 15:54:34,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-02-04 15:54:34,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2018-02-04 15:54:34,180 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 7 [2018-02-04 15:54:34,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:54:34,180 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2018-02-04 15:54:34,180 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 15:54:34,180 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2018-02-04 15:54:34,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 15:54:34,181 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:54:34,181 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:54:34,181 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 15:54:34,181 INFO L82 PathProgramCache]: Analyzing trace with hash 2000515713, now seen corresponding path program 1 times [2018-02-04 15:54:34,182 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:54:34,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:54:34,198 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:54:34,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:34,258 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:54:34,258 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 15:54:34,258 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:54:34,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:34,259 INFO L182 omatonBuilderFactory]: Interpolants [530#true, 531#false, 532#(= 1 (select |#valid| |main_~#list~0.base|)), 533#(= 1 (select |#valid| |append_#in~plist.base|)), 534#(= 1 (select |#valid| append_~plist.base))] [2018-02-04 15:54:34,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:34,259 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 15:54:34,259 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 15:54:34,260 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 15:54:34,260 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand 5 states. [2018-02-04 15:54:34,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:54:34,392 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2018-02-04 15:54:34,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 15:54:34,392 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-04 15:54:34,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:54:34,393 INFO L225 Difference]: With dead ends: 99 [2018-02-04 15:54:34,393 INFO L226 Difference]: Without dead ends: 99 [2018-02-04 15:54:34,393 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 15:54:34,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-02-04 15:54:34,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2018-02-04 15:54:34,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-04 15:54:34,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2018-02-04 15:54:34,399 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 14 [2018-02-04 15:54:34,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:54:34,399 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2018-02-04 15:54:34,399 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 15:54:34,399 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2018-02-04 15:54:34,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 15:54:34,400 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:54:34,400 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:54:34,400 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 15:54:34,400 INFO L82 PathProgramCache]: Analyzing trace with hash 2000515714, now seen corresponding path program 1 times [2018-02-04 15:54:34,401 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:54:34,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:54:34,412 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:54:34,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:34,506 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:54:34,506 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 15:54:34,506 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:54:34,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:34,507 INFO L182 omatonBuilderFactory]: Interpolants [736#(and (= append_~plist.offset 0) (<= 4 (select |#length| append_~plist.base)) (= (select |#valid| append_~plist.base) 1)), 737#(and (= append_~plist.offset 0) (<= 4 (select |#length| append_~plist.base))), 731#true, 732#false, 733#(and (= 0 |main_~#list~0.offset|) (= (select |#length| |main_~#list~0.base|) 4)), 734#(and (= 0 |main_~#list~0.offset|) (= (select |#length| |main_~#list~0.base|) 4) (= (select |#valid| |main_~#list~0.base|) 1)), 735#(and (= (select |#valid| |append_#in~plist.base|) 1) (<= 4 (select |#length| |append_#in~plist.base|)) (= 0 |append_#in~plist.offset|))] [2018-02-04 15:54:34,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:34,507 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 15:54:34,507 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 15:54:34,507 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 15:54:34,508 INFO L87 Difference]: Start difference. First operand 95 states and 100 transitions. Second operand 7 states. [2018-02-04 15:54:34,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:54:34,703 INFO L93 Difference]: Finished difference Result 125 states and 131 transitions. [2018-02-04 15:54:34,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 15:54:34,704 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-02-04 15:54:34,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:54:34,705 INFO L225 Difference]: With dead ends: 125 [2018-02-04 15:54:34,705 INFO L226 Difference]: Without dead ends: 125 [2018-02-04 15:54:34,705 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-02-04 15:54:34,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-04 15:54:34,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 115. [2018-02-04 15:54:34,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-04 15:54:34,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 131 transitions. [2018-02-04 15:54:34,710 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 131 transitions. Word has length 14 [2018-02-04 15:54:34,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:54:34,710 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 131 transitions. [2018-02-04 15:54:34,710 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 15:54:34,710 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 131 transitions. [2018-02-04 15:54:34,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 15:54:34,711 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:54:34,711 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:54:34,711 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 15:54:34,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1886445036, now seen corresponding path program 1 times [2018-02-04 15:54:34,712 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:54:34,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:54:34,721 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:54:34,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:34,740 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:54:34,740 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 15:54:34,741 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:54:34,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:34,741 INFO L182 omatonBuilderFactory]: Interpolants [980#true, 981#false, 982#(= 1 (select |#valid| |append_#t~malloc1.base|)), 983#(= 1 (select |#valid| append_~item~0.base))] [2018-02-04 15:54:34,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:34,741 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 15:54:34,741 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 15:54:34,741 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 15:54:34,741 INFO L87 Difference]: Start difference. First operand 115 states and 131 transitions. Second operand 4 states. [2018-02-04 15:54:34,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:54:34,791 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2018-02-04 15:54:34,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 15:54:34,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-04 15:54:34,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:54:34,792 INFO L225 Difference]: With dead ends: 111 [2018-02-04 15:54:34,792 INFO L226 Difference]: Without dead ends: 111 [2018-02-04 15:54:34,793 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-04 15:54:34,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-04 15:54:34,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-02-04 15:54:34,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-02-04 15:54:34,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 123 transitions. [2018-02-04 15:54:34,798 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 123 transitions. Word has length 15 [2018-02-04 15:54:34,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:54:34,799 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 123 transitions. [2018-02-04 15:54:34,799 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 15:54:34,799 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2018-02-04 15:54:34,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 15:54:34,799 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:54:34,799 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:54:34,799 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 15:54:34,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1886445037, now seen corresponding path program 1 times [2018-02-04 15:54:34,800 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:54:34,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:54:34,810 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:54:34,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:34,837 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:54:34,837 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 15:54:34,838 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:54:34,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:34,838 INFO L182 omatonBuilderFactory]: Interpolants [1208#true, 1209#false, 1210#(and (= 8 (select |#length| |append_#t~malloc1.base|)) (= 0 |append_#t~malloc1.offset|)), 1211#(and (= (select |#length| append_~item~0.base) 8) (= append_~item~0.offset 0))] [2018-02-04 15:54:34,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:34,838 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 15:54:34,838 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 15:54:34,838 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 15:54:34,838 INFO L87 Difference]: Start difference. First operand 111 states and 123 transitions. Second operand 4 states. [2018-02-04 15:54:34,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:54:34,893 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2018-02-04 15:54:34,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 15:54:34,894 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-04 15:54:34,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:54:34,894 INFO L225 Difference]: With dead ends: 107 [2018-02-04 15:54:34,894 INFO L226 Difference]: Without dead ends: 107 [2018-02-04 15:54:34,895 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-04 15:54:34,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-02-04 15:54:34,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-02-04 15:54:34,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-02-04 15:54:34,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 115 transitions. [2018-02-04 15:54:34,898 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 115 transitions. Word has length 15 [2018-02-04 15:54:34,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:54:34,898 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 115 transitions. [2018-02-04 15:54:34,898 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 15:54:34,898 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2018-02-04 15:54:34,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 15:54:34,899 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:54:34,899 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] [2018-02-04 15:54:34,899 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 15:54:34,899 INFO L82 PathProgramCache]: Analyzing trace with hash 198602156, now seen corresponding path program 1 times [2018-02-04 15:54:34,899 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:54:34,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:54:34,905 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:54:34,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:34,974 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:54:34,974 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 15:54:34,974 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:54:34,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:34,975 INFO L182 omatonBuilderFactory]: Interpolants [1428#true, 1429#false, 1430#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 1431#(and (= 0 (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~plist.base|) |append_#in~plist.offset|))), 1432#(and (= 0 (select (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset)) (= 0 (select (select |#memory_$Pointer$.offset| append_~plist.base) append_~plist.offset))), 1433#(and (= 0 |append_#t~mem3.offset|) (= 0 |append_#t~mem3.base|)), 1434#(and (= 0 (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| append_~item~0.base) append_~item~0.offset))), 1435#(and (= |append_#t~mem4.offset| (select (select |#memory_$Pointer$.offset| append_~item~0.base) append_~item~0.offset)) (= |append_#t~mem4.base| 0) (= 0 (select (select |#memory_$Pointer$.offset| append_~item~0.base) append_~item~0.offset)))] [2018-02-04 15:54:34,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:34,975 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 15:54:34,975 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 15:54:34,975 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 15:54:34,975 INFO L87 Difference]: Start difference. First operand 107 states and 115 transitions. Second operand 8 states. [2018-02-04 15:54:35,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:54:35,142 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2018-02-04 15:54:35,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 15:54:35,142 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-02-04 15:54:35,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:54:35,143 INFO L225 Difference]: With dead ends: 104 [2018-02-04 15:54:35,143 INFO L226 Difference]: Without dead ends: 104 [2018-02-04 15:54:35,143 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-02-04 15:54:35,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-04 15:54:35,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-02-04 15:54:35,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-02-04 15:54:35,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 109 transitions. [2018-02-04 15:54:35,147 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 109 transitions. Word has length 20 [2018-02-04 15:54:35,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:54:35,148 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 109 transitions. [2018-02-04 15:54:35,148 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 15:54:35,148 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 109 transitions. [2018-02-04 15:54:35,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 15:54:35,149 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:54:35,149 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:54:35,149 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 15:54:35,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1229999684, now seen corresponding path program 1 times [2018-02-04 15:54:35,150 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:54:35,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:54:35,162 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:54:35,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:35,235 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:54:35,235 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 15:54:35,235 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:54:35,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:35,236 INFO L182 omatonBuilderFactory]: Interpolants [1656#true, 1657#false, 1658#(and (= 0 |main_~#list~0.offset|) (= (select |#length| |main_~#list~0.base|) 4)), 1659#(and (= append_~plist.base |append_#in~plist.base|) (or (= append_~plist.offset 0) (= |append_#in~plist.offset| append_~plist.offset))), 1660#(or (<= 4 (select |#length| |append_#in~plist.base|)) (not (= |append_#in~plist.offset| 0))), 1661#(and (< 0 (+ |main_~#list~0.offset| 1)) (<= (+ |main_~#list~0.offset| 4) (select |#length| |main_~#list~0.base|)))] [2018-02-04 15:54:35,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:35,236 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 15:54:35,236 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 15:54:35,236 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 15:54:35,236 INFO L87 Difference]: Start difference. First operand 104 states and 109 transitions. Second operand 6 states. [2018-02-04 15:54:35,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:54:35,334 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2018-02-04 15:54:35,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 15:54:35,335 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-02-04 15:54:35,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:54:35,336 INFO L225 Difference]: With dead ends: 120 [2018-02-04 15:54:35,336 INFO L226 Difference]: Without dead ends: 120 [2018-02-04 15:54:35,336 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-04 15:54:35,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-04 15:54:35,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 110. [2018-02-04 15:54:35,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-02-04 15:54:35,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2018-02-04 15:54:35,342 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 31 [2018-02-04 15:54:35,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:54:35,342 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2018-02-04 15:54:35,342 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 15:54:35,342 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2018-02-04 15:54:35,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 15:54:35,343 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:54:35,343 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:54:35,343 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 15:54:35,343 INFO L82 PathProgramCache]: Analyzing trace with hash -524715473, now seen corresponding path program 1 times [2018-02-04 15:54:35,343 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:54:35,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:54:35,351 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:54:35,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:35,391 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:54:35,391 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 15:54:35,392 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:54:35,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:35,392 INFO L182 omatonBuilderFactory]: Interpolants [1894#true, 1895#false, 1896#(and (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|)), 1897#(and (= append_~plist.base |append_#in~plist.base|) (= 1 (select |#valid| append_~item~0.base)) (= append_~plist.offset |append_#in~plist.offset|)), 1898#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|))), 1899#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 1900#(= 1 (select |#valid| |main_#t~mem15.base|))] [2018-02-04 15:54:35,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:35,392 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 15:54:35,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 15:54:35,392 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-04 15:54:35,392 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand 7 states. [2018-02-04 15:54:35,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:54:35,498 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2018-02-04 15:54:35,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 15:54:35,498 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2018-02-04 15:54:35,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:54:35,498 INFO L225 Difference]: With dead ends: 130 [2018-02-04 15:54:35,499 INFO L226 Difference]: Without dead ends: 130 [2018-02-04 15:54:35,499 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-04 15:54:35,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-02-04 15:54:35,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 111. [2018-02-04 15:54:35,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-02-04 15:54:35,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 120 transitions. [2018-02-04 15:54:35,502 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 120 transitions. Word has length 32 [2018-02-04 15:54:35,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:54:35,503 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 120 transitions. [2018-02-04 15:54:35,503 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 15:54:35,503 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 120 transitions. [2018-02-04 15:54:35,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 15:54:35,504 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:54:35,504 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:54:35,504 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 15:54:35,504 INFO L82 PathProgramCache]: Analyzing trace with hash -524715472, now seen corresponding path program 1 times [2018-02-04 15:54:35,505 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:54:35,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:54:35,516 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:54:35,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:35,647 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:54:35,647 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 15:54:35,647 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:54:35,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:35,648 INFO L182 omatonBuilderFactory]: Interpolants [2148#true, 2149#false, 2150#(and (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|)), 2151#(and (= append_~plist.base |append_#in~plist.base|) (= 0 |append_#t~malloc1.offset|) (= append_~plist.offset |append_#in~plist.offset|)), 2152#(and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (= append_~plist.offset |append_#in~plist.offset|)), 2153#(and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (= append_~plist.offset |append_#in~plist.offset|) (<= (+ append_~item~0.offset 8) (select |#length| append_~item~0.base))), 2154#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~plist.base|) |append_#in~plist.offset|))), 2155#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))), 2156#(and (<= 8 (select |#length| |main_#t~mem15.base|)) (= |main_#t~mem15.offset| 0))] [2018-02-04 15:54:35,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:35,648 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 15:54:35,648 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 15:54:35,648 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-04 15:54:35,648 INFO L87 Difference]: Start difference. First operand 111 states and 120 transitions. Second operand 9 states. [2018-02-04 15:54:35,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:54:35,799 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2018-02-04 15:54:35,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 15:54:35,799 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-02-04 15:54:35,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:54:35,799 INFO L225 Difference]: With dead ends: 127 [2018-02-04 15:54:35,799 INFO L226 Difference]: Without dead ends: 127 [2018-02-04 15:54:35,800 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-02-04 15:54:35,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-04 15:54:35,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 110. [2018-02-04 15:54:35,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-02-04 15:54:35,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2018-02-04 15:54:35,802 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 32 [2018-02-04 15:54:35,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:54:35,803 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2018-02-04 15:54:35,803 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 15:54:35,803 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2018-02-04 15:54:35,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 15:54:35,803 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:54:35,803 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:54:35,803 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 15:54:35,804 INFO L82 PathProgramCache]: Analyzing trace with hash -524727421, now seen corresponding path program 1 times [2018-02-04 15:54:35,804 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:54:35,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:54:35,813 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:54:35,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:35,829 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:54:35,829 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 15:54:35,829 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:54:35,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:35,830 INFO L182 omatonBuilderFactory]: Interpolants [2408#true, 2409#false, 2410#(<= 1 main_~length~0)] [2018-02-04 15:54:35,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:35,830 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 15:54:35,830 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 15:54:35,830 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 15:54:35,831 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand 3 states. [2018-02-04 15:54:35,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:54:35,840 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2018-02-04 15:54:35,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 15:54:35,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-02-04 15:54:35,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:54:35,844 INFO L225 Difference]: With dead ends: 96 [2018-02-04 15:54:35,845 INFO L226 Difference]: Without dead ends: 96 [2018-02-04 15:54:35,845 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-04 15:54:35,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-04 15:54:35,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-02-04 15:54:35,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-04 15:54:35,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2018-02-04 15:54:35,848 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 32 [2018-02-04 15:54:35,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:54:35,848 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2018-02-04 15:54:35,848 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 15:54:35,848 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2018-02-04 15:54:35,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 15:54:35,849 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:54:35,849 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:54:35,849 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 15:54:35,849 INFO L82 PathProgramCache]: Analyzing trace with hash 947709807, now seen corresponding path program 1 times [2018-02-04 15:54:35,850 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:54:35,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:54:35,858 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:54:35,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:35,871 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:54:35,871 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 15:54:35,871 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:54:35,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:35,872 INFO L182 omatonBuilderFactory]: Interpolants [2603#true, 2604#false, 2605#(<= main_~length~0 0)] [2018-02-04 15:54:35,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:35,872 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 15:54:35,872 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 15:54:35,872 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 15:54:35,873 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand 3 states. [2018-02-04 15:54:35,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:54:35,881 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2018-02-04 15:54:35,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 15:54:35,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-02-04 15:54:35,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:54:35,882 INFO L225 Difference]: With dead ends: 96 [2018-02-04 15:54:35,882 INFO L226 Difference]: Without dead ends: 96 [2018-02-04 15:54:35,883 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-04 15:54:35,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-04 15:54:35,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2018-02-04 15:54:35,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-04 15:54:35,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2018-02-04 15:54:35,885 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 33 [2018-02-04 15:54:35,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:54:35,885 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2018-02-04 15:54:35,885 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 15:54:35,885 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2018-02-04 15:54:35,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 15:54:35,886 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:54:35,886 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 15:54:35,886 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 15:54:35,886 INFO L82 PathProgramCache]: Analyzing trace with hash -302598238, now seen corresponding path program 1 times [2018-02-04 15:54:35,887 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:54:35,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:54:35,898 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:54:36,003 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:36,004 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:54:36,004 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 15:54:36,004 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:54:36,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:36,004 INFO L182 omatonBuilderFactory]: Interpolants [2800#(and (or (<= 4 (select |#length| |append_#in~plist.base|)) (not (= |append_#in~plist.offset| 0))) (= (select |#valid| |append_#in~plist.base|) 1)), 2801#(and (<= 4 (select |#length| |main_~#list~0.base|)) (= 0 |main_~#list~0.offset|) (= (select |#valid| |main_~#list~0.base|) 1)), 2802#(and (= (select |#valid| |append_#in~plist.base|) 1) (<= 4 (select |#length| |append_#in~plist.base|)) (= 0 |append_#in~plist.offset|)), 2803#(and (= append_~plist.offset 0) (<= 4 (select |#length| append_~plist.base)) (= (select |#valid| append_~plist.base) 1)), 2804#(and (= append_~plist.offset 0) (<= 4 (select |#length| append_~plist.base))), 2796#true, 2797#false, 2798#(and (= 0 |main_~#list~0.offset|) (= (select |#length| |main_~#list~0.base|) 4)), 2799#(and (= append_~plist.base |append_#in~plist.base|) (or (= append_~plist.offset 0) (= |append_#in~plist.offset| append_~plist.offset)))] [2018-02-04 15:54:36,004 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:36,005 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 15:54:36,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 15:54:36,005 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 15:54:36,005 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand 9 states. [2018-02-04 15:54:36,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:54:36,132 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2018-02-04 15:54:36,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 15:54:36,132 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-02-04 15:54:36,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:54:36,133 INFO L225 Difference]: With dead ends: 93 [2018-02-04 15:54:36,133 INFO L226 Difference]: Without dead ends: 93 [2018-02-04 15:54:36,133 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-02-04 15:54:36,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-04 15:54:36,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 85. [2018-02-04 15:54:36,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-02-04 15:54:36,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2018-02-04 15:54:36,136 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 34 [2018-02-04 15:54:36,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:54:36,136 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2018-02-04 15:54:36,136 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 15:54:36,136 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2018-02-04 15:54:36,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 15:54:36,137 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:54:36,137 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:54:36,137 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 15:54:36,137 INFO L82 PathProgramCache]: Analyzing trace with hash 214855819, now seen corresponding path program 1 times [2018-02-04 15:54:36,138 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:54:36,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:54:36,146 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:54:36,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:36,161 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:54:36,162 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 15:54:36,162 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:54:36,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:36,162 INFO L182 omatonBuilderFactory]: Interpolants [2987#true, 2988#false, 2989#(= main_~length~0 0), 2990#(<= 1 main_~length~0)] [2018-02-04 15:54:36,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:36,163 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 15:54:36,163 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 15:54:36,163 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 15:54:36,163 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand 4 states. [2018-02-04 15:54:36,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:54:36,179 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2018-02-04 15:54:36,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 15:54:36,180 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-02-04 15:54:36,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:54:36,180 INFO L225 Difference]: With dead ends: 84 [2018-02-04 15:54:36,180 INFO L226 Difference]: Without dead ends: 84 [2018-02-04 15:54:36,181 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 15:54:36,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-04 15:54:36,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2018-02-04 15:54:36,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-04 15:54:36,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 85 transitions. [2018-02-04 15:54:36,183 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 85 transitions. Word has length 35 [2018-02-04 15:54:36,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:54:36,183 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 85 transitions. [2018-02-04 15:54:36,183 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 15:54:36,184 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2018-02-04 15:54:36,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 15:54:36,184 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:54:36,184 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:54:36,184 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 15:54:36,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1882322185, now seen corresponding path program 1 times [2018-02-04 15:54:36,185 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:54:36,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:54:36,193 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:54:36,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:36,246 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:54:36,246 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 15:54:36,246 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:54:36,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:36,247 INFO L182 omatonBuilderFactory]: Interpolants [3158#true, 3159#false, 3160#(and (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|)), 3161#(and (= append_~plist.base |append_#in~plist.base|) (= 0 |append_#t~malloc1.offset|) (= append_~plist.offset |append_#in~plist.offset|)), 3162#(and (= 0 append_~item~0.offset) (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|)), 3163#(= 0 (select (select |#memory_$Pointer$.offset| |append_#in~plist.base|) |append_#in~plist.offset|)), 3164#(= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)), 3165#(= |main_#t~mem17.offset| 0)] [2018-02-04 15:54:36,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:36,247 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 15:54:36,247 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 15:54:36,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 15:54:36,248 INFO L87 Difference]: Start difference. First operand 83 states and 85 transitions. Second operand 8 states. [2018-02-04 15:54:36,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:54:36,341 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2018-02-04 15:54:36,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 15:54:36,341 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-02-04 15:54:36,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:54:36,342 INFO L225 Difference]: With dead ends: 82 [2018-02-04 15:54:36,343 INFO L226 Difference]: Without dead ends: 82 [2018-02-04 15:54:36,343 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-02-04 15:54:36,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-04 15:54:36,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-02-04 15:54:36,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-04 15:54:36,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2018-02-04 15:54:36,346 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 35 [2018-02-04 15:54:36,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:54:36,346 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2018-02-04 15:54:36,346 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 15:54:36,346 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2018-02-04 15:54:36,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 15:54:36,347 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:54:36,347 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:54:36,347 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 15:54:36,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1882322186, now seen corresponding path program 1 times [2018-02-04 15:54:36,348 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:54:36,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:54:36,357 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:54:36,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:36,379 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:54:36,379 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 15:54:36,379 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:54:36,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:36,380 INFO L182 omatonBuilderFactory]: Interpolants [3344#(= 1 (select |#valid| |main_#t~mem17.base|)), 3340#true, 3341#false, 3342#(= |main_#t~mem15.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)), 3343#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))] [2018-02-04 15:54:36,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:36,380 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 15:54:36,381 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 15:54:36,381 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 15:54:36,381 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand 5 states. [2018-02-04 15:54:36,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:54:36,452 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2018-02-04 15:54:36,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 15:54:36,452 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-02-04 15:54:36,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:54:36,453 INFO L225 Difference]: With dead ends: 81 [2018-02-04 15:54:36,453 INFO L226 Difference]: Without dead ends: 81 [2018-02-04 15:54:36,453 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-04 15:54:36,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-04 15:54:36,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-02-04 15:54:36,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 15:54:36,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2018-02-04 15:54:36,454 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 35 [2018-02-04 15:54:36,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:54:36,455 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2018-02-04 15:54:36,455 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 15:54:36,455 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2018-02-04 15:54:36,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 15:54:36,455 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:54:36,455 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:54:36,455 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 15:54:36,455 INFO L82 PathProgramCache]: Analyzing trace with hash 730389066, now seen corresponding path program 1 times [2018-02-04 15:54:36,456 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:54:36,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:54:36,478 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:54:36,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:36,588 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:54:36,588 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 15:54:36,588 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:54:36,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:36,589 INFO L182 omatonBuilderFactory]: Interpolants [3520#(and (not (= |main_#t~mem17.base| 0)) (= 1 (select (store |#valid| |main_#t~mem17.base| 0) |main_~#list~0.base|))), 3511#true, 3512#false, 3513#(= 1 (select |#valid| |main_~#list~0.base|)), 3514#(= |#valid| |old(#valid)|), 3515#(and (= append_~plist.base |append_#in~plist.base|) (= |#valid| |old(#valid)|) (= append_~plist.offset |append_#in~plist.offset|)), 3516#(and (= (select |old(#valid)| |append_#t~malloc1.base|) 0) (= append_~plist.base |append_#in~plist.base|) (not (= |append_#t~malloc1.base| 0)) (= append_~plist.offset |append_#in~plist.offset|)), 3517#(and (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|) (= (select |old(#valid)| append_~item~0.base) 0) (not (= append_~item~0.base 0))), 3518#(and (not (= (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) 0) (= 1 (select |#valid| |append_#in~plist.base|))), 3519#(and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) |main_~#list~0.base|)) (= 1 (select |#valid| |main_~#list~0.base|)))] [2018-02-04 15:54:36,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:36,589 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 15:54:36,589 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 15:54:36,589 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-04 15:54:36,589 INFO L87 Difference]: Start difference. First operand 81 states and 83 transitions. Second operand 10 states. [2018-02-04 15:54:36,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:54:36,769 INFO L93 Difference]: Finished difference Result 80 states and 82 transitions. [2018-02-04 15:54:36,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 15:54:36,769 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2018-02-04 15:54:36,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:54:36,770 INFO L225 Difference]: With dead ends: 80 [2018-02-04 15:54:36,770 INFO L226 Difference]: Without dead ends: 80 [2018-02-04 15:54:36,770 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-02-04 15:54:36,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-04 15:54:36,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-02-04 15:54:36,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-04 15:54:36,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2018-02-04 15:54:36,773 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 37 [2018-02-04 15:54:36,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:54:36,773 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2018-02-04 15:54:36,773 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 15:54:36,773 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2018-02-04 15:54:36,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 15:54:36,773 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:54:36,773 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2018-02-04 15:54:36,774 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 15:54:36,774 INFO L82 PathProgramCache]: Analyzing trace with hash 2123324108, now seen corresponding path program 1 times [2018-02-04 15:54:36,774 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:54:36,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:54:36,786 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:54:36,915 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:36,915 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:54:36,916 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 15:54:36,916 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:54:36,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:36,916 INFO L182 omatonBuilderFactory]: Interpolants [3696#(or (= 1 (select |#valid| |append_#t~mem3.base|)) (= append_~item~0.base |append_#t~mem3.base|)), 3697#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset))), 3698#(= 1 (select |#valid| |append_#t~mem5.base|)), 3687#true, 3688#false, 3689#(and (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|)), 3690#(and (= append_~plist.base |append_#in~plist.base|) (= 1 (select |#valid| append_~item~0.base)) (= append_~plist.offset |append_#in~plist.offset|)), 3691#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|))), 3692#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 3693#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset))), 3694#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset))) (= |append_#t~malloc1.base| (select (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset))), 3695#(or (= append_~item~0.base (select (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset))))] [2018-02-04 15:54:36,916 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:36,916 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 15:54:36,917 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 15:54:36,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-02-04 15:54:36,917 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 12 states. [2018-02-04 15:54:37,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:54:37,158 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2018-02-04 15:54:37,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 15:54:37,158 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2018-02-04 15:54:37,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:54:37,158 INFO L225 Difference]: With dead ends: 81 [2018-02-04 15:54:37,158 INFO L226 Difference]: Without dead ends: 81 [2018-02-04 15:54:37,159 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2018-02-04 15:54:37,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-04 15:54:37,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2018-02-04 15:54:37,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-02-04 15:54:37,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2018-02-04 15:54:37,160 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 40 [2018-02-04 15:54:37,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:54:37,160 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2018-02-04 15:54:37,160 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 15:54:37,160 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2018-02-04 15:54:37,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 15:54:37,161 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:54:37,161 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2018-02-04 15:54:37,161 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 15:54:37,161 INFO L82 PathProgramCache]: Analyzing trace with hash 2123324109, now seen corresponding path program 1 times [2018-02-04 15:54:37,161 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:54:37,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:54:37,173 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:54:37,360 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:37,360 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:54:37,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 15:54:37,360 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:54:37,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:37,361 INFO L182 omatonBuilderFactory]: Interpolants [3875#true, 3876#false, 3877#(and (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|)), 3878#(and (= append_~plist.base |append_#in~plist.base|) (= 0 |append_#t~malloc1.offset|) (= append_~plist.offset |append_#in~plist.offset|)), 3879#(and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (= append_~plist.offset |append_#in~plist.offset|)), 3880#(and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (= (select |#valid| append_~item~0.base) 1) (= append_~plist.offset |append_#in~plist.offset|) (<= (+ append_~item~0.offset 8) (select |#length| append_~item~0.base))), 3881#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) 1) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~plist.base|) |append_#in~plist.offset|))), 3882#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 1)), 3883#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset)) 1) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset))) (= 0 (select (select |#memory_$Pointer$.offset| append_~plist.base) append_~plist.offset))), 3884#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset))) (= 0 (select (select |#memory_$Pointer$.offset| append_~plist.base) append_~plist.offset))), 3885#(and (= 0 |append_#t~mem3.offset|) (<= 8 (select |#length| |append_#t~mem3.base|))), 3886#(and (= 0 (select (select |#memory_$Pointer$.offset| append_~item~0.base) append_~item~0.offset)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset)))), 3887#(and (= |append_#t~mem5.offset| 0) (<= 8 (select |#length| |append_#t~mem5.base|)))] [2018-02-04 15:54:37,361 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:37,361 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 15:54:37,361 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 15:54:37,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-02-04 15:54:37,362 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand 13 states. [2018-02-04 15:54:37,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:54:37,755 INFO L93 Difference]: Finished difference Result 80 states and 82 transitions. [2018-02-04 15:54:37,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 15:54:37,755 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-02-04 15:54:37,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:54:37,756 INFO L225 Difference]: With dead ends: 80 [2018-02-04 15:54:37,756 INFO L226 Difference]: Without dead ends: 80 [2018-02-04 15:54:37,756 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=492, Unknown=0, NotChecked=0, Total=650 [2018-02-04 15:54:37,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-04 15:54:37,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2018-02-04 15:54:37,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-04 15:54:37,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2018-02-04 15:54:37,758 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 40 [2018-02-04 15:54:37,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:54:37,759 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2018-02-04 15:54:37,759 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 15:54:37,759 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2018-02-04 15:54:37,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 15:54:37,759 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:54:37,759 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:54:37,759 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 15:54:37,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1242227968, now seen corresponding path program 1 times [2018-02-04 15:54:37,760 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:54:37,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:54:37,769 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:54:37,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:37,790 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:54:37,790 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 15:54:37,790 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:54:37,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:37,790 INFO L182 omatonBuilderFactory]: Interpolants [4072#true, 4073#false, 4074#(= main_~length~0 0), 4075#(<= main_~length~0 1), 4076#(<= main_~length~0 0)] [2018-02-04 15:54:37,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:37,791 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 15:54:37,791 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 15:54:37,791 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-04 15:54:37,791 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 5 states. [2018-02-04 15:54:37,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:54:37,816 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2018-02-04 15:54:37,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 15:54:37,817 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-02-04 15:54:37,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:54:37,817 INFO L225 Difference]: With dead ends: 96 [2018-02-04 15:54:37,817 INFO L226 Difference]: Without dead ends: 96 [2018-02-04 15:54:37,818 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-04 15:54:37,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-04 15:54:37,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 93. [2018-02-04 15:54:37,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-04 15:54:37,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 96 transitions. [2018-02-04 15:54:37,820 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 96 transitions. Word has length 42 [2018-02-04 15:54:37,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:54:37,820 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 96 transitions. [2018-02-04 15:54:37,820 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 15:54:37,820 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2018-02-04 15:54:37,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 15:54:37,821 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:54:37,821 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:54:37,821 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 15:54:37,821 INFO L82 PathProgramCache]: Analyzing trace with hash -221032996, now seen corresponding path program 1 times [2018-02-04 15:54:37,822 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:54:37,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 15:54:37,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 15:54:37,867 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 15:54:37,879 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-04 15:54:37,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 03:54:37 BoogieIcfgContainer [2018-02-04 15:54:37,891 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 15:54:37,891 INFO L168 Benchmark]: Toolchain (without parser) took 4752.65 ms. Allocated memory was 405.8 MB in the beginning and 724.6 MB in the end (delta: 318.8 MB). Free memory was 362.7 MB in the beginning and 529.3 MB in the end (delta: -166.6 MB). Peak memory consumption was 152.1 MB. Max. memory is 5.3 GB. [2018-02-04 15:54:37,892 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 405.8 MB. Free memory is still 368.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 15:54:37,892 INFO L168 Benchmark]: CACSL2BoogieTranslator took 155.59 ms. Allocated memory is still 405.8 MB. Free memory was 362.7 MB in the beginning and 352.1 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 15:54:37,892 INFO L168 Benchmark]: Boogie Preprocessor took 29.03 ms. Allocated memory is still 405.8 MB. Free memory was 352.1 MB in the beginning and 349.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 15:54:37,892 INFO L168 Benchmark]: RCFGBuilder took 288.06 ms. Allocated memory is still 405.8 MB. Free memory was 349.5 MB in the beginning and 319.6 MB in the end (delta: 29.9 MB). Peak memory consumption was 29.9 MB. Max. memory is 5.3 GB. [2018-02-04 15:54:37,893 INFO L168 Benchmark]: TraceAbstraction took 4277.29 ms. Allocated memory was 405.8 MB in the beginning and 724.6 MB in the end (delta: 318.8 MB). Free memory was 319.6 MB in the beginning and 529.3 MB in the end (delta: -209.8 MB). Peak memory consumption was 109.0 MB. Max. memory is 5.3 GB. [2018-02-04 15:54:37,894 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.17 ms. Allocated memory is still 405.8 MB. Free memory is still 368.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 155.59 ms. Allocated memory is still 405.8 MB. Free memory was 362.7 MB in the beginning and 352.1 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.03 ms. Allocated memory is still 405.8 MB. Free memory was 352.1 MB in the beginning and 349.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 288.06 ms. Allocated memory is still 405.8 MB. Free memory was 349.5 MB in the beginning and 319.6 MB in the end (delta: 29.9 MB). Peak memory consumption was 29.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 4277.29 ms. Allocated memory was 405.8 MB in the beginning and 724.6 MB in the end (delta: 318.8 MB). Free memory was 319.6 MB in the beginning and 529.3 MB in the end (delta: -209.8 MB). Peak memory consumption was 109.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 635]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L620] int c = 0; VAL [\old(c)=0, c=0] [L637] FCALL struct item *list = ((void *)0); VAL [\old(c)=0, c=0, list={9:0}] [L638] int length = 0; VAL [\old(c)=0, c=0, length=0, list={9:0}] [L640] CALL append(&list) VAL [\old(c)=0, c=0, plist={9:0}] [L627] c++ VAL [\old(c)=0, c=1, plist={9:0}, plist={9:0}] [L628] EXPR, FCALL malloc(sizeof *item) VAL [\old(c)=0, c=1, malloc(sizeof *item)={14:0}, plist={9:0}, plist={9:0}] [L628] struct item *item = malloc(sizeof *item); VAL [\old(c)=0, c=1, item={14:0}, malloc(sizeof *item)={14:0}, plist={9:0}, plist={9:0}] [L629] EXPR, FCALL \read(**plist) VAL [\old(c)=0, \read(**plist)={0:0}, c=1, item={14:0}, malloc(sizeof *item)={14:0}, plist={9:0}, plist={9:0}] [L629] FCALL item->next = *plist VAL [\old(c)=0, \read(**plist)={0:0}, c=1, item={14:0}, malloc(sizeof *item)={14:0}, plist={9:0}, plist={9:0}] [L630] EXPR, FCALL item->next VAL [\old(c)=0, c=1, item={14:0}, item->next={0:0}, malloc(sizeof *item)={14:0}, plist={9:0}, plist={9:0}] [L630-L632] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) VAL [\old(c)=0, c=1, item={14:0}, item->next={0:0}, malloc(sizeof *item)={14:0}, plist={9:0}, plist={9:0}] [L632] EXPR, FCALL malloc(sizeof *item) VAL [\old(c)=0, c=1, item={14:0}, item->next={0:0}, malloc(sizeof *item)={11:0}, malloc(sizeof *item)={14:0}, plist={9:0}, plist={9:0}] [L630-L632] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={11:0}, \old(c)=0, c=1, item={14:0}, item->next={0:0}, malloc(sizeof *item)={11:0}, malloc(sizeof *item)={14:0}, plist={9:0}, plist={9:0}] [L630-L632] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={11:0}, \old(c)=0, c=1, item={14:0}, item->next={0:0}, malloc(sizeof *item)={11:0}, malloc(sizeof *item)={14:0}, plist={9:0}, plist={9:0}] [L633] RET, FCALL *plist = item VAL [\old(c)=0, c=1, item={14:0}, malloc(sizeof *item)={11:0}, malloc(sizeof *item)={14:0}, plist={9:0}, plist={9:0}] [L640] append(&list) VAL [\old(c)=0, c=1, length=0, list={9:0}] [L641] length++ VAL [\old(c)=0, c=1, length=1, list={9:0}] [L642] COND FALSE !(__VERIFIER_nondet_int() && c < 20) [L643] COND TRUE length > 0 VAL [\old(c)=0, c=1, length=1, list={9:0}] [L644] COND FALSE !(length < 0) VAL [\old(c)=0, c=1, length=1, list={9:0}] [L647] EXPR, FCALL \read(*list) VAL [\old(c)=0, \read(*list)={14:0}, c=1, length=1, list={9:0}] [L647] EXPR, FCALL list->next VAL [\old(c)=0, \read(*list)={14:0}, c=1, length=1, list={9:0}, list->next={0:0}] [L647] struct item *next = list->next; [L648] EXPR, FCALL \read(*list) VAL [\old(c)=0, \read(*list)={14:0}, c=1, length=1, list={9:0}, next={0:0}] [L648] FCALL free(list) VAL [\old(c)=0, \read(*list)={14:0}, c=1, length=1, list={9:0}, next={0:0}] [L649] FCALL list = next VAL [\old(c)=0, c=1, length=1, list={9:0}, next={0:0}] [L650] length-- VAL [\old(c)=0, c=1, length=0, list={9:0}, next={0:0}] [L652] COND FALSE !(length > 0) VAL [\old(c)=0, c=1, length=0, list={9:0}, next={0:0}] [L658] return 0; VAL [\old(c)=0, \result=0, c=1, length=0, list={9:0}, next={0:0}] [L637] FCALL struct item *list = ((void *)0); VAL [\old(c)=0, \result=0, c=1, length=0, list={9:0}, next={0:0}] [L658] return 0; VAL [\old(c)=0, \result=0, c=1, length=0, next={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 105 locations, 43 error locations. UNSAFE Result, 4.2s OverallTime, 21 OverallIterations, 2 TraceHistogramMax, 2.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1330 SDtfs, 925 SDslu, 3027 SDs, 0 SdLazy, 2449 SolverSat, 128 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 173 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 7/26 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 20 MinimizatonAttempts, 85 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 594 NumberOfCodeBlocks, 594 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 530 ConstructedInterpolants, 0 QuantifiedInterpolants, 102656 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 17 PerfectInterpolantSequences, 7/26 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_15-54-37-899.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_15-54-37-899.csv Received shutdown request...