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.3_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 17:52:34,051 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 17:52:34,053 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 17:52:34,062 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 17:52:34,062 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 17:52:34,063 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 17:52:34,063 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 17:52:34,065 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 17:52:34,066 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 17:52:34,067 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 17:52:34,067 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 17:52:34,067 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 17:52:34,068 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 17:52:34,069 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 17:52:34,069 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 17:52:34,070 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 17:52:34,072 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 17:52:34,073 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 17:52:34,073 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 17:52:34,074 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 17:52:34,075 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 17:52:34,075 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 17:52:34,076 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 17:52:34,076 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 17:52:34,077 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 17:52:34,077 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 17:52:34,078 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 17:52:34,078 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 17:52:34,078 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 17:52:34,078 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 17:52:34,079 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 17:52:34,079 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:34,086 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 17:52:34,086 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 17:52:34,087 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 17:52:34,087 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 17:52:34,087 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 17:52:34,088 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 17:52:34,088 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 17:52:34,088 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 17:52:34,088 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 17:52:34,088 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 17:52:34,088 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 17:52:34,088 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 17:52:34,088 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 17:52:34,089 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 17:52:34,089 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 17:52:34,089 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 17:52:34,089 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 17:52:34,089 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 17:52:34,089 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 17:52:34,089 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 17:52:34,090 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 17:52:34,090 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 17:52:34,090 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 17:52:34,090 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 17:52:34,113 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 17:52:34,120 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 17:52:34,123 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 17:52:34,124 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 17:52:34,125 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 17:52:34,125 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/lockfree-3.3_false-valid-memtrack.i [2018-02-04 17:52:34,249 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 17:52:34,250 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 17:52:34,251 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 17:52:34,252 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 17:52:34,257 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 17:52:34,258 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:52:34" (1/1) ... [2018-02-04 17:52:34,260 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69a9abb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:52:34, skipping insertion in model container [2018-02-04 17:52:34,260 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:52:34" (1/1) ... [2018-02-04 17:52:34,270 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:52:34,297 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:52:34,391 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:52:34,410 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:52:34,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:52:34 WrapperNode [2018-02-04 17:52:34,418 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 17:52:34,418 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 17:52:34,419 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 17:52:34,419 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 17:52:34,429 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:34" (1/1) ... [2018-02-04 17:52:34,430 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:34" (1/1) ... [2018-02-04 17:52:34,436 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:34" (1/1) ... [2018-02-04 17:52:34,437 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:34" (1/1) ... [2018-02-04 17:52:34,441 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:34" (1/1) ... [2018-02-04 17:52:34,445 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:34" (1/1) ... [2018-02-04 17:52:34,446 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:34" (1/1) ... [2018-02-04 17:52:34,448 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 17:52:34,449 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 17:52:34,449 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 17:52:34,449 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 17:52:34,450 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:52:34" (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:34,490 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 17:52:34,490 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 17:52:34,491 INFO L136 BoogieDeclarations]: Found implementation of procedure push [2018-02-04 17:52:34,491 INFO L136 BoogieDeclarations]: Found implementation of procedure pop [2018-02-04 17:52:34,491 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 17:52:34,491 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 17:52:34,491 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 17:52:34,491 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 17:52:34,492 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 17:52:34,492 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 17:52:34,492 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 17:52:34,492 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 17:52:34,492 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 17:52:34,492 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 17:52:34,492 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 17:52:34,492 INFO L128 BoogieDeclarations]: Found specification of procedure push [2018-02-04 17:52:34,493 INFO L128 BoogieDeclarations]: Found specification of procedure pop [2018-02-04 17:52:34,493 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 17:52:34,493 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 17:52:34,493 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 17:52:34,747 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 17:52:34,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:52:34 BoogieIcfgContainer [2018-02-04 17:52:34,747 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 17:52:34,748 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 17:52:34,748 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 17:52:34,750 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 17:52:34,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 05:52:34" (1/3) ... [2018-02-04 17:52:34,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e281a12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:52:34, skipping insertion in model container [2018-02-04 17:52:34,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:52:34" (2/3) ... [2018-02-04 17:52:34,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e281a12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:52:34, skipping insertion in model container [2018-02-04 17:52:34,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:52:34" (3/3) ... [2018-02-04 17:52:34,752 INFO L107 eAbstractionObserver]: Analyzing ICFG lockfree-3.3_false-valid-memtrack.i [2018-02-04 17:52:34,757 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 17:52:34,763 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-02-04 17:52:34,785 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 17:52:34,786 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 17:52:34,786 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 17:52:34,786 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 17:52:34,786 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 17:52:34,786 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 17:52:34,786 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 17:52:34,786 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 17:52:34,787 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 17:52:34,796 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-02-04 17:52:34,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-02-04 17:52:34,804 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:52:34,805 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:52:34,805 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:34,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1799126466, now seen corresponding path program 1 times [2018-02-04 17:52:34,809 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:52:34,809 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:52:34,839 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:34,839 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:34,839 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:34,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:34,883 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:34,915 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:34,918 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:52:34,918 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 17:52:34,920 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-04 17:52:34,931 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-04 17:52:34,932 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-04 17:52:34,934 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 2 states. [2018-02-04 17:52:35,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:52:35,013 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2018-02-04 17:52:35,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-04 17:52:35,014 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-02-04 17:52:35,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:52:35,026 INFO L225 Difference]: With dead ends: 76 [2018-02-04 17:52:35,026 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 17:52:35,027 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:35,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 17:52:35,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-02-04 17:52:35,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-04 17:52:35,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 90 transitions. [2018-02-04 17:52:35,053 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 90 transitions. Word has length 9 [2018-02-04 17:52:35,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:52:35,053 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 90 transitions. [2018-02-04 17:52:35,053 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-04 17:52:35,054 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2018-02-04 17:52:35,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-04 17:52:35,054 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:52:35,054 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:52:35,054 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:35,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1199640283, now seen corresponding path program 1 times [2018-02-04 17:52:35,054 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:52:35,055 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:52:35,056 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:35,056 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:35,056 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:35,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:35,074 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:35,107 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:35,107 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:52:35,107 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 17:52:35,109 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 17:52:35,109 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 17:52:35,109 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 17:52:35,109 INFO L87 Difference]: Start difference. First operand 73 states and 90 transitions. Second operand 3 states. [2018-02-04 17:52:35,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:52:35,134 INFO L93 Difference]: Finished difference Result 74 states and 91 transitions. [2018-02-04 17:52:35,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 17:52:35,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-02-04 17:52:35,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:52:35,136 INFO L225 Difference]: With dead ends: 74 [2018-02-04 17:52:35,136 INFO L226 Difference]: Without dead ends: 74 [2018-02-04 17:52:35,137 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:35,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-04 17:52:35,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-02-04 17:52:35,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-04 17:52:35,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2018-02-04 17:52:35,146 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 12 [2018-02-04 17:52:35,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:52:35,146 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2018-02-04 17:52:35,146 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 17:52:35,146 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2018-02-04 17:52:35,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-04 17:52:35,147 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:52:35,147 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:52:35,147 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:35,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1201487325, now seen corresponding path program 1 times [2018-02-04 17:52:35,147 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:52:35,148 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:52:35,148 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:35,149 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:35,149 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:35,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:35,165 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:35,208 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:35,209 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:52:35,209 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 17:52:35,209 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 17:52:35,209 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 17:52:35,209 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 17:52:35,209 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand 3 states. [2018-02-04 17:52:35,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:52:35,233 INFO L93 Difference]: Finished difference Result 132 states and 167 transitions. [2018-02-04 17:52:35,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 17:52:35,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-02-04 17:52:35,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:52:35,234 INFO L225 Difference]: With dead ends: 132 [2018-02-04 17:52:35,234 INFO L226 Difference]: Without dead ends: 132 [2018-02-04 17:52:35,234 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:35,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-04 17:52:35,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 114. [2018-02-04 17:52:35,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-04 17:52:35,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2018-02-04 17:52:35,246 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 12 [2018-02-04 17:52:35,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:52:35,246 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2018-02-04 17:52:35,246 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 17:52:35,247 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2018-02-04 17:52:35,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 17:52:35,247 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:52:35,247 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:52:35,247 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:35,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1408600152, now seen corresponding path program 1 times [2018-02-04 17:52:35,247 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:52:35,247 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:52:35,248 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:35,248 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:35,248 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:35,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:35,261 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:35,284 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:35,285 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:52:35,285 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 17:52:35,285 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 17:52:35,285 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 17:52:35,285 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 17:52:35,286 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand 3 states. [2018-02-04 17:52:35,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:52:35,340 INFO L93 Difference]: Finished difference Result 147 states and 205 transitions. [2018-02-04 17:52:35,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 17:52:35,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-02-04 17:52:35,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:52:35,342 INFO L225 Difference]: With dead ends: 147 [2018-02-04 17:52:35,342 INFO L226 Difference]: Without dead ends: 143 [2018-02-04 17:52:35,342 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:35,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-04 17:52:35,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 135. [2018-02-04 17:52:35,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-04 17:52:35,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 192 transitions. [2018-02-04 17:52:35,350 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 192 transitions. Word has length 13 [2018-02-04 17:52:35,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:52:35,350 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 192 transitions. [2018-02-04 17:52:35,350 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 17:52:35,350 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 192 transitions. [2018-02-04 17:52:35,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 17:52:35,350 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:52:35,350 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:35,350 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:35,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1628464921, now seen corresponding path program 1 times [2018-02-04 17:52:35,351 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:52:35,351 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:52:35,351 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:35,351 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:35,351 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:35,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:35,362 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:35,395 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:35,395 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:52:35,395 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 17:52:35,396 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:52:35,396 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:52:35,396 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:52:35,396 INFO L87 Difference]: Start difference. First operand 135 states and 192 transitions. Second operand 5 states. [2018-02-04 17:52:35,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:52:35,445 INFO L93 Difference]: Finished difference Result 255 states and 357 transitions. [2018-02-04 17:52:35,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:52:35,445 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-04 17:52:35,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:52:35,447 INFO L225 Difference]: With dead ends: 255 [2018-02-04 17:52:35,448 INFO L226 Difference]: Without dead ends: 255 [2018-02-04 17:52:35,448 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:35,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-02-04 17:52:35,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 226. [2018-02-04 17:52:35,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-02-04 17:52:35,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 338 transitions. [2018-02-04 17:52:35,463 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 338 transitions. Word has length 15 [2018-02-04 17:52:35,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:52:35,463 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 338 transitions. [2018-02-04 17:52:35,464 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:52:35,464 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 338 transitions. [2018-02-04 17:52:35,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 17:52:35,464 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:52:35,464 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:35,464 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:35,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474006, now seen corresponding path program 1 times [2018-02-04 17:52:35,465 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:52:35,465 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:52:35,466 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:35,466 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:35,466 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:35,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:35,476 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:35,500 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:35,500 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:52:35,500 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 17:52:35,501 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 17:52:35,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 17:52:35,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 17:52:35,501 INFO L87 Difference]: Start difference. First operand 226 states and 338 transitions. Second operand 4 states. [2018-02-04 17:52:35,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:52:35,582 INFO L93 Difference]: Finished difference Result 386 states and 569 transitions. [2018-02-04 17:52:35,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 17:52:35,582 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-04 17:52:35,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:52:35,585 INFO L225 Difference]: With dead ends: 386 [2018-02-04 17:52:35,585 INFO L226 Difference]: Without dead ends: 386 [2018-02-04 17:52:35,585 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:35,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-02-04 17:52:35,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 358. [2018-02-04 17:52:35,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-02-04 17:52:35,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 548 transitions. [2018-02-04 17:52:35,604 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 548 transitions. Word has length 16 [2018-02-04 17:52:35,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:52:35,604 INFO L432 AbstractCegarLoop]: Abstraction has 358 states and 548 transitions. [2018-02-04 17:52:35,605 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 17:52:35,605 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 548 transitions. [2018-02-04 17:52:35,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 17:52:35,605 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:52:35,606 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:35,606 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:35,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474005, now seen corresponding path program 1 times [2018-02-04 17:52:35,606 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:52:35,606 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:52:35,607 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:35,607 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:35,607 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:35,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:35,616 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:35,647 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:35,647 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:52:35,647 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 17:52:35,647 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 17:52:35,648 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 17:52:35,648 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 17:52:35,648 INFO L87 Difference]: Start difference. First operand 358 states and 548 transitions. Second operand 4 states. [2018-02-04 17:52:35,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:52:35,738 INFO L93 Difference]: Finished difference Result 485 states and 716 transitions. [2018-02-04 17:52:35,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 17:52:35,740 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-04 17:52:35,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:52:35,742 INFO L225 Difference]: With dead ends: 485 [2018-02-04 17:52:35,743 INFO L226 Difference]: Without dead ends: 485 [2018-02-04 17:52:35,743 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:35,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-02-04 17:52:35,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 460. [2018-02-04 17:52:35,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-02-04 17:52:35,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 696 transitions. [2018-02-04 17:52:35,757 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 696 transitions. Word has length 16 [2018-02-04 17:52:35,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:52:35,757 INFO L432 AbstractCegarLoop]: Abstraction has 460 states and 696 transitions. [2018-02-04 17:52:35,757 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 17:52:35,757 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 696 transitions. [2018-02-04 17:52:35,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 17:52:35,758 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:52:35,758 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:35,758 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:35,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1708141764, now seen corresponding path program 1 times [2018-02-04 17:52:35,758 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:52:35,758 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:52:35,759 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:35,759 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:35,759 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:35,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:35,767 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:35,797 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:35,798 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:52:35,798 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 17:52:35,798 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:52:35,798 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:52:35,798 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:52:35,799 INFO L87 Difference]: Start difference. First operand 460 states and 696 transitions. Second operand 5 states. [2018-02-04 17:52:35,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:52:35,843 INFO L93 Difference]: Finished difference Result 861 states and 1225 transitions. [2018-02-04 17:52:35,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:52:35,845 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-02-04 17:52:35,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:52:35,849 INFO L225 Difference]: With dead ends: 861 [2018-02-04 17:52:35,849 INFO L226 Difference]: Without dead ends: 861 [2018-02-04 17:52:35,849 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:35,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2018-02-04 17:52:35,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 828. [2018-02-04 17:52:35,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2018-02-04 17:52:35,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1196 transitions. [2018-02-04 17:52:35,874 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1196 transitions. Word has length 16 [2018-02-04 17:52:35,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:52:35,874 INFO L432 AbstractCegarLoop]: Abstraction has 828 states and 1196 transitions. [2018-02-04 17:52:35,874 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:52:35,874 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1196 transitions. [2018-02-04 17:52:35,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 17:52:35,875 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:52:35,876 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:35,876 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:35,876 INFO L82 PathProgramCache]: Analyzing trace with hash 750766986, now seen corresponding path program 1 times [2018-02-04 17:52:35,876 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:52:35,876 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:52:35,877 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:35,877 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:35,877 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:35,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:35,887 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:35,926 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:35,926 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:52:35,926 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:52:35,927 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:35,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:35,981 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:52:36,022 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:36,022 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:52:36,022 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-02-04 17:52:36,023 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 17:52:36,023 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 17:52:36,023 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 17:52:36,023 INFO L87 Difference]: Start difference. First operand 828 states and 1196 transitions. Second operand 6 states. [2018-02-04 17:52:36,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:52:36,101 INFO L93 Difference]: Finished difference Result 1289 states and 1809 transitions. [2018-02-04 17:52:36,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 17:52:36,104 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-04 17:52:36,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:52:36,110 INFO L225 Difference]: With dead ends: 1289 [2018-02-04 17:52:36,110 INFO L226 Difference]: Without dead ends: 1289 [2018-02-04 17:52:36,110 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:36,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2018-02-04 17:52:36,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1220. [2018-02-04 17:52:36,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1220 states. [2018-02-04 17:52:36,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 1220 states and 1744 transitions. [2018-02-04 17:52:36,145 INFO L78 Accepts]: Start accepts. Automaton has 1220 states and 1744 transitions. Word has length 26 [2018-02-04 17:52:36,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:52:36,146 INFO L432 AbstractCegarLoop]: Abstraction has 1220 states and 1744 transitions. [2018-02-04 17:52:36,146 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 17:52:36,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 1744 transitions. [2018-02-04 17:52:36,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 17:52:36,147 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:52:36,147 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:36,147 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:36,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1952857995, now seen corresponding path program 1 times [2018-02-04 17:52:36,148 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:52:36,148 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:52:36,148 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:36,149 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:36,149 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:36,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:36,159 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:36,253 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:52:36,253 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:52:36,253 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:52:36,254 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:36,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:36,279 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:52:36,314 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:36,315 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:52:36,315 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2018-02-04 17:52:36,315 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 17:52:36,315 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 17:52:36,315 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-02-04 17:52:36,316 INFO L87 Difference]: Start difference. First operand 1220 states and 1744 transitions. Second operand 12 states. [2018-02-04 17:52:37,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:52:37,325 INFO L93 Difference]: Finished difference Result 5202 states and 7738 transitions. [2018-02-04 17:52:37,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 17:52:37,326 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2018-02-04 17:52:37,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:52:37,350 INFO L225 Difference]: With dead ends: 5202 [2018-02-04 17:52:37,350 INFO L226 Difference]: Without dead ends: 5202 [2018-02-04 17:52:37,351 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=416, Invalid=1390, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 17:52:37,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5202 states. [2018-02-04 17:52:37,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5202 to 4910. [2018-02-04 17:52:37,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4910 states. [2018-02-04 17:52:37,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4910 states to 4910 states and 7315 transitions. [2018-02-04 17:52:37,455 INFO L78 Accepts]: Start accepts. Automaton has 4910 states and 7315 transitions. Word has length 27 [2018-02-04 17:52:37,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:52:37,456 INFO L432 AbstractCegarLoop]: Abstraction has 4910 states and 7315 transitions. [2018-02-04 17:52:37,456 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 17:52:37,456 INFO L276 IsEmpty]: Start isEmpty. Operand 4910 states and 7315 transitions. [2018-02-04 17:52:37,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 17:52:37,457 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:52:37,457 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:37,459 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:37,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1995842725, now seen corresponding path program 1 times [2018-02-04 17:52:37,459 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:52:37,459 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:52:37,460 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:37,460 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:37,460 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:37,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:37,471 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:37,518 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:37,518 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:52:37,518 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 17:52:37,518 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 17:52:37,519 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 17:52:37,519 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 17:52:37,519 INFO L87 Difference]: Start difference. First operand 4910 states and 7315 transitions. Second operand 7 states. [2018-02-04 17:52:37,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:52:37,698 INFO L93 Difference]: Finished difference Result 2110 states and 2748 transitions. [2018-02-04 17:52:37,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 17:52:37,699 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-02-04 17:52:37,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:52:37,706 INFO L225 Difference]: With dead ends: 2110 [2018-02-04 17:52:37,706 INFO L226 Difference]: Without dead ends: 1762 [2018-02-04 17:52:37,706 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:37,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2018-02-04 17:52:37,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 1605. [2018-02-04 17:52:37,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1605 states. [2018-02-04 17:52:37,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 2191 transitions. [2018-02-04 17:52:37,744 INFO L78 Accepts]: Start accepts. Automaton has 1605 states and 2191 transitions. Word has length 31 [2018-02-04 17:52:37,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:52:37,745 INFO L432 AbstractCegarLoop]: Abstraction has 1605 states and 2191 transitions. [2018-02-04 17:52:37,745 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 17:52:37,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 2191 transitions. [2018-02-04 17:52:37,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 17:52:37,746 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:52:37,746 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:37,746 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:37,748 INFO L82 PathProgramCache]: Analyzing trace with hash 735152201, now seen corresponding path program 1 times [2018-02-04 17:52:37,748 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:52:37,748 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:52:37,749 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:37,749 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:37,749 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:37,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:37,760 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:37,907 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:37,907 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:52:37,907 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:52:37,908 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:37,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:37,929 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:52:37,968 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:37,969 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:52:37,969 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2018-02-04 17:52:37,969 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 17:52:37,969 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 17:52:37,969 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-04 17:52:37,970 INFO L87 Difference]: Start difference. First operand 1605 states and 2191 transitions. Second operand 12 states. [2018-02-04 17:52:38,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:52:38,706 INFO L93 Difference]: Finished difference Result 2946 states and 3978 transitions. [2018-02-04 17:52:38,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 17:52:38,707 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-02-04 17:52:38,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:52:38,717 INFO L225 Difference]: With dead ends: 2946 [2018-02-04 17:52:38,717 INFO L226 Difference]: Without dead ends: 2926 [2018-02-04 17:52:38,717 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:38,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2926 states. [2018-02-04 17:52:38,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2926 to 2272. [2018-02-04 17:52:38,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2272 states. [2018-02-04 17:52:38,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2272 states to 2272 states and 3098 transitions. [2018-02-04 17:52:38,772 INFO L78 Accepts]: Start accepts. Automaton has 2272 states and 3098 transitions. Word has length 31 [2018-02-04 17:52:38,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:52:38,772 INFO L432 AbstractCegarLoop]: Abstraction has 2272 states and 3098 transitions. [2018-02-04 17:52:38,772 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 17:52:38,772 INFO L276 IsEmpty]: Start isEmpty. Operand 2272 states and 3098 transitions. [2018-02-04 17:52:38,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 17:52:38,773 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:52:38,773 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:38,773 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:38,774 INFO L82 PathProgramCache]: Analyzing trace with hash -663528086, now seen corresponding path program 1 times [2018-02-04 17:52:38,774 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:52:38,774 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:52:38,774 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:38,774 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:38,775 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:38,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:38,784 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:38,849 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:38,849 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:52:38,849 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:52:38,850 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:38,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:38,876 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:52:38,905 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:38,905 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:52:38,905 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2018-02-04 17:52:38,905 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 17:52:38,906 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 17:52:38,906 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-02-04 17:52:38,906 INFO L87 Difference]: Start difference. First operand 2272 states and 3098 transitions. Second operand 10 states. [2018-02-04 17:52:39,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:52:39,368 INFO L93 Difference]: Finished difference Result 1746 states and 2285 transitions. [2018-02-04 17:52:39,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 17:52:39,368 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-02-04 17:52:39,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:52:39,374 INFO L225 Difference]: With dead ends: 1746 [2018-02-04 17:52:39,375 INFO L226 Difference]: Without dead ends: 1746 [2018-02-04 17:52:39,375 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2018-02-04 17:52:39,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1746 states. [2018-02-04 17:52:39,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1746 to 1495. [2018-02-04 17:52:39,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1495 states. [2018-02-04 17:52:39,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1495 states to 1495 states and 1987 transitions. [2018-02-04 17:52:39,405 INFO L78 Accepts]: Start accepts. Automaton has 1495 states and 1987 transitions. Word has length 38 [2018-02-04 17:52:39,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:52:39,405 INFO L432 AbstractCegarLoop]: Abstraction has 1495 states and 1987 transitions. [2018-02-04 17:52:39,406 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 17:52:39,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 1987 transitions. [2018-02-04 17:52:39,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 17:52:39,406 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:52:39,406 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:39,407 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:39,407 INFO L82 PathProgramCache]: Analyzing trace with hash 490510064, now seen corresponding path program 1 times [2018-02-04 17:52:39,407 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:52:39,407 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:52:39,407 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:39,408 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:39,408 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:39,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:39,419 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:39,476 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:39,476 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:52:39,476 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:52:39,477 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:39,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:39,501 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:52:39,545 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:39,546 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:52:39,546 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2018-02-04 17:52:39,546 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 17:52:39,546 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 17:52:39,546 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-02-04 17:52:39,547 INFO L87 Difference]: Start difference. First operand 1495 states and 1987 transitions. Second operand 12 states. [2018-02-04 17:52:39,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:52:39,794 INFO L93 Difference]: Finished difference Result 2094 states and 2899 transitions. [2018-02-04 17:52:39,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 17:52:39,794 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-02-04 17:52:39,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:52:39,799 INFO L225 Difference]: With dead ends: 2094 [2018-02-04 17:52:39,799 INFO L226 Difference]: Without dead ends: 2094 [2018-02-04 17:52:39,800 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2018-02-04 17:52:39,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2094 states. [2018-02-04 17:52:39,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2094 to 1851. [2018-02-04 17:52:39,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1851 states. [2018-02-04 17:52:39,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1851 states to 1851 states and 2485 transitions. [2018-02-04 17:52:39,825 INFO L78 Accepts]: Start accepts. Automaton has 1851 states and 2485 transitions. Word has length 42 [2018-02-04 17:52:39,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:52:39,825 INFO L432 AbstractCegarLoop]: Abstraction has 1851 states and 2485 transitions. [2018-02-04 17:52:39,825 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 17:52:39,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1851 states and 2485 transitions. [2018-02-04 17:52:39,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 17:52:39,826 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:52:39,826 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:52:39,826 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:39,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1159552053, now seen corresponding path program 1 times [2018-02-04 17:52:39,826 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:52:39,826 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:52:39,827 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:39,827 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:39,827 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:39,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:39,836 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:39,906 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:39,907 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:52:39,907 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:52:39,907 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:39,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:39,936 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:52:40,058 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:40,058 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:52:40,058 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2018-02-04 17:52:40,058 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 17:52:40,059 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 17:52:40,059 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-02-04 17:52:40,059 INFO L87 Difference]: Start difference. First operand 1851 states and 2485 transitions. Second operand 13 states. [2018-02-04 17:52:40,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:52:40,856 INFO L93 Difference]: Finished difference Result 1465 states and 1908 transitions. [2018-02-04 17:52:40,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 17:52:40,857 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2018-02-04 17:52:40,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:52:40,860 INFO L225 Difference]: With dead ends: 1465 [2018-02-04 17:52:40,860 INFO L226 Difference]: Without dead ends: 1405 [2018-02-04 17:52:40,860 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:40,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2018-02-04 17:52:40,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 1271. [2018-02-04 17:52:40,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1271 states. [2018-02-04 17:52:40,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 1684 transitions. [2018-02-04 17:52:40,876 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 1684 transitions. Word has length 43 [2018-02-04 17:52:40,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:52:40,876 INFO L432 AbstractCegarLoop]: Abstraction has 1271 states and 1684 transitions. [2018-02-04 17:52:40,876 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 17:52:40,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 1684 transitions. [2018-02-04 17:52:40,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 17:52:40,877 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:52:40,877 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:40,877 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:40,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1425126877, now seen corresponding path program 1 times [2018-02-04 17:52:40,877 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:52:40,877 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:52:40,878 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:40,878 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:40,878 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:40,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:40,888 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:40,936 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:40,936 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:52:40,936 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:52:40,937 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:40,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:40,955 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:52:40,980 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:40,981 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:52:40,981 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-02-04 17:52:40,981 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 17:52:40,981 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 17:52:40,981 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-04 17:52:40,981 INFO L87 Difference]: Start difference. First operand 1271 states and 1684 transitions. Second operand 11 states. [2018-02-04 17:52:41,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:52:41,188 INFO L93 Difference]: Finished difference Result 1671 states and 2281 transitions. [2018-02-04 17:52:41,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 17:52:41,189 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2018-02-04 17:52:41,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:52:41,194 INFO L225 Difference]: With dead ends: 1671 [2018-02-04 17:52:41,194 INFO L226 Difference]: Without dead ends: 1671 [2018-02-04 17:52:41,195 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2018-02-04 17:52:41,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2018-02-04 17:52:41,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1301. [2018-02-04 17:52:41,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1301 states. [2018-02-04 17:52:41,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1301 states to 1301 states and 1729 transitions. [2018-02-04 17:52:41,223 INFO L78 Accepts]: Start accepts. Automaton has 1301 states and 1729 transitions. Word has length 54 [2018-02-04 17:52:41,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:52:41,224 INFO L432 AbstractCegarLoop]: Abstraction has 1301 states and 1729 transitions. [2018-02-04 17:52:41,224 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 17:52:41,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1301 states and 1729 transitions. [2018-02-04 17:52:41,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 17:52:41,225 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:52:41,225 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:41,225 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:41,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1162734491, now seen corresponding path program 1 times [2018-02-04 17:52:41,225 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:52:41,225 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:52:41,226 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:41,226 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:41,226 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:41,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:41,238 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:41,307 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:41,307 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:52:41,307 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:52:41,308 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:41,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:41,333 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:52:41,397 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:41,397 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:52:41,397 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-02-04 17:52:41,398 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 17:52:41,398 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 17:52:41,398 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-02-04 17:52:41,398 INFO L87 Difference]: Start difference. First operand 1301 states and 1729 transitions. Second operand 15 states. [2018-02-04 17:52:41,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:52:41,773 INFO L93 Difference]: Finished difference Result 2178 states and 3009 transitions. [2018-02-04 17:52:41,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 17:52:41,774 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2018-02-04 17:52:41,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:52:41,781 INFO L225 Difference]: With dead ends: 2178 [2018-02-04 17:52:41,781 INFO L226 Difference]: Without dead ends: 2144 [2018-02-04 17:52:41,781 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:41,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2144 states. [2018-02-04 17:52:41,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2144 to 1768. [2018-02-04 17:52:41,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1768 states. [2018-02-04 17:52:41,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1768 states to 1768 states and 2365 transitions. [2018-02-04 17:52:41,820 INFO L78 Accepts]: Start accepts. Automaton has 1768 states and 2365 transitions. Word has length 54 [2018-02-04 17:52:41,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:52:41,820 INFO L432 AbstractCegarLoop]: Abstraction has 1768 states and 2365 transitions. [2018-02-04 17:52:41,820 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 17:52:41,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1768 states and 2365 transitions. [2018-02-04 17:52:41,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-04 17:52:41,821 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:52:41,822 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:41,822 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:41,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1047296506, now seen corresponding path program 1 times [2018-02-04 17:52:41,822 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:52:41,822 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:52:41,823 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:41,823 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:41,823 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:41,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:41,839 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:41,906 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:41,906 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:52:41,906 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:52:41,907 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:41,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:41,935 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:52:41,984 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:41,984 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:52:41,985 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-02-04 17:52:41,985 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 17:52:41,985 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 17:52:41,985 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-04 17:52:41,985 INFO L87 Difference]: Start difference. First operand 1768 states and 2365 transitions. Second operand 11 states. [2018-02-04 17:52:42,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:52:42,188 INFO L93 Difference]: Finished difference Result 2138 states and 2900 transitions. [2018-02-04 17:52:42,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 17:52:42,189 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-02-04 17:52:42,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:52:42,193 INFO L225 Difference]: With dead ends: 2138 [2018-02-04 17:52:42,193 INFO L226 Difference]: Without dead ends: 2138 [2018-02-04 17:52:42,193 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:42,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2138 states. [2018-02-04 17:52:42,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2138 to 2115. [2018-02-04 17:52:42,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2115 states. [2018-02-04 17:52:42,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2115 states to 2115 states and 2881 transitions. [2018-02-04 17:52:42,242 INFO L78 Accepts]: Start accepts. Automaton has 2115 states and 2881 transitions. Word has length 68 [2018-02-04 17:52:42,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:52:42,242 INFO L432 AbstractCegarLoop]: Abstraction has 2115 states and 2881 transitions. [2018-02-04 17:52:42,243 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 17:52:42,243 INFO L276 IsEmpty]: Start isEmpty. Operand 2115 states and 2881 transitions. [2018-02-04 17:52:42,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-04 17:52:42,243 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:52:42,244 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:42,244 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:42,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1597143259, now seen corresponding path program 1 times [2018-02-04 17:52:42,244 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:52:42,244 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:52:42,244 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:42,244 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:42,244 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:42,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:42,254 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:42,347 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:42,347 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:52:42,347 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:52:42,347 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:42,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:42,372 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:52:42,486 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:42,486 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:52:42,486 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2018-02-04 17:52:42,486 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 17:52:42,487 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 17:52:42,487 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2018-02-04 17:52:42,487 INFO L87 Difference]: Start difference. First operand 2115 states and 2881 transitions. Second operand 18 states. [2018-02-04 17:52:43,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:52:43,315 INFO L93 Difference]: Finished difference Result 3702 states and 5110 transitions. [2018-02-04 17:52:43,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 17:52:43,315 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 70 [2018-02-04 17:52:43,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:52:43,324 INFO L225 Difference]: With dead ends: 3702 [2018-02-04 17:52:43,325 INFO L226 Difference]: Without dead ends: 3657 [2018-02-04 17:52:43,325 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:43,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3657 states. [2018-02-04 17:52:43,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3657 to 2699. [2018-02-04 17:52:43,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2699 states. [2018-02-04 17:52:43,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2699 states to 2699 states and 3619 transitions. [2018-02-04 17:52:43,388 INFO L78 Accepts]: Start accepts. Automaton has 2699 states and 3619 transitions. Word has length 70 [2018-02-04 17:52:43,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:52:43,388 INFO L432 AbstractCegarLoop]: Abstraction has 2699 states and 3619 transitions. [2018-02-04 17:52:43,388 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 17:52:43,388 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 3619 transitions. [2018-02-04 17:52:43,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-04 17:52:43,389 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:52:43,389 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:43,390 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:43,390 INFO L82 PathProgramCache]: Analyzing trace with hash 933081794, now seen corresponding path program 1 times [2018-02-04 17:52:43,390 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:52:43,390 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:52:43,390 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:43,391 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:43,391 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:43,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:43,428 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:43,607 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:43,607 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:52:43,607 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:52:43,608 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:43,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:43,640 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:52:43,741 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:43,741 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:52:43,741 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-02-04 17:52:43,741 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 17:52:43,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 17:52:43,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-02-04 17:52:43,742 INFO L87 Difference]: Start difference. First operand 2699 states and 3619 transitions. Second operand 17 states. [2018-02-04 17:52:44,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:52:44,278 INFO L93 Difference]: Finished difference Result 3630 states and 4965 transitions. [2018-02-04 17:52:44,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 17:52:44,278 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 84 [2018-02-04 17:52:44,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:52:44,285 INFO L225 Difference]: With dead ends: 3630 [2018-02-04 17:52:44,285 INFO L226 Difference]: Without dead ends: 3566 [2018-02-04 17:52:44,286 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:44,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3566 states. [2018-02-04 17:52:44,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3566 to 2645. [2018-02-04 17:52:44,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2645 states. [2018-02-04 17:52:44,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2645 states to 2645 states and 3515 transitions. [2018-02-04 17:52:44,341 INFO L78 Accepts]: Start accepts. Automaton has 2645 states and 3515 transitions. Word has length 84 [2018-02-04 17:52:44,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:52:44,342 INFO L432 AbstractCegarLoop]: Abstraction has 2645 states and 3515 transitions. [2018-02-04 17:52:44,342 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 17:52:44,342 INFO L276 IsEmpty]: Start isEmpty. Operand 2645 states and 3515 transitions. [2018-02-04 17:52:44,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-04 17:52:44,343 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:52:44,343 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:44,343 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:44,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1343466028, now seen corresponding path program 1 times [2018-02-04 17:52:44,344 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:52:44,344 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:52:44,344 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:44,344 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:44,345 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:44,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:44,361 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:44,450 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 40 proven. 64 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-02-04 17:52:44,450 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:52:44,450 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:52:44,451 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:44,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:44,480 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:52:44,585 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:44,585 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:52:44,586 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2018-02-04 17:52:44,586 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 17:52:44,586 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 17:52:44,586 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-02-04 17:52:44,587 INFO L87 Difference]: Start difference. First operand 2645 states and 3515 transitions. Second operand 17 states. [2018-02-04 17:52:45,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:52:45,945 INFO L93 Difference]: Finished difference Result 6191 states and 8334 transitions. [2018-02-04 17:52:45,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-02-04 17:52:45,945 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 87 [2018-02-04 17:52:45,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:52:45,962 INFO L225 Difference]: With dead ends: 6191 [2018-02-04 17:52:45,963 INFO L226 Difference]: Without dead ends: 6137 [2018-02-04 17:52:45,964 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1999 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1093, Invalid=5387, Unknown=0, NotChecked=0, Total=6480 [2018-02-04 17:52:45,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6137 states. [2018-02-04 17:52:46,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6137 to 5460. [2018-02-04 17:52:46,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5460 states. [2018-02-04 17:52:46,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5460 states to 5460 states and 7360 transitions. [2018-02-04 17:52:46,060 INFO L78 Accepts]: Start accepts. Automaton has 5460 states and 7360 transitions. Word has length 87 [2018-02-04 17:52:46,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:52:46,060 INFO L432 AbstractCegarLoop]: Abstraction has 5460 states and 7360 transitions. [2018-02-04 17:52:46,060 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 17:52:46,060 INFO L276 IsEmpty]: Start isEmpty. Operand 5460 states and 7360 transitions. [2018-02-04 17:52:46,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-02-04 17:52:46,062 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:52:46,062 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2018-02-04 17:52:46,062 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:46,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1189470598, now seen corresponding path program 1 times [2018-02-04 17:52:46,063 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:52:46,063 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:52:46,063 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:46,064 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:46,064 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:46,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:46,080 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:46,218 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 39 proven. 76 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-02-04 17:52:46,218 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:52:46,218 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:52:46,219 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:46,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:46,251 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:52:46,360 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 103 proven. 7 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-02-04 17:52:46,360 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:52:46,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2018-02-04 17:52:46,360 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 17:52:46,361 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 17:52:46,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2018-02-04 17:52:46,361 INFO L87 Difference]: Start difference. First operand 5460 states and 7360 transitions. Second operand 18 states. [2018-02-04 17:52:48,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:52:48,882 INFO L93 Difference]: Finished difference Result 12673 states and 17616 transitions. [2018-02-04 17:52:48,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-02-04 17:52:48,882 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 99 [2018-02-04 17:52:48,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:52:48,905 INFO L225 Difference]: With dead ends: 12673 [2018-02-04 17:52:48,905 INFO L226 Difference]: Without dead ends: 12673 [2018-02-04 17:52:48,907 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3820 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1614, Invalid=9942, Unknown=0, NotChecked=0, Total=11556 [2018-02-04 17:52:48,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12673 states. [2018-02-04 17:52:49,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12673 to 9656. [2018-02-04 17:52:49,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9656 states. [2018-02-04 17:52:49,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9656 states to 9656 states and 13350 transitions. [2018-02-04 17:52:49,058 INFO L78 Accepts]: Start accepts. Automaton has 9656 states and 13350 transitions. Word has length 99 [2018-02-04 17:52:49,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:52:49,058 INFO L432 AbstractCegarLoop]: Abstraction has 9656 states and 13350 transitions. [2018-02-04 17:52:49,058 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 17:52:49,058 INFO L276 IsEmpty]: Start isEmpty. Operand 9656 states and 13350 transitions. [2018-02-04 17:52:49,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-02-04 17:52:49,059 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:52:49,060 INFO L351 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1] [2018-02-04 17:52:49,060 INFO L371 AbstractCegarLoop]: === Iteration 23 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 17:52:49,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1793769950, now seen corresponding path program 1 times [2018-02-04 17:52:49,060 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:52:49,060 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:52:49,061 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:49,061 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:49,061 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:49,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:49,071 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:49,226 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 47 proven. 95 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-02-04 17:52:49,227 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:52:49,227 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:52:49,227 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:49,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:49,269 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:52:49,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:52:49,297 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:52:49,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:52:49,301 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 17:52:49,526 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 85 proven. 91 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-04 17:52:49,526 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:52:49,527 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 21 [2018-02-04 17:52:49,527 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 17:52:49,527 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 17:52:49,527 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2018-02-04 17:52:49,527 INFO L87 Difference]: Start difference. First operand 9656 states and 13350 transitions. Second operand 22 states. [2018-02-04 17:52:51,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:52:51,054 INFO L93 Difference]: Finished difference Result 13596 states and 18690 transitions. [2018-02-04 17:52:51,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 17:52:51,055 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 105 [2018-02-04 17:52:51,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:52:51,081 INFO L225 Difference]: With dead ends: 13596 [2018-02-04 17:52:51,081 INFO L226 Difference]: Without dead ends: 13596 [2018-02-04 17:52:51,082 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 114 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=467, Invalid=2083, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 17:52:51,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13596 states. [2018-02-04 17:52:51,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13596 to 12790. [2018-02-04 17:52:51,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12790 states. [2018-02-04 17:52:51,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12790 states to 12790 states and 17634 transitions. [2018-02-04 17:52:51,261 INFO L78 Accepts]: Start accepts. Automaton has 12790 states and 17634 transitions. Word has length 105 [2018-02-04 17:52:51,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:52:51,261 INFO L432 AbstractCegarLoop]: Abstraction has 12790 states and 17634 transitions. [2018-02-04 17:52:51,261 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 17:52:51,261 INFO L276 IsEmpty]: Start isEmpty. Operand 12790 states and 17634 transitions. [2018-02-04 17:52:51,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-02-04 17:52:51,266 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:52:51,266 INFO L351 BasicCegarLoop]: trace histogram [10, 10, 9, 8, 6, 6, 6, 6, 6, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:52:51,266 INFO L371 AbstractCegarLoop]: === Iteration 24 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 17:52:51,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1854918738, now seen corresponding path program 1 times [2018-02-04 17:52:51,267 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:52:51,267 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:52:51,267 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:51,267 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:51,267 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:51,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:51,286 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:51,389 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 86 proven. 4 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2018-02-04 17:52:51,389 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:52:51,389 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:52:51,390 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:51,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:51,427 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:52:51,478 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 86 proven. 4 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2018-02-04 17:52:51,479 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:52:51,479 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-02-04 17:52:51,479 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 17:52:51,479 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 17:52:51,479 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-04 17:52:51,480 INFO L87 Difference]: Start difference. First operand 12790 states and 17634 transitions. Second operand 11 states. [2018-02-04 17:52:51,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:52:51,701 INFO L93 Difference]: Finished difference Result 13454 states and 18016 transitions. [2018-02-04 17:52:51,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 17:52:51,701 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 131 [2018-02-04 17:52:51,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:52:51,722 INFO L225 Difference]: With dead ends: 13454 [2018-02-04 17:52:51,722 INFO L226 Difference]: Without dead ends: 12782 [2018-02-04 17:52:51,722 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 135 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2018-02-04 17:52:51,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12782 states. [2018-02-04 17:52:51,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12782 to 12010. [2018-02-04 17:52:51,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12010 states. [2018-02-04 17:52:51,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12010 states to 12010 states and 16249 transitions. [2018-02-04 17:52:51,888 INFO L78 Accepts]: Start accepts. Automaton has 12010 states and 16249 transitions. Word has length 131 [2018-02-04 17:52:51,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:52:51,888 INFO L432 AbstractCegarLoop]: Abstraction has 12010 states and 16249 transitions. [2018-02-04 17:52:51,888 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 17:52:51,888 INFO L276 IsEmpty]: Start isEmpty. Operand 12010 states and 16249 transitions. [2018-02-04 17:52:51,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-02-04 17:52:51,891 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:52:51,891 INFO L351 BasicCegarLoop]: trace histogram [11, 11, 10, 9, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:52:51,891 INFO L371 AbstractCegarLoop]: === Iteration 25 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 17:52:51,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1800322707, now seen corresponding path program 1 times [2018-02-04 17:52:51,892 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:52:51,892 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:52:51,892 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:51,892 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:51,892 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:51,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 17:52:51,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 17:52:51,959 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 17:52:52,004 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-04 17:52:52,010 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:52,011 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:52,012 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:52,012 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:52,013 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:52,015 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:52,016 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:52,017 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:52,019 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:52,020 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:52,021 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:52,021 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:52,023 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:52,024 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch8 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:52,026 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch8 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:52,026 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch8 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:52,027 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch8 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:52,028 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch8 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:52,029 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch8 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:52,029 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch8 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:52,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 05:52:52 BoogieIcfgContainer [2018-02-04 17:52:52,040 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 17:52:52,040 INFO L168 Benchmark]: Toolchain (without parser) took 17790.55 ms. Allocated memory was 403.7 MB in the beginning and 1.2 GB in the end (delta: 766.0 MB). Free memory was 360.6 MB in the beginning and 899.6 MB in the end (delta: -539.0 MB). Peak memory consumption was 226.9 MB. Max. memory is 5.3 GB. [2018-02-04 17:52:52,041 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 403.7 MB. Free memory is still 367.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 17:52:52,041 INFO L168 Benchmark]: CACSL2BoogieTranslator took 166.62 ms. Allocated memory is still 403.7 MB. Free memory was 360.6 MB in the beginning and 350.0 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:52,042 INFO L168 Benchmark]: Boogie Preprocessor took 30.16 ms. Allocated memory is still 403.7 MB. Free memory was 350.0 MB in the beginning and 347.4 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:52,042 INFO L168 Benchmark]: RCFGBuilder took 298.38 ms. Allocated memory is still 403.7 MB. Free memory was 347.4 MB in the beginning and 320.1 MB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 5.3 GB. [2018-02-04 17:52:52,042 INFO L168 Benchmark]: TraceAbstraction took 17292.05 ms. Allocated memory was 403.7 MB in the beginning and 1.2 GB in the end (delta: 766.0 MB). Free memory was 320.1 MB in the beginning and 899.6 MB in the end (delta: -579.5 MB). Peak memory consumption was 186.4 MB. Max. memory is 5.3 GB. [2018-02-04 17:52:52,043 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 403.7 MB. Free memory is still 367.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 166.62 ms. Allocated memory is still 403.7 MB. Free memory was 360.6 MB in the beginning and 350.0 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 30.16 ms. Allocated memory is still 403.7 MB. Free memory was 350.0 MB in the beginning and 347.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 298.38 ms. Allocated memory is still 403.7 MB. Free memory was 347.4 MB in the beginning and 320.1 MB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 17292.05 ms. Allocated memory was 403.7 MB in the beginning and 1.2 GB in the end (delta: 766.0 MB). Free memory was 320.1 MB in the beginning and 899.6 MB in the end (delta: -579.5 MB). Peak memory consumption was 186.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - 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~switch8 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~switch8 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~switch8 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~switch8 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~switch8 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~switch8 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~switch8 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 688]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L625] int pc1 = 1; [L626] int pc4 = 1; [L624] struct cell *S; [L627] static struct cell *t1 = ((void *)0); [L628] static struct cell *x1 = ((void *)0); [L657] struct cell* garbage; [L658] static struct cell *t4 = ((void *)0); [L659] static struct cell *x4 = ((void *)0); [L662] static int res4; VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L690] S || 1 != pc1 || __VERIFIER_nondet_int() [L690] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, __VERIFIER_nondet_int()=1, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L631] pc1++ [L632] case 1: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L633] EXPR, FCALL malloc(sizeof(*x1)) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, malloc(sizeof(*x1))={12:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L633] x1 = malloc(sizeof(*x1)) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, malloc(sizeof(*x1))={12:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L634] FCALL x1->data = 0 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, malloc(sizeof(*x1))={12:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L635] RET, FCALL x1->next = ((void *)0) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, malloc(sizeof(*x1))={12:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __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)=0, \old(x1)=12, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L631] pc1++ [L632] case 1: [L637] case 2: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=12, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L638] RET, FCALL x1->data = 4 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=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] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __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)=0, \old(x1)=12, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc1++=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=12, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L631] pc1++ [L632] case 1: [L637] case 2: [L640] case 3: [L643] case 4: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=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}] [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] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __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)=0, \old(x1)=12, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L647] COND TRUE S == t1 [L648] RET S = x1 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=12, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={12:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=1, res4=0, S={12:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=1, res4=0, S={12:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=12, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=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] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={12:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L691] COND FALSE !(__VERIFIER_nondet_int()) [L694] CALL pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=12, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=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}] [L663] pc4++ [L664] case 1: [L665] RET t4 = S VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=12, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=2, pc4++=1, res4=0, S={12:0}, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L694] pop() 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=2, res4=0, S={12:0}, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L690] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=2, res4=0, S={12:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L691] COND FALSE !(__VERIFIER_nondet_int()) [L694] CALL pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=2, \old(res4)=0, \old(S)=12, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=12, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=2, res4=0, S={12:0}, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L663] pc4++ [L664] case 1: [L667] case 2: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=2, \old(res4)=0, \old(S)=0, \old(S)=12, \old(t1)=0, \old(t1)=0, \old(t4)=12, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=3, pc4++=2, res4=0, S={12:0}, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L668] COND FALSE, RET !(t4 == ((void *)0)) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=2, \old(res4)=0, \old(S)=12, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=12, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=3, pc4++=2, res4=0, S={12:0}, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L694] pop() 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=3, res4=0, S={12:0}, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L690] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=3, res4=0, S={12:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L691] COND FALSE !(__VERIFIER_nondet_int()) [L694] CALL pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=3, \old(res4)=0, \old(S)=0, \old(S)=12, \old(t1)=0, \old(t1)=0, \old(t4)=12, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=3, res4=0, S={12:0}, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L663] pc4++ [L664] case 1: [L667] case 2: [L671] case 3: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=3, \old(res4)=0, \old(S)=0, \old(S)=12, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=12, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=4, pc4++=3, res4=0, S={12:0}, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L672] EXPR, FCALL t4->next VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=3, \old(res4)=0, \old(S)=0, \old(S)=12, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=12, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=4, pc4++=3, res4=0, S={12:0}, t1={0:0}, t4={12:0}, t4->next={0:0}, x1={12:0}, x4={0:0}] [L672] RET x4 = t4->next [L694] pop() 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=4, res4=0, S={12:0}, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L690] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=4, res4=0, S={12:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L691] COND FALSE !(__VERIFIER_nondet_int()) [L694] CALL pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=12, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=12, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=4, res4=0, S={12:0}, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L663] pc4++ [L664] case 1: [L667] case 2: [L671] case 3: [L674] case 4: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=0, \old(S)=12, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=12, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=5, pc4++=4, res4=0, S={12:0}, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L675] COND TRUE S == t4 [L676] RET S = x4 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=12, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=12, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=5, pc4++=4, res4=0, S={0:0}, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L694] pop() 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=5, res4=0, S={0:0}, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L690] S || 1 != pc1 || __VERIFIER_nondet_int() [L690] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, __VERIFIER_nondet_int()=0, garbage={0:0}, pc1=1, pc4=5, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=0, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L690] COND FALSE !(S || 1 != pc1 || __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=5, res4=0, S={0:0}, t1={0:0}, t4={12: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=5, 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, 17.2s OverallTime, 25 OverallIterations, 11 TraceHistogramMax, 11.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2558 SDtfs, 8526 SDslu, 6455 SDs, 0 SdLazy, 12911 SolverSat, 2106 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1654 GetRequests, 1086 SyntacticMatches, 12 SemanticMatches, 556 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8220 ImplicationChecksByTransitivity, 6.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12790occurred in iteration=23, 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.2s AutomataMinimizationTime, 24 MinimizatonAttempts, 9861 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 2203 NumberOfCodeBlocks, 2203 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 2019 ConstructedInterpolants, 10 QuantifiedInterpolants, 500639 SizeOfPredicates, 64 NumberOfNonLiveVariables, 7256 ConjunctsInSsa, 235 ConjunctsInUnsatCore, 39 InterpolantComputations, 12 PerfectInterpolantSequences, 2164/2663 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.3_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_17-52-52-050.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.3_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_17-52-52-050.csv Received shutdown request...