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/memsafety/lockfree-3.2_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 15:17:53,716 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 15:17:53,718 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 15:17:53,728 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 15:17:53,728 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 15:17:53,729 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 15:17:53,730 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 15:17:53,731 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 15:17:53,733 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 15:17:53,733 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 15:17:53,734 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 15:17:53,734 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 15:17:53,735 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 15:17:53,736 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 15:17:53,737 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 15:17:53,738 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 15:17:53,740 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 15:17:53,741 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 15:17:53,742 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 15:17:53,743 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 15:17:53,744 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 15:17:53,745 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 15:17:53,745 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 15:17:53,746 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 15:17:53,746 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 15:17:53,747 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 15:17:53,747 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 15:17:53,748 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 15:17:53,748 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 15:17:53,748 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 15:17:53,749 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 15:17:53,749 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:17:53,758 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 15:17:53,758 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 15:17:53,759 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 15:17:53,759 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 15:17:53,760 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 15:17:53,760 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 15:17:53,760 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 15:17:53,760 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 15:17:53,760 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 15:17:53,760 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 15:17:53,761 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 15:17:53,761 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 15:17:53,761 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 15:17:53,761 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 15:17:53,761 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 15:17:53,761 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 15:17:53,762 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 15:17:53,762 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 15:17:53,762 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 15:17:53,762 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 15:17:53,762 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 15:17:53,762 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 15:17:53,789 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 15:17:53,796 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 15:17:53,799 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 15:17:53,800 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 15:17:53,800 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 15:17:53,801 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/lockfree-3.2_false-valid-memtrack.i [2018-02-04 15:17:53,943 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 15:17:53,944 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 15:17:53,944 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 15:17:53,944 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 15:17:53,950 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 15:17:53,951 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:17:53" (1/1) ... [2018-02-04 15:17:53,953 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34e66bcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:17:53, skipping insertion in model container [2018-02-04 15:17:53,953 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:17:53" (1/1) ... [2018-02-04 15:17:53,966 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 15:17:53,992 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 15:17:54,078 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 15:17:54,091 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 15:17:54,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:17:54 WrapperNode [2018-02-04 15:17:54,096 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 15:17:54,097 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 15:17:54,097 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 15:17:54,097 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 15:17:54,107 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:17:54" (1/1) ... [2018-02-04 15:17:54,107 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:17:54" (1/1) ... [2018-02-04 15:17:54,114 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:17:54" (1/1) ... [2018-02-04 15:17:54,114 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:17:54" (1/1) ... [2018-02-04 15:17:54,118 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:17:54" (1/1) ... [2018-02-04 15:17:54,121 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:17:54" (1/1) ... [2018-02-04 15:17:54,122 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:17:54" (1/1) ... [2018-02-04 15:17:54,123 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 15:17:54,124 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 15:17:54,124 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 15:17:54,124 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 15:17:54,124 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:17:54" (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:17:54,158 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 15:17:54,158 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 15:17:54,158 INFO L136 BoogieDeclarations]: Found implementation of procedure push [2018-02-04 15:17:54,158 INFO L136 BoogieDeclarations]: Found implementation of procedure pop [2018-02-04 15:17:54,158 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 15:17:54,158 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 15:17:54,158 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 15:17:54,158 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 15:17:54,159 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 15:17:54,159 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 15:17:54,159 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 15:17:54,159 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 15:17:54,159 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 15:17:54,159 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 15:17:54,159 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 15:17:54,159 INFO L128 BoogieDeclarations]: Found specification of procedure push [2018-02-04 15:17:54,159 INFO L128 BoogieDeclarations]: Found specification of procedure pop [2018-02-04 15:17:54,159 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 15:17:54,159 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 15:17:54,159 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 15:17:54,405 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 15:17:54,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:17:54 BoogieIcfgContainer [2018-02-04 15:17:54,405 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 15:17:54,406 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 15:17:54,406 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 15:17:54,408 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 15:17:54,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 03:17:53" (1/3) ... [2018-02-04 15:17:54,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c765b65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:17:54, skipping insertion in model container [2018-02-04 15:17:54,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:17:54" (2/3) ... [2018-02-04 15:17:54,409 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c765b65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:17:54, skipping insertion in model container [2018-02-04 15:17:54,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:17:54" (3/3) ... [2018-02-04 15:17:54,410 INFO L107 eAbstractionObserver]: Analyzing ICFG lockfree-3.2_false-valid-memtrack.i [2018-02-04 15:17:54,415 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 15:17:54,419 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-02-04 15:17:54,440 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 15:17:54,440 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 15:17:54,440 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 15:17:54,440 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 15:17:54,440 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 15:17:54,441 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 15:17:54,442 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 15:17:54,442 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 15:17:54,443 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 15:17:54,455 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-02-04 15:17:54,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-02-04 15:17:54,463 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:17:54,464 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:17:54,464 INFO L371 AbstractCegarLoop]: === Iteration 1 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 15:17:54,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1799126466, now seen corresponding path program 1 times [2018-02-04 15:17:54,502 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:17:54,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:17:54,548 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:17:54,580 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:17:54,582 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:17:54,583 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 15:17:54,584 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:17:54,584 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:17:54,584 INFO L182 omatonBuilderFactory]: Interpolants [80#false, 79#true] [2018-02-04 15:17:54,585 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:17:54,585 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-04 15:17:54,597 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-04 15:17:54,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-04 15:17:54,600 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 2 states. [2018-02-04 15:17:54,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:17:54,692 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2018-02-04 15:17:54,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-04 15:17:54,693 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-02-04 15:17:54,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:17:54,700 INFO L225 Difference]: With dead ends: 76 [2018-02-04 15:17:54,701 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 15:17:54,702 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-04 15:17:54,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 15:17:54,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-02-04 15:17:54,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-04 15:17:54,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 90 transitions. [2018-02-04 15:17:54,725 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 90 transitions. Word has length 9 [2018-02-04 15:17:54,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:17:54,726 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 90 transitions. [2018-02-04 15:17:54,726 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-04 15:17:54,726 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2018-02-04 15:17:54,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-04 15:17:54,726 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:17:54,726 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:17:54,726 INFO L371 AbstractCegarLoop]: === Iteration 2 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 15:17:54,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1199640283, now seen corresponding path program 1 times [2018-02-04 15:17:54,728 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:17:54,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:17:54,744 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:17:54,770 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:17:54,770 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:17:54,771 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 15:17:54,771 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:17:54,771 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:17:54,771 INFO L182 omatonBuilderFactory]: Interpolants [230#true, 231#false, 232#|main_#t~short13|] [2018-02-04 15:17:54,772 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:17:54,773 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 15:17:54,773 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 15:17:54,773 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 15:17:54,774 INFO L87 Difference]: Start difference. First operand 73 states and 90 transitions. Second operand 3 states. [2018-02-04 15:17:54,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:17:54,786 INFO L93 Difference]: Finished difference Result 74 states and 91 transitions. [2018-02-04 15:17:54,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 15:17:54,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-02-04 15:17:54,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:17:54,787 INFO L225 Difference]: With dead ends: 74 [2018-02-04 15:17:54,787 INFO L226 Difference]: Without dead ends: 74 [2018-02-04 15:17:54,788 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:17:54,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-04 15:17:54,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-02-04 15:17:54,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-04 15:17:54,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2018-02-04 15:17:54,792 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 12 [2018-02-04 15:17:54,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:17:54,792 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2018-02-04 15:17:54,792 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 15:17:54,793 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2018-02-04 15:17:54,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-04 15:17:54,793 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:17:54,793 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:17:54,793 INFO L371 AbstractCegarLoop]: === Iteration 3 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 15:17:54,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1201487325, now seen corresponding path program 1 times [2018-02-04 15:17:54,794 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:17:54,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:17:54,812 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:17:54,855 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:17:54,855 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:17:54,856 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 15:17:54,856 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:17:54,856 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:17:54,856 INFO L182 omatonBuilderFactory]: Interpolants [381#true, 382#false, 383#(and (= 0 ~garbage.base) (= 0 ~garbage.offset))] [2018-02-04 15:17:54,856 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:17:54,856 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 15:17:54,857 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 15:17:54,857 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 15:17:54,857 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand 3 states. [2018-02-04 15:17:54,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:17:54,891 INFO L93 Difference]: Finished difference Result 132 states and 167 transitions. [2018-02-04 15:17:54,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 15:17:54,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-02-04 15:17:54,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:17:54,893 INFO L225 Difference]: With dead ends: 132 [2018-02-04 15:17:54,893 INFO L226 Difference]: Without dead ends: 132 [2018-02-04 15:17:54,893 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 15:17:54,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-04 15:17:54,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 114. [2018-02-04 15:17:54,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-04 15:17:54,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2018-02-04 15:17:54,901 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 12 [2018-02-04 15:17:54,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:17:54,902 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2018-02-04 15:17:54,902 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 15:17:54,902 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2018-02-04 15:17:54,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 15:17:54,902 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:17:54,902 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:17:54,902 INFO L371 AbstractCegarLoop]: === Iteration 4 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 15:17:54,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1408600152, now seen corresponding path program 1 times [2018-02-04 15:17:54,903 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:17:54,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:17:54,912 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:17:54,928 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:17:54,928 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:17:54,928 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 15:17:54,929 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:17:54,929 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:17:54,929 INFO L182 omatonBuilderFactory]: Interpolants [630#true, 631#false, 632#(= |#valid| |old(#valid)|)] [2018-02-04 15:17:54,929 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:17:54,929 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 15:17:54,930 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 15:17:54,930 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 15:17:54,930 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand 3 states. [2018-02-04 15:17:54,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:17:54,996 INFO L93 Difference]: Finished difference Result 147 states and 205 transitions. [2018-02-04 15:17:54,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 15:17:54,997 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-02-04 15:17:54,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:17:54,998 INFO L225 Difference]: With dead ends: 147 [2018-02-04 15:17:54,998 INFO L226 Difference]: Without dead ends: 143 [2018-02-04 15:17:54,998 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:17:54,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-04 15:17:55,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 135. [2018-02-04 15:17:55,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-04 15:17:55,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 192 transitions. [2018-02-04 15:17:55,006 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 192 transitions. Word has length 13 [2018-02-04 15:17:55,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:17:55,006 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 192 transitions. [2018-02-04 15:17:55,006 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 15:17:55,006 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 192 transitions. [2018-02-04 15:17:55,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 15:17:55,006 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:17:55,006 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:17:55,006 INFO L371 AbstractCegarLoop]: === Iteration 5 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 15:17:55,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1628464921, now seen corresponding path program 1 times [2018-02-04 15:17:55,007 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:17:55,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:17:55,019 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:17:55,056 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:17:55,056 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:17:55,056 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 15:17:55,056 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:17:55,056 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:17:55,056 INFO L182 omatonBuilderFactory]: Interpolants [915#true, 916#false, 917#(<= ~pc1 1), 918#(<= |push_#t~post0| 1), 919#(not |push_#t~switch1|)] [2018-02-04 15:17:55,057 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:17:55,057 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 15:17:55,057 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 15:17:55,057 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 15:17:55,057 INFO L87 Difference]: Start difference. First operand 135 states and 192 transitions. Second operand 5 states. [2018-02-04 15:17:55,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:17:55,117 INFO L93 Difference]: Finished difference Result 255 states and 357 transitions. [2018-02-04 15:17:55,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 15:17:55,120 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-04 15:17:55,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:17:55,122 INFO L225 Difference]: With dead ends: 255 [2018-02-04 15:17:55,122 INFO L226 Difference]: Without dead ends: 255 [2018-02-04 15:17:55,123 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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 15:17:55,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-02-04 15:17:55,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 226. [2018-02-04 15:17:55,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-02-04 15:17:55,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 338 transitions. [2018-02-04 15:17:55,148 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 338 transitions. Word has length 15 [2018-02-04 15:17:55,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:17:55,148 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 338 transitions. [2018-02-04 15:17:55,148 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 15:17:55,148 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 338 transitions. [2018-02-04 15:17:55,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 15:17:55,149 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:17:55,149 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:17:55,149 INFO L371 AbstractCegarLoop]: === Iteration 6 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 15:17:55,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474006, now seen corresponding path program 1 times [2018-02-04 15:17:55,150 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:17:55,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:17:55,159 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:17:55,180 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:17:55,180 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:17:55,180 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 15:17:55,180 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:17:55,181 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:17:55,181 INFO L182 omatonBuilderFactory]: Interpolants [1403#true, 1404#false, 1405#(= 1 (select |#valid| |push_#t~malloc2.base|)), 1406#(= 1 (select |#valid| ~x1.base))] [2018-02-04 15:17:55,181 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:17:55,181 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 15:17:55,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 15:17:55,181 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 15:17:55,182 INFO L87 Difference]: Start difference. First operand 226 states and 338 transitions. Second operand 4 states. [2018-02-04 15:17:55,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:17:55,259 INFO L93 Difference]: Finished difference Result 386 states and 569 transitions. [2018-02-04 15:17:55,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 15:17:55,259 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-04 15:17:55,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:17:55,261 INFO L225 Difference]: With dead ends: 386 [2018-02-04 15:17:55,261 INFO L226 Difference]: Without dead ends: 386 [2018-02-04 15:17:55,261 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:17:55,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-02-04 15:17:55,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 358. [2018-02-04 15:17:55,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-02-04 15:17:55,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 548 transitions. [2018-02-04 15:17:55,271 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 548 transitions. Word has length 16 [2018-02-04 15:17:55,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:17:55,272 INFO L432 AbstractCegarLoop]: Abstraction has 358 states and 548 transitions. [2018-02-04 15:17:55,272 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 15:17:55,272 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 548 transitions. [2018-02-04 15:17:55,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 15:17:55,272 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:17:55,272 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:17:55,272 INFO L371 AbstractCegarLoop]: === Iteration 7 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 15:17:55,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474005, now seen corresponding path program 1 times [2018-02-04 15:17:55,273 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:17:55,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:17:55,279 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:17:55,307 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:17:55,307 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:17:55,307 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 15:17:55,307 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:17:55,307 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:17:55,308 INFO L182 omatonBuilderFactory]: Interpolants [2153#true, 2154#false, 2155#(and (= 8 (select |#length| |push_#t~malloc2.base|)) (= 0 |push_#t~malloc2.offset|)), 2156#(and (= (select |#length| ~x1.base) 8) (= ~x1.offset 0))] [2018-02-04 15:17:55,308 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:17:55,308 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 15:17:55,308 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 15:17:55,308 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 15:17:55,308 INFO L87 Difference]: Start difference. First operand 358 states and 548 transitions. Second operand 4 states. [2018-02-04 15:17:55,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:17:55,384 INFO L93 Difference]: Finished difference Result 485 states and 716 transitions. [2018-02-04 15:17:55,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 15:17:55,385 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-04 15:17:55,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:17:55,387 INFO L225 Difference]: With dead ends: 485 [2018-02-04 15:17:55,387 INFO L226 Difference]: Without dead ends: 485 [2018-02-04 15:17:55,387 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:17:55,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-02-04 15:17:55,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 460. [2018-02-04 15:17:55,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-02-04 15:17:55,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 696 transitions. [2018-02-04 15:17:55,405 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 696 transitions. Word has length 16 [2018-02-04 15:17:55,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:17:55,405 INFO L432 AbstractCegarLoop]: Abstraction has 460 states and 696 transitions. [2018-02-04 15:17:55,405 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 15:17:55,405 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 696 transitions. [2018-02-04 15:17:55,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 15:17:55,406 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:17:55,406 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:17:55,406 INFO L371 AbstractCegarLoop]: === Iteration 8 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 15:17:55,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1708141764, now seen corresponding path program 1 times [2018-02-04 15:17:55,407 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:17:55,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:17:55,415 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:17:55,442 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:17:55,442 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:17:55,442 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 15:17:55,442 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:17:55,443 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:17:55,443 INFO L182 omatonBuilderFactory]: Interpolants [3104#true, 3105#false, 3106#(<= ~pc4 1), 3107#(<= |pop_#t~post7| 1), 3108#(not |pop_#t~switch8|)] [2018-02-04 15:17:55,443 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:17:55,443 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 15:17:55,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 15:17:55,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 15:17:55,443 INFO L87 Difference]: Start difference. First operand 460 states and 696 transitions. Second operand 5 states. [2018-02-04 15:17:55,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:17:55,489 INFO L93 Difference]: Finished difference Result 861 states and 1225 transitions. [2018-02-04 15:17:55,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 15:17:55,490 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-02-04 15:17:55,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:17:55,494 INFO L225 Difference]: With dead ends: 861 [2018-02-04 15:17:55,494 INFO L226 Difference]: Without dead ends: 861 [2018-02-04 15:17:55,494 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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 15:17:55,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2018-02-04 15:17:55,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 828. [2018-02-04 15:17:55,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2018-02-04 15:17:55,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1196 transitions. [2018-02-04 15:17:55,519 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1196 transitions. Word has length 16 [2018-02-04 15:17:55,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:17:55,519 INFO L432 AbstractCegarLoop]: Abstraction has 828 states and 1196 transitions. [2018-02-04 15:17:55,519 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 15:17:55,519 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1196 transitions. [2018-02-04 15:17:55,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 15:17:55,520 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:17:55,520 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:17:55,521 INFO L371 AbstractCegarLoop]: === Iteration 9 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 15:17:55,521 INFO L82 PathProgramCache]: Analyzing trace with hash 750766986, now seen corresponding path program 1 times [2018-02-04 15:17:55,521 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:17:55,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:17:55,532 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:17:55,573 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:17:55,573 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:17:55,573 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 15:17:55,573 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:17:55,574 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:17:55,574 INFO L182 omatonBuilderFactory]: Interpolants [4800#true, 4801#false, 4802#(or (not |pop_#t~switch8|) (<= ~pc4 2)), 4803#(<= ~pc4 2), 4804#(<= |pop_#t~post7| 2), 4805#(not |pop_#t~switch8|)] [2018-02-04 15:17:55,574 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:17:55,574 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 15:17:55,575 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 15:17:55,575 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 15:17:55,575 INFO L87 Difference]: Start difference. First operand 828 states and 1196 transitions. Second operand 6 states. [2018-02-04 15:17:55,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:17:55,660 INFO L93 Difference]: Finished difference Result 1289 states and 1809 transitions. [2018-02-04 15:17:55,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 15:17:55,660 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-04 15:17:55,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:17:55,666 INFO L225 Difference]: With dead ends: 1289 [2018-02-04 15:17:55,666 INFO L226 Difference]: Without dead ends: 1289 [2018-02-04 15:17:55,666 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-04 15:17:55,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2018-02-04 15:17:55,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1220. [2018-02-04 15:17:55,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1220 states. [2018-02-04 15:17:55,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 1220 states and 1744 transitions. [2018-02-04 15:17:55,699 INFO L78 Accepts]: Start accepts. Automaton has 1220 states and 1744 transitions. Word has length 26 [2018-02-04 15:17:55,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:17:55,699 INFO L432 AbstractCegarLoop]: Abstraction has 1220 states and 1744 transitions. [2018-02-04 15:17:55,699 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 15:17:55,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 1744 transitions. [2018-02-04 15:17:55,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 15:17:55,701 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:17:55,701 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:17:55,701 INFO L371 AbstractCegarLoop]: === Iteration 10 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 15:17:55,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1952857995, now seen corresponding path program 1 times [2018-02-04 15:17:55,702 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:17:55,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:17:55,712 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:17:55,765 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:17:55,765 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:17:55,765 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 15:17:55,765 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:17:55,765 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:17:55,766 INFO L182 omatonBuilderFactory]: Interpolants [7321#true, 7322#false, 7323#(= 0 ~S.base), 7324#(or (not (= ~S.offset 0)) (not (= 1 ~pc4)) (not |main_#t~short13|)), 7325#(or (not (= ~S.offset 0)) (not (= 1 ~pc4))), 7326#(= ~S.offset |old(~S.offset)|), 7327#|main_#t~short13|] [2018-02-04 15:17:55,766 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:17:55,766 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 15:17:55,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 15:17:55,766 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-04 15:17:55,766 INFO L87 Difference]: Start difference. First operand 1220 states and 1744 transitions. Second operand 7 states. [2018-02-04 15:17:55,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:17:55,880 INFO L93 Difference]: Finished difference Result 3241 states and 4724 transitions. [2018-02-04 15:17:55,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 15:17:55,891 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-02-04 15:17:55,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:17:55,905 INFO L225 Difference]: With dead ends: 3241 [2018-02-04 15:17:55,905 INFO L226 Difference]: Without dead ends: 3241 [2018-02-04 15:17:55,905 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-02-04 15:17:55,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3241 states. [2018-02-04 15:17:55,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3241 to 3128. [2018-02-04 15:17:55,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2018-02-04 15:17:55,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 4498 transitions. [2018-02-04 15:17:55,991 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 4498 transitions. Word has length 27 [2018-02-04 15:17:55,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:17:55,991 INFO L432 AbstractCegarLoop]: Abstraction has 3128 states and 4498 transitions. [2018-02-04 15:17:55,991 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 15:17:55,991 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 4498 transitions. [2018-02-04 15:17:55,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 15:17:55,993 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:17:55,993 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:17:55,993 INFO L371 AbstractCegarLoop]: === Iteration 11 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 15:17:55,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1524460851, now seen corresponding path program 1 times [2018-02-04 15:17:55,994 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:17:56,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 15:17:56,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 15:17:56,045 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 15:17:56,068 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-04 15:17:56,077 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-04 15:17:56,078 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-04 15:17:56,079 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-04 15:17:56,079 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-04 15:17:56,080 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-04 15:17:56,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 03:17:56 BoogieIcfgContainer [2018-02-04 15:17:56,091 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 15:17:56,091 INFO L168 Benchmark]: Toolchain (without parser) took 2148.09 ms. Allocated memory was 405.3 MB in the beginning and 644.9 MB in the end (delta: 239.6 MB). Free memory was 362.2 MB in the beginning and 506.9 MB in the end (delta: -144.7 MB). Peak memory consumption was 94.9 MB. Max. memory is 5.3 GB. [2018-02-04 15:17:56,092 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 405.3 MB. Free memory is still 368.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 15:17:56,092 INFO L168 Benchmark]: CACSL2BoogieTranslator took 152.42 ms. Allocated memory is still 405.3 MB. Free memory was 362.2 MB in the beginning and 351.6 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:17:56,093 INFO L168 Benchmark]: Boogie Preprocessor took 26.47 ms. Allocated memory is still 405.3 MB. Free memory was 351.6 MB in the beginning and 348.9 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:17:56,093 INFO L168 Benchmark]: RCFGBuilder took 281.97 ms. Allocated memory is still 405.3 MB. Free memory was 348.9 MB in the beginning and 321.6 MB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 5.3 GB. [2018-02-04 15:17:56,093 INFO L168 Benchmark]: TraceAbstraction took 1684.73 ms. Allocated memory was 405.3 MB in the beginning and 644.9 MB in the end (delta: 239.6 MB). Free memory was 321.6 MB in the beginning and 506.9 MB in the end (delta: -185.2 MB). Peak memory consumption was 54.4 MB. Max. memory is 5.3 GB. [2018-02-04 15:17:56,094 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 405.3 MB. Free memory is still 368.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 152.42 ms. Allocated memory is still 405.3 MB. Free memory was 362.2 MB in the beginning and 351.6 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 26.47 ms. Allocated memory is still 405.3 MB. Free memory was 351.6 MB in the beginning and 348.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 281.97 ms. Allocated memory is still 405.3 MB. Free memory was 348.9 MB in the beginning and 321.6 MB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1684.73 ms. Allocated memory was 405.3 MB in the beginning and 644.9 MB in the end (delta: 239.6 MB). Free memory was 321.6 MB in the beginning and 506.9 MB in the end (delta: -185.2 MB). Peak memory consumption was 54.4 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.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 688]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L625] int pc1 = 1; [L626] int pc4 = 1; [L624] struct cell *S; [L627] static struct cell *t1 = ((void *)0); [L628] static struct cell *x1 = ((void *)0); [L657] struct cell* garbage; [L658] static struct cell *t4 = ((void *)0); [L659] static struct cell *x4 = ((void *)0); [L662] static int res4; VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] S || 1 != pc4 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, __VERIFIER_nondet_int()=1, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, S || 1 != pc4 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L631] pc1++ [L632] case 1: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L633] EXPR, FCALL malloc(sizeof(*x1)) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, malloc(sizeof(*x1))={12:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L633] x1 = malloc(sizeof(*x1)) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, malloc(sizeof(*x1))={12:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L634] FCALL x1->data = 0 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, malloc(sizeof(*x1))={12:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L635] RET, FCALL x1->next = ((void *)0) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, malloc(sizeof(*x1))={12:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] S || 1 != pc4 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, __VERIFIER_nondet_int()=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, S || 1 != pc4 || __VERIFIER_nondet_int()=0, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] COND FALSE !(S || 1 != pc4 || __VERIFIER_nondet_int()) [L696] COND FALSE !(\read(*garbage)) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L701] S = ((void *)0) [L702] t1 = ((void *)0) [L703] x1 = ((void *)0) [L704] t4 = ((void *)0) [L705] x4 = ((void *)0) [L706] return !!garbage; VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, \result=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 76 locations, 19 error locations. UNSAFE Result, 1.6s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 932 SDtfs, 809 SDslu, 1466 SDs, 0 SdLazy, 368 SolverSat, 109 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3128occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 8/12 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 323 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 189 NumberOfCodeBlocks, 189 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 152 ConstructedInterpolants, 0 QuantifiedInterpolants, 7141 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 8/12 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/lockfree-3.2_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_15-17-56-100.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.2_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_15-17-56-100.csv Received shutdown request...