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.1_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 12:29:30,155 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 12:29:30,157 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 12:29:30,167 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 12:29:30,168 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 12:29:30,169 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 12:29:30,170 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 12:29:30,171 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 12:29:30,172 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 12:29:30,173 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 12:29:30,174 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 12:29:30,174 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 12:29:30,174 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 12:29:30,175 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 12:29:30,176 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 12:29:30,178 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 12:29:30,180 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 12:29:30,181 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 12:29:30,182 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 12:29:30,183 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 12:29:30,185 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 12:29:30,185 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 12:29:30,185 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 12:29:30,186 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 12:29:30,187 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 12:29:30,188 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 12:29:30,188 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 12:29:30,188 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 12:29:30,188 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 12:29:30,189 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 12:29:30,189 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 12:29:30,189 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-04 12:29:30,199 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 12:29:30,199 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 12:29:30,200 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 12:29:30,200 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 12:29:30,200 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 12:29:30,200 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 12:29:30,201 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 12:29:30,201 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 12:29:30,201 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 12:29:30,201 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 12:29:30,201 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 12:29:30,201 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 12:29:30,201 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 12:29:30,202 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 12:29:30,202 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 12:29:30,202 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 12:29:30,202 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 12:29:30,202 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 12:29:30,202 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 12:29:30,203 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 12:29:30,203 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 12:29:30,203 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 12:29:30,203 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 12:29:30,203 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 12:29:30,232 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 12:29:30,240 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 12:29:30,242 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 12:29:30,243 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 12:29:30,243 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 12:29:30,244 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/lockfree-3.1_false-valid-memtrack.i [2018-02-04 12:29:30,376 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 12:29:30,377 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 12:29:30,377 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 12:29:30,377 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 12:29:30,381 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 12:29:30,382 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:29:30" (1/1) ... [2018-02-04 12:29:30,383 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 04.02 12:29:30, skipping insertion in model container [2018-02-04 12:29:30,384 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:29:30" (1/1) ... [2018-02-04 12:29:30,393 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:29:30,420 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:29:30,515 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:29:30,531 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:29:30,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:29:30 WrapperNode [2018-02-04 12:29:30,538 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 12:29:30,539 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 12:29:30,539 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 12:29:30,539 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 12:29:30,549 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:29:30" (1/1) ... [2018-02-04 12:29:30,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:29:30" (1/1) ... [2018-02-04 12:29:30,556 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:29:30" (1/1) ... [2018-02-04 12:29:30,556 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:29:30" (1/1) ... [2018-02-04 12:29:30,561 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:29:30" (1/1) ... [2018-02-04 12:29:30,565 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:29:30" (1/1) ... [2018-02-04 12:29:30,566 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:29:30" (1/1) ... [2018-02-04 12:29:30,569 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 12:29:30,569 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 12:29:30,569 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 12:29:30,569 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 12:29:30,570 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:29:30" (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 12:29:30,607 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 12:29:30,607 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 12:29:30,607 INFO L136 BoogieDeclarations]: Found implementation of procedure push [2018-02-04 12:29:30,608 INFO L136 BoogieDeclarations]: Found implementation of procedure pop [2018-02-04 12:29:30,608 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 12:29:30,608 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 12:29:30,608 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 12:29:30,608 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 12:29:30,608 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 12:29:30,608 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 12:29:30,608 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 12:29:30,609 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 12:29:30,609 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 12:29:30,609 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 12:29:30,609 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 12:29:30,609 INFO L128 BoogieDeclarations]: Found specification of procedure push [2018-02-04 12:29:30,609 INFO L128 BoogieDeclarations]: Found specification of procedure pop [2018-02-04 12:29:30,609 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 12:29:30,609 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 12:29:30,609 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 12:29:30,907 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 12:29:30,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:29:30 BoogieIcfgContainer [2018-02-04 12:29:30,908 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 12:29:30,908 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 12:29:30,908 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 12:29:30,910 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 12:29:30,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 12:29:30" (1/3) ... [2018-02-04 12:29:30,911 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 04.02 12:29:30, skipping insertion in model container [2018-02-04 12:29:30,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:29:30" (2/3) ... [2018-02-04 12:29:30,911 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 04.02 12:29:30, skipping insertion in model container [2018-02-04 12:29:30,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:29:30" (3/3) ... [2018-02-04 12:29:30,912 INFO L107 eAbstractionObserver]: Analyzing ICFG lockfree-3.1_false-valid-memtrack.i [2018-02-04 12:29:30,917 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 12:29:30,922 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-02-04 12:29:30,945 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 12:29:30,946 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 12:29:30,946 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 12:29:30,946 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 12:29:30,946 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 12:29:30,946 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 12:29:30,946 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 12:29:30,947 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 12:29:30,947 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 12:29:30,956 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-02-04 12:29:30,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-02-04 12:29:30,964 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:29:30,965 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:29:30,965 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 12:29:30,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1799126466, now seen corresponding path program 1 times [2018-02-04 12:29:30,969 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:29:30,969 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:29:30,999 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:29:31,000 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:29:31,000 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:29:31,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:29:31,044 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:29:31,078 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 12:29:31,080 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:29:31,080 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 12:29:31,082 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-04 12:29:31,092 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-04 12:29:31,093 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-04 12:29:31,094 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 2 states. [2018-02-04 12:29:31,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:29:31,170 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2018-02-04 12:29:31,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-04 12:29:31,171 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-02-04 12:29:31,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:29:31,181 INFO L225 Difference]: With dead ends: 76 [2018-02-04 12:29:31,181 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 12:29:31,182 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 12:29:31,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 12:29:31,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-02-04 12:29:31,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-04 12:29:31,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 90 transitions. [2018-02-04 12:29:31,211 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 90 transitions. Word has length 9 [2018-02-04 12:29:31,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:29:31,211 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 90 transitions. [2018-02-04 12:29:31,211 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-04 12:29:31,211 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2018-02-04 12:29:31,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-04 12:29:31,212 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:29:31,212 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:29:31,212 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 12:29:31,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1199640283, now seen corresponding path program 1 times [2018-02-04 12:29:31,213 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:29:31,213 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:29:31,214 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:29:31,214 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:29:31,214 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:29:31,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:29:31,232 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:29:31,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-04 12:29:31,264 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:29:31,264 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:29:31,265 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 12:29:31,266 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 12:29:31,266 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:29:31,266 INFO L87 Difference]: Start difference. First operand 73 states and 90 transitions. Second operand 3 states. [2018-02-04 12:29:31,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:29:31,283 INFO L93 Difference]: Finished difference Result 74 states and 91 transitions. [2018-02-04 12:29:31,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 12:29:31,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-02-04 12:29:31,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:29:31,285 INFO L225 Difference]: With dead ends: 74 [2018-02-04 12:29:31,285 INFO L226 Difference]: Without dead ends: 74 [2018-02-04 12:29:31,286 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 12:29:31,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-04 12:29:31,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-02-04 12:29:31,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-04 12:29:31,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2018-02-04 12:29:31,292 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 12 [2018-02-04 12:29:31,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:29:31,293 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2018-02-04 12:29:31,293 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 12:29:31,293 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2018-02-04 12:29:31,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-04 12:29:31,294 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:29:31,294 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:29:31,294 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 12:29:31,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1201487325, now seen corresponding path program 1 times [2018-02-04 12:29:31,294 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:29:31,294 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:29:31,295 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:29:31,295 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:29:31,295 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:29:31,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:29:31,314 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:29:31,356 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 12:29:31,357 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:29:31,357 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:29:31,357 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 12:29:31,357 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 12:29:31,357 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:29:31,357 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand 3 states. [2018-02-04 12:29:31,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:29:31,390 INFO L93 Difference]: Finished difference Result 132 states and 167 transitions. [2018-02-04 12:29:31,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 12:29:31,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-02-04 12:29:31,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:29:31,391 INFO L225 Difference]: With dead ends: 132 [2018-02-04 12:29:31,391 INFO L226 Difference]: Without dead ends: 132 [2018-02-04 12:29:31,391 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 12:29:31,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-04 12:29:31,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 114. [2018-02-04 12:29:31,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-04 12:29:31,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2018-02-04 12:29:31,401 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 12 [2018-02-04 12:29:31,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:29:31,402 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2018-02-04 12:29:31,402 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 12:29:31,402 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2018-02-04 12:29:31,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 12:29:31,402 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:29:31,402 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:29:31,402 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 12:29:31,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1408600152, now seen corresponding path program 1 times [2018-02-04 12:29:31,402 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:29:31,403 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:29:31,403 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:29:31,403 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:29:31,404 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:29:31,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:29:31,418 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:29:31,440 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 12:29:31,441 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:29:31,441 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 12:29:31,441 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 12:29:31,441 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 12:29:31,441 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:29:31,441 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand 3 states. [2018-02-04 12:29:31,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:29:31,495 INFO L93 Difference]: Finished difference Result 147 states and 205 transitions. [2018-02-04 12:29:31,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 12:29:31,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-02-04 12:29:31,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:29:31,497 INFO L225 Difference]: With dead ends: 147 [2018-02-04 12:29:31,497 INFO L226 Difference]: Without dead ends: 143 [2018-02-04 12:29:31,498 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 12:29:31,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-04 12:29:31,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 135. [2018-02-04 12:29:31,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-04 12:29:31,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 192 transitions. [2018-02-04 12:29:31,508 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 192 transitions. Word has length 13 [2018-02-04 12:29:31,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:29:31,508 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 192 transitions. [2018-02-04 12:29:31,509 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 12:29:31,509 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 192 transitions. [2018-02-04 12:29:31,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 12:29:31,509 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:29:31,509 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:29:31,509 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 12:29:31,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1628464921, now seen corresponding path program 1 times [2018-02-04 12:29:31,510 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:29:31,510 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:29:31,511 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:29:31,511 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:29:31,511 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:29:31,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:29:31,522 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:29:31,559 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 12:29:31,559 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:29:31,559 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 12:29:31,560 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:29:31,560 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:29:31,560 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:29:31,560 INFO L87 Difference]: Start difference. First operand 135 states and 192 transitions. Second operand 5 states. [2018-02-04 12:29:31,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:29:31,617 INFO L93 Difference]: Finished difference Result 255 states and 357 transitions. [2018-02-04 12:29:31,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:29:31,617 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-04 12:29:31,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:29:31,619 INFO L225 Difference]: With dead ends: 255 [2018-02-04 12:29:31,619 INFO L226 Difference]: Without dead ends: 255 [2018-02-04 12:29:31,620 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 12:29:31,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-02-04 12:29:31,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 226. [2018-02-04 12:29:31,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-02-04 12:29:31,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 338 transitions. [2018-02-04 12:29:31,635 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 338 transitions. Word has length 15 [2018-02-04 12:29:31,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:29:31,635 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 338 transitions. [2018-02-04 12:29:31,635 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:29:31,635 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 338 transitions. [2018-02-04 12:29:31,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 12:29:31,636 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:29:31,636 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:29:31,636 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 12:29:31,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474006, now seen corresponding path program 1 times [2018-02-04 12:29:31,636 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:29:31,637 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:29:31,637 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:29:31,637 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:29:31,637 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:29:31,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:29:31,650 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:29:31,678 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 12:29:31,679 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:29:31,679 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:29:31,679 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:29:31,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:29:31,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:29:31,680 INFO L87 Difference]: Start difference. First operand 226 states and 338 transitions. Second operand 4 states. [2018-02-04 12:29:31,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:29:31,758 INFO L93 Difference]: Finished difference Result 386 states and 569 transitions. [2018-02-04 12:29:31,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 12:29:31,759 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-04 12:29:31,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:29:31,761 INFO L225 Difference]: With dead ends: 386 [2018-02-04 12:29:31,761 INFO L226 Difference]: Without dead ends: 386 [2018-02-04 12:29:31,761 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 12:29:31,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-02-04 12:29:31,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 358. [2018-02-04 12:29:31,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-02-04 12:29:31,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 548 transitions. [2018-02-04 12:29:31,771 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 548 transitions. Word has length 16 [2018-02-04 12:29:31,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:29:31,771 INFO L432 AbstractCegarLoop]: Abstraction has 358 states and 548 transitions. [2018-02-04 12:29:31,771 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:29:31,771 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 548 transitions. [2018-02-04 12:29:31,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 12:29:31,772 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:29:31,772 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:29:31,772 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 12:29:31,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474005, now seen corresponding path program 1 times [2018-02-04 12:29:31,772 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:29:31,772 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:29:31,773 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:29:31,773 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:29:31,773 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:29:31,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:29:31,782 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:29:31,824 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 12:29:31,824 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:29:31,824 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:29:31,824 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:29:31,825 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:29:31,825 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:29:31,825 INFO L87 Difference]: Start difference. First operand 358 states and 548 transitions. Second operand 4 states. [2018-02-04 12:29:31,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:29:31,915 INFO L93 Difference]: Finished difference Result 485 states and 716 transitions. [2018-02-04 12:29:31,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 12:29:31,916 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-04 12:29:31,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:29:31,918 INFO L225 Difference]: With dead ends: 485 [2018-02-04 12:29:31,918 INFO L226 Difference]: Without dead ends: 485 [2018-02-04 12:29:31,919 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 12:29:31,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-02-04 12:29:31,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 460. [2018-02-04 12:29:31,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-02-04 12:29:31,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 696 transitions. [2018-02-04 12:29:31,947 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 696 transitions. Word has length 16 [2018-02-04 12:29:31,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:29:31,947 INFO L432 AbstractCegarLoop]: Abstraction has 460 states and 696 transitions. [2018-02-04 12:29:31,947 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:29:31,947 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 696 transitions. [2018-02-04 12:29:31,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 12:29:31,948 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:29:31,948 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:29:31,948 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 12:29:31,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1708141764, now seen corresponding path program 1 times [2018-02-04 12:29:31,948 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:29:31,948 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:29:31,949 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:29:31,949 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:29:31,949 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:29:31,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:29:31,968 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:29:32,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:29:32,004 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:29:32,005 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 12:29:32,005 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:29:32,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:29:32,005 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:29:32,005 INFO L87 Difference]: Start difference. First operand 460 states and 696 transitions. Second operand 5 states. [2018-02-04 12:29:32,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:29:32,055 INFO L93 Difference]: Finished difference Result 861 states and 1225 transitions. [2018-02-04 12:29:32,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:29:32,058 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-02-04 12:29:32,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:29:32,063 INFO L225 Difference]: With dead ends: 861 [2018-02-04 12:29:32,063 INFO L226 Difference]: Without dead ends: 861 [2018-02-04 12:29:32,063 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 12:29:32,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2018-02-04 12:29:32,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 828. [2018-02-04 12:29:32,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2018-02-04 12:29:32,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1196 transitions. [2018-02-04 12:29:32,089 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1196 transitions. Word has length 16 [2018-02-04 12:29:32,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:29:32,089 INFO L432 AbstractCegarLoop]: Abstraction has 828 states and 1196 transitions. [2018-02-04 12:29:32,090 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:29:32,090 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1196 transitions. [2018-02-04 12:29:32,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 12:29:32,091 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:29:32,091 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 12:29:32,091 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 12:29:32,091 INFO L82 PathProgramCache]: Analyzing trace with hash 750766986, now seen corresponding path program 1 times [2018-02-04 12:29:32,091 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:29:32,091 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:29:32,092 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:29:32,092 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:29:32,092 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:29:32,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:29:32,104 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:29:32,146 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 12:29:32,147 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:29:32,147 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-04 12:29:32,155 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:29:32,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:29:32,218 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:29:32,294 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-04 12:29:32,325 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:29:32,325 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 9 [2018-02-04 12:29:32,325 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 12:29:32,326 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 12:29:32,326 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-02-04 12:29:32,326 INFO L87 Difference]: Start difference. First operand 828 states and 1196 transitions. Second operand 9 states. [2018-02-04 12:29:32,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:29:32,670 INFO L93 Difference]: Finished difference Result 1420 states and 2030 transitions. [2018-02-04 12:29:32,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 12:29:32,670 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-02-04 12:29:32,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:29:32,676 INFO L225 Difference]: With dead ends: 1420 [2018-02-04 12:29:32,676 INFO L226 Difference]: Without dead ends: 1420 [2018-02-04 12:29:32,676 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-04 12:29:32,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2018-02-04 12:29:32,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 1268. [2018-02-04 12:29:32,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1268 states. [2018-02-04 12:29:32,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 1792 transitions. [2018-02-04 12:29:32,707 INFO L78 Accepts]: Start accepts. Automaton has 1268 states and 1792 transitions. Word has length 26 [2018-02-04 12:29:32,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:29:32,708 INFO L432 AbstractCegarLoop]: Abstraction has 1268 states and 1792 transitions. [2018-02-04 12:29:32,708 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 12:29:32,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 1792 transitions. [2018-02-04 12:29:32,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 12:29:32,709 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:29:32,709 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 12:29:32,709 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 12:29:32,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1952857995, now seen corresponding path program 1 times [2018-02-04 12:29:32,710 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:29:32,710 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:29:32,711 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:29:32,711 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:29:32,711 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:29:32,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:29:32,722 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:29:32,779 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:29:32,780 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:29:32,780 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-04 12:29:32,789 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:29:32,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:29:32,826 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:29:32,863 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:29:32,893 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 12:29:32,893 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2018-02-04 12:29:32,893 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 12:29:32,894 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 12:29:32,894 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-02-04 12:29:32,894 INFO L87 Difference]: Start difference. First operand 1268 states and 1792 transitions. Second operand 11 states. [2018-02-04 12:29:33,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:29:33,499 INFO L93 Difference]: Finished difference Result 2898 states and 4625 transitions. [2018-02-04 12:29:33,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 12:29:33,500 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-02-04 12:29:33,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:29:33,514 INFO L225 Difference]: With dead ends: 2898 [2018-02-04 12:29:33,514 INFO L226 Difference]: Without dead ends: 2898 [2018-02-04 12:29:33,515 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=265, Invalid=925, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 12:29:33,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2018-02-04 12:29:33,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 2348. [2018-02-04 12:29:33,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2348 states. [2018-02-04 12:29:33,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2348 states to 2348 states and 3475 transitions. [2018-02-04 12:29:33,604 INFO L78 Accepts]: Start accepts. Automaton has 2348 states and 3475 transitions. Word has length 27 [2018-02-04 12:29:33,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:29:33,604 INFO L432 AbstractCegarLoop]: Abstraction has 2348 states and 3475 transitions. [2018-02-04 12:29:33,604 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 12:29:33,604 INFO L276 IsEmpty]: Start isEmpty. Operand 2348 states and 3475 transitions. [2018-02-04 12:29:33,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 12:29:33,605 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:29:33,606 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:29:33,606 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 12:29:33,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1995842725, now seen corresponding path program 1 times [2018-02-04 12:29:33,606 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:29:33,606 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:29:33,607 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:29:33,607 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:29:33,607 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:29:33,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:29:33,619 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:29:33,677 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:29:33,677 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:29:33,677 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 12:29:33,678 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 12:29:33,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 12:29:33,678 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 12:29:33,678 INFO L87 Difference]: Start difference. First operand 2348 states and 3475 transitions. Second operand 7 states. [2018-02-04 12:29:33,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:29:33,846 INFO L93 Difference]: Finished difference Result 1085 states and 1347 transitions. [2018-02-04 12:29:33,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 12:29:33,847 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-02-04 12:29:33,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:29:33,850 INFO L225 Difference]: With dead ends: 1085 [2018-02-04 12:29:33,850 INFO L226 Difference]: Without dead ends: 869 [2018-02-04 12:29:33,850 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-02-04 12:29:33,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2018-02-04 12:29:33,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 772. [2018-02-04 12:29:33,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2018-02-04 12:29:33,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1012 transitions. [2018-02-04 12:29:33,868 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1012 transitions. Word has length 31 [2018-02-04 12:29:33,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:29:33,868 INFO L432 AbstractCegarLoop]: Abstraction has 772 states and 1012 transitions. [2018-02-04 12:29:33,868 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 12:29:33,868 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1012 transitions. [2018-02-04 12:29:33,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 12:29:33,869 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:29:33,869 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:29:33,869 INFO L371 AbstractCegarLoop]: === Iteration 12 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 12:29:33,870 INFO L82 PathProgramCache]: Analyzing trace with hash -663528086, now seen corresponding path program 1 times [2018-02-04 12:29:33,870 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:29:33,870 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:29:33,870 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:29:33,871 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:29:33,871 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:29:33,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:29:33,882 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:29:33,949 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:29:33,949 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:29:33,949 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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:29:33,957 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:29:34,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:29:34,003 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:29:34,025 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-02-04 12:29:34,048 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 12:29:34,048 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2018-02-04 12:29:34,049 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 12:29:34,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 12:29:34,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-04 12:29:34,049 INFO L87 Difference]: Start difference. First operand 772 states and 1012 transitions. Second operand 10 states. [2018-02-04 12:29:34,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:29:34,540 INFO L93 Difference]: Finished difference Result 2610 states and 3504 transitions. [2018-02-04 12:29:34,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 12:29:34,540 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-02-04 12:29:34,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:29:34,550 INFO L225 Difference]: With dead ends: 2610 [2018-02-04 12:29:34,550 INFO L226 Difference]: Without dead ends: 2610 [2018-02-04 12:29:34,551 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2018-02-04 12:29:34,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2610 states. [2018-02-04 12:29:34,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2610 to 2263. [2018-02-04 12:29:34,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2263 states. [2018-02-04 12:29:34,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2263 states to 2263 states and 2989 transitions. [2018-02-04 12:29:34,605 INFO L78 Accepts]: Start accepts. Automaton has 2263 states and 2989 transitions. Word has length 38 [2018-02-04 12:29:34,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:29:34,605 INFO L432 AbstractCegarLoop]: Abstraction has 2263 states and 2989 transitions. [2018-02-04 12:29:34,605 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 12:29:34,606 INFO L276 IsEmpty]: Start isEmpty. Operand 2263 states and 2989 transitions. [2018-02-04 12:29:34,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 12:29:34,606 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:29:34,607 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:29:34,607 INFO L371 AbstractCegarLoop]: === Iteration 13 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 12:29:34,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1056748287, now seen corresponding path program 1 times [2018-02-04 12:29:34,607 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:29:34,607 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:29:34,608 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:29:34,608 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:29:34,608 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:29:34,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:29:34,619 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:29:34,734 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 12:29:34,735 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:29:34,735 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:29:34,742 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:29:34,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:29:34,780 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:29:34,882 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 12:29:34,914 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:29:34,914 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2018-02-04 12:29:34,914 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 12:29:34,915 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 12:29:34,915 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-02-04 12:29:34,915 INFO L87 Difference]: Start difference. First operand 2263 states and 2989 transitions. Second operand 16 states. [2018-02-04 12:29:35,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:29:35,808 INFO L93 Difference]: Finished difference Result 2313 states and 2891 transitions. [2018-02-04 12:29:35,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 12:29:35,809 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2018-02-04 12:29:35,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:29:35,814 INFO L225 Difference]: With dead ends: 2313 [2018-02-04 12:29:35,814 INFO L226 Difference]: Without dead ends: 2259 [2018-02-04 12:29:35,814 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=341, Invalid=1465, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 12:29:35,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2259 states. [2018-02-04 12:29:35,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2259 to 1656. [2018-02-04 12:29:35,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1656 states. [2018-02-04 12:29:35,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1656 states and 2081 transitions. [2018-02-04 12:29:35,840 INFO L78 Accepts]: Start accepts. Automaton has 1656 states and 2081 transitions. Word has length 41 [2018-02-04 12:29:35,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:29:35,840 INFO L432 AbstractCegarLoop]: Abstraction has 1656 states and 2081 transitions. [2018-02-04 12:29:35,840 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 12:29:35,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 2081 transitions. [2018-02-04 12:29:35,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 12:29:35,840 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:29:35,841 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:29:35,841 INFO L371 AbstractCegarLoop]: === Iteration 14 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 12:29:35,841 INFO L82 PathProgramCache]: Analyzing trace with hash 490510064, now seen corresponding path program 1 times [2018-02-04 12:29:35,841 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:29:35,841 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:29:35,842 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:29:35,842 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:29:35,842 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:29:35,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:29:35,851 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:29:35,942 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 12:29:35,943 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:29:35,943 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:29:35,948 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:29:35,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:29:35,978 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:29:36,012 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:29:36,029 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:29:36,029 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2018-02-04 12:29:36,029 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 12:29:36,029 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 12:29:36,030 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-02-04 12:29:36,030 INFO L87 Difference]: Start difference. First operand 1656 states and 2081 transitions. Second operand 14 states. [2018-02-04 12:29:36,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:29:36,484 INFO L93 Difference]: Finished difference Result 2319 states and 2974 transitions. [2018-02-04 12:29:36,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 12:29:36,485 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 42 [2018-02-04 12:29:36,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:29:36,491 INFO L225 Difference]: With dead ends: 2319 [2018-02-04 12:29:36,491 INFO L226 Difference]: Without dead ends: 2319 [2018-02-04 12:29:36,492 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=345, Invalid=1377, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 12:29:36,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2319 states. [2018-02-04 12:29:36,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2319 to 2095. [2018-02-04 12:29:36,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2095 states. [2018-02-04 12:29:36,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2095 states to 2095 states and 2656 transitions. [2018-02-04 12:29:36,521 INFO L78 Accepts]: Start accepts. Automaton has 2095 states and 2656 transitions. Word has length 42 [2018-02-04 12:29:36,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:29:36,521 INFO L432 AbstractCegarLoop]: Abstraction has 2095 states and 2656 transitions. [2018-02-04 12:29:36,521 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 12:29:36,521 INFO L276 IsEmpty]: Start isEmpty. Operand 2095 states and 2656 transitions. [2018-02-04 12:29:36,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 12:29:36,522 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:29:36,522 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:29:36,522 INFO L371 AbstractCegarLoop]: === Iteration 15 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 12:29:36,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1425126877, now seen corresponding path program 1 times [2018-02-04 12:29:36,522 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:29:36,523 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:29:36,523 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:29:36,523 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:29:36,523 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:29:36,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:29:36,533 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:29:36,594 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 32 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 12:29:36,594 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:29:36,594 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:29:36,604 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:29:36,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:29:36,653 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:29:36,690 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 32 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 12:29:36,723 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:29:36,723 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-02-04 12:29:36,724 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 12:29:36,724 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 12:29:36,724 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-04 12:29:36,724 INFO L87 Difference]: Start difference. First operand 2095 states and 2656 transitions. Second operand 11 states. [2018-02-04 12:29:36,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:29:36,977 INFO L93 Difference]: Finished difference Result 2774 states and 3666 transitions. [2018-02-04 12:29:36,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 12:29:36,977 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2018-02-04 12:29:36,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:29:36,988 INFO L225 Difference]: With dead ends: 2774 [2018-02-04 12:29:36,989 INFO L226 Difference]: Without dead ends: 2774 [2018-02-04 12:29:36,989 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2018-02-04 12:29:36,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2774 states. [2018-02-04 12:29:37,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2774 to 2161. [2018-02-04 12:29:37,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2161 states. [2018-02-04 12:29:37,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2161 states to 2161 states and 2755 transitions. [2018-02-04 12:29:37,039 INFO L78 Accepts]: Start accepts. Automaton has 2161 states and 2755 transitions. Word has length 54 [2018-02-04 12:29:37,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:29:37,039 INFO L432 AbstractCegarLoop]: Abstraction has 2161 states and 2755 transitions. [2018-02-04 12:29:37,039 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 12:29:37,039 INFO L276 IsEmpty]: Start isEmpty. Operand 2161 states and 2755 transitions. [2018-02-04 12:29:37,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 12:29:37,040 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:29:37,040 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:29:37,041 INFO L371 AbstractCegarLoop]: === Iteration 16 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 12:29:37,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1162734491, now seen corresponding path program 1 times [2018-02-04 12:29:37,041 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:29:37,041 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:29:37,042 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:29:37,042 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:29:37,042 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:29:37,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:29:37,055 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:29:37,114 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 12:29:37,114 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:29:37,114 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:29:37,124 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:29:37,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:29:37,176 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:29:37,229 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 37 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 12:29:37,247 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:29:37,248 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-02-04 12:29:37,248 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 12:29:37,248 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 12:29:37,248 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-02-04 12:29:37,248 INFO L87 Difference]: Start difference. First operand 2161 states and 2755 transitions. Second operand 15 states. [2018-02-04 12:29:37,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:29:37,601 INFO L93 Difference]: Finished difference Result 3687 states and 4967 transitions. [2018-02-04 12:29:37,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 12:29:37,602 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2018-02-04 12:29:37,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:29:37,611 INFO L225 Difference]: With dead ends: 3687 [2018-02-04 12:29:37,611 INFO L226 Difference]: Without dead ends: 3615 [2018-02-04 12:29:37,611 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=803, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 12:29:37,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3615 states. [2018-02-04 12:29:37,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3615 to 2996. [2018-02-04 12:29:37,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2996 states. [2018-02-04 12:29:37,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2996 states to 2996 states and 3855 transitions. [2018-02-04 12:29:37,651 INFO L78 Accepts]: Start accepts. Automaton has 2996 states and 3855 transitions. Word has length 54 [2018-02-04 12:29:37,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:29:37,651 INFO L432 AbstractCegarLoop]: Abstraction has 2996 states and 3855 transitions. [2018-02-04 12:29:37,651 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 12:29:37,651 INFO L276 IsEmpty]: Start isEmpty. Operand 2996 states and 3855 transitions. [2018-02-04 12:29:37,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-04 12:29:37,652 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:29:37,652 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:29:37,652 INFO L371 AbstractCegarLoop]: === Iteration 17 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 12:29:37,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1047296506, now seen corresponding path program 1 times [2018-02-04 12:29:37,652 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:29:37,652 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:29:37,653 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:29:37,653 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:29:37,653 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:29:37,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:29:37,667 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:29:37,719 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 50 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-02-04 12:29:37,719 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:29:37,719 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:29:37,725 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:29:37,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:29:37,782 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:29:37,830 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 66 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-04 12:29:37,856 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:29:37,856 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-02-04 12:29:37,857 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 12:29:37,857 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 12:29:37,857 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-04 12:29:37,857 INFO L87 Difference]: Start difference. First operand 2996 states and 3855 transitions. Second operand 11 states. [2018-02-04 12:29:38,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:29:38,038 INFO L93 Difference]: Finished difference Result 3609 states and 4730 transitions. [2018-02-04 12:29:38,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 12:29:38,039 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-02-04 12:29:38,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:29:38,047 INFO L225 Difference]: With dead ends: 3609 [2018-02-04 12:29:38,047 INFO L226 Difference]: Without dead ends: 3609 [2018-02-04 12:29:38,047 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-02-04 12:29:38,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3609 states. [2018-02-04 12:29:38,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3609 to 3567. [2018-02-04 12:29:38,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3567 states. [2018-02-04 12:29:38,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3567 states to 3567 states and 4691 transitions. [2018-02-04 12:29:38,100 INFO L78 Accepts]: Start accepts. Automaton has 3567 states and 4691 transitions. Word has length 68 [2018-02-04 12:29:38,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:29:38,100 INFO L432 AbstractCegarLoop]: Abstraction has 3567 states and 4691 transitions. [2018-02-04 12:29:38,100 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 12:29:38,100 INFO L276 IsEmpty]: Start isEmpty. Operand 3567 states and 4691 transitions. [2018-02-04 12:29:38,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-04 12:29:38,101 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:29:38,102 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:29:38,102 INFO L371 AbstractCegarLoop]: === Iteration 18 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 12:29:38,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1597143259, now seen corresponding path program 1 times [2018-02-04 12:29:38,102 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:29:38,102 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:29:38,102 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:29:38,102 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:29:38,103 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:29:38,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:29:38,114 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:29:38,206 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 51 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-04 12:29:38,206 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:29:38,206 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:29:38,212 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:29:38,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:29:38,272 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:29:38,386 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 53 proven. 22 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-04 12:29:38,403 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:29:38,404 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2018-02-04 12:29:38,404 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 12:29:38,404 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 12:29:38,404 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2018-02-04 12:29:38,404 INFO L87 Difference]: Start difference. First operand 3567 states and 4691 transitions. Second operand 18 states. [2018-02-04 12:29:39,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:29:39,059 INFO L93 Difference]: Finished difference Result 6255 states and 8375 transitions. [2018-02-04 12:29:39,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 12:29:39,240 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 70 [2018-02-04 12:29:39,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:29:39,258 INFO L225 Difference]: With dead ends: 6255 [2018-02-04 12:29:39,258 INFO L226 Difference]: Without dead ends: 6156 [2018-02-04 12:29:39,259 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=291, Invalid=1041, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 12:29:39,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6156 states. [2018-02-04 12:29:39,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6156 to 4675. [2018-02-04 12:29:39,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4675 states. [2018-02-04 12:29:39,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4675 states to 4675 states and 6031 transitions. [2018-02-04 12:29:39,330 INFO L78 Accepts]: Start accepts. Automaton has 4675 states and 6031 transitions. Word has length 70 [2018-02-04 12:29:39,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:29:39,330 INFO L432 AbstractCegarLoop]: Abstraction has 4675 states and 6031 transitions. [2018-02-04 12:29:39,330 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 12:29:39,330 INFO L276 IsEmpty]: Start isEmpty. Operand 4675 states and 6031 transitions. [2018-02-04 12:29:39,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-04 12:29:39,331 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:29:39,332 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 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 12:29:39,332 INFO L371 AbstractCegarLoop]: === Iteration 19 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 12:29:39,332 INFO L82 PathProgramCache]: Analyzing trace with hash 933081794, now seen corresponding path program 1 times [2018-02-04 12:29:39,332 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:29:39,332 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:29:39,332 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:29:39,333 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:29:39,333 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:29:39,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:29:39,344 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:29:39,496 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 68 proven. 31 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-02-04 12:29:39,497 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:29:39,497 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:29:39,504 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:29:39,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:29:39,568 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:29:39,646 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 78 proven. 6 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-02-04 12:29:39,666 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:29:39,666 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-02-04 12:29:39,666 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 12:29:39,666 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 12:29:39,667 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-02-04 12:29:39,667 INFO L87 Difference]: Start difference. First operand 4675 states and 6031 transitions. Second operand 17 states. [2018-02-04 12:29:40,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:29:40,161 INFO L93 Difference]: Finished difference Result 6142 states and 8117 transitions. [2018-02-04 12:29:40,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 12:29:40,161 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 84 [2018-02-04 12:29:40,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:29:40,177 INFO L225 Difference]: With dead ends: 6142 [2018-02-04 12:29:40,177 INFO L226 Difference]: Without dead ends: 6004 [2018-02-04 12:29:40,178 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=219, Invalid=837, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 12:29:40,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6004 states. [2018-02-04 12:29:40,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6004 to 4579. [2018-02-04 12:29:40,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4579 states. [2018-02-04 12:29:40,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4579 states to 4579 states and 5837 transitions. [2018-02-04 12:29:40,279 INFO L78 Accepts]: Start accepts. Automaton has 4579 states and 5837 transitions. Word has length 84 [2018-02-04 12:29:40,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:29:40,280 INFO L432 AbstractCegarLoop]: Abstraction has 4579 states and 5837 transitions. [2018-02-04 12:29:40,280 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 12:29:40,280 INFO L276 IsEmpty]: Start isEmpty. Operand 4579 states and 5837 transitions. [2018-02-04 12:29:40,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-04 12:29:40,281 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:29:40,282 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:29:40,282 INFO L371 AbstractCegarLoop]: === Iteration 20 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 12:29:40,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1343466028, now seen corresponding path program 1 times [2018-02-04 12:29:40,282 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:29:40,282 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:29:40,283 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:29:40,283 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:29:40,283 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:29:40,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:29:40,301 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:29:40,455 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 68 proven. 35 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-02-04 12:29:40,455 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:29:40,456 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:29:40,464 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:29:40,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:29:40,528 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:29:40,655 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 101 proven. 18 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-02-04 12:29:40,673 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:29:40,673 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-02-04 12:29:40,673 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 12:29:40,673 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 12:29:40,673 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-02-04 12:29:40,674 INFO L87 Difference]: Start difference. First operand 4579 states and 5837 transitions. Second operand 18 states. [2018-02-04 12:29:41,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:29:41,268 INFO L93 Difference]: Finished difference Result 6614 states and 8422 transitions. [2018-02-04 12:29:41,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 12:29:41,268 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 87 [2018-02-04 12:29:41,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:29:41,283 INFO L225 Difference]: With dead ends: 6614 [2018-02-04 12:29:41,283 INFO L226 Difference]: Without dead ends: 6515 [2018-02-04 12:29:41,284 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=304, Invalid=1102, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 12:29:41,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6515 states. [2018-02-04 12:29:41,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6515 to 6365. [2018-02-04 12:29:41,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6365 states. [2018-02-04 12:29:41,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6365 states to 6365 states and 8191 transitions. [2018-02-04 12:29:41,375 INFO L78 Accepts]: Start accepts. Automaton has 6365 states and 8191 transitions. Word has length 87 [2018-02-04 12:29:41,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:29:41,375 INFO L432 AbstractCegarLoop]: Abstraction has 6365 states and 8191 transitions. [2018-02-04 12:29:41,375 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 12:29:41,375 INFO L276 IsEmpty]: Start isEmpty. Operand 6365 states and 8191 transitions. [2018-02-04 12:29:41,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-02-04 12:29:41,377 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:29:41,377 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:29:41,377 INFO L371 AbstractCegarLoop]: === Iteration 21 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 12:29:41,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1756447406, now seen corresponding path program 1 times [2018-02-04 12:29:41,377 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:29:41,378 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:29:41,378 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:29:41,378 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:29:41,378 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:29:41,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 12:29:41,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 12:29:41,448 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 12:29:41,492 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-04 12:29:41,499 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 12:29:41,500 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 12:29:41,501 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 12:29:41,502 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 12:29:41,502 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 12:29:41,504 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 12:29:41,505 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 12:29:41,507 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 12:29:41,509 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 12:29:41,509 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 12:29:41,511 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 12:29:41,512 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 12:29:41,514 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 12:29:41,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 12:29:41 BoogieIcfgContainer [2018-02-04 12:29:41,527 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 12:29:41,528 INFO L168 Benchmark]: Toolchain (without parser) took 11151.71 ms. Allocated memory was 385.9 MB in the beginning and 859.3 MB in the end (delta: 473.4 MB). Free memory was 342.8 MB in the beginning and 565.0 MB in the end (delta: -222.2 MB). Peak memory consumption was 251.2 MB. Max. memory is 5.3 GB. [2018-02-04 12:29:41,529 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 385.9 MB. Free memory is still 349.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 12:29:41,529 INFO L168 Benchmark]: CACSL2BoogieTranslator took 161.49 ms. Allocated memory is still 385.9 MB. Free memory was 342.8 MB in the beginning and 332.2 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 12:29:41,529 INFO L168 Benchmark]: Boogie Preprocessor took 29.82 ms. Allocated memory is still 385.9 MB. Free memory was 332.2 MB in the beginning and 329.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 12:29:41,530 INFO L168 Benchmark]: RCFGBuilder took 338.66 ms. Allocated memory is still 385.9 MB. Free memory was 329.5 MB in the beginning and 302.2 MB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 5.3 GB. [2018-02-04 12:29:41,530 INFO L168 Benchmark]: TraceAbstraction took 10618.88 ms. Allocated memory was 385.9 MB in the beginning and 859.3 MB in the end (delta: 473.4 MB). Free memory was 302.2 MB in the beginning and 565.0 MB in the end (delta: -262.8 MB). Peak memory consumption was 210.7 MB. Max. memory is 5.3 GB. [2018-02-04 12:29:41,531 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.10 ms. Allocated memory is still 385.9 MB. Free memory is still 349.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 161.49 ms. Allocated memory is still 385.9 MB. Free memory was 342.8 MB in the beginning and 332.2 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.82 ms. Allocated memory is still 385.9 MB. Free memory was 332.2 MB in the beginning and 329.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 338.66 ms. Allocated memory is still 385.9 MB. Free memory was 329.5 MB in the beginning and 302.2 MB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 10618.88 ms. Allocated memory was 385.9 MB in the beginning and 859.3 MB in the end (delta: 473.4 MB). Free memory was 302.2 MB in the beginning and 565.0 MB in the end (delta: -262.8 MB). Peak memory consumption was 210.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 - 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 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 688]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L625] int pc1 = 1; [L626] int pc4 = 1; [L624] struct cell *S; [L627] static struct cell *t1 = ((void *)0); [L628] static struct cell *x1 = ((void *)0); [L657] struct cell* garbage; [L658] static struct cell *t4 = ((void *)0); [L659] static struct cell *x4 = ((void *)0); [L662] static int res4; VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \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}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 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] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \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] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=2, \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)=12, \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}] [L631] pc1++ [L632] case 1: [L637] case 2: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=2, \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)=12, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L638] RET, FCALL x1->data = 4 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=2, \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)=12, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc1++=2, 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=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \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=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=3, \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)=12, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L631] pc1++ [L632] case 1: [L637] case 2: [L640] case 3: [L641] RET t1 = S VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=3, \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)=12, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc1++=3, 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=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \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=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \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)=12, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L631] pc1++ [L632] case 1: [L637] case 2: [L640] case 3: [L643] case 4: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \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)=12, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L644] RET, FCALL x1->next = t1 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \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)=12, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc1++=4, 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=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \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=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \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)=12, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L631] pc1++ [L632] case 1: [L637] case 2: [L640] case 3: [L643] case 4: [L646] case 5: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \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)=12, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L647] COND TRUE S == t1 [L648] RET S = x1 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \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)=12, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={12: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=6, pc4=1, res4=0, S={12:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \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=6, pc4=1, res4=0, S={12:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=12, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=12, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=1, res4=0, S={12:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L631] pc1++ [L632] case 1: [L637] case 2: [L640] case 3: [L643] case 4: [L646] case 5: [L652] case 6: [L653] RET pc1 = 1 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=12, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=12, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc1++=6, pc4=1, res4=0, S={12: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=1, pc4=1, res4=0, S={12:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=0, \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=1, pc4=1, res4=0, S={12:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] COND FALSE !(1 != pc1 || 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=1, pc4=1, res4=0, S={12: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=1, 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, 10.5s OverallTime, 21 OverallIterations, 7 TraceHistogramMax, 6.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1975 SDtfs, 5529 SDslu, 4189 SDs, 0 SdLazy, 6189 SolverSat, 1338 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1009 GetRequests, 659 SyntacticMatches, 6 SemanticMatches, 344 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2374 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6365occurred in iteration=20, 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.7s AutomataMinimizationTime, 20 MinimizatonAttempts, 6444 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1417 NumberOfCodeBlocks, 1417 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1291 ConstructedInterpolants, 0 QuantifiedInterpolants, 184901 SizeOfPredicates, 45 NumberOfNonLiveVariables, 4705 ConjunctsInSsa, 125 ConjunctsInUnsatCore, 31 InterpolantComputations, 11 PerfectInterpolantSequences, 1042/1239 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_12-29-41-537.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_12-29-41-537.csv Received shutdown request...