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_Camel.epf -i ../../../trunk/examples/svcomp/memsafety/lockfree-3.2_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-03 23:13:49,506 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-03 23:13:49,507 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-03 23:13:49,516 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-03 23:13:49,516 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-03 23:13:49,517 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-03 23:13:49,518 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-03 23:13:49,519 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-03 23:13:49,521 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-03 23:13:49,521 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-03 23:13:49,522 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-03 23:13:49,522 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-03 23:13:49,523 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-03 23:13:49,524 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-03 23:13:49,525 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-03 23:13:49,526 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-03 23:13:49,528 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-03 23:13:49,530 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-03 23:13:49,530 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-03 23:13:49,531 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-03 23:13:49,533 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-03 23:13:49,533 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-03 23:13:49,533 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-03 23:13:49,534 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-03 23:13:49,535 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-03 23:13:49,536 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-03 23:13:49,536 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-03 23:13:49,537 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-03 23:13:49,537 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-03 23:13:49,537 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-03 23:13:49,537 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-03 23:13:49,537 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-03 23:13:49,547 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-03 23:13:49,547 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-03 23:13:49,548 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-03 23:13:49,548 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-03 23:13:49,548 INFO L133 SettingsManager]: * Use SBE=true [2018-02-03 23:13:49,548 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-03 23:13:49,549 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-03 23:13:49,549 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-03 23:13:49,549 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-03 23:13:49,549 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-03 23:13:49,549 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-03 23:13:49,549 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-03 23:13:49,549 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-03 23:13:49,550 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-03 23:13:49,550 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-03 23:13:49,550 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-03 23:13:49,550 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-03 23:13:49,550 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-03 23:13:49,550 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-03 23:13:49,551 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-03 23:13:49,551 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-03 23:13:49,551 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-03 23:13:49,551 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-03 23:13:49,551 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-03 23:13:49,551 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-03 23:13:49,579 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-03 23:13:49,588 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-03 23:13:49,592 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-03 23:13:49,593 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-03 23:13:49,593 INFO L276 PluginConnector]: CDTParser initialized [2018-02-03 23:13:49,594 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-03 23:13:49,727 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-03 23:13:49,728 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-03 23:13:49,728 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-03 23:13:49,729 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-03 23:13:49,734 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-03 23:13:49,734 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 11:13:49" (1/1) ... [2018-02-03 23:13:49,737 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69a9abb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:13:49, skipping insertion in model container [2018-02-03 23:13:49,737 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 11:13:49" (1/1) ... [2018-02-03 23:13:49,750 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-03 23:13:49,777 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-03 23:13:49,871 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-03 23:13:49,884 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-03 23:13:49,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:13:49 WrapperNode [2018-02-03 23:13:49,889 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-03 23:13:49,889 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-03 23:13:49,889 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-03 23:13:49,889 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-03 23:13:49,899 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:13:49" (1/1) ... [2018-02-03 23:13:49,900 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:13:49" (1/1) ... [2018-02-03 23:13:49,908 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:13:49" (1/1) ... [2018-02-03 23:13:49,908 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:13:49" (1/1) ... [2018-02-03 23:13:49,912 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:13:49" (1/1) ... [2018-02-03 23:13:49,914 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:13:49" (1/1) ... [2018-02-03 23:13:49,915 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:13:49" (1/1) ... [2018-02-03 23:13:49,917 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-03 23:13:49,917 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-03 23:13:49,917 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-03 23:13:49,917 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-03 23:13:49,918 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:13:49" (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-03 23:13:49,952 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-03 23:13:49,952 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-03 23:13:49,953 INFO L136 BoogieDeclarations]: Found implementation of procedure push [2018-02-03 23:13:49,953 INFO L136 BoogieDeclarations]: Found implementation of procedure pop [2018-02-03 23:13:49,953 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-03 23:13:49,953 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-03 23:13:49,953 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-03 23:13:49,953 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-03 23:13:49,953 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-03 23:13:49,953 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-03 23:13:49,954 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-03 23:13:49,954 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-03 23:13:49,954 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-03 23:13:49,954 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-03 23:13:49,954 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-03 23:13:49,954 INFO L128 BoogieDeclarations]: Found specification of procedure push [2018-02-03 23:13:49,954 INFO L128 BoogieDeclarations]: Found specification of procedure pop [2018-02-03 23:13:49,954 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-03 23:13:49,954 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-03 23:13:49,954 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-03 23:13:50,184 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-03 23:13:50,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 11:13:50 BoogieIcfgContainer [2018-02-03 23:13:50,185 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-03 23:13:50,185 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-03 23:13:50,185 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-03 23:13:50,187 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-03 23:13:50,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.02 11:13:49" (1/3) ... [2018-02-03 23:13:50,188 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e281a12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 11:13:50, skipping insertion in model container [2018-02-03 23:13:50,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:13:49" (2/3) ... [2018-02-03 23:13:50,188 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e281a12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 11:13:50, skipping insertion in model container [2018-02-03 23:13:50,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 11:13:50" (3/3) ... [2018-02-03 23:13:50,189 INFO L107 eAbstractionObserver]: Analyzing ICFG lockfree-3.2_false-valid-memtrack.i [2018-02-03 23:13:50,195 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-03 23:13:50,200 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-02-03 23:13:50,222 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-03 23:13:50,222 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-03 23:13:50,222 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-03 23:13:50,223 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-03 23:13:50,223 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-03 23:13:50,223 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-03 23:13:50,223 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-03 23:13:50,223 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-03 23:13:50,223 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-03 23:13:50,234 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-02-03 23:13:50,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-02-03 23:13:50,242 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:13:50,243 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:13:50,243 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-03 23:13:50,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1799126466, now seen corresponding path program 1 times [2018-02-03 23:13:50,248 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:13:50,249 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:13:50,291 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:13:50,291 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:13:50,292 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:13:50,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:13:50,345 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:13:50,378 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-03 23:13:50,380 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:13:50,380 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-03 23:13:50,382 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-03 23:13:50,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-03 23:13:50,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-03 23:13:50,396 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 2 states. [2018-02-03 23:13:50,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:13:50,464 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2018-02-03 23:13:50,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-03 23:13:50,466 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-02-03 23:13:50,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:13:50,476 INFO L225 Difference]: With dead ends: 76 [2018-02-03 23:13:50,476 INFO L226 Difference]: Without dead ends: 73 [2018-02-03 23:13:50,477 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-03 23:13:50,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-03 23:13:50,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-02-03 23:13:50,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-03 23:13:50,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 90 transitions. [2018-02-03 23:13:50,509 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 90 transitions. Word has length 9 [2018-02-03 23:13:50,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:13:50,509 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 90 transitions. [2018-02-03 23:13:50,509 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-03 23:13:50,509 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2018-02-03 23:13:50,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-03 23:13:50,510 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:13:50,510 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:13:50,510 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-03 23:13:50,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1199640283, now seen corresponding path program 1 times [2018-02-03 23:13:50,511 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:13:50,511 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:13:50,512 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:13:50,512 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:13:50,512 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:13:50,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:13:50,529 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:13:50,556 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-03 23:13:50,556 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:13:50,556 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 23:13:50,558 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-03 23:13:50,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-03 23:13:50,558 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-03 23:13:50,558 INFO L87 Difference]: Start difference. First operand 73 states and 90 transitions. Second operand 3 states. [2018-02-03 23:13:50,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:13:50,584 INFO L93 Difference]: Finished difference Result 74 states and 91 transitions. [2018-02-03 23:13:50,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-03 23:13:50,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-02-03 23:13:50,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:13:50,586 INFO L225 Difference]: With dead ends: 74 [2018-02-03 23:13:50,586 INFO L226 Difference]: Without dead ends: 74 [2018-02-03 23:13:50,587 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-03 23:13:50,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-03 23:13:50,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-02-03 23:13:50,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-03 23:13:50,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2018-02-03 23:13:50,594 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 12 [2018-02-03 23:13:50,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:13:50,594 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2018-02-03 23:13:50,594 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-03 23:13:50,594 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2018-02-03 23:13:50,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-03 23:13:50,595 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:13:50,595 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:13:50,595 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-03 23:13:50,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1201487325, now seen corresponding path program 1 times [2018-02-03 23:13:50,595 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:13:50,596 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:13:50,596 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:13:50,597 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:13:50,597 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:13:50,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:13:50,615 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:13:50,658 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-03 23:13:50,658 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:13:50,658 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 23:13:50,658 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-03 23:13:50,659 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-03 23:13:50,659 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-03 23:13:50,659 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand 3 states. [2018-02-03 23:13:50,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:13:50,688 INFO L93 Difference]: Finished difference Result 132 states and 167 transitions. [2018-02-03 23:13:50,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-03 23:13:50,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-02-03 23:13:50,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:13:50,690 INFO L225 Difference]: With dead ends: 132 [2018-02-03 23:13:50,690 INFO L226 Difference]: Without dead ends: 132 [2018-02-03 23:13:50,690 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-03 23:13:50,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-03 23:13:50,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 114. [2018-02-03 23:13:50,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-03 23:13:50,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2018-02-03 23:13:50,703 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 12 [2018-02-03 23:13:50,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:13:50,703 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2018-02-03 23:13:50,703 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-03 23:13:50,703 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2018-02-03 23:13:50,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-03 23:13:50,704 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:13:50,704 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:13:50,704 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-03 23:13:50,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1408600152, now seen corresponding path program 1 times [2018-02-03 23:13:50,704 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:13:50,704 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:13:50,705 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:13:50,705 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:13:50,705 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:13:50,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:13:50,719 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:13:50,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:13:50,741 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:13:50,741 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-03 23:13:50,742 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-03 23:13:50,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-03 23:13:50,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-03 23:13:50,742 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand 3 states. [2018-02-03 23:13:50,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:13:50,820 INFO L93 Difference]: Finished difference Result 147 states and 205 transitions. [2018-02-03 23:13:50,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-03 23:13:50,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-02-03 23:13:50,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:13:50,822 INFO L225 Difference]: With dead ends: 147 [2018-02-03 23:13:50,822 INFO L226 Difference]: Without dead ends: 143 [2018-02-03 23:13:50,822 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-03 23:13:50,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-03 23:13:50,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 135. [2018-02-03 23:13:50,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-03 23:13:50,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 192 transitions. [2018-02-03 23:13:50,832 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 192 transitions. Word has length 13 [2018-02-03 23:13:50,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:13:50,832 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 192 transitions. [2018-02-03 23:13:50,832 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-03 23:13:50,833 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 192 transitions. [2018-02-03 23:13:50,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-03 23:13:50,833 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:13:50,833 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:13:50,833 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-03 23:13:50,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1628464921, now seen corresponding path program 1 times [2018-02-03 23:13:50,834 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:13:50,834 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:13:50,835 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:13:50,835 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:13:50,835 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:13:50,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:13:50,845 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:13:50,883 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-03 23:13:50,883 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:13:50,883 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-03 23:13:50,883 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 23:13:50,883 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 23:13:50,884 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-03 23:13:50,884 INFO L87 Difference]: Start difference. First operand 135 states and 192 transitions. Second operand 5 states. [2018-02-03 23:13:50,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:13:50,939 INFO L93 Difference]: Finished difference Result 255 states and 357 transitions. [2018-02-03 23:13:50,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 23:13:50,939 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-03 23:13:50,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:13:50,941 INFO L225 Difference]: With dead ends: 255 [2018-02-03 23:13:50,941 INFO L226 Difference]: Without dead ends: 255 [2018-02-03 23:13:50,941 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-03 23:13:50,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-02-03 23:13:50,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 226. [2018-02-03 23:13:50,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-02-03 23:13:50,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 338 transitions. [2018-02-03 23:13:50,954 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 338 transitions. Word has length 15 [2018-02-03 23:13:50,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:13:50,954 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 338 transitions. [2018-02-03 23:13:50,954 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 23:13:50,955 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 338 transitions. [2018-02-03 23:13:50,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-03 23:13:50,955 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:13:50,955 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:13:50,955 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-03 23:13:50,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474006, now seen corresponding path program 1 times [2018-02-03 23:13:50,959 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:13:50,959 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:13:50,959 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:13:50,960 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:13:50,960 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:13:50,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:13:50,969 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:13:50,990 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-03 23:13:50,991 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:13:50,991 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 23:13:50,991 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 23:13:50,991 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 23:13:50,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 23:13:50,992 INFO L87 Difference]: Start difference. First operand 226 states and 338 transitions. Second operand 4 states. [2018-02-03 23:13:51,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:13:51,072 INFO L93 Difference]: Finished difference Result 386 states and 569 transitions. [2018-02-03 23:13:51,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-03 23:13:51,072 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-03 23:13:51,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:13:51,074 INFO L225 Difference]: With dead ends: 386 [2018-02-03 23:13:51,075 INFO L226 Difference]: Without dead ends: 386 [2018-02-03 23:13:51,075 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-03 23:13:51,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-02-03 23:13:51,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 358. [2018-02-03 23:13:51,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-02-03 23:13:51,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 548 transitions. [2018-02-03 23:13:51,091 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 548 transitions. Word has length 16 [2018-02-03 23:13:51,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:13:51,091 INFO L432 AbstractCegarLoop]: Abstraction has 358 states and 548 transitions. [2018-02-03 23:13:51,092 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 23:13:51,092 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 548 transitions. [2018-02-03 23:13:51,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-03 23:13:51,092 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:13:51,093 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:13:51,093 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-03 23:13:51,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474005, now seen corresponding path program 1 times [2018-02-03 23:13:51,093 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:13:51,093 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:13:51,094 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:13:51,094 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:13:51,094 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:13:51,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:13:51,103 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:13:51,136 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-03 23:13:51,136 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:13:51,136 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 23:13:51,136 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 23:13:51,137 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 23:13:51,137 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 23:13:51,137 INFO L87 Difference]: Start difference. First operand 358 states and 548 transitions. Second operand 4 states. [2018-02-03 23:13:51,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:13:51,199 INFO L93 Difference]: Finished difference Result 485 states and 716 transitions. [2018-02-03 23:13:51,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-03 23:13:51,199 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-03 23:13:51,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:13:51,201 INFO L225 Difference]: With dead ends: 485 [2018-02-03 23:13:51,201 INFO L226 Difference]: Without dead ends: 485 [2018-02-03 23:13:51,201 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-03 23:13:51,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-02-03 23:13:51,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 460. [2018-02-03 23:13:51,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-02-03 23:13:51,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 696 transitions. [2018-02-03 23:13:51,214 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 696 transitions. Word has length 16 [2018-02-03 23:13:51,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:13:51,214 INFO L432 AbstractCegarLoop]: Abstraction has 460 states and 696 transitions. [2018-02-03 23:13:51,214 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 23:13:51,215 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 696 transitions. [2018-02-03 23:13:51,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-03 23:13:51,215 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:13:51,215 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:13:51,215 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-03 23:13:51,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1708141764, now seen corresponding path program 1 times [2018-02-03 23:13:51,216 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:13:51,216 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:13:51,216 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:13:51,217 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:13:51,217 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:13:51,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:13:51,225 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:13:51,264 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-03 23:13:51,264 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:13:51,264 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-03 23:13:51,264 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 23:13:51,264 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 23:13:51,265 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-03 23:13:51,265 INFO L87 Difference]: Start difference. First operand 460 states and 696 transitions. Second operand 5 states. [2018-02-03 23:13:51,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:13:51,311 INFO L93 Difference]: Finished difference Result 861 states and 1225 transitions. [2018-02-03 23:13:51,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 23:13:51,311 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-02-03 23:13:51,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:13:51,315 INFO L225 Difference]: With dead ends: 861 [2018-02-03 23:13:51,315 INFO L226 Difference]: Without dead ends: 861 [2018-02-03 23:13:51,315 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-03 23:13:51,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2018-02-03 23:13:51,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 828. [2018-02-03 23:13:51,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2018-02-03 23:13:51,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1196 transitions. [2018-02-03 23:13:51,337 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1196 transitions. Word has length 16 [2018-02-03 23:13:51,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:13:51,338 INFO L432 AbstractCegarLoop]: Abstraction has 828 states and 1196 transitions. [2018-02-03 23:13:51,338 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 23:13:51,338 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1196 transitions. [2018-02-03 23:13:51,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-03 23:13:51,339 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:13:51,339 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-03 23:13:51,339 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-03 23:13:51,339 INFO L82 PathProgramCache]: Analyzing trace with hash 750766986, now seen corresponding path program 1 times [2018-02-03 23:13:51,339 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:13:51,339 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:13:51,340 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:13:51,340 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:13:51,340 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:13:51,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:13:51,351 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:13:51,397 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-03 23:13:51,397 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:13:51,397 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:13:51,403 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:13:51,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:13:51,453 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:13:51,541 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:13:51,559 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:13:51,559 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 9 [2018-02-03 23:13:51,559 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-03 23:13:51,559 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-03 23:13:51,560 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-02-03 23:13:51,560 INFO L87 Difference]: Start difference. First operand 828 states and 1196 transitions. Second operand 9 states. [2018-02-03 23:13:51,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:13:51,915 INFO L93 Difference]: Finished difference Result 1420 states and 2030 transitions. [2018-02-03 23:13:51,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-03 23:13:51,919 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-02-03 23:13:51,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:13:51,925 INFO L225 Difference]: With dead ends: 1420 [2018-02-03 23:13:51,926 INFO L226 Difference]: Without dead ends: 1420 [2018-02-03 23:13:51,926 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2018-02-03 23:13:51,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2018-02-03 23:13:51,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 1268. [2018-02-03 23:13:51,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1268 states. [2018-02-03 23:13:51,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 1792 transitions. [2018-02-03 23:13:51,972 INFO L78 Accepts]: Start accepts. Automaton has 1268 states and 1792 transitions. Word has length 26 [2018-02-03 23:13:51,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:13:51,973 INFO L432 AbstractCegarLoop]: Abstraction has 1268 states and 1792 transitions. [2018-02-03 23:13:51,973 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-03 23:13:51,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 1792 transitions. [2018-02-03 23:13:51,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-03 23:13:51,974 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:13:51,974 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-03 23:13:51,974 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-03 23:13:51,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1952857995, now seen corresponding path program 1 times [2018-02-03 23:13:51,974 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:13:51,975 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:13:51,975 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:13:51,975 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:13:51,976 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:13:51,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:13:51,987 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:13:52,042 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-03 23:13:52,042 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:13:52,042 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:13:52,050 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:13:52,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:13:52,088 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:13:52,135 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-03 23:13:52,152 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:13:52,153 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2018-02-03 23:13:52,153 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-03 23:13:52,153 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-03 23:13:52,153 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-02-03 23:13:52,153 INFO L87 Difference]: Start difference. First operand 1268 states and 1792 transitions. Second operand 10 states. [2018-02-03 23:13:52,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:13:52,353 INFO L93 Difference]: Finished difference Result 4135 states and 6003 transitions. [2018-02-03 23:13:52,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-03 23:13:52,353 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-02-03 23:13:52,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:13:52,365 INFO L225 Difference]: With dead ends: 4135 [2018-02-03 23:13:52,366 INFO L226 Difference]: Without dead ends: 4135 [2018-02-03 23:13:52,366 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2018-02-03 23:13:52,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4135 states. [2018-02-03 23:13:52,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4135 to 3944. [2018-02-03 23:13:52,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3944 states. [2018-02-03 23:13:52,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3944 states to 3944 states and 5578 transitions. [2018-02-03 23:13:52,488 INFO L78 Accepts]: Start accepts. Automaton has 3944 states and 5578 transitions. Word has length 27 [2018-02-03 23:13:52,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:13:52,488 INFO L432 AbstractCegarLoop]: Abstraction has 3944 states and 5578 transitions. [2018-02-03 23:13:52,488 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-03 23:13:52,488 INFO L276 IsEmpty]: Start isEmpty. Operand 3944 states and 5578 transitions. [2018-02-03 23:13:52,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-03 23:13:52,489 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:13:52,489 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-03 23:13:52,490 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-03 23:13:52,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1524460851, now seen corresponding path program 1 times [2018-02-03 23:13:52,490 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:13:52,490 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:13:52,491 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:13:52,491 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:13:52,491 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:13:52,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-03 23:13:52,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-03 23:13:52,535 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-03 23:13:52,557 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-03 23:13:52,566 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-03 23:13:52,567 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-03 23:13:52,567 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-03 23:13:52,568 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-03 23:13:52,569 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-03 23:13:52,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.02 11:13:52 BoogieIcfgContainer [2018-02-03 23:13:52,579 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-03 23:13:52,579 INFO L168 Benchmark]: Toolchain (without parser) took 2852.23 ms. Allocated memory was 402.7 MB in the beginning and 692.1 MB in the end (delta: 289.4 MB). Free memory was 359.3 MB in the beginning and 605.0 MB in the end (delta: -245.7 MB). Peak memory consumption was 43.7 MB. Max. memory is 5.3 GB. [2018-02-03 23:13:52,580 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 402.7 MB. Free memory is still 365.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-03 23:13:52,580 INFO L168 Benchmark]: CACSL2BoogieTranslator took 160.63 ms. Allocated memory is still 402.7 MB. Free memory was 359.3 MB in the beginning and 348.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-03 23:13:52,581 INFO L168 Benchmark]: Boogie Preprocessor took 27.46 ms. Allocated memory is still 402.7 MB. Free memory was 348.8 MB in the beginning and 346.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-03 23:13:52,581 INFO L168 Benchmark]: RCFGBuilder took 267.98 ms. Allocated memory is still 402.7 MB. Free memory was 346.1 MB in the beginning and 318.2 MB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 5.3 GB. [2018-02-03 23:13:52,581 INFO L168 Benchmark]: TraceAbstraction took 2393.51 ms. Allocated memory was 402.7 MB in the beginning and 692.1 MB in the end (delta: 289.4 MB). Free memory was 318.2 MB in the beginning and 605.0 MB in the end (delta: -286.8 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-03 23:13:52,582 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.13 ms. Allocated memory is still 402.7 MB. Free memory is still 365.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 160.63 ms. Allocated memory is still 402.7 MB. Free memory was 359.3 MB in the beginning and 348.8 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.46 ms. Allocated memory is still 402.7 MB. Free memory was 348.8 MB in the beginning and 346.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 267.98 ms. Allocated memory is still 402.7 MB. Free memory was 346.1 MB in the beginning and 318.2 MB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2393.51 ms. Allocated memory was 402.7 MB in the beginning and 692.1 MB in the end (delta: 289.4 MB). Free memory was 318.2 MB in the beginning and 605.0 MB in the end (delta: -286.8 MB). Peak memory consumption was 2.6 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, 2.3s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 937 SDtfs, 1248 SDslu, 1589 SDs, 0 SdLazy, 595 SolverSat, 191 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 122 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3944occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 484 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 242 NumberOfCodeBlocks, 242 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 203 ConstructedInterpolants, 0 QuantifiedInterpolants, 11823 SizeOfPredicates, 12 NumberOfNonLiveVariables, 609 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 9/24 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_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-03_23-13-52-588.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_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-03_23-13-52-588.csv Received shutdown request...