java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/memsafety/lockfree-3.1_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 17:52:16,481 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 17:52:16,483 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 17:52:16,496 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 17:52:16,496 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 17:52:16,497 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 17:52:16,497 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 17:52:16,499 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 17:52:16,500 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 17:52:16,501 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 17:52:16,502 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 17:52:16,502 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 17:52:16,503 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 17:52:16,504 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 17:52:16,504 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 17:52:16,506 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 17:52:16,507 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 17:52:16,509 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 17:52:16,510 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 17:52:16,511 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 17:52:16,512 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 17:52:16,513 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 17:52:16,513 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 17:52:16,514 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 17:52:16,514 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 17:52:16,515 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 17:52:16,515 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 17:52:16,516 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 17:52:16,516 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 17:52:16,516 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 17:52:16,516 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 17:52:16,516 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-04 17:52:16,525 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 17:52:16,525 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 17:52:16,526 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 17:52:16,526 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 17:52:16,526 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 17:52:16,526 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 17:52:16,526 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 17:52:16,526 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 17:52:16,526 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 17:52:16,527 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 17:52:16,527 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 17:52:16,527 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 17:52:16,527 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 17:52:16,527 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 17:52:16,527 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 17:52:16,527 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 17:52:16,527 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 17:52:16,527 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 17:52:16,528 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 17:52:16,528 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 17:52:16,528 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 17:52:16,528 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 17:52:16,528 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 17:52:16,528 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 17:52:16,554 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 17:52:16,564 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 17:52:16,567 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 17:52:16,568 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 17:52:16,569 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 17:52:16,569 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 17:52:16,718 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 17:52:16,719 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 17:52:16,720 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 17:52:16,720 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 17:52:16,725 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 17:52:16,726 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:52:16" (1/1) ... [2018-02-04 17:52:16,728 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34e66bcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:52:16, skipping insertion in model container [2018-02-04 17:52:16,728 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:52:16" (1/1) ... [2018-02-04 17:52:16,742 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:52:16,771 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:52:16,857 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:52:16,875 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:52:16,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:52:16 WrapperNode [2018-02-04 17:52:16,881 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 17:52:16,882 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 17:52:16,882 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 17:52:16,882 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 17:52:16,892 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:52:16" (1/1) ... [2018-02-04 17:52:16,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:52:16" (1/1) ... [2018-02-04 17:52:16,900 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:52:16" (1/1) ... [2018-02-04 17:52:16,900 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:52:16" (1/1) ... [2018-02-04 17:52:16,903 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:52:16" (1/1) ... [2018-02-04 17:52:16,906 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:52:16" (1/1) ... [2018-02-04 17:52:16,907 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:52:16" (1/1) ... [2018-02-04 17:52:16,908 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 17:52:16,909 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 17:52:16,909 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 17:52:16,909 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 17:52:16,909 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:52:16" (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 17:52:16,944 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 17:52:16,944 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 17:52:16,944 INFO L136 BoogieDeclarations]: Found implementation of procedure push [2018-02-04 17:52:16,944 INFO L136 BoogieDeclarations]: Found implementation of procedure pop [2018-02-04 17:52:16,944 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 17:52:16,945 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 17:52:16,945 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 17:52:16,945 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 17:52:16,945 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 17:52:16,945 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 17:52:16,945 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 17:52:16,945 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 17:52:16,945 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 17:52:16,945 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 17:52:16,945 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 17:52:16,945 INFO L128 BoogieDeclarations]: Found specification of procedure push [2018-02-04 17:52:16,945 INFO L128 BoogieDeclarations]: Found specification of procedure pop [2018-02-04 17:52:16,946 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 17:52:16,946 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 17:52:16,946 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 17:52:17,204 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 17:52:17,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:52:17 BoogieIcfgContainer [2018-02-04 17:52:17,204 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 17:52:17,205 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 17:52:17,205 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 17:52:17,208 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 17:52:17,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 05:52:16" (1/3) ... [2018-02-04 17:52:17,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c765b65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:52:17, skipping insertion in model container [2018-02-04 17:52:17,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:52:16" (2/3) ... [2018-02-04 17:52:17,209 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c765b65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:52:17, skipping insertion in model container [2018-02-04 17:52:17,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:52:17" (3/3) ... [2018-02-04 17:52:17,210 INFO L107 eAbstractionObserver]: Analyzing ICFG lockfree-3.1_false-valid-memtrack.i [2018-02-04 17:52:17,217 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 17:52:17,223 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-02-04 17:52:17,255 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 17:52:17,255 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 17:52:17,255 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 17:52:17,255 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 17:52:17,255 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 17:52:17,256 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 17:52:17,256 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 17:52:17,256 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 17:52:17,257 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 17:52:17,268 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-02-04 17:52:17,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-02-04 17:52:17,276 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:52:17,277 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:52:17,277 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 17:52:17,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1799126466, now seen corresponding path program 1 times [2018-02-04 17:52:17,283 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:52:17,283 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:52:17,326 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:17,327 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:17,327 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:17,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:17,376 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:52:17,409 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 17:52:17,411 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:52:17,411 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 17:52:17,412 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-04 17:52:17,423 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-04 17:52:17,424 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-04 17:52:17,426 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 2 states. [2018-02-04 17:52:17,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:52:17,512 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2018-02-04 17:52:17,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-04 17:52:17,514 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-02-04 17:52:17,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:52:17,523 INFO L225 Difference]: With dead ends: 76 [2018-02-04 17:52:17,523 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 17:52:17,524 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 17:52:17,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 17:52:17,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-02-04 17:52:17,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-04 17:52:17,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 90 transitions. [2018-02-04 17:52:17,548 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 90 transitions. Word has length 9 [2018-02-04 17:52:17,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:52:17,548 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 90 transitions. [2018-02-04 17:52:17,549 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-04 17:52:17,549 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2018-02-04 17:52:17,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-04 17:52:17,549 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:52:17,549 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:52:17,549 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 17:52:17,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1199640283, now seen corresponding path program 1 times [2018-02-04 17:52:17,550 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:52:17,550 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:52:17,551 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:17,551 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:17,551 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:17,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:17,565 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:52:17,601 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 17:52:17,601 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:52:17,601 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 17:52:17,602 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 17:52:17,603 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 17:52:17,603 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 17:52:17,603 INFO L87 Difference]: Start difference. First operand 73 states and 90 transitions. Second operand 3 states. [2018-02-04 17:52:17,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:52:17,619 INFO L93 Difference]: Finished difference Result 74 states and 91 transitions. [2018-02-04 17:52:17,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 17:52:17,620 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-02-04 17:52:17,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:52:17,621 INFO L225 Difference]: With dead ends: 74 [2018-02-04 17:52:17,621 INFO L226 Difference]: Without dead ends: 74 [2018-02-04 17:52:17,621 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 17:52:17,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-04 17:52:17,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-02-04 17:52:17,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-04 17:52:17,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2018-02-04 17:52:17,627 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 12 [2018-02-04 17:52:17,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:52:17,627 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2018-02-04 17:52:17,628 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 17:52:17,628 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2018-02-04 17:52:17,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-04 17:52:17,628 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:52:17,628 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:52:17,628 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 17:52:17,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1201487325, now seen corresponding path program 1 times [2018-02-04 17:52:17,629 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:52:17,629 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:52:17,630 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:17,630 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:17,630 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:17,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:17,649 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:52:17,692 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 17:52:17,692 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:52:17,692 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 17:52:17,692 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 17:52:17,692 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 17:52:17,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 17:52:17,693 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand 3 states. [2018-02-04 17:52:17,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:52:17,725 INFO L93 Difference]: Finished difference Result 132 states and 167 transitions. [2018-02-04 17:52:17,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 17:52:17,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-02-04 17:52:17,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:52:17,727 INFO L225 Difference]: With dead ends: 132 [2018-02-04 17:52:17,727 INFO L226 Difference]: Without dead ends: 132 [2018-02-04 17:52:17,728 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 17:52:17,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-04 17:52:17,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 114. [2018-02-04 17:52:17,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-04 17:52:17,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2018-02-04 17:52:17,739 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 12 [2018-02-04 17:52:17,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:52:17,740 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2018-02-04 17:52:17,740 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 17:52:17,740 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2018-02-04 17:52:17,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 17:52:17,740 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:52:17,740 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:52:17,741 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 17:52:17,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1408600152, now seen corresponding path program 1 times [2018-02-04 17:52:17,741 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:52:17,741 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:52:17,742 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:17,742 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:17,742 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:17,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:17,754 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:52:17,776 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 17:52:17,776 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:52:17,776 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 17:52:17,776 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 17:52:17,776 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 17:52:17,777 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 17:52:17,777 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand 3 states. [2018-02-04 17:52:17,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:52:17,830 INFO L93 Difference]: Finished difference Result 147 states and 205 transitions. [2018-02-04 17:52:17,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 17:52:17,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-02-04 17:52:17,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:52:17,832 INFO L225 Difference]: With dead ends: 147 [2018-02-04 17:52:17,832 INFO L226 Difference]: Without dead ends: 143 [2018-02-04 17:52:17,833 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 17:52:17,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-04 17:52:17,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 135. [2018-02-04 17:52:17,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-04 17:52:17,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 192 transitions. [2018-02-04 17:52:17,844 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 192 transitions. Word has length 13 [2018-02-04 17:52:17,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:52:17,844 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 192 transitions. [2018-02-04 17:52:17,844 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 17:52:17,844 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 192 transitions. [2018-02-04 17:52:17,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 17:52:17,845 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:52:17,845 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:52:17,845 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 17:52:17,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1628464921, now seen corresponding path program 1 times [2018-02-04 17:52:17,845 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:52:17,846 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:52:17,846 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:17,846 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:17,847 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:17,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:17,858 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:52:17,909 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 17:52:17,909 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:52:17,910 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 17:52:17,910 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:52:17,910 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:52:17,910 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:52:17,910 INFO L87 Difference]: Start difference. First operand 135 states and 192 transitions. Second operand 5 states. [2018-02-04 17:52:17,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:52:17,971 INFO L93 Difference]: Finished difference Result 255 states and 357 transitions. [2018-02-04 17:52:17,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:52:17,972 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-04 17:52:17,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:52:17,974 INFO L225 Difference]: With dead ends: 255 [2018-02-04 17:52:17,974 INFO L226 Difference]: Without dead ends: 255 [2018-02-04 17:52:17,974 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 17:52:17,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-02-04 17:52:17,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 226. [2018-02-04 17:52:17,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-02-04 17:52:17,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 338 transitions. [2018-02-04 17:52:17,988 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 338 transitions. Word has length 15 [2018-02-04 17:52:17,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:52:17,988 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 338 transitions. [2018-02-04 17:52:17,988 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:52:17,988 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 338 transitions. [2018-02-04 17:52:17,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 17:52:17,989 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:52:17,989 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:52:17,989 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 17:52:17,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474006, now seen corresponding path program 1 times [2018-02-04 17:52:17,989 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:52:17,989 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:52:17,990 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:17,990 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:17,990 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:18,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:18,001 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:52:18,025 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 17:52:18,025 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:52:18,025 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 17:52:18,025 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 17:52:18,025 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 17:52:18,026 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 17:52:18,026 INFO L87 Difference]: Start difference. First operand 226 states and 338 transitions. Second operand 4 states. [2018-02-04 17:52:18,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:52:18,087 INFO L93 Difference]: Finished difference Result 386 states and 569 transitions. [2018-02-04 17:52:18,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 17:52:18,088 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-04 17:52:18,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:52:18,090 INFO L225 Difference]: With dead ends: 386 [2018-02-04 17:52:18,090 INFO L226 Difference]: Without dead ends: 386 [2018-02-04 17:52:18,090 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 17:52:18,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-02-04 17:52:18,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 358. [2018-02-04 17:52:18,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-02-04 17:52:18,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 548 transitions. [2018-02-04 17:52:18,105 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 548 transitions. Word has length 16 [2018-02-04 17:52:18,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:52:18,105 INFO L432 AbstractCegarLoop]: Abstraction has 358 states and 548 transitions. [2018-02-04 17:52:18,105 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 17:52:18,105 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 548 transitions. [2018-02-04 17:52:18,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 17:52:18,106 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:52:18,106 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:52:18,106 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 17:52:18,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474005, now seen corresponding path program 1 times [2018-02-04 17:52:18,107 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:52:18,107 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:52:18,107 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:18,108 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:18,108 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:18,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:18,118 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:52:18,154 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 17:52:18,155 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:52:18,155 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 17:52:18,155 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 17:52:18,155 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 17:52:18,155 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 17:52:18,156 INFO L87 Difference]: Start difference. First operand 358 states and 548 transitions. Second operand 4 states. [2018-02-04 17:52:18,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:52:18,239 INFO L93 Difference]: Finished difference Result 485 states and 716 transitions. [2018-02-04 17:52:18,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 17:52:18,239 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-04 17:52:18,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:52:18,242 INFO L225 Difference]: With dead ends: 485 [2018-02-04 17:52:18,242 INFO L226 Difference]: Without dead ends: 485 [2018-02-04 17:52:18,242 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 17:52:18,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-02-04 17:52:18,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 460. [2018-02-04 17:52:18,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-02-04 17:52:18,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 696 transitions. [2018-02-04 17:52:18,258 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 696 transitions. Word has length 16 [2018-02-04 17:52:18,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:52:18,259 INFO L432 AbstractCegarLoop]: Abstraction has 460 states and 696 transitions. [2018-02-04 17:52:18,259 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 17:52:18,259 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 696 transitions. [2018-02-04 17:52:18,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 17:52:18,259 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:52:18,259 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:52:18,260 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 17:52:18,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1708141764, now seen corresponding path program 1 times [2018-02-04 17:52:18,260 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:52:18,260 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:52:18,261 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:18,261 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:18,261 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:18,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:18,270 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:52:18,296 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 17:52:18,296 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:52:18,296 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 17:52:18,296 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:52:18,297 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:52:18,297 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:52:18,297 INFO L87 Difference]: Start difference. First operand 460 states and 696 transitions. Second operand 5 states. [2018-02-04 17:52:18,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:52:18,344 INFO L93 Difference]: Finished difference Result 861 states and 1225 transitions. [2018-02-04 17:52:18,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:52:18,344 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-02-04 17:52:18,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:52:18,348 INFO L225 Difference]: With dead ends: 861 [2018-02-04 17:52:18,348 INFO L226 Difference]: Without dead ends: 861 [2018-02-04 17:52:18,348 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 17:52:18,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2018-02-04 17:52:18,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 828. [2018-02-04 17:52:18,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2018-02-04 17:52:18,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1196 transitions. [2018-02-04 17:52:18,371 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1196 transitions. Word has length 16 [2018-02-04 17:52:18,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:52:18,371 INFO L432 AbstractCegarLoop]: Abstraction has 828 states and 1196 transitions. [2018-02-04 17:52:18,372 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:52:18,372 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1196 transitions. [2018-02-04 17:52:18,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 17:52:18,372 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:52:18,373 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 17:52:18,373 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 17:52:18,373 INFO L82 PathProgramCache]: Analyzing trace with hash 750766986, now seen corresponding path program 1 times [2018-02-04 17:52:18,373 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:52:18,373 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:52:18,374 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:18,374 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:18,374 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:18,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:18,385 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:52:18,428 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 17:52:18,428 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:52:18,428 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:52:18,429 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:18,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:18,485 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:52:18,528 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 17:52:18,528 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:52:18,528 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-02-04 17:52:18,529 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 17:52:18,529 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 17:52:18,529 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 17:52:18,529 INFO L87 Difference]: Start difference. First operand 828 states and 1196 transitions. Second operand 6 states. [2018-02-04 17:52:18,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:52:18,602 INFO L93 Difference]: Finished difference Result 1289 states and 1809 transitions. [2018-02-04 17:52:18,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 17:52:18,604 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-04 17:52:18,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:52:18,609 INFO L225 Difference]: With dead ends: 1289 [2018-02-04 17:52:18,609 INFO L226 Difference]: Without dead ends: 1289 [2018-02-04 17:52:18,610 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-04 17:52:18,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2018-02-04 17:52:18,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1220. [2018-02-04 17:52:18,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1220 states. [2018-02-04 17:52:18,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 1220 states and 1744 transitions. [2018-02-04 17:52:18,643 INFO L78 Accepts]: Start accepts. Automaton has 1220 states and 1744 transitions. Word has length 26 [2018-02-04 17:52:18,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:52:18,644 INFO L432 AbstractCegarLoop]: Abstraction has 1220 states and 1744 transitions. [2018-02-04 17:52:18,644 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 17:52:18,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 1744 transitions. [2018-02-04 17:52:18,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 17:52:18,645 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:52:18,645 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 17:52:18,645 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 17:52:18,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1952857995, now seen corresponding path program 1 times [2018-02-04 17:52:18,645 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:52:18,646 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:52:18,646 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:18,646 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:18,646 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:18,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:18,657 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:52:18,719 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 17:52:18,719 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:52:18,719 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:52:18,720 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:18,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:18,753 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:52:18,783 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 17:52:18,783 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:52:18,783 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2018-02-04 17:52:18,783 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 17:52:18,783 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 17:52:18,784 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-02-04 17:52:18,784 INFO L87 Difference]: Start difference. First operand 1220 states and 1744 transitions. Second operand 11 states. [2018-02-04 17:52:19,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:52:19,391 INFO L93 Difference]: Finished difference Result 2826 states and 4553 transitions. [2018-02-04 17:52:19,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 17:52:19,391 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-02-04 17:52:19,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:52:19,406 INFO L225 Difference]: With dead ends: 2826 [2018-02-04 17:52:19,406 INFO L226 Difference]: Without dead ends: 2826 [2018-02-04 17:52:19,406 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=265, Invalid=925, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 17:52:19,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2826 states. [2018-02-04 17:52:19,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2826 to 2276. [2018-02-04 17:52:19,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2276 states. [2018-02-04 17:52:19,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2276 states to 2276 states and 3403 transitions. [2018-02-04 17:52:19,505 INFO L78 Accepts]: Start accepts. Automaton has 2276 states and 3403 transitions. Word has length 27 [2018-02-04 17:52:19,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:52:19,505 INFO L432 AbstractCegarLoop]: Abstraction has 2276 states and 3403 transitions. [2018-02-04 17:52:19,505 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 17:52:19,505 INFO L276 IsEmpty]: Start isEmpty. Operand 2276 states and 3403 transitions. [2018-02-04 17:52:19,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 17:52:19,510 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:52:19,510 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 17:52:19,510 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 17:52:19,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1995842725, now seen corresponding path program 1 times [2018-02-04 17:52:19,510 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:52:19,510 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:52:19,511 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:19,511 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:19,512 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:19,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:19,526 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:52:19,597 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 17:52:19,597 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:52:19,597 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 17:52:19,598 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 17:52:19,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 17:52:19,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 17:52:19,598 INFO L87 Difference]: Start difference. First operand 2276 states and 3403 transitions. Second operand 7 states. [2018-02-04 17:52:19,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:52:19,768 INFO L93 Difference]: Finished difference Result 1061 states and 1323 transitions. [2018-02-04 17:52:19,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 17:52:19,769 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-02-04 17:52:19,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:52:19,772 INFO L225 Difference]: With dead ends: 1061 [2018-02-04 17:52:19,772 INFO L226 Difference]: Without dead ends: 845 [2018-02-04 17:52:19,773 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 17:52:19,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2018-02-04 17:52:19,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 748. [2018-02-04 17:52:19,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2018-02-04 17:52:19,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 988 transitions. [2018-02-04 17:52:19,792 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 988 transitions. Word has length 31 [2018-02-04 17:52:19,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:52:19,792 INFO L432 AbstractCegarLoop]: Abstraction has 748 states and 988 transitions. [2018-02-04 17:52:19,792 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 17:52:19,792 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 988 transitions. [2018-02-04 17:52:19,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 17:52:19,793 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:52:19,793 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:52:19,793 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 17:52:19,794 INFO L82 PathProgramCache]: Analyzing trace with hash 735152201, now seen corresponding path program 1 times [2018-02-04 17:52:19,794 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:52:19,794 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:52:19,794 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:19,794 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:19,795 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:19,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:19,806 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:52:19,952 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:52:19,952 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:52:19,952 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:52:19,953 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:19,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:19,976 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:52:20,017 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:52:20,018 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:52:20,018 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2018-02-04 17:52:20,018 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 17:52:20,018 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 17:52:20,018 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-04 17:52:20,018 INFO L87 Difference]: Start difference. First operand 748 states and 988 transitions. Second operand 12 states. [2018-02-04 17:52:20,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:52:20,722 INFO L93 Difference]: Finished difference Result 1376 states and 1800 transitions. [2018-02-04 17:52:20,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 17:52:20,723 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-02-04 17:52:20,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:52:20,728 INFO L225 Difference]: With dead ends: 1376 [2018-02-04 17:52:20,728 INFO L226 Difference]: Without dead ends: 1370 [2018-02-04 17:52:20,728 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=158, Invalid=598, Unknown=0, NotChecked=0, Total=756 [2018-02-04 17:52:20,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2018-02-04 17:52:20,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1040. [2018-02-04 17:52:20,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1040 states. [2018-02-04 17:52:20,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 1372 transitions. [2018-02-04 17:52:20,757 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 1372 transitions. Word has length 31 [2018-02-04 17:52:20,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:52:20,757 INFO L432 AbstractCegarLoop]: Abstraction has 1040 states and 1372 transitions. [2018-02-04 17:52:20,757 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 17:52:20,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1372 transitions. [2018-02-04 17:52:20,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 17:52:20,758 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:52:20,758 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 17:52:20,758 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 17:52:20,758 INFO L82 PathProgramCache]: Analyzing trace with hash -663528086, now seen corresponding path program 1 times [2018-02-04 17:52:20,759 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:52:20,759 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:52:20,759 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:20,759 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:20,759 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:20,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:20,769 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:52:20,833 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 17:52:20,833 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:52:20,833 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:52:20,834 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:20,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:20,858 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:52:20,882 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 17:52:20,882 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:52:20,882 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2018-02-04 17:52:20,883 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 17:52:20,883 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 17:52:20,883 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-04 17:52:20,883 INFO L87 Difference]: Start difference. First operand 1040 states and 1372 transitions. Second operand 10 states. [2018-02-04 17:52:21,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:52:21,365 INFO L93 Difference]: Finished difference Result 2596 states and 3391 transitions. [2018-02-04 17:52:21,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 17:52:21,366 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-02-04 17:52:21,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:52:21,374 INFO L225 Difference]: With dead ends: 2596 [2018-02-04 17:52:21,375 INFO L226 Difference]: Without dead ends: 2596 [2018-02-04 17:52:21,375 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2018-02-04 17:52:21,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2596 states. [2018-02-04 17:52:21,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2596 to 2209. [2018-02-04 17:52:21,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2209 states. [2018-02-04 17:52:21,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2209 states to 2209 states and 2909 transitions. [2018-02-04 17:52:21,455 INFO L78 Accepts]: Start accepts. Automaton has 2209 states and 2909 transitions. Word has length 38 [2018-02-04 17:52:21,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:52:21,455 INFO L432 AbstractCegarLoop]: Abstraction has 2209 states and 2909 transitions. [2018-02-04 17:52:21,455 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 17:52:21,455 INFO L276 IsEmpty]: Start isEmpty. Operand 2209 states and 2909 transitions. [2018-02-04 17:52:21,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 17:52:21,456 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:52:21,456 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 17:52:21,456 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 17:52:21,456 INFO L82 PathProgramCache]: Analyzing trace with hash 490510064, now seen corresponding path program 1 times [2018-02-04 17:52:21,456 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:52:21,456 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:52:21,457 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:21,457 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:21,457 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:21,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:21,468 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:52:21,549 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 17:52:21,549 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:52:21,549 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:52:21,550 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:21,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:21,575 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:52:21,651 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 17:52:21,651 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:52:21,651 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2018-02-04 17:52:21,652 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 17:52:21,652 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 17:52:21,652 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-02-04 17:52:21,652 INFO L87 Difference]: Start difference. First operand 2209 states and 2909 transitions. Second operand 14 states. [2018-02-04 17:52:22,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:52:22,371 INFO L93 Difference]: Finished difference Result 4674 states and 6633 transitions. [2018-02-04 17:52:22,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 17:52:22,371 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 42 [2018-02-04 17:52:22,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:52:22,391 INFO L225 Difference]: With dead ends: 4674 [2018-02-04 17:52:22,391 INFO L226 Difference]: Without dead ends: 4674 [2018-02-04 17:52:22,392 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=345, Invalid=1377, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 17:52:22,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4674 states. [2018-02-04 17:52:22,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4674 to 3089. [2018-02-04 17:52:22,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3089 states. [2018-02-04 17:52:22,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3089 states to 3089 states and 4113 transitions. [2018-02-04 17:52:22,494 INFO L78 Accepts]: Start accepts. Automaton has 3089 states and 4113 transitions. Word has length 42 [2018-02-04 17:52:22,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:52:22,494 INFO L432 AbstractCegarLoop]: Abstraction has 3089 states and 4113 transitions. [2018-02-04 17:52:22,494 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 17:52:22,494 INFO L276 IsEmpty]: Start isEmpty. Operand 3089 states and 4113 transitions. [2018-02-04 17:52:22,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 17:52:22,495 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:52:22,495 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:52:22,495 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 17:52:22,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1922656245, now seen corresponding path program 1 times [2018-02-04 17:52:22,496 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:52:22,496 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:52:22,496 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:22,496 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:22,496 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:22,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:22,507 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:52:22,623 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 17:52:22,623 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:52:22,624 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:52:22,624 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:22,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:22,651 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:52:22,726 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:52:22,727 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:52:22,727 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2018-02-04 17:52:22,727 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 17:52:22,727 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 17:52:22,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-02-04 17:52:22,727 INFO L87 Difference]: Start difference. First operand 3089 states and 4113 transitions. Second operand 13 states. [2018-02-04 17:52:23,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:52:23,589 INFO L93 Difference]: Finished difference Result 2517 states and 3288 transitions. [2018-02-04 17:52:23,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 17:52:23,595 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2018-02-04 17:52:23,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:52:23,604 INFO L225 Difference]: With dead ends: 2517 [2018-02-04 17:52:23,604 INFO L226 Difference]: Without dead ends: 2457 [2018-02-04 17:52:23,604 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=281, Invalid=1051, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 17:52:23,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2457 states. [2018-02-04 17:52:23,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2457 to 2285. [2018-02-04 17:52:23,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2285 states. [2018-02-04 17:52:23,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2285 states to 2285 states and 3005 transitions. [2018-02-04 17:52:23,658 INFO L78 Accepts]: Start accepts. Automaton has 2285 states and 3005 transitions. Word has length 43 [2018-02-04 17:52:23,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:52:23,658 INFO L432 AbstractCegarLoop]: Abstraction has 2285 states and 3005 transitions. [2018-02-04 17:52:23,658 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 17:52:23,658 INFO L276 IsEmpty]: Start isEmpty. Operand 2285 states and 3005 transitions. [2018-02-04 17:52:23,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 17:52:23,659 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:52:23,659 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 17:52:23,659 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 17:52:23,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1425126877, now seen corresponding path program 1 times [2018-02-04 17:52:23,660 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:52:23,660 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:52:23,660 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:23,660 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:23,661 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:23,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:23,674 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:52:23,743 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 17:52:23,743 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:52:23,743 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:52:23,743 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:23,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:23,769 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:52:23,799 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 17:52:23,800 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:52:23,800 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-02-04 17:52:23,800 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 17:52:23,800 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 17:52:23,800 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-04 17:52:23,800 INFO L87 Difference]: Start difference. First operand 2285 states and 3005 transitions. Second operand 11 states. [2018-02-04 17:52:24,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:52:24,039 INFO L93 Difference]: Finished difference Result 3038 states and 4173 transitions. [2018-02-04 17:52:24,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 17:52:24,055 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2018-02-04 17:52:24,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:52:24,062 INFO L225 Difference]: With dead ends: 3038 [2018-02-04 17:52:24,062 INFO L226 Difference]: Without dead ends: 3038 [2018-02-04 17:52:24,062 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 17:52:24,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3038 states. [2018-02-04 17:52:24,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3038 to 2375. [2018-02-04 17:52:24,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2375 states. [2018-02-04 17:52:24,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2375 states to 2375 states and 3139 transitions. [2018-02-04 17:52:24,100 INFO L78 Accepts]: Start accepts. Automaton has 2375 states and 3139 transitions. Word has length 54 [2018-02-04 17:52:24,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:52:24,100 INFO L432 AbstractCegarLoop]: Abstraction has 2375 states and 3139 transitions. [2018-02-04 17:52:24,100 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 17:52:24,100 INFO L276 IsEmpty]: Start isEmpty. Operand 2375 states and 3139 transitions. [2018-02-04 17:52:24,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 17:52:24,101 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:52:24,101 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 17:52:24,101 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 17:52:24,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1162734491, now seen corresponding path program 1 times [2018-02-04 17:52:24,101 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:52:24,101 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:52:24,102 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:24,102 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:24,102 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:24,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:24,110 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:52:24,160 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 17:52:24,160 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:52:24,160 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:52:24,161 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:24,178 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:52:24,238 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 17:52:24,238 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:52:24,238 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-02-04 17:52:24,239 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 17:52:24,239 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 17:52:24,239 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-02-04 17:52:24,239 INFO L87 Difference]: Start difference. First operand 2375 states and 3139 transitions. Second operand 15 states. [2018-02-04 17:52:24,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:52:24,769 INFO L93 Difference]: Finished difference Result 4079 states and 5699 transitions. [2018-02-04 17:52:24,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 17:52:24,769 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2018-02-04 17:52:24,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:52:24,783 INFO L225 Difference]: With dead ends: 4079 [2018-02-04 17:52:24,783 INFO L226 Difference]: Without dead ends: 3987 [2018-02-04 17:52:24,783 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 17:52:24,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3987 states. [2018-02-04 17:52:24,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3987 to 3310. [2018-02-04 17:52:24,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3310 states. [2018-02-04 17:52:24,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3310 states to 3310 states and 4399 transitions. [2018-02-04 17:52:24,854 INFO L78 Accepts]: Start accepts. Automaton has 3310 states and 4399 transitions. Word has length 54 [2018-02-04 17:52:24,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:52:24,855 INFO L432 AbstractCegarLoop]: Abstraction has 3310 states and 4399 transitions. [2018-02-04 17:52:24,855 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 17:52:24,855 INFO L276 IsEmpty]: Start isEmpty. Operand 3310 states and 4399 transitions. [2018-02-04 17:52:24,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-04 17:52:24,856 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:52:24,856 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 17:52:24,857 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 17:52:24,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1047296506, now seen corresponding path program 1 times [2018-02-04 17:52:24,857 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:52:24,857 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:52:24,858 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:24,858 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:24,858 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:24,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:24,873 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:52:24,961 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 17:52:24,961 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:52:24,961 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:52:24,961 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:24,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:24,982 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:52:25,008 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 17:52:25,009 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:52:25,009 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-02-04 17:52:25,009 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 17:52:25,009 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 17:52:25,009 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-04 17:52:25,009 INFO L87 Difference]: Start difference. First operand 3310 states and 4399 transitions. Second operand 11 states. [2018-02-04 17:52:25,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:52:25,198 INFO L93 Difference]: Finished difference Result 3981 states and 5400 transitions. [2018-02-04 17:52:25,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 17:52:25,198 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-02-04 17:52:25,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:52:25,207 INFO L225 Difference]: With dead ends: 3981 [2018-02-04 17:52:25,207 INFO L226 Difference]: Without dead ends: 3981 [2018-02-04 17:52:25,208 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 17:52:25,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3981 states. [2018-02-04 17:52:25,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3981 to 3929. [2018-02-04 17:52:25,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3929 states. [2018-02-04 17:52:25,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3929 states to 3929 states and 5350 transitions. [2018-02-04 17:52:25,261 INFO L78 Accepts]: Start accepts. Automaton has 3929 states and 5350 transitions. Word has length 68 [2018-02-04 17:52:25,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:52:25,262 INFO L432 AbstractCegarLoop]: Abstraction has 3929 states and 5350 transitions. [2018-02-04 17:52:25,262 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 17:52:25,262 INFO L276 IsEmpty]: Start isEmpty. Operand 3929 states and 5350 transitions. [2018-02-04 17:52:25,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-04 17:52:25,263 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:52:25,264 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 17:52:25,264 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 17:52:25,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1597143259, now seen corresponding path program 1 times [2018-02-04 17:52:25,264 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:52:25,264 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:52:25,264 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:25,264 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:25,265 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:25,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:25,274 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:52:25,395 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 17:52:25,395 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:52:25,395 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:52:25,396 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:25,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:25,430 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:52:25,529 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 17:52:25,529 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:52:25,529 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2018-02-04 17:52:25,529 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 17:52:25,530 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 17:52:25,530 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2018-02-04 17:52:25,530 INFO L87 Difference]: Start difference. First operand 3929 states and 5350 transitions. Second operand 18 states. [2018-02-04 17:52:26,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:52:26,238 INFO L93 Difference]: Finished difference Result 6913 states and 9588 transitions. [2018-02-04 17:52:26,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 17:52:26,238 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 70 [2018-02-04 17:52:26,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:52:26,259 INFO L225 Difference]: With dead ends: 6913 [2018-02-04 17:52:26,259 INFO L226 Difference]: Without dead ends: 6787 [2018-02-04 17:52:26,260 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 17:52:26,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6787 states. [2018-02-04 17:52:26,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6787 to 5218. [2018-02-04 17:52:26,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5218 states. [2018-02-04 17:52:26,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5218 states to 5218 states and 6929 transitions. [2018-02-04 17:52:26,388 INFO L78 Accepts]: Start accepts. Automaton has 5218 states and 6929 transitions. Word has length 70 [2018-02-04 17:52:26,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:52:26,389 INFO L432 AbstractCegarLoop]: Abstraction has 5218 states and 6929 transitions. [2018-02-04 17:52:26,389 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 17:52:26,389 INFO L276 IsEmpty]: Start isEmpty. Operand 5218 states and 6929 transitions. [2018-02-04 17:52:26,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-04 17:52:26,391 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:52:26,391 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 17:52:26,391 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 17:52:26,391 INFO L82 PathProgramCache]: Analyzing trace with hash 933081794, now seen corresponding path program 1 times [2018-02-04 17:52:26,391 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:52:26,391 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:52:26,392 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:26,392 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:26,392 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:26,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:26,408 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:52:26,550 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 17:52:26,550 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:52:26,550 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:52:26,551 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:26,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:26,570 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:52:26,679 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 17:52:26,679 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:52:26,679 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-02-04 17:52:26,679 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 17:52:26,680 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 17:52:26,680 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-02-04 17:52:26,680 INFO L87 Difference]: Start difference. First operand 5218 states and 6929 transitions. Second operand 17 states. [2018-02-04 17:52:27,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:52:27,263 INFO L93 Difference]: Finished difference Result 6770 states and 9242 transitions. [2018-02-04 17:52:27,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 17:52:27,264 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 84 [2018-02-04 17:52:27,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:52:27,276 INFO L225 Difference]: With dead ends: 6770 [2018-02-04 17:52:27,276 INFO L226 Difference]: Without dead ends: 6592 [2018-02-04 17:52:27,276 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=219, Invalid=837, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 17:52:27,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6592 states. [2018-02-04 17:52:27,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6592 to 5105. [2018-02-04 17:52:27,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5105 states. [2018-02-04 17:52:27,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5105 states to 5105 states and 6680 transitions. [2018-02-04 17:52:27,353 INFO L78 Accepts]: Start accepts. Automaton has 5105 states and 6680 transitions. Word has length 84 [2018-02-04 17:52:27,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:52:27,353 INFO L432 AbstractCegarLoop]: Abstraction has 5105 states and 6680 transitions. [2018-02-04 17:52:27,353 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 17:52:27,353 INFO L276 IsEmpty]: Start isEmpty. Operand 5105 states and 6680 transitions. [2018-02-04 17:52:27,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-04 17:52:27,354 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:52:27,354 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 17:52:27,354 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 17:52:27,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1343466028, now seen corresponding path program 1 times [2018-02-04 17:52:27,355 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:52:27,355 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:52:27,355 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:27,355 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:27,355 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:27,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:27,365 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:52:27,496 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 17:52:27,496 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:52:27,496 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:52:27,497 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:27,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:27,532 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:52:27,630 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 17:52:27,630 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:52:27,630 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-02-04 17:52:27,630 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 17:52:27,631 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 17:52:27,631 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-02-04 17:52:27,631 INFO L87 Difference]: Start difference. First operand 5105 states and 6680 transitions. Second operand 18 states. [2018-02-04 17:52:28,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:52:28,404 INFO L93 Difference]: Finished difference Result 7254 states and 9512 transitions. [2018-02-04 17:52:28,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 17:52:28,404 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 87 [2018-02-04 17:52:28,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:52:28,417 INFO L225 Difference]: With dead ends: 7254 [2018-02-04 17:52:28,417 INFO L226 Difference]: Without dead ends: 7128 [2018-02-04 17:52:28,418 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 17:52:28,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7128 states. [2018-02-04 17:52:28,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7128 to 6942. [2018-02-04 17:52:28,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6942 states. [2018-02-04 17:52:28,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6942 states to 6942 states and 9218 transitions. [2018-02-04 17:52:28,533 INFO L78 Accepts]: Start accepts. Automaton has 6942 states and 9218 transitions. Word has length 87 [2018-02-04 17:52:28,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:52:28,533 INFO L432 AbstractCegarLoop]: Abstraction has 6942 states and 9218 transitions. [2018-02-04 17:52:28,533 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 17:52:28,533 INFO L276 IsEmpty]: Start isEmpty. Operand 6942 states and 9218 transitions. [2018-02-04 17:52:28,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-02-04 17:52:28,536 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:52:28,536 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 17:52:28,536 INFO L371 AbstractCegarLoop]: === Iteration 22 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 17:52:28,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1756447406, now seen corresponding path program 1 times [2018-02-04 17:52:28,536 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:52:28,536 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:52:28,537 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:28,537 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:28,537 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:28,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 17:52:28,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 17:52:28,609 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 17:52:28,658 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-04 17:52:28,671 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 17:52:28,672 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 17:52:28,672 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 17:52:28,673 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 17:52:28,674 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 17:52:28,676 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 17:52:28,676 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 17:52:28,678 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 17:52:28,680 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 17:52:28,681 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 17:52:28,683 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 17:52:28,684 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 17:52:28,686 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 17:52:28,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 05:52:28 BoogieIcfgContainer [2018-02-04 17:52:28,700 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 17:52:28,701 INFO L168 Benchmark]: Toolchain (without parser) took 11982.39 ms. Allocated memory was 404.2 MB in the beginning and 916.5 MB in the end (delta: 512.2 MB). Free memory was 361.1 MB in the beginning and 543.7 MB in the end (delta: -182.6 MB). Peak memory consumption was 329.6 MB. Max. memory is 5.3 GB. [2018-02-04 17:52:28,702 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 404.2 MB. Free memory is still 367.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 17:52:28,702 INFO L168 Benchmark]: CACSL2BoogieTranslator took 161.85 ms. Allocated memory is still 404.2 MB. Free memory was 361.1 MB in the beginning and 350.5 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 17:52:28,702 INFO L168 Benchmark]: Boogie Preprocessor took 26.74 ms. Allocated memory is still 404.2 MB. Free memory was 350.5 MB in the beginning and 347.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 17:52:28,702 INFO L168 Benchmark]: RCFGBuilder took 296.00 ms. Allocated memory is still 404.2 MB. Free memory was 347.9 MB in the beginning and 320.6 MB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 5.3 GB. [2018-02-04 17:52:28,702 INFO L168 Benchmark]: TraceAbstraction took 11494.82 ms. Allocated memory was 404.2 MB in the beginning and 916.5 MB in the end (delta: 512.2 MB). Free memory was 320.6 MB in the beginning and 543.7 MB in the end (delta: -223.2 MB). Peak memory consumption was 289.1 MB. Max. memory is 5.3 GB. [2018-02-04 17:52:28,704 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 404.2 MB. Free memory is still 367.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 161.85 ms. Allocated memory is still 404.2 MB. Free memory was 361.1 MB in the beginning and 350.5 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 26.74 ms. Allocated memory is still 404.2 MB. Free memory was 350.5 MB in the beginning and 347.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 296.00 ms. Allocated memory is still 404.2 MB. Free memory was 347.9 MB in the beginning and 320.6 MB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 11494.82 ms. Allocated memory was 404.2 MB in the beginning and 916.5 MB in the end (delta: 512.2 MB). Free memory was 320.6 MB in the beginning and 543.7 MB in the end (delta: -223.2 MB). Peak memory consumption was 289.1 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)=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}] [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)=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}] [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)=12, \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}] [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)=12, \old(x1)=0, \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)=12, \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}] [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)=0, \old(x1)=12, \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)=12, \old(x1)=0, \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)=0, \old(S)=12, \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, 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)=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=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, 11.4s OverallTime, 22 OverallIterations, 7 TraceHistogramMax, 7.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2127 SDtfs, 4839 SDslu, 4706 SDs, 0 SdLazy, 6576 SolverSat, 1164 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1049 GetRequests, 689 SyntacticMatches, 7 SemanticMatches, 353 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2316 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6942occurred in iteration=21, 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: 1.0s AutomataMinimizationTime, 21 MinimizatonAttempts, 7965 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1483 NumberOfCodeBlocks, 1483 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1355 ConstructedInterpolants, 0 QuantifiedInterpolants, 193324 SizeOfPredicates, 47 NumberOfNonLiveVariables, 5028 ConjunctsInSsa, 129 ConjunctsInUnsatCore, 33 InterpolantComputations, 12 PerfectInterpolantSequences, 1072/1263 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_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_17-52-28-710.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_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_17-52-28-710.csv Received shutdown request...