java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 18:52:23,834 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 18:52:23,835 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 18:52:23,848 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 18:52:23,848 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 18:52:23,851 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 18:52:23,852 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 18:52:23,853 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 18:52:23,855 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 18:52:23,856 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 18:52:23,856 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 18:52:23,857 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 18:52:23,857 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 18:52:23,858 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 18:52:23,859 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 18:52:23,861 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 18:52:23,862 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 18:52:23,864 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 18:52:23,865 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 18:52:23,866 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 18:52:23,867 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 18:52:23,868 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 18:52:23,868 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 18:52:23,869 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 18:52:23,869 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 18:52:23,870 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 18:52:23,871 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 18:52:23,871 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 18:52:23,871 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 18:52:23,872 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 18:52:23,872 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 18:52:23,872 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-04 18:52:23,886 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 18:52:23,887 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 18:52:23,888 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 18:52:23,888 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 18:52:23,888 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 18:52:23,888 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 18:52:23,888 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 18:52:23,888 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 18:52:23,889 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 18:52:23,889 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 18:52:23,889 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 18:52:23,889 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 18:52:23,889 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 18:52:23,889 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 18:52:23,889 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 18:52:23,890 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 18:52:23,890 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 18:52:23,890 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 18:52:23,890 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 18:52:23,890 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 18:52:23,890 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 18:52:23,891 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 18:52:23,891 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 18:52:23,891 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 18:52:23,917 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 18:52:23,925 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 18:52:23,927 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 18:52:23,928 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 18:52:23,928 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 18:52:23,929 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c [2018-02-04 18:52:24,037 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 18:52:24,038 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 18:52:24,038 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 18:52:24,038 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 18:52:24,043 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 18:52:24,043 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 06:52:24" (1/1) ... [2018-02-04 18:52:24,045 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cf8f85b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:52:24, skipping insertion in model container [2018-02-04 18:52:24,045 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 06:52:24" (1/1) ... [2018-02-04 18:52:24,056 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 18:52:24,065 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 18:52:24,156 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 18:52:24,169 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 18:52:24,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:52:24 WrapperNode [2018-02-04 18:52:24,174 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 18:52:24,175 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 18:52:24,175 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 18:52:24,175 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 18:52:24,183 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:52:24" (1/1) ... [2018-02-04 18:52:24,183 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:52:24" (1/1) ... [2018-02-04 18:52:24,190 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:52:24" (1/1) ... [2018-02-04 18:52:24,190 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:52:24" (1/1) ... [2018-02-04 18:52:24,192 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:52:24" (1/1) ... [2018-02-04 18:52:24,194 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:52:24" (1/1) ... [2018-02-04 18:52:24,195 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:52:24" (1/1) ... [2018-02-04 18:52:24,196 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 18:52:24,197 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 18:52:24,197 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 18:52:24,197 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 18:52:24,198 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:52:24" (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 18:52:24,231 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 18:52:24,231 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 18:52:24,231 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-02-04 18:52:24,232 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 18:52:24,232 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 18:52:24,232 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 18:52:24,232 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 18:52:24,232 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 18:52:24,232 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 18:52:24,232 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-02-04 18:52:24,233 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 18:52:24,233 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 18:52:24,233 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 18:52:24,349 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 18:52:24,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 06:52:24 BoogieIcfgContainer [2018-02-04 18:52:24,350 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 18:52:24,350 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 18:52:24,350 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 18:52:24,352 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 18:52:24,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 06:52:24" (1/3) ... [2018-02-04 18:52:24,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35a3244b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 06:52:24, skipping insertion in model container [2018-02-04 18:52:24,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:52:24" (2/3) ... [2018-02-04 18:52:24,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35a3244b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 06:52:24, skipping insertion in model container [2018-02-04 18:52:24,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 06:52:24" (3/3) ... [2018-02-04 18:52:24,354 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength4_true-valid-memsafety_true-termination.c [2018-02-04 18:52:24,359 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 18:52:24,363 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-02-04 18:52:24,385 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 18:52:24,385 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 18:52:24,385 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 18:52:24,385 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 18:52:24,385 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 18:52:24,385 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 18:52:24,385 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 18:52:24,385 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 18:52:24,386 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 18:52:24,395 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-02-04 18:52:24,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-04 18:52:24,405 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:24,406 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:52:24,406 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:52:24,410 INFO L82 PathProgramCache]: Analyzing trace with hash -215054890, now seen corresponding path program 1 times [2018-02-04 18:52:24,412 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:24,412 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:24,454 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:24,454 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:24,454 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:24,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:24,490 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:24,549 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 18:52:24,551 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:52:24,551 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 18:52:24,552 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 18:52:24,560 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 18:52:24,560 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 18:52:24,561 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-02-04 18:52:24,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:24,615 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-02-04 18:52:24,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 18:52:24,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-02-04 18:52:24,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:24,624 INFO L225 Difference]: With dead ends: 63 [2018-02-04 18:52:24,624 INFO L226 Difference]: Without dead ends: 59 [2018-02-04 18:52:24,626 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 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 18:52:24,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-04 18:52:24,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2018-02-04 18:52:24,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 18:52:24,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-02-04 18:52:24,696 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 11 [2018-02-04 18:52:24,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:24,696 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-02-04 18:52:24,696 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 18:52:24,696 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-02-04 18:52:24,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 18:52:24,696 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:24,697 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:52:24,697 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:52:24,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1100032001, now seen corresponding path program 1 times [2018-02-04 18:52:24,697 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:24,697 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:24,698 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:24,698 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:24,698 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:24,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:24,711 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:24,737 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 18:52:24,737 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:52:24,738 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 18:52:24,739 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 18:52:24,740 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 18:52:24,740 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 18:52:24,740 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 3 states. [2018-02-04 18:52:24,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:24,765 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-02-04 18:52:24,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 18:52:24,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-02-04 18:52:24,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:24,768 INFO L225 Difference]: With dead ends: 60 [2018-02-04 18:52:24,768 INFO L226 Difference]: Without dead ends: 60 [2018-02-04 18:52:24,769 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 18:52:24,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-04 18:52:24,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2018-02-04 18:52:24,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 18:52:24,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-02-04 18:52:24,774 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2018-02-04 18:52:24,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:24,774 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-02-04 18:52:24,774 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 18:52:24,774 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-02-04 18:52:24,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 18:52:24,775 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:24,775 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:52:24,775 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:52:24,775 INFO L82 PathProgramCache]: Analyzing trace with hash -258746290, now seen corresponding path program 1 times [2018-02-04 18:52:24,775 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:24,775 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:24,776 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:24,776 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:24,777 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:24,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:24,789 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:24,898 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 18:52:24,898 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:52:24,898 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 18:52:24,899 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 18:52:24,899 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 18:52:24,899 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 18:52:24,899 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 6 states. [2018-02-04 18:52:24,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:24,995 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-02-04 18:52:24,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 18:52:24,995 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-02-04 18:52:24,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:24,996 INFO L225 Difference]: With dead ends: 54 [2018-02-04 18:52:24,996 INFO L226 Difference]: Without dead ends: 54 [2018-02-04 18:52:24,997 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-02-04 18:52:24,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-04 18:52:25,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-02-04 18:52:25,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 18:52:25,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-02-04 18:52:25,002 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 17 [2018-02-04 18:52:25,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:25,002 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-02-04 18:52:25,002 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 18:52:25,002 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-02-04 18:52:25,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 18:52:25,003 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:25,003 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:52:25,003 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:52:25,003 INFO L82 PathProgramCache]: Analyzing trace with hash -258746291, now seen corresponding path program 1 times [2018-02-04 18:52:25,004 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:25,004 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:25,004 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:25,004 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:25,005 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:25,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:25,013 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:25,039 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 18:52:25,039 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:52:25,039 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 18:52:25,039 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 18:52:25,039 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 18:52:25,039 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 18:52:25,040 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 5 states. [2018-02-04 18:52:25,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:25,062 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-02-04 18:52:25,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 18:52:25,063 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-04 18:52:25,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:25,063 INFO L225 Difference]: With dead ends: 50 [2018-02-04 18:52:25,063 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 18:52:25,063 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 18:52:25,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 18:52:25,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-04 18:52:25,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 18:52:25,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-02-04 18:52:25,066 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 17 [2018-02-04 18:52:25,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:25,066 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-02-04 18:52:25,066 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 18:52:25,066 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-02-04 18:52:25,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 18:52:25,067 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:25,067 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:52:25,067 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:52:25,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1933852231, now seen corresponding path program 1 times [2018-02-04 18:52:25,067 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:25,067 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:25,068 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:25,068 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:25,068 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:25,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:25,074 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:25,111 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:52:25,111 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:52:25,111 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:52:25,112 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:25,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:25,135 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:52:25,156 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:52:25,156 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:52:25,156 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3] total 8 [2018-02-04 18:52:25,156 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 18:52:25,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 18:52:25,157 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-04 18:52:25,157 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 9 states. [2018-02-04 18:52:25,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:25,246 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2018-02-04 18:52:25,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 18:52:25,247 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-02-04 18:52:25,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:25,247 INFO L225 Difference]: With dead ends: 60 [2018-02-04 18:52:25,248 INFO L226 Difference]: Without dead ends: 60 [2018-02-04 18:52:25,248 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-02-04 18:52:25,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-04 18:52:25,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-02-04 18:52:25,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 18:52:25,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2018-02-04 18:52:25,252 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 22 [2018-02-04 18:52:25,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:25,252 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2018-02-04 18:52:25,252 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 18:52:25,252 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2018-02-04 18:52:25,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 18:52:25,253 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:25,253 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:52:25,253 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:52:25,253 INFO L82 PathProgramCache]: Analyzing trace with hash 687601263, now seen corresponding path program 1 times [2018-02-04 18:52:25,253 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:25,254 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:25,254 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:25,255 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:25,255 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:25,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:25,266 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:25,300 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-04 18:52:25,300 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:52:25,300 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 18:52:25,300 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 18:52:25,301 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 18:52:25,301 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-04 18:52:25,301 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 5 states. [2018-02-04 18:52:25,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:25,334 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2018-02-04 18:52:25,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 18:52:25,335 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-02-04 18:52:25,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:25,336 INFO L225 Difference]: With dead ends: 70 [2018-02-04 18:52:25,336 INFO L226 Difference]: Without dead ends: 70 [2018-02-04 18:52:25,336 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 18:52:25,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-04 18:52:25,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 56. [2018-02-04 18:52:25,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-04 18:52:25,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-02-04 18:52:25,339 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 41 [2018-02-04 18:52:25,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:25,340 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-02-04 18:52:25,340 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 18:52:25,340 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-02-04 18:52:25,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-04 18:52:25,341 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:25,341 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:52:25,341 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:52:25,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1072164206, now seen corresponding path program 1 times [2018-02-04 18:52:25,342 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:25,342 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:25,343 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:25,343 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:25,343 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:25,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:25,363 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:25,413 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-04 18:52:25,414 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:52:25,414 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:52:25,415 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:25,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:25,430 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:52:25,445 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-04 18:52:25,446 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:52:25,446 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-02-04 18:52:25,446 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 18:52:25,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 18:52:25,447 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-04 18:52:25,447 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 5 states. [2018-02-04 18:52:25,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:25,511 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2018-02-04 18:52:25,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 18:52:25,511 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-02-04 18:52:25,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:25,512 INFO L225 Difference]: With dead ends: 84 [2018-02-04 18:52:25,512 INFO L226 Difference]: Without dead ends: 84 [2018-02-04 18:52:25,512 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 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 18:52:25,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-04 18:52:25,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 67. [2018-02-04 18:52:25,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-04 18:52:25,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2018-02-04 18:52:25,517 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 49 [2018-02-04 18:52:25,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:25,517 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2018-02-04 18:52:25,517 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 18:52:25,517 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2018-02-04 18:52:25,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-02-04 18:52:25,520 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:52:25,520 INFO L351 BasicCegarLoop]: trace histogram [8, 6, 6, 6, 6, 6, 3, 2, 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] [2018-02-04 18:52:25,520 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:52:25,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1102390087, now seen corresponding path program 2 times [2018-02-04 18:52:25,521 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:52:25,521 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:52:25,521 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:25,522 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:52:25,522 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:52:25,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:52:25,542 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:52:25,591 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-02-04 18:52:25,592 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:52:25,592 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:52:25,592 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 18:52:25,603 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-04 18:52:25,604 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:52:25,607 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:52:25,642 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:25,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-02-04 18:52:25,649 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:25,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:25,651 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-04 18:52:25,700 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:52:25,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-02-04 18:52:25,702 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:52:25,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:52:25,704 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-04 18:52:25,738 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_~#mask~0.base| Int)) (and (= (store |c_old(#valid)| |main_~#mask~0.base| 0) |c_#valid|) (= (select |c_old(#valid)| |main_~#mask~0.base|) 0))) is different from true [2018-02-04 18:52:25,757 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-02-04 18:52:25,758 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:52:25,758 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2018-02-04 18:52:25,758 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 18:52:25,759 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 18:52:25,759 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=40, Unknown=1, NotChecked=12, Total=72 [2018-02-04 18:52:25,759 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand 9 states. [2018-02-04 18:52:26,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:52:26,030 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2018-02-04 18:52:26,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 18:52:26,031 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 79 [2018-02-04 18:52:26,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:52:26,031 INFO L225 Difference]: With dead ends: 97 [2018-02-04 18:52:26,032 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 18:52:26,032 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 74 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=175, Unknown=1, NotChecked=28, Total=272 [2018-02-04 18:52:26,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 18:52:26,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 18:52:26,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 18:52:26,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 18:52:26,033 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 79 [2018-02-04 18:52:26,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:52:26,033 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 18:52:26,033 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 18:52:26,033 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 18:52:26,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 18:52:26,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 06:52:26 BoogieIcfgContainer [2018-02-04 18:52:26,039 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 18:52:26,039 INFO L168 Benchmark]: Toolchain (without parser) took 2002.27 ms. Allocated memory was 402.7 MB in the beginning and 629.7 MB in the end (delta: 227.0 MB). Free memory was 357.9 MB in the beginning and 545.0 MB in the end (delta: -187.1 MB). Peak memory consumption was 39.9 MB. Max. memory is 5.3 GB. [2018-02-04 18:52:26,040 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 402.7 MB. Free memory is still 363.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 18:52:26,041 INFO L168 Benchmark]: CACSL2BoogieTranslator took 136.19 ms. Allocated memory is still 402.7 MB. Free memory was 357.9 MB in the beginning and 350.0 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 5.3 GB. [2018-02-04 18:52:26,041 INFO L168 Benchmark]: Boogie Preprocessor took 21.56 ms. Allocated memory is still 402.7 MB. Free memory was 350.0 MB in the beginning and 347.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 18:52:26,041 INFO L168 Benchmark]: RCFGBuilder took 153.11 ms. Allocated memory is still 402.7 MB. Free memory was 347.4 MB in the beginning and 331.2 MB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 5.3 GB. [2018-02-04 18:52:26,041 INFO L168 Benchmark]: TraceAbstraction took 1688.72 ms. Allocated memory was 402.7 MB in the beginning and 629.7 MB in the end (delta: 227.0 MB). Free memory was 329.9 MB in the beginning and 545.0 MB in the end (delta: -215.2 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. [2018-02-04 18:52:26,042 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.09 ms. Allocated memory is still 402.7 MB. Free memory is still 363.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 136.19 ms. Allocated memory is still 402.7 MB. Free memory was 357.9 MB in the beginning and 350.0 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 21.56 ms. Allocated memory is still 402.7 MB. Free memory was 350.0 MB in the beginning and 347.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 153.11 ms. Allocated memory is still 402.7 MB. Free memory was 347.4 MB in the beginning and 331.2 MB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1688.72 ms. Allocated memory was 402.7 MB in the beginning and 629.7 MB in the end (delta: 227.0 MB). Free memory was 329.9 MB in the beginning and 545.0 MB in the end (delta: -215.2 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 26]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 21]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 29]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 46 locations, 6 error locations. SAFE Result, 1.6s OverallTime, 8 OverallIterations, 8 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 284 SDtfs, 338 SDslu, 518 SDs, 0 SdLazy, 343 SolverSat, 72 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 196 GetRequests, 148 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 52 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 402 NumberOfCodeBlocks, 342 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 391 ConstructedInterpolants, 50 QuantifiedInterpolants, 67703 SizeOfPredicates, 2 NumberOfNonLiveVariables, 240 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 11 InterpolantComputations, 6 PerfectInterpolantSequences, 327/345 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_18-52-26-048.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_18-52-26-048.csv Received shutdown request...