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-ccafca9-m [2018-02-04 02:03:38,039 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 02:03:38,040 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 02:03:38,051 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 02:03:38,051 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 02:03:38,052 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 02:03:38,053 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 02:03:38,054 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 02:03:38,056 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 02:03:38,056 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 02:03:38,057 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 02:03:38,057 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 02:03:38,058 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 02:03:38,059 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 02:03:38,059 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 02:03:38,061 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 02:03:38,063 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 02:03:38,064 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 02:03:38,065 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 02:03:38,066 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 02:03:38,068 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 02:03:38,068 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 02:03:38,068 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 02:03:38,069 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 02:03:38,070 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 02:03:38,071 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 02:03:38,071 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 02:03:38,071 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 02:03:38,071 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 02:03:38,072 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 02:03:38,072 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 02:03:38,072 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 02:03:38,082 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 02:03:38,083 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 02:03:38,084 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 02:03:38,084 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 02:03:38,084 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 02:03:38,085 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 02:03:38,085 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 02:03:38,085 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 02:03:38,085 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 02:03:38,085 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 02:03:38,085 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 02:03:38,086 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 02:03:38,086 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 02:03:38,086 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 02:03:38,086 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 02:03:38,086 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 02:03:38,086 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 02:03:38,087 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 02:03:38,087 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 02:03:38,087 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 02:03:38,087 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 02:03:38,087 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 02:03:38,087 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 02:03:38,122 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 02:03:38,135 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 02:03:38,139 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 02:03:38,141 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 02:03:38,141 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 02:03:38,141 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 02:03:38,277 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 02:03:38,278 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 02:03:38,279 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 02:03:38,279 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 02:03:38,284 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 02:03:38,284 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:03:38" (1/1) ... [2018-02-04 02:03:38,286 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ece180a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:03:38, skipping insertion in model container [2018-02-04 02:03:38,286 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:03:38" (1/1) ... [2018-02-04 02:03:38,300 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 02:03:38,329 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 02:03:38,420 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 02:03:38,434 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 02:03:38,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:03:38 WrapperNode [2018-02-04 02:03:38,438 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 02:03:38,439 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 02:03:38,439 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 02:03:38,439 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 02:03:38,449 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:03:38" (1/1) ... [2018-02-04 02:03:38,449 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:03:38" (1/1) ... [2018-02-04 02:03:38,457 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:03:38" (1/1) ... [2018-02-04 02:03:38,458 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:03:38" (1/1) ... [2018-02-04 02:03:38,461 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:03:38" (1/1) ... [2018-02-04 02:03:38,463 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:03:38" (1/1) ... [2018-02-04 02:03:38,464 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:03:38" (1/1) ... [2018-02-04 02:03:38,466 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 02:03:38,466 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 02:03:38,466 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 02:03:38,466 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 02:03:38,467 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:03:38" (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 02:03:38,502 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 02:03:38,502 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 02:03:38,502 INFO L136 BoogieDeclarations]: Found implementation of procedure push [2018-02-04 02:03:38,503 INFO L136 BoogieDeclarations]: Found implementation of procedure pop [2018-02-04 02:03:38,503 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 02:03:38,503 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 02:03:38,503 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 02:03:38,503 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 02:03:38,503 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 02:03:38,503 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 02:03:38,503 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 02:03:38,503 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 02:03:38,503 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 02:03:38,503 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 02:03:38,503 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 02:03:38,504 INFO L128 BoogieDeclarations]: Found specification of procedure push [2018-02-04 02:03:38,504 INFO L128 BoogieDeclarations]: Found specification of procedure pop [2018-02-04 02:03:38,504 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 02:03:38,504 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 02:03:38,504 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 02:03:38,784 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 02:03:38,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:03:38 BoogieIcfgContainer [2018-02-04 02:03:38,785 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 02:03:38,785 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 02:03:38,785 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 02:03:38,788 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 02:03:38,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 02:03:38" (1/3) ... [2018-02-04 02:03:38,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f4b0ba7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:03:38, skipping insertion in model container [2018-02-04 02:03:38,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:03:38" (2/3) ... [2018-02-04 02:03:38,790 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f4b0ba7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:03:38, skipping insertion in model container [2018-02-04 02:03:38,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:03:38" (3/3) ... [2018-02-04 02:03:38,791 INFO L107 eAbstractionObserver]: Analyzing ICFG lockfree-3.2_false-valid-memtrack.i [2018-02-04 02:03:38,797 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 02:03:38,802 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-02-04 02:03:38,833 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 02:03:38,834 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 02:03:38,834 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 02:03:38,834 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 02:03:38,834 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 02:03:38,834 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 02:03:38,834 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 02:03:38,834 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 02:03:38,835 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 02:03:38,847 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-02-04 02:03:38,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-02-04 02:03:38,856 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:38,857 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:38,857 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 02:03:38,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1799126466, now seen corresponding path program 1 times [2018-02-04 02:03:38,895 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:38,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:38,939 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:38,973 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 02:03:38,975 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:03:38,975 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 02:03:38,976 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:38,977 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 02:03:38,977 INFO L182 omatonBuilderFactory]: Interpolants [80#false, 79#true] [2018-02-04 02:03:38,977 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 02:03:38,978 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-04 02:03:38,990 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-04 02:03:38,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-04 02:03:38,993 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 2 states. [2018-02-04 02:03:39,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:39,069 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2018-02-04 02:03:39,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-04 02:03:39,070 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-02-04 02:03:39,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:39,080 INFO L225 Difference]: With dead ends: 76 [2018-02-04 02:03:39,080 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 02:03:39,081 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 02:03:39,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 02:03:39,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-02-04 02:03:39,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-04 02:03:39,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 90 transitions. [2018-02-04 02:03:39,108 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 90 transitions. Word has length 9 [2018-02-04 02:03:39,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:39,108 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 90 transitions. [2018-02-04 02:03:39,109 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-04 02:03:39,109 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2018-02-04 02:03:39,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-04 02:03:39,109 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:39,109 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:39,109 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 02:03:39,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1199640283, now seen corresponding path program 1 times [2018-02-04 02:03:39,111 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:39,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:39,129 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:39,156 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 02:03:39,156 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:03:39,156 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 02:03:39,157 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:39,157 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 02:03:39,157 INFO L182 omatonBuilderFactory]: Interpolants [230#true, 231#false, 232#|main_#t~short13|] [2018-02-04 02:03:39,157 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 02:03:39,159 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 02:03:39,159 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 02:03:39,159 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 02:03:39,159 INFO L87 Difference]: Start difference. First operand 73 states and 90 transitions. Second operand 3 states. [2018-02-04 02:03:39,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:39,177 INFO L93 Difference]: Finished difference Result 74 states and 91 transitions. [2018-02-04 02:03:39,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 02:03:39,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-02-04 02:03:39,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:39,179 INFO L225 Difference]: With dead ends: 74 [2018-02-04 02:03:39,179 INFO L226 Difference]: Without dead ends: 74 [2018-02-04 02:03:39,180 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 02:03:39,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-04 02:03:39,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-02-04 02:03:39,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-04 02:03:39,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2018-02-04 02:03:39,186 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 12 [2018-02-04 02:03:39,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:39,186 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2018-02-04 02:03:39,186 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 02:03:39,186 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2018-02-04 02:03:39,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-04 02:03:39,187 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:39,187 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:39,187 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 02:03:39,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1201487325, now seen corresponding path program 1 times [2018-02-04 02:03:39,188 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:39,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:39,202 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:39,242 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 02:03:39,242 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:03:39,242 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 02:03:39,242 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:39,243 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 02:03:39,243 INFO L182 omatonBuilderFactory]: Interpolants [381#true, 382#false, 383#(and (= 0 ~garbage.base) (= 0 ~garbage.offset))] [2018-02-04 02:03:39,243 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 02:03:39,243 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 02:03:39,243 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 02:03:39,243 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 02:03:39,244 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand 3 states. [2018-02-04 02:03:39,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:39,263 INFO L93 Difference]: Finished difference Result 132 states and 167 transitions. [2018-02-04 02:03:39,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 02:03:39,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-02-04 02:03:39,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:39,265 INFO L225 Difference]: With dead ends: 132 [2018-02-04 02:03:39,265 INFO L226 Difference]: Without dead ends: 132 [2018-02-04 02:03:39,265 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 02:03:39,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-04 02:03:39,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 114. [2018-02-04 02:03:39,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-04 02:03:39,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2018-02-04 02:03:39,277 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 12 [2018-02-04 02:03:39,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:39,277 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2018-02-04 02:03:39,278 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 02:03:39,278 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2018-02-04 02:03:39,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 02:03:39,278 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:39,278 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:39,278 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 02:03:39,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1408600152, now seen corresponding path program 1 times [2018-02-04 02:03:39,279 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:39,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:39,292 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:39,323 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 02:03:39,323 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:03:39,323 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 02:03:39,323 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:39,323 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 02:03:39,323 INFO L182 omatonBuilderFactory]: Interpolants [630#true, 631#false, 632#(= |#valid| |old(#valid)|)] [2018-02-04 02:03:39,324 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 02:03:39,324 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 02:03:39,324 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 02:03:39,324 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 02:03:39,324 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand 3 states. [2018-02-04 02:03:39,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:39,390 INFO L93 Difference]: Finished difference Result 147 states and 205 transitions. [2018-02-04 02:03:39,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 02:03:39,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-02-04 02:03:39,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:39,392 INFO L225 Difference]: With dead ends: 147 [2018-02-04 02:03:39,392 INFO L226 Difference]: Without dead ends: 143 [2018-02-04 02:03:39,392 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 02:03:39,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-04 02:03:39,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 135. [2018-02-04 02:03:39,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-04 02:03:39,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 192 transitions. [2018-02-04 02:03:39,400 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 192 transitions. Word has length 13 [2018-02-04 02:03:39,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:39,400 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 192 transitions. [2018-02-04 02:03:39,400 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 02:03:39,400 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 192 transitions. [2018-02-04 02:03:39,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 02:03:39,400 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:39,401 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:39,401 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 02:03:39,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1628464921, now seen corresponding path program 1 times [2018-02-04 02:03:39,401 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:39,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:39,413 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:39,445 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 02:03:39,445 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:03:39,446 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 02:03:39,446 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:39,446 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 02:03:39,446 INFO L182 omatonBuilderFactory]: Interpolants [915#true, 916#false, 917#(<= ~pc1 1), 918#(<= |push_#t~post0| 1), 919#(not |push_#t~switch1|)] [2018-02-04 02:03:39,446 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 02:03:39,447 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 02:03:39,447 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 02:03:39,447 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:03:39,447 INFO L87 Difference]: Start difference. First operand 135 states and 192 transitions. Second operand 5 states. [2018-02-04 02:03:39,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:39,504 INFO L93 Difference]: Finished difference Result 255 states and 357 transitions. [2018-02-04 02:03:39,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 02:03:39,504 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-04 02:03:39,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:39,506 INFO L225 Difference]: With dead ends: 255 [2018-02-04 02:03:39,507 INFO L226 Difference]: Without dead ends: 255 [2018-02-04 02:03:39,507 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 02:03:39,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-02-04 02:03:39,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 226. [2018-02-04 02:03:39,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-02-04 02:03:39,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 338 transitions. [2018-02-04 02:03:39,522 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 338 transitions. Word has length 15 [2018-02-04 02:03:39,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:39,522 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 338 transitions. [2018-02-04 02:03:39,522 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 02:03:39,522 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 338 transitions. [2018-02-04 02:03:39,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 02:03:39,523 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:39,523 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:39,523 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 02:03:39,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474006, now seen corresponding path program 1 times [2018-02-04 02:03:39,524 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:39,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:39,534 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:39,554 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 02:03:39,555 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:03:39,555 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 02:03:39,555 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:39,555 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 02:03:39,555 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 02:03:39,555 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 02:03:39,556 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 02:03:39,556 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 02:03:39,556 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 02:03:39,556 INFO L87 Difference]: Start difference. First operand 226 states and 338 transitions. Second operand 4 states. [2018-02-04 02:03:39,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:39,651 INFO L93 Difference]: Finished difference Result 386 states and 569 transitions. [2018-02-04 02:03:39,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 02:03:39,651 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-04 02:03:39,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:39,654 INFO L225 Difference]: With dead ends: 386 [2018-02-04 02:03:39,654 INFO L226 Difference]: Without dead ends: 386 [2018-02-04 02:03:39,654 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 02:03:39,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-02-04 02:03:39,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 358. [2018-02-04 02:03:39,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-02-04 02:03:39,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 548 transitions. [2018-02-04 02:03:39,674 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 548 transitions. Word has length 16 [2018-02-04 02:03:39,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:39,674 INFO L432 AbstractCegarLoop]: Abstraction has 358 states and 548 transitions. [2018-02-04 02:03:39,674 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 02:03:39,674 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 548 transitions. [2018-02-04 02:03:39,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 02:03:39,675 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:39,675 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:39,675 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 02:03:39,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474005, now seen corresponding path program 1 times [2018-02-04 02:03:39,676 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:39,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:39,686 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:39,736 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 02:03:39,737 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:03:39,737 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 02:03:39,737 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:39,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 02:03:39,737 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 02:03:39,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 02:03:39,737 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 02:03:39,738 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 02:03:39,738 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 02:03:39,738 INFO L87 Difference]: Start difference. First operand 358 states and 548 transitions. Second operand 4 states. [2018-02-04 02:03:39,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:39,808 INFO L93 Difference]: Finished difference Result 485 states and 716 transitions. [2018-02-04 02:03:39,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 02:03:39,809 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-04 02:03:39,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:39,812 INFO L225 Difference]: With dead ends: 485 [2018-02-04 02:03:39,812 INFO L226 Difference]: Without dead ends: 485 [2018-02-04 02:03:39,812 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 02:03:39,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-02-04 02:03:39,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 460. [2018-02-04 02:03:39,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-02-04 02:03:39,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 696 transitions. [2018-02-04 02:03:39,825 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 696 transitions. Word has length 16 [2018-02-04 02:03:39,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:39,825 INFO L432 AbstractCegarLoop]: Abstraction has 460 states and 696 transitions. [2018-02-04 02:03:39,825 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 02:03:39,826 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 696 transitions. [2018-02-04 02:03:39,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 02:03:39,826 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:39,826 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:39,826 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 02:03:39,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1708141764, now seen corresponding path program 1 times [2018-02-04 02:03:39,827 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:39,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:39,835 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:39,864 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 02:03:39,864 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:03:39,864 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 02:03:39,865 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:39,865 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 02:03:39,865 INFO L182 omatonBuilderFactory]: Interpolants [3104#true, 3105#false, 3106#(<= ~pc4 1), 3107#(<= |pop_#t~post7| 1), 3108#(not |pop_#t~switch8|)] [2018-02-04 02:03:39,865 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 02:03:39,865 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 02:03:39,865 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 02:03:39,865 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:03:39,866 INFO L87 Difference]: Start difference. First operand 460 states and 696 transitions. Second operand 5 states. [2018-02-04 02:03:39,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:39,909 INFO L93 Difference]: Finished difference Result 861 states and 1225 transitions. [2018-02-04 02:03:39,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 02:03:39,910 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-02-04 02:03:39,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:39,913 INFO L225 Difference]: With dead ends: 861 [2018-02-04 02:03:39,914 INFO L226 Difference]: Without dead ends: 861 [2018-02-04 02:03:39,914 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 02:03:39,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2018-02-04 02:03:39,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 828. [2018-02-04 02:03:39,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2018-02-04 02:03:39,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1196 transitions. [2018-02-04 02:03:39,937 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1196 transitions. Word has length 16 [2018-02-04 02:03:39,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:39,937 INFO L432 AbstractCegarLoop]: Abstraction has 828 states and 1196 transitions. [2018-02-04 02:03:39,937 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 02:03:39,937 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1196 transitions. [2018-02-04 02:03:39,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 02:03:39,938 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:39,938 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 02:03:39,938 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 02:03:39,939 INFO L82 PathProgramCache]: Analyzing trace with hash 750766986, now seen corresponding path program 1 times [2018-02-04 02:03:39,939 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:39,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:39,950 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:39,991 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 02:03:39,991 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:03:39,991 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 02:03:39,991 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:39,992 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 02:03:39,992 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 02:03:39,992 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 02:03:39,992 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 02:03:39,992 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 02:03:39,992 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 02:03:39,993 INFO L87 Difference]: Start difference. First operand 828 states and 1196 transitions. Second operand 6 states. [2018-02-04 02:03:40,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:40,091 INFO L93 Difference]: Finished difference Result 1289 states and 1809 transitions. [2018-02-04 02:03:40,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 02:03:40,094 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-04 02:03:40,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:40,099 INFO L225 Difference]: With dead ends: 1289 [2018-02-04 02:03:40,100 INFO L226 Difference]: Without dead ends: 1289 [2018-02-04 02:03:40,100 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 02:03:40,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2018-02-04 02:03:40,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1220. [2018-02-04 02:03:40,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1220 states. [2018-02-04 02:03:40,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 1220 states and 1744 transitions. [2018-02-04 02:03:40,134 INFO L78 Accepts]: Start accepts. Automaton has 1220 states and 1744 transitions. Word has length 26 [2018-02-04 02:03:40,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:40,134 INFO L432 AbstractCegarLoop]: Abstraction has 1220 states and 1744 transitions. [2018-02-04 02:03:40,135 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 02:03:40,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 1744 transitions. [2018-02-04 02:03:40,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 02:03:40,136 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:40,136 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 02:03:40,136 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 02:03:40,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1952857995, now seen corresponding path program 1 times [2018-02-04 02:03:40,137 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:40,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:40,148 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:40,205 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 02:03:40,206 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:03:40,206 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 02:03:40,206 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:40,206 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 02:03:40,206 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 02:03:40,206 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 02:03:40,207 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 02:03:40,207 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 02:03:40,207 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-04 02:03:40,207 INFO L87 Difference]: Start difference. First operand 1220 states and 1744 transitions. Second operand 7 states. [2018-02-04 02:03:40,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:40,346 INFO L93 Difference]: Finished difference Result 3241 states and 4724 transitions. [2018-02-04 02:03:40,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 02:03:40,346 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-02-04 02:03:40,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:40,358 INFO L225 Difference]: With dead ends: 3241 [2018-02-04 02:03:40,358 INFO L226 Difference]: Without dead ends: 3241 [2018-02-04 02:03:40,359 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 02:03:40,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3241 states. [2018-02-04 02:03:40,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3241 to 3128. [2018-02-04 02:03:40,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2018-02-04 02:03:40,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 4498 transitions. [2018-02-04 02:03:40,436 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 4498 transitions. Word has length 27 [2018-02-04 02:03:40,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:40,436 INFO L432 AbstractCegarLoop]: Abstraction has 3128 states and 4498 transitions. [2018-02-04 02:03:40,436 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 02:03:40,436 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 4498 transitions. [2018-02-04 02:03:40,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 02:03:40,437 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:40,437 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 02:03:40,437 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 02:03:40,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1524460851, now seen corresponding path program 1 times [2018-02-04 02:03:40,438 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:40,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 02:03:40,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 02:03:40,487 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 02:03:40,510 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-04 02:03:40,518 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 02:03:40,519 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 02:03:40,519 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 02:03:40,520 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 02:03:40,521 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 02:03:40,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 02:03:40 BoogieIcfgContainer [2018-02-04 02:03:40,531 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 02:03:40,531 INFO L168 Benchmark]: Toolchain (without parser) took 2253.62 ms. Allocated memory was 394.8 MB in the beginning and 626.5 MB in the end (delta: 231.7 MB). Free memory was 351.7 MB in the beginning and 481.2 MB in the end (delta: -129.5 MB). Peak memory consumption was 102.2 MB. Max. memory is 5.3 GB. [2018-02-04 02:03:40,532 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 394.8 MB. Free memory is still 358.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 02:03:40,532 INFO L168 Benchmark]: CACSL2BoogieTranslator took 160.03 ms. Allocated memory is still 394.8 MB. Free memory was 351.7 MB in the beginning and 341.1 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 02:03:40,533 INFO L168 Benchmark]: Boogie Preprocessor took 27.19 ms. Allocated memory is still 394.8 MB. Free memory was 341.1 MB in the beginning and 338.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 02:03:40,533 INFO L168 Benchmark]: RCFGBuilder took 318.51 ms. Allocated memory is still 394.8 MB. Free memory was 338.5 MB in the beginning and 311.1 MB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 5.3 GB. [2018-02-04 02:03:40,533 INFO L168 Benchmark]: TraceAbstraction took 1745.34 ms. Allocated memory was 394.8 MB in the beginning and 626.5 MB in the end (delta: 231.7 MB). Free memory was 311.1 MB in the beginning and 481.2 MB in the end (delta: -170.1 MB). Peak memory consumption was 61.7 MB. Max. memory is 5.3 GB. [2018-02-04 02:03:40,534 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.14 ms. Allocated memory is still 394.8 MB. Free memory is still 358.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 160.03 ms. Allocated memory is still 394.8 MB. Free memory was 351.7 MB in the beginning and 341.1 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 27.19 ms. Allocated memory is still 394.8 MB. Free memory was 341.1 MB in the beginning and 338.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 318.51 ms. Allocated memory is still 394.8 MB. Free memory was 338.5 MB in the beginning and 311.1 MB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1745.34 ms. Allocated memory was 394.8 MB in the beginning and 626.5 MB in the end (delta: 231.7 MB). Free memory was 311.1 MB in the beginning and 481.2 MB in the end (delta: -170.1 MB). Peak memory consumption was 61.7 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: - UnprovableResult [Line: 688]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 688. Possible 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.7s 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 could not prove your program: unable to determine feasibility of some traces 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_02-03-40-540.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_02-03-40-540.csv Received shutdown request...