./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/psyco/psyco_abp_1-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/psyco/psyco_abp_1-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 39adc6d5c92d5d4be7746cac0afbcc96f3b450588f18f3eb2d03a3ab1e20a3ef --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 12:58:11,944 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 12:58:11,947 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 12:58:11,998 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 12:58:12,000 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 12:58:12,003 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 12:58:12,004 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 12:58:12,008 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 12:58:12,010 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 12:58:12,010 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 12:58:12,011 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 12:58:12,012 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 12:58:12,013 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 12:58:12,015 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 12:58:12,016 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 12:58:12,017 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 12:58:12,020 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 12:58:12,025 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 12:58:12,026 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 12:58:12,029 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 12:58:12,030 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 12:58:12,033 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 12:58:12,034 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 12:58:12,034 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 12:58:12,036 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 12:58:12,037 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 12:58:12,037 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 12:58:12,038 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 12:58:12,039 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 12:58:12,039 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 12:58:12,039 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 12:58:12,040 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 12:58:12,040 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 12:58:12,041 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 12:58:12,042 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 12:58:12,042 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 12:58:12,043 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 12:58:12,044 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 12:58:12,044 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 12:58:12,044 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 12:58:12,045 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 12:58:12,045 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-14 12:58:12,065 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 12:58:12,065 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 12:58:12,066 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 12:58:12,066 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 12:58:12,067 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 12:58:12,067 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 12:58:12,067 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 12:58:12,067 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 12:58:12,067 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 12:58:12,068 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 12:58:12,068 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 12:58:12,068 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 12:58:12,069 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 12:58:12,069 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 12:58:12,069 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 12:58:12,069 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 12:58:12,069 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 12:58:12,069 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 12:58:12,069 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 12:58:12,069 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 12:58:12,070 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 12:58:12,070 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 12:58:12,070 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 12:58:12,070 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 12:58:12,070 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 12:58:12,070 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 12:58:12,070 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 12:58:12,071 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 12:58:12,072 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 12:58:12,072 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 12:58:12,072 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 12:58:12,072 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 12:58:12,072 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 12:58:12,072 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 12:58:12,073 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 39adc6d5c92d5d4be7746cac0afbcc96f3b450588f18f3eb2d03a3ab1e20a3ef [2021-12-14 12:58:12,276 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 12:58:12,292 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 12:58:12,294 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 12:58:12,295 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 12:58:12,295 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 12:58:12,296 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/psyco/psyco_abp_1-1.c [2021-12-14 12:58:12,339 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29618ebf0/ff544f1747244caebc3515ff7a3b22ce/FLAG4fab6ee4e [2021-12-14 12:58:12,694 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 12:58:12,701 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/psyco/psyco_abp_1-1.c [2021-12-14 12:58:12,711 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29618ebf0/ff544f1747244caebc3515ff7a3b22ce/FLAG4fab6ee4e [2021-12-14 12:58:13,095 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29618ebf0/ff544f1747244caebc3515ff7a3b22ce [2021-12-14 12:58:13,097 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 12:58:13,098 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 12:58:13,099 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 12:58:13,099 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 12:58:13,101 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 12:58:13,102 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 12:58:13" (1/1) ... [2021-12-14 12:58:13,102 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@212cc6c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:58:13, skipping insertion in model container [2021-12-14 12:58:13,102 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 12:58:13" (1/1) ... [2021-12-14 12:58:13,107 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 12:58:13,126 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 12:58:13,349 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/psyco/psyco_abp_1-1.c[24818,24831] [2021-12-14 12:58:13,365 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 12:58:13,374 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 12:58:13,426 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/psyco/psyco_abp_1-1.c[24818,24831] [2021-12-14 12:58:13,433 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 12:58:13,442 INFO L208 MainTranslator]: Completed translation [2021-12-14 12:58:13,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:58:13 WrapperNode [2021-12-14 12:58:13,443 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 12:58:13,445 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 12:58:13,445 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 12:58:13,445 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 12:58:13,450 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:58:13" (1/1) ... [2021-12-14 12:58:13,470 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:58:13" (1/1) ... [2021-12-14 12:58:13,504 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 417 [2021-12-14 12:58:13,505 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 12:58:13,506 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 12:58:13,506 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 12:58:13,506 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 12:58:13,511 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:58:13" (1/1) ... [2021-12-14 12:58:13,512 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:58:13" (1/1) ... [2021-12-14 12:58:13,519 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:58:13" (1/1) ... [2021-12-14 12:58:13,520 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:58:13" (1/1) ... [2021-12-14 12:58:13,540 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:58:13" (1/1) ... [2021-12-14 12:58:13,546 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:58:13" (1/1) ... [2021-12-14 12:58:13,557 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:58:13" (1/1) ... [2021-12-14 12:58:13,561 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 12:58:13,564 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 12:58:13,565 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 12:58:13,565 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 12:58:13,566 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:58:13" (1/1) ... [2021-12-14 12:58:13,571 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 12:58:13,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 12:58:13,613 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-14 12:58:13,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-14 12:58:13,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 12:58:13,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 12:58:13,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 12:58:13,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 12:58:13,698 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 12:58:13,699 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 12:58:14,115 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 12:58:14,119 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 12:58:14,120 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-14 12:58:14,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 12:58:14 BoogieIcfgContainer [2021-12-14 12:58:14,122 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 12:58:14,123 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 12:58:14,123 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 12:58:14,125 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 12:58:14,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 12:58:13" (1/3) ... [2021-12-14 12:58:14,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eb0d351 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 12:58:14, skipping insertion in model container [2021-12-14 12:58:14,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:58:13" (2/3) ... [2021-12-14 12:58:14,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eb0d351 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 12:58:14, skipping insertion in model container [2021-12-14 12:58:14,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 12:58:14" (3/3) ... [2021-12-14 12:58:14,128 INFO L111 eAbstractionObserver]: Analyzing ICFG psyco_abp_1-1.c [2021-12-14 12:58:14,131 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 12:58:14,131 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-14 12:58:14,162 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 12:58:14,166 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-14 12:58:14,167 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-14 12:58:14,177 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 108 states have (on average 1.9537037037037037) internal successors, (211), 109 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:14,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-14 12:58:14,181 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 12:58:14,181 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 12:58:14,181 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 12:58:14,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 12:58:14,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1895078531, now seen corresponding path program 1 times [2021-12-14 12:58:14,191 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 12:58:14,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888676904] [2021-12-14 12:58:14,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 12:58:14,192 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 12:58:14,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 12:58:14,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 12:58:14,283 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 12:58:14,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888676904] [2021-12-14 12:58:14,283 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888676904] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 12:58:14,284 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 12:58:14,284 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 12:58:14,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590194720] [2021-12-14 12:58:14,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 12:58:14,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-14 12:58:14,288 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 12:58:14,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-14 12:58:14,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-14 12:58:14,307 INFO L87 Difference]: Start difference. First operand has 110 states, 108 states have (on average 1.9537037037037037) internal successors, (211), 109 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:14,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 12:58:14,330 INFO L93 Difference]: Finished difference Result 218 states and 420 transitions. [2021-12-14 12:58:14,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-14 12:58:14,332 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-14 12:58:14,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 12:58:14,338 INFO L225 Difference]: With dead ends: 218 [2021-12-14 12:58:14,338 INFO L226 Difference]: Without dead ends: 106 [2021-12-14 12:58:14,340 INFO L932 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 [2021-12-14 12:58:14,342 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 12:58:14,343 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 12:58:14,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-12-14 12:58:14,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2021-12-14 12:58:14,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 1.6857142857142857) internal successors, (177), 105 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:14,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 177 transitions. [2021-12-14 12:58:14,366 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 177 transitions. Word has length 10 [2021-12-14 12:58:14,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 12:58:14,367 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 177 transitions. [2021-12-14 12:58:14,367 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:14,367 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 177 transitions. [2021-12-14 12:58:14,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-14 12:58:14,368 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 12:58:14,368 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 12:58:14,368 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 12:58:14,368 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 12:58:14,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 12:58:14,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1914595175, now seen corresponding path program 1 times [2021-12-14 12:58:14,369 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 12:58:14,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241675820] [2021-12-14 12:58:14,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 12:58:14,370 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 12:58:14,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 12:58:14,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 12:58:14,399 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 12:58:14,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241675820] [2021-12-14 12:58:14,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241675820] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 12:58:14,399 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 12:58:14,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 12:58:14,399 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811658364] [2021-12-14 12:58:14,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 12:58:14,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 12:58:14,401 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 12:58:14,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 12:58:14,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 12:58:14,401 INFO L87 Difference]: Start difference. First operand 106 states and 177 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:14,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 12:58:14,427 INFO L93 Difference]: Finished difference Result 214 states and 358 transitions. [2021-12-14 12:58:14,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 12:58:14,428 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-14 12:58:14,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 12:58:14,429 INFO L225 Difference]: With dead ends: 214 [2021-12-14 12:58:14,429 INFO L226 Difference]: Without dead ends: 110 [2021-12-14 12:58:14,430 INFO L932 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 [2021-12-14 12:58:14,431 INFO L933 BasicCegarLoop]: 176 mSDtfsCounter, 5 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 12:58:14,431 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 332 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 12:58:14,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-12-14 12:58:14,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2021-12-14 12:58:14,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 109 states have (on average 1.6697247706422018) internal successors, (182), 109 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:14,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 182 transitions. [2021-12-14 12:58:14,437 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 182 transitions. Word has length 11 [2021-12-14 12:58:14,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 12:58:14,438 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 182 transitions. [2021-12-14 12:58:14,438 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:14,438 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 182 transitions. [2021-12-14 12:58:14,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-14 12:58:14,439 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 12:58:14,439 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 12:58:14,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 12:58:14,439 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 12:58:14,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 12:58:14,440 INFO L85 PathProgramCache]: Analyzing trace with hash 100490260, now seen corresponding path program 1 times [2021-12-14 12:58:14,440 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 12:58:14,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661645770] [2021-12-14 12:58:14,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 12:58:14,441 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 12:58:14,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 12:58:14,567 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 12:58:14,567 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 12:58:14,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661645770] [2021-12-14 12:58:14,568 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661645770] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 12:58:14,568 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 12:58:14,568 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 12:58:14,568 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497303299] [2021-12-14 12:58:14,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 12:58:14,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 12:58:14,569 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 12:58:14,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 12:58:14,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-14 12:58:14,569 INFO L87 Difference]: Start difference. First operand 110 states and 182 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:14,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 12:58:14,748 INFO L93 Difference]: Finished difference Result 326 states and 541 transitions. [2021-12-14 12:58:14,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 12:58:14,749 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-12-14 12:58:14,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 12:58:14,752 INFO L225 Difference]: With dead ends: 326 [2021-12-14 12:58:14,753 INFO L226 Difference]: Without dead ends: 197 [2021-12-14 12:58:14,755 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-14 12:58:14,760 INFO L933 BasicCegarLoop]: 173 mSDtfsCounter, 148 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 12:58:14,761 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 389 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 12:58:14,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-12-14 12:58:14,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 184. [2021-12-14 12:58:14,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 183 states have (on average 1.644808743169399) internal successors, (301), 183 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:14,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 301 transitions. [2021-12-14 12:58:14,777 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 301 transitions. Word has length 17 [2021-12-14 12:58:14,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 12:58:14,777 INFO L470 AbstractCegarLoop]: Abstraction has 184 states and 301 transitions. [2021-12-14 12:58:14,777 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:14,778 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 301 transitions. [2021-12-14 12:58:14,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-14 12:58:14,779 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 12:58:14,780 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 12:58:14,780 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 12:58:14,780 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 12:58:14,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 12:58:14,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1571478032, now seen corresponding path program 1 times [2021-12-14 12:58:14,781 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 12:58:14,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803045497] [2021-12-14 12:58:14,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 12:58:14,782 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 12:58:14,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 12:58:14,835 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 12:58:14,835 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 12:58:14,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803045497] [2021-12-14 12:58:14,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803045497] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 12:58:14,835 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 12:58:14,836 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 12:58:14,836 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405546682] [2021-12-14 12:58:14,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 12:58:14,836 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 12:58:14,836 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 12:58:14,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 12:58:14,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 12:58:14,837 INFO L87 Difference]: Start difference. First operand 184 states and 301 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:14,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 12:58:14,863 INFO L93 Difference]: Finished difference Result 314 states and 514 transitions. [2021-12-14 12:58:14,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 12:58:14,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-14 12:58:14,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 12:58:14,864 INFO L225 Difference]: With dead ends: 314 [2021-12-14 12:58:14,865 INFO L226 Difference]: Without dead ends: 133 [2021-12-14 12:58:14,867 INFO L932 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 [2021-12-14 12:58:14,868 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 33 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 12:58:14,870 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 307 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 12:58:14,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-12-14 12:58:14,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2021-12-14 12:58:14,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.623076923076923) internal successors, (211), 130 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:14,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 211 transitions. [2021-12-14 12:58:14,877 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 211 transitions. Word has length 18 [2021-12-14 12:58:14,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 12:58:14,877 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 211 transitions. [2021-12-14 12:58:14,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:14,878 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 211 transitions. [2021-12-14 12:58:14,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-14 12:58:14,879 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 12:58:14,879 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 12:58:14,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 12:58:14,879 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 12:58:14,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 12:58:14,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1260642915, now seen corresponding path program 1 times [2021-12-14 12:58:14,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 12:58:14,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345582723] [2021-12-14 12:58:14,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 12:58:14,882 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 12:58:14,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 12:58:14,923 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-14 12:58:14,923 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 12:58:14,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345582723] [2021-12-14 12:58:14,923 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345582723] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 12:58:14,923 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 12:58:14,923 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 12:58:14,924 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36731812] [2021-12-14 12:58:14,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 12:58:14,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 12:58:14,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 12:58:14,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 12:58:14,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 12:58:14,927 INFO L87 Difference]: Start difference. First operand 131 states and 211 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:14,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 12:58:14,946 INFO L93 Difference]: Finished difference Result 267 states and 431 transitions. [2021-12-14 12:58:14,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 12:58:14,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-14 12:58:14,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 12:58:14,947 INFO L225 Difference]: With dead ends: 267 [2021-12-14 12:58:14,948 INFO L226 Difference]: Without dead ends: 139 [2021-12-14 12:58:14,948 INFO L932 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 [2021-12-14 12:58:14,949 INFO L933 BasicCegarLoop]: 177 mSDtfsCounter, 35 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 12:58:14,949 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 306 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 12:58:14,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-12-14 12:58:14,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2021-12-14 12:58:14,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 1.6029411764705883) internal successors, (218), 136 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:14,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 218 transitions. [2021-12-14 12:58:14,955 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 218 transitions. Word has length 24 [2021-12-14 12:58:14,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 12:58:14,956 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 218 transitions. [2021-12-14 12:58:14,956 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:14,956 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 218 transitions. [2021-12-14 12:58:14,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-14 12:58:14,957 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 12:58:14,957 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 12:58:14,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 12:58:14,957 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 12:58:14,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 12:58:14,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1813922334, now seen corresponding path program 1 times [2021-12-14 12:58:14,958 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 12:58:14,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668153976] [2021-12-14 12:58:14,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 12:58:14,958 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 12:58:14,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 12:58:15,032 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 12:58:15,032 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 12:58:15,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668153976] [2021-12-14 12:58:15,032 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668153976] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 12:58:15,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290271444] [2021-12-14 12:58:15,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 12:58:15,033 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 12:58:15,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 12:58:15,038 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 12:58:15,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-14 12:58:15,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 12:58:15,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 12:58:15,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 12:58:15,170 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 12:58:15,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 12:58:15,220 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 12:58:15,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290271444] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 12:58:15,220 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 12:58:15,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2021-12-14 12:58:15,221 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860356632] [2021-12-14 12:58:15,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 12:58:15,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 12:58:15,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 12:58:15,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 12:58:15,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-14 12:58:15,222 INFO L87 Difference]: Start difference. First operand 137 states and 218 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:15,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 12:58:15,337 INFO L93 Difference]: Finished difference Result 258 states and 411 transitions. [2021-12-14 12:58:15,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 12:58:15,338 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-14 12:58:15,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 12:58:15,339 INFO L225 Difference]: With dead ends: 258 [2021-12-14 12:58:15,339 INFO L226 Difference]: Without dead ends: 243 [2021-12-14 12:58:15,339 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-14 12:58:15,342 INFO L933 BasicCegarLoop]: 285 mSDtfsCounter, 348 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 12:58:15,342 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [348 Valid, 708 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 12:58:15,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2021-12-14 12:58:15,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 220. [2021-12-14 12:58:15,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 219 states have (on average 1.6484018264840183) internal successors, (361), 219 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:15,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 361 transitions. [2021-12-14 12:58:15,352 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 361 transitions. Word has length 26 [2021-12-14 12:58:15,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 12:58:15,353 INFO L470 AbstractCegarLoop]: Abstraction has 220 states and 361 transitions. [2021-12-14 12:58:15,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:15,353 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 361 transitions. [2021-12-14 12:58:15,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-14 12:58:15,355 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 12:58:15,355 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 12:58:15,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-14 12:58:15,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-12-14 12:58:15,572 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 12:58:15,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 12:58:15,574 INFO L85 PathProgramCache]: Analyzing trace with hash 408461028, now seen corresponding path program 1 times [2021-12-14 12:58:15,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 12:58:15,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137848805] [2021-12-14 12:58:15,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 12:58:15,574 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 12:58:15,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 12:58:15,704 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 12:58:15,704 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 12:58:15,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137848805] [2021-12-14 12:58:15,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137848805] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 12:58:15,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906152712] [2021-12-14 12:58:15,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 12:58:15,705 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 12:58:15,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 12:58:15,708 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 12:58:15,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-14 12:58:15,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 12:58:15,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-14 12:58:15,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 12:58:15,921 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 12:58:15,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 12:58:16,039 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 12:58:16,040 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906152712] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 12:58:16,040 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 12:58:16,040 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2021-12-14 12:58:16,040 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961803238] [2021-12-14 12:58:16,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 12:58:16,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 12:58:16,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 12:58:16,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 12:58:16,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-14 12:58:16,041 INFO L87 Difference]: Start difference. First operand 220 states and 361 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:16,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 12:58:16,157 INFO L93 Difference]: Finished difference Result 462 states and 753 transitions. [2021-12-14 12:58:16,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 12:58:16,157 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-14 12:58:16,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 12:58:16,158 INFO L225 Difference]: With dead ends: 462 [2021-12-14 12:58:16,158 INFO L226 Difference]: Without dead ends: 243 [2021-12-14 12:58:16,159 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-14 12:58:16,159 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 54 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 12:58:16,159 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 886 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 12:58:16,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2021-12-14 12:58:16,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 239. [2021-12-14 12:58:16,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 238 states have (on average 1.6260504201680672) internal successors, (387), 238 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:16,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 387 transitions. [2021-12-14 12:58:16,164 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 387 transitions. Word has length 27 [2021-12-14 12:58:16,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 12:58:16,164 INFO L470 AbstractCegarLoop]: Abstraction has 239 states and 387 transitions. [2021-12-14 12:58:16,164 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:16,164 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 387 transitions. [2021-12-14 12:58:16,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-14 12:58:16,165 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 12:58:16,165 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 12:58:16,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-14 12:58:16,389 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-12-14 12:58:16,389 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 12:58:16,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 12:58:16,389 INFO L85 PathProgramCache]: Analyzing trace with hash -895020851, now seen corresponding path program 1 times [2021-12-14 12:58:16,390 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 12:58:16,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048422096] [2021-12-14 12:58:16,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 12:58:16,390 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 12:58:16,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 12:58:16,420 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-14 12:58:16,421 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 12:58:16,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048422096] [2021-12-14 12:58:16,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048422096] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 12:58:16,421 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 12:58:16,421 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 12:58:16,421 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803025711] [2021-12-14 12:58:16,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 12:58:16,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 12:58:16,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 12:58:16,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 12:58:16,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 12:58:16,422 INFO L87 Difference]: Start difference. First operand 239 states and 387 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:16,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 12:58:16,439 INFO L93 Difference]: Finished difference Result 447 states and 721 transitions. [2021-12-14 12:58:16,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 12:58:16,440 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-12-14 12:58:16,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 12:58:16,441 INFO L225 Difference]: With dead ends: 447 [2021-12-14 12:58:16,441 INFO L226 Difference]: Without dead ends: 211 [2021-12-14 12:58:16,441 INFO L932 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 [2021-12-14 12:58:16,441 INFO L933 BasicCegarLoop]: 145 mSDtfsCounter, 70 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 12:58:16,442 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 214 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 12:58:16,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-12-14 12:58:16,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2021-12-14 12:58:16,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 1.5769230769230769) internal successors, (328), 208 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:16,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 328 transitions. [2021-12-14 12:58:16,445 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 328 transitions. Word has length 34 [2021-12-14 12:58:16,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 12:58:16,446 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 328 transitions. [2021-12-14 12:58:16,446 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:16,446 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 328 transitions. [2021-12-14 12:58:16,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-14 12:58:16,446 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 12:58:16,447 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-14 12:58:16,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-14 12:58:16,447 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 12:58:16,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 12:58:16,447 INFO L85 PathProgramCache]: Analyzing trace with hash -936850633, now seen corresponding path program 1 times [2021-12-14 12:58:16,447 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 12:58:16,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451711022] [2021-12-14 12:58:16,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 12:58:16,448 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 12:58:16,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 12:58:16,529 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 12:58:16,529 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 12:58:16,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451711022] [2021-12-14 12:58:16,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451711022] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 12:58:16,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705107427] [2021-12-14 12:58:16,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 12:58:16,530 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 12:58:16,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 12:58:16,531 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 12:58:16,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-14 12:58:16,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 12:58:16,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-14 12:58:16,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 12:58:16,715 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-14 12:58:16,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 12:58:16,848 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-14 12:58:16,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705107427] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 12:58:16,848 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 12:58:16,848 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2021-12-14 12:58:16,849 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145515945] [2021-12-14 12:58:16,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 12:58:16,849 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 12:58:16,849 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 12:58:16,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 12:58:16,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-12-14 12:58:16,850 INFO L87 Difference]: Start difference. First operand 209 states and 328 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:17,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 12:58:17,209 INFO L93 Difference]: Finished difference Result 673 states and 1050 transitions. [2021-12-14 12:58:17,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 12:58:17,210 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-12-14 12:58:17,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 12:58:17,211 INFO L225 Difference]: With dead ends: 673 [2021-12-14 12:58:17,211 INFO L226 Difference]: Without dead ends: 438 [2021-12-14 12:58:17,212 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-12-14 12:58:17,212 INFO L933 BasicCegarLoop]: 228 mSDtfsCounter, 523 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 12:58:17,212 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [523 Valid, 851 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 12:58:17,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2021-12-14 12:58:17,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 400. [2021-12-14 12:58:17,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 399 states have (on average 1.5488721804511278) internal successors, (618), 399 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:17,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 618 transitions. [2021-12-14 12:58:17,219 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 618 transitions. Word has length 37 [2021-12-14 12:58:17,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 12:58:17,219 INFO L470 AbstractCegarLoop]: Abstraction has 400 states and 618 transitions. [2021-12-14 12:58:17,220 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:17,220 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 618 transitions. [2021-12-14 12:58:17,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-14 12:58:17,220 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 12:58:17,220 INFO L514 BasicCegarLoop]: trace histogram [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, 1] [2021-12-14 12:58:17,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-14 12:58:17,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 12:58:17,436 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 12:58:17,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 12:58:17,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1033847947, now seen corresponding path program 1 times [2021-12-14 12:58:17,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 12:58:17,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618886403] [2021-12-14 12:58:17,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 12:58:17,437 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 12:58:17,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 12:58:17,478 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-14 12:58:17,478 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 12:58:17,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618886403] [2021-12-14 12:58:17,478 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618886403] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 12:58:17,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576441452] [2021-12-14 12:58:17,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 12:58:17,479 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 12:58:17,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 12:58:17,480 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 12:58:17,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-14 12:58:17,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 12:58:17,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-14 12:58:17,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 12:58:17,609 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-14 12:58:17,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 12:58:17,683 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-14 12:58:17,684 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576441452] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 12:58:17,684 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 12:58:17,684 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2021-12-14 12:58:17,684 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745541665] [2021-12-14 12:58:17,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 12:58:17,684 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 12:58:17,685 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 12:58:17,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 12:58:17,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 12:58:17,685 INFO L87 Difference]: Start difference. First operand 400 states and 618 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:17,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 12:58:17,747 INFO L93 Difference]: Finished difference Result 415 states and 631 transitions. [2021-12-14 12:58:17,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 12:58:17,747 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-12-14 12:58:17,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 12:58:17,748 INFO L225 Difference]: With dead ends: 415 [2021-12-14 12:58:17,749 INFO L226 Difference]: Without dead ends: 403 [2021-12-14 12:58:17,749 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 72 SyntacticMatches, 5 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 12:58:17,749 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 222 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 12:58:17,750 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [222 Valid, 437 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 12:58:17,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2021-12-14 12:58:17,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 400. [2021-12-14 12:58:17,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 399 states have (on average 1.518796992481203) internal successors, (606), 399 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:17,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 606 transitions. [2021-12-14 12:58:17,756 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 606 transitions. Word has length 38 [2021-12-14 12:58:17,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 12:58:17,756 INFO L470 AbstractCegarLoop]: Abstraction has 400 states and 606 transitions. [2021-12-14 12:58:17,756 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:17,756 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 606 transitions. [2021-12-14 12:58:17,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-14 12:58:17,757 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 12:58:17,757 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2021-12-14 12:58:17,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-14 12:58:17,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 12:58:17,973 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 12:58:17,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 12:58:17,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1756734972, now seen corresponding path program 1 times [2021-12-14 12:58:17,973 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 12:58:17,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569430408] [2021-12-14 12:58:17,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 12:58:17,973 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 12:58:17,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 12:58:18,107 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 12:58:18,108 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 12:58:18,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569430408] [2021-12-14 12:58:18,108 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569430408] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 12:58:18,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240553472] [2021-12-14 12:58:18,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 12:58:18,108 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 12:58:18,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 12:58:18,118 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 12:58:18,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-14 12:58:18,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 12:58:18,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-14 12:58:18,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 12:58:18,423 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 12:58:18,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 12:58:18,708 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 12:58:18,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240553472] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 12:58:18,709 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 12:58:18,709 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2021-12-14 12:58:18,710 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43977190] [2021-12-14 12:58:18,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 12:58:18,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 12:58:18,711 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 12:58:18,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 12:58:18,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-12-14 12:58:18,712 INFO L87 Difference]: Start difference. First operand 400 states and 606 transitions. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:18,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 12:58:18,813 INFO L93 Difference]: Finished difference Result 412 states and 615 transitions. [2021-12-14 12:58:18,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 12:58:18,814 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-12-14 12:58:18,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 12:58:18,815 INFO L225 Difference]: With dead ends: 412 [2021-12-14 12:58:18,815 INFO L226 Difference]: Without dead ends: 410 [2021-12-14 12:58:18,815 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-12-14 12:58:18,816 INFO L933 BasicCegarLoop]: 167 mSDtfsCounter, 199 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 12:58:18,816 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [199 Valid, 659 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 12:58:18,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2021-12-14 12:58:18,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 401. [2021-12-14 12:58:18,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 400 states have (on average 1.5175) internal successors, (607), 400 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:18,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 607 transitions. [2021-12-14 12:58:18,822 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 607 transitions. Word has length 40 [2021-12-14 12:58:18,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 12:58:18,822 INFO L470 AbstractCegarLoop]: Abstraction has 401 states and 607 transitions. [2021-12-14 12:58:18,822 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:18,823 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 607 transitions. [2021-12-14 12:58:18,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-14 12:58:18,823 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 12:58:18,823 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2021-12-14 12:58:18,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-14 12:58:19,041 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-12-14 12:58:19,042 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 12:58:19,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 12:58:19,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1250552987, now seen corresponding path program 1 times [2021-12-14 12:58:19,042 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 12:58:19,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766700781] [2021-12-14 12:58:19,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 12:58:19,042 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 12:58:19,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 12:58:19,062 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-14 12:58:19,063 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 12:58:19,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766700781] [2021-12-14 12:58:19,063 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766700781] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 12:58:19,063 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 12:58:19,063 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 12:58:19,063 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494249388] [2021-12-14 12:58:19,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 12:58:19,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 12:58:19,064 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 12:58:19,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 12:58:19,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 12:58:19,064 INFO L87 Difference]: Start difference. First operand 401 states and 607 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:19,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 12:58:19,082 INFO L93 Difference]: Finished difference Result 756 states and 1142 transitions. [2021-12-14 12:58:19,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 12:58:19,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-12-14 12:58:19,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 12:58:19,084 INFO L225 Difference]: With dead ends: 756 [2021-12-14 12:58:19,084 INFO L226 Difference]: Without dead ends: 400 [2021-12-14 12:58:19,084 INFO L932 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 [2021-12-14 12:58:19,085 INFO L933 BasicCegarLoop]: 147 mSDtfsCounter, 33 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 12:58:19,085 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 246 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 12:58:19,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2021-12-14 12:58:19,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 398. [2021-12-14 12:58:19,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 397 states have (on average 1.4836272040302267) internal successors, (589), 397 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:19,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 589 transitions. [2021-12-14 12:58:19,091 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 589 transitions. Word has length 41 [2021-12-14 12:58:19,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 12:58:19,091 INFO L470 AbstractCegarLoop]: Abstraction has 398 states and 589 transitions. [2021-12-14 12:58:19,091 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:19,091 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 589 transitions. [2021-12-14 12:58:19,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-12-14 12:58:19,092 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 12:58:19,092 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 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] [2021-12-14 12:58:19,092 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-14 12:58:19,092 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 12:58:19,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 12:58:19,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1798904348, now seen corresponding path program 1 times [2021-12-14 12:58:19,093 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 12:58:19,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840652468] [2021-12-14 12:58:19,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 12:58:19,093 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 12:58:19,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 12:58:19,116 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-12-14 12:58:19,117 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 12:58:19,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840652468] [2021-12-14 12:58:19,117 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840652468] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 12:58:19,117 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 12:58:19,117 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 12:58:19,117 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228783630] [2021-12-14 12:58:19,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 12:58:19,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 12:58:19,118 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 12:58:19,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 12:58:19,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 12:58:19,118 INFO L87 Difference]: Start difference. First operand 398 states and 589 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:19,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 12:58:19,133 INFO L93 Difference]: Finished difference Result 566 states and 838 transitions. [2021-12-14 12:58:19,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 12:58:19,134 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-12-14 12:58:19,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 12:58:19,135 INFO L225 Difference]: With dead ends: 566 [2021-12-14 12:58:19,135 INFO L226 Difference]: Without dead ends: 233 [2021-12-14 12:58:19,135 INFO L932 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 [2021-12-14 12:58:19,136 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 30 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 12:58:19,136 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 203 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 12:58:19,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2021-12-14 12:58:19,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 231. [2021-12-14 12:58:19,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 230 states have (on average 1.4478260869565218) internal successors, (333), 230 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:19,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 333 transitions. [2021-12-14 12:58:19,161 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 333 transitions. Word has length 53 [2021-12-14 12:58:19,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 12:58:19,161 INFO L470 AbstractCegarLoop]: Abstraction has 231 states and 333 transitions. [2021-12-14 12:58:19,162 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:19,162 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 333 transitions. [2021-12-14 12:58:19,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-12-14 12:58:19,162 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 12:58:19,162 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 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] [2021-12-14 12:58:19,162 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-14 12:58:19,162 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 12:58:19,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 12:58:19,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1723595032, now seen corresponding path program 1 times [2021-12-14 12:58:19,163 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 12:58:19,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660125710] [2021-12-14 12:58:19,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 12:58:19,163 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 12:58:19,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 12:58:19,261 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-14 12:58:19,261 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 12:58:19,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660125710] [2021-12-14 12:58:19,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660125710] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 12:58:19,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487770703] [2021-12-14 12:58:19,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 12:58:19,262 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 12:58:19,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 12:58:19,274 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 12:58:19,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-14 12:58:19,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 12:58:19,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-14 12:58:19,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 12:58:19,446 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-14 12:58:19,446 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 12:58:19,446 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487770703] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 12:58:19,447 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 12:58:19,447 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2021-12-14 12:58:19,447 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678025995] [2021-12-14 12:58:19,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 12:58:19,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 12:58:19,447 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 12:58:19,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 12:58:19,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-12-14 12:58:19,448 INFO L87 Difference]: Start difference. First operand 231 states and 333 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:19,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 12:58:19,488 INFO L93 Difference]: Finished difference Result 317 states and 455 transitions. [2021-12-14 12:58:19,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 12:58:19,488 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2021-12-14 12:58:19,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 12:58:19,489 INFO L225 Difference]: With dead ends: 317 [2021-12-14 12:58:19,489 INFO L226 Difference]: Without dead ends: 313 [2021-12-14 12:58:19,490 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-12-14 12:58:19,490 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 198 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 12:58:19,490 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [198 Valid, 427 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 12:58:19,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2021-12-14 12:58:19,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 309. [2021-12-14 12:58:19,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 308 states have (on average 1.4545454545454546) internal successors, (448), 308 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:19,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 448 transitions. [2021-12-14 12:58:19,495 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 448 transitions. Word has length 55 [2021-12-14 12:58:19,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 12:58:19,495 INFO L470 AbstractCegarLoop]: Abstraction has 309 states and 448 transitions. [2021-12-14 12:58:19,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:19,496 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 448 transitions. [2021-12-14 12:58:19,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-12-14 12:58:19,496 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 12:58:19,496 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 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, 1] [2021-12-14 12:58:19,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-14 12:58:19,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 12:58:19,712 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 12:58:19,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 12:58:19,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1291508586, now seen corresponding path program 1 times [2021-12-14 12:58:19,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 12:58:19,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786671721] [2021-12-14 12:58:19,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 12:58:19,713 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 12:58:19,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 12:58:19,744 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 23 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-14 12:58:19,745 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 12:58:19,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786671721] [2021-12-14 12:58:19,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786671721] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 12:58:19,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411179035] [2021-12-14 12:58:19,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 12:58:19,745 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 12:58:19,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 12:58:19,746 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 12:58:19,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-14 12:58:19,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 12:58:19,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 12:58:19,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 12:58:19,880 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 23 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-14 12:58:19,880 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 12:58:19,974 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 23 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-14 12:58:19,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [411179035] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 12:58:19,974 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 12:58:19,974 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2021-12-14 12:58:19,974 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325254076] [2021-12-14 12:58:19,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 12:58:19,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 12:58:19,975 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 12:58:19,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 12:58:19,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2021-12-14 12:58:19,975 INFO L87 Difference]: Start difference. First operand 309 states and 448 transitions. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:20,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 12:58:20,083 INFO L93 Difference]: Finished difference Result 810 states and 1182 transitions. [2021-12-14 12:58:20,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 12:58:20,083 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2021-12-14 12:58:20,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 12:58:20,085 INFO L225 Difference]: With dead ends: 810 [2021-12-14 12:58:20,085 INFO L226 Difference]: Without dead ends: 643 [2021-12-14 12:58:20,085 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2021-12-14 12:58:20,086 INFO L933 BasicCegarLoop]: 171 mSDtfsCounter, 586 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 12:58:20,086 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [586 Valid, 776 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 12:58:20,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2021-12-14 12:58:20,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 628. [2021-12-14 12:58:20,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 627 states have (on average 1.4290271132376395) internal successors, (896), 627 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:20,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 896 transitions. [2021-12-14 12:58:20,095 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 896 transitions. Word has length 55 [2021-12-14 12:58:20,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 12:58:20,095 INFO L470 AbstractCegarLoop]: Abstraction has 628 states and 896 transitions. [2021-12-14 12:58:20,096 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:20,096 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 896 transitions. [2021-12-14 12:58:20,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-14 12:58:20,096 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 12:58:20,096 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 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, 1] [2021-12-14 12:58:20,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-12-14 12:58:20,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 12:58:20,312 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 12:58:20,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 12:58:20,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1903289774, now seen corresponding path program 1 times [2021-12-14 12:58:20,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 12:58:20,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124488277] [2021-12-14 12:58:20,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 12:58:20,313 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 12:58:20,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 12:58:20,450 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 12:58:20,451 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 12:58:20,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124488277] [2021-12-14 12:58:20,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124488277] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 12:58:20,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346088666] [2021-12-14 12:58:20,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 12:58:20,451 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 12:58:20,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 12:58:20,452 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 12:58:20,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-14 12:58:20,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 12:58:20,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-14 12:58:20,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 12:58:20,781 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 12:58:20,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 12:58:21,138 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 12:58:21,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1346088666] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 12:58:21,138 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 12:58:21,138 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2021-12-14 12:58:21,139 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532274560] [2021-12-14 12:58:21,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 12:58:21,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 12:58:21,139 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 12:58:21,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 12:58:21,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-12-14 12:58:21,140 INFO L87 Difference]: Start difference. First operand 628 states and 896 transitions. Second operand has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 11 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:21,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 12:58:21,233 INFO L93 Difference]: Finished difference Result 634 states and 899 transitions. [2021-12-14 12:58:21,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 12:58:21,233 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 11 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2021-12-14 12:58:21,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 12:58:21,235 INFO L225 Difference]: With dead ends: 634 [2021-12-14 12:58:21,235 INFO L226 Difference]: Without dead ends: 632 [2021-12-14 12:58:21,235 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 105 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-12-14 12:58:21,235 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 143 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 12:58:21,236 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 960 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 12:58:21,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2021-12-14 12:58:21,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 628. [2021-12-14 12:58:21,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 627 states have (on average 1.4242424242424243) internal successors, (893), 627 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:21,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 893 transitions. [2021-12-14 12:58:21,245 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 893 transitions. Word has length 56 [2021-12-14 12:58:21,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 12:58:21,246 INFO L470 AbstractCegarLoop]: Abstraction has 628 states and 893 transitions. [2021-12-14 12:58:21,246 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 11 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:21,246 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 893 transitions. [2021-12-14 12:58:21,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-12-14 12:58:21,246 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 12:58:21,246 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 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, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 12:58:21,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-14 12:58:21,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-12-14 12:58:21,463 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 12:58:21,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 12:58:21,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1029731011, now seen corresponding path program 1 times [2021-12-14 12:58:21,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 12:58:21,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162210511] [2021-12-14 12:58:21,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 12:58:21,464 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 12:58:21,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 12:58:21,714 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 12:58:21,715 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 12:58:21,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162210511] [2021-12-14 12:58:21,715 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162210511] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 12:58:21,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897987831] [2021-12-14 12:58:21,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 12:58:21,715 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 12:58:21,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 12:58:21,716 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 12:58:21,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-14 12:58:21,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 12:58:21,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-14 12:58:21,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 12:58:22,151 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 12:58:22,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 12:58:22,455 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 43 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-14 12:58:22,455 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897987831] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 12:58:22,455 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 12:58:22,455 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 12 [2021-12-14 12:58:22,456 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466966116] [2021-12-14 12:58:22,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 12:58:22,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-14 12:58:22,456 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 12:58:22,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-14 12:58:22,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-12-14 12:58:22,457 INFO L87 Difference]: Start difference. First operand 628 states and 893 transitions. Second operand has 12 states, 12 states have (on average 9.5) internal successors, (114), 12 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:22,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 12:58:22,713 INFO L93 Difference]: Finished difference Result 638 states and 898 transitions. [2021-12-14 12:58:22,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-14 12:58:22,714 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.5) internal successors, (114), 12 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-12-14 12:58:22,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 12:58:22,715 INFO L225 Difference]: With dead ends: 638 [2021-12-14 12:58:22,715 INFO L226 Difference]: Without dead ends: 636 [2021-12-14 12:58:22,716 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 119 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2021-12-14 12:58:22,716 INFO L933 BasicCegarLoop]: 228 mSDtfsCounter, 284 mSDsluCounter, 1560 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 1788 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 12:58:22,716 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [284 Valid, 1788 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 12:58:22,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2021-12-14 12:58:22,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 628. [2021-12-14 12:58:22,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 627 states have (on average 1.4066985645933014) internal successors, (882), 627 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:22,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 882 transitions. [2021-12-14 12:58:22,726 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 882 transitions. Word has length 63 [2021-12-14 12:58:22,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 12:58:22,727 INFO L470 AbstractCegarLoop]: Abstraction has 628 states and 882 transitions. [2021-12-14 12:58:22,727 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.5) internal successors, (114), 12 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:22,727 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 882 transitions. [2021-12-14 12:58:22,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-12-14 12:58:22,727 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 12:58:22,727 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 7, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-12-14 12:58:22,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-12-14 12:58:22,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-14 12:58:22,943 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 12:58:22,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 12:58:22,944 INFO L85 PathProgramCache]: Analyzing trace with hash -112559507, now seen corresponding path program 1 times [2021-12-14 12:58:22,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 12:58:22,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663719098] [2021-12-14 12:58:22,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 12:58:22,944 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 12:58:22,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 12:58:23,103 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 21 proven. 110 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-14 12:58:23,104 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 12:58:23,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663719098] [2021-12-14 12:58:23,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663719098] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 12:58:23,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411387043] [2021-12-14 12:58:23,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 12:58:23,105 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 12:58:23,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 12:58:23,106 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 12:58:23,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-14 12:58:23,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 12:58:23,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-14 12:58:23,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 12:58:23,555 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 21 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 12:58:23,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 12:58:24,028 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 51 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 12:58:24,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411387043] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 12:58:24,028 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 12:58:24,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 20 [2021-12-14 12:58:24,028 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368068883] [2021-12-14 12:58:24,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 12:58:24,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-14 12:58:24,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 12:58:24,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-14 12:58:24,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2021-12-14 12:58:24,030 INFO L87 Difference]: Start difference. First operand 628 states and 882 transitions. Second operand has 20 states, 20 states have (on average 10.45) internal successors, (209), 20 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:24,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 12:58:24,251 INFO L93 Difference]: Finished difference Result 634 states and 885 transitions. [2021-12-14 12:58:24,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-14 12:58:24,253 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 10.45) internal successors, (209), 20 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2021-12-14 12:58:24,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 12:58:24,255 INFO L225 Difference]: With dead ends: 634 [2021-12-14 12:58:24,255 INFO L226 Difference]: Without dead ends: 632 [2021-12-14 12:58:24,255 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 161 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2021-12-14 12:58:24,256 INFO L933 BasicCegarLoop]: 199 mSDtfsCounter, 362 mSDsluCounter, 1833 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 2032 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 12:58:24,256 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [362 Valid, 2032 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 12:58:24,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2021-12-14 12:58:24,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 628. [2021-12-14 12:58:24,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 627 states have (on average 1.4035087719298245) internal successors, (880), 627 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:24,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 880 transitions. [2021-12-14 12:58:24,317 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 880 transitions. Word has length 86 [2021-12-14 12:58:24,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 12:58:24,317 INFO L470 AbstractCegarLoop]: Abstraction has 628 states and 880 transitions. [2021-12-14 12:58:24,317 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 10.45) internal successors, (209), 20 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:24,317 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 880 transitions. [2021-12-14 12:58:24,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-12-14 12:58:24,318 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 12:58:24,318 INFO L514 BasicCegarLoop]: trace histogram [13, 12, 12, 9, 9, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 12:58:24,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-14 12:58:24,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-14 12:58:24,519 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 12:58:24,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 12:58:24,519 INFO L85 PathProgramCache]: Analyzing trace with hash -520376012, now seen corresponding path program 1 times [2021-12-14 12:58:24,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 12:58:24,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770082070] [2021-12-14 12:58:24,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 12:58:24,520 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 12:58:24,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 12:58:24,663 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 91 proven. 330 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-14 12:58:24,664 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 12:58:24,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770082070] [2021-12-14 12:58:24,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770082070] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 12:58:24,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471653283] [2021-12-14 12:58:24,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 12:58:24,664 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 12:58:24,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 12:58:24,665 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 12:58:24,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-14 12:58:24,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 12:58:24,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 887 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-14 12:58:24,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 12:58:24,958 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 91 proven. 330 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-14 12:58:24,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 12:58:25,171 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 91 proven. 330 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-14 12:58:25,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471653283] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 12:58:25,171 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 12:58:25,171 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2021-12-14 12:58:25,171 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055852046] [2021-12-14 12:58:25,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 12:58:25,172 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-14 12:58:25,172 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 12:58:25,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-14 12:58:25,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2021-12-14 12:58:25,172 INFO L87 Difference]: Start difference. First operand 628 states and 880 transitions. Second operand has 17 states, 17 states have (on average 14.0) internal successors, (238), 17 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:25,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 12:58:25,307 INFO L93 Difference]: Finished difference Result 1687 states and 2348 transitions. [2021-12-14 12:58:25,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-14 12:58:25,308 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 14.0) internal successors, (238), 17 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 147 [2021-12-14 12:58:25,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 12:58:25,311 INFO L225 Difference]: With dead ends: 1687 [2021-12-14 12:58:25,311 INFO L226 Difference]: Without dead ends: 1323 [2021-12-14 12:58:25,312 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2021-12-14 12:58:25,312 INFO L933 BasicCegarLoop]: 170 mSDtfsCounter, 1739 mSDsluCounter, 1207 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1739 SdHoareTripleChecker+Valid, 1377 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 12:58:25,313 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1739 Valid, 1377 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 12:58:25,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2021-12-14 12:58:25,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 1252. [2021-12-14 12:58:25,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1252 states, 1251 states have (on average 1.4036770583533174) internal successors, (1756), 1251 states have internal predecessors, (1756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:25,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1756 transitions. [2021-12-14 12:58:25,352 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 1756 transitions. Word has length 147 [2021-12-14 12:58:25,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 12:58:25,352 INFO L470 AbstractCegarLoop]: Abstraction has 1252 states and 1756 transitions. [2021-12-14 12:58:25,352 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 14.0) internal successors, (238), 17 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:25,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1756 transitions. [2021-12-14 12:58:25,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-12-14 12:58:25,353 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 12:58:25,353 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 9, 9, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 12:58:25,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-14 12:58:25,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 12:58:25,567 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 12:58:25,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 12:58:25,568 INFO L85 PathProgramCache]: Analyzing trace with hash 38595792, now seen corresponding path program 1 times [2021-12-14 12:58:25,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 12:58:25,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687393879] [2021-12-14 12:58:25,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 12:58:25,568 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 12:58:25,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 12:58:25,831 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 36 proven. 397 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-14 12:58:25,831 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 12:58:25,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687393879] [2021-12-14 12:58:25,832 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687393879] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 12:58:25,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654819197] [2021-12-14 12:58:25,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 12:58:25,832 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 12:58:25,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 12:58:25,852 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 12:58:25,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-14 12:58:26,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 12:58:26,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 51 conjunts are in the unsatisfiable core [2021-12-14 12:58:26,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 12:58:26,626 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 36 proven. 417 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 12:58:26,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 12:58:27,543 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 174 proven. 279 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 12:58:27,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654819197] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 12:58:27,544 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 12:58:27,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 14] total 35 [2021-12-14 12:58:27,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893790270] [2021-12-14 12:58:27,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 12:58:27,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-12-14 12:58:27,545 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 12:58:27,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-12-14 12:58:27,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1051, Unknown=0, NotChecked=0, Total=1190 [2021-12-14 12:58:27,546 INFO L87 Difference]: Start difference. First operand 1252 states and 1756 transitions. Second operand has 35 states, 35 states have (on average 11.714285714285714) internal successors, (410), 35 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:27,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 12:58:27,908 INFO L93 Difference]: Finished difference Result 1256 states and 1758 transitions. [2021-12-14 12:58:27,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-14 12:58:27,909 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 11.714285714285714) internal successors, (410), 35 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2021-12-14 12:58:27,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 12:58:27,912 INFO L225 Difference]: With dead ends: 1256 [2021-12-14 12:58:27,913 INFO L226 Difference]: Without dead ends: 1254 [2021-12-14 12:58:27,913 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=152, Invalid=1180, Unknown=0, NotChecked=0, Total=1332 [2021-12-14 12:58:27,914 INFO L933 BasicCegarLoop]: 326 mSDtfsCounter, 673 mSDsluCounter, 4267 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 4593 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 12:58:27,914 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [673 Valid, 4593 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 12:58:27,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2021-12-14 12:58:27,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1252. [2021-12-14 12:58:27,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1252 states, 1251 states have (on average 1.3996802557953638) internal successors, (1751), 1251 states have internal predecessors, (1751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:27,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1751 transitions. [2021-12-14 12:58:27,940 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 1751 transitions. Word has length 148 [2021-12-14 12:58:27,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 12:58:27,940 INFO L470 AbstractCegarLoop]: Abstraction has 1252 states and 1751 transitions. [2021-12-14 12:58:27,940 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 11.714285714285714) internal successors, (410), 35 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:27,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1751 transitions. [2021-12-14 12:58:27,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2021-12-14 12:58:27,943 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 12:58:27,943 INFO L514 BasicCegarLoop]: trace histogram [29, 28, 28, 21, 21, 14, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 12:58:27,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-14 12:58:28,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 12:58:28,167 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 12:58:28,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 12:58:28,168 INFO L85 PathProgramCache]: Analyzing trace with hash -691826832, now seen corresponding path program 2 times [2021-12-14 12:58:28,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 12:58:28,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456554262] [2021-12-14 12:58:28,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 12:58:28,168 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 12:58:28,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 12:58:28,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2551 backedges. 227 proven. 2258 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-12-14 12:58:28,433 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 12:58:28,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456554262] [2021-12-14 12:58:28,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456554262] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 12:58:28,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501014121] [2021-12-14 12:58:28,434 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 12:58:28,434 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 12:58:28,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 12:58:28,435 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 12:58:28,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-14 12:58:28,679 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 12:58:28,679 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 12:58:28,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 1947 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-14 12:58:28,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 12:58:29,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2551 backedges. 227 proven. 2258 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-12-14 12:58:29,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 12:58:29,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2551 backedges. 227 proven. 2258 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-12-14 12:58:29,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501014121] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 12:58:29,777 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 12:58:29,778 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 20 [2021-12-14 12:58:29,778 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453983810] [2021-12-14 12:58:29,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 12:58:29,778 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-14 12:58:29,779 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 12:58:29,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-14 12:58:29,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2021-12-14 12:58:29,779 INFO L87 Difference]: Start difference. First operand 1252 states and 1751 transitions. Second operand has 20 states, 20 states have (on average 16.3) internal successors, (326), 20 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:29,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 12:58:29,974 INFO L93 Difference]: Finished difference Result 2222 states and 3089 transitions. [2021-12-14 12:58:29,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-14 12:58:29,974 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 16.3) internal successors, (326), 20 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 331 [2021-12-14 12:58:29,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 12:58:29,979 INFO L225 Difference]: With dead ends: 2222 [2021-12-14 12:58:29,979 INFO L226 Difference]: Without dead ends: 1546 [2021-12-14 12:58:29,980 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 690 GetRequests, 672 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2021-12-14 12:58:29,980 INFO L933 BasicCegarLoop]: 169 mSDtfsCounter, 1911 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1911 SdHoareTripleChecker+Valid, 1434 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 12:58:29,980 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1911 Valid, 1434 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 12:58:29,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2021-12-14 12:58:30,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1486. [2021-12-14 12:58:30,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1486 states, 1485 states have (on average 1.3986531986531987) internal successors, (2077), 1485 states have internal predecessors, (2077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:30,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1486 states and 2077 transitions. [2021-12-14 12:58:30,008 INFO L78 Accepts]: Start accepts. Automaton has 1486 states and 2077 transitions. Word has length 331 [2021-12-14 12:58:30,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 12:58:30,009 INFO L470 AbstractCegarLoop]: Abstraction has 1486 states and 2077 transitions. [2021-12-14 12:58:30,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 16.3) internal successors, (326), 20 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 12:58:30,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 2077 transitions. [2021-12-14 12:58:30,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2021-12-14 12:58:30,013 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 12:58:30,013 INFO L514 BasicCegarLoop]: trace histogram [35, 34, 34, 25, 25, 16, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 12:58:30,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-12-14 12:58:30,248 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-12-14 12:58:30,249 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 12:58:30,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 12:58:30,249 INFO L85 PathProgramCache]: Analyzing trace with hash 49372446, now seen corresponding path program 1 times [2021-12-14 12:58:30,249 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 12:58:30,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543908338] [2021-12-14 12:58:30,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 12:58:30,250 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 12:58:30,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 12:58:30,948 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 12:58:31,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 12:58:31,740 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 12:58:31,741 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-14 12:58:31,741 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-14 12:58:31,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-14 12:58:31,745 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 12:58:31,748 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-14 12:58:31,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 12:58:31 BoogieIcfgContainer [2021-12-14 12:58:31,903 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-14 12:58:31,903 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 12:58:31,903 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 12:58:31,904 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 12:58:31,904 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 12:58:14" (3/4) ... [2021-12-14 12:58:31,905 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-14 12:58:32,060 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-14 12:58:32,060 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 12:58:32,061 INFO L158 Benchmark]: Toolchain (without parser) took 18962.60ms. Allocated memory was 109.1MB in the beginning and 358.6MB in the end (delta: 249.6MB). Free memory was 83.3MB in the beginning and 234.6MB in the end (delta: -151.3MB). Peak memory consumption was 96.5MB. Max. memory is 16.1GB. [2021-12-14 12:58:32,061 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 109.1MB. Free memory is still 68.7MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 12:58:32,061 INFO L158 Benchmark]: CACSL2BoogieTranslator took 344.78ms. Allocated memory was 109.1MB in the beginning and 140.5MB in the end (delta: 31.5MB). Free memory was 83.0MB in the beginning and 109.4MB in the end (delta: -26.4MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. [2021-12-14 12:58:32,064 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.34ms. Allocated memory is still 140.5MB. Free memory was 109.4MB in the beginning and 104.8MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-14 12:58:32,064 INFO L158 Benchmark]: Boogie Preprocessor took 58.22ms. Allocated memory is still 140.5MB. Free memory was 104.8MB in the beginning and 102.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 12:58:32,065 INFO L158 Benchmark]: RCFGBuilder took 557.88ms. Allocated memory is still 140.5MB. Free memory was 102.0MB in the beginning and 112.4MB in the end (delta: -10.4MB). Peak memory consumption was 34.3MB. Max. memory is 16.1GB. [2021-12-14 12:58:32,065 INFO L158 Benchmark]: TraceAbstraction took 17779.67ms. Allocated memory was 140.5MB in the beginning and 358.6MB in the end (delta: 218.1MB). Free memory was 111.8MB in the beginning and 279.5MB in the end (delta: -167.7MB). Peak memory consumption was 179.0MB. Max. memory is 16.1GB. [2021-12-14 12:58:32,067 INFO L158 Benchmark]: Witness Printer took 156.91ms. Allocated memory is still 358.6MB. Free memory was 279.5MB in the beginning and 234.6MB in the end (delta: 44.9MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2021-12-14 12:58:32,072 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 109.1MB. Free memory is still 68.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 344.78ms. Allocated memory was 109.1MB in the beginning and 140.5MB in the end (delta: 31.5MB). Free memory was 83.0MB in the beginning and 109.4MB in the end (delta: -26.4MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.34ms. Allocated memory is still 140.5MB. Free memory was 109.4MB in the beginning and 104.8MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.22ms. Allocated memory is still 140.5MB. Free memory was 104.8MB in the beginning and 102.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 557.88ms. Allocated memory is still 140.5MB. Free memory was 102.0MB in the beginning and 112.4MB in the end (delta: -10.4MB). Peak memory consumption was 34.3MB. Max. memory is 16.1GB. * TraceAbstraction took 17779.67ms. Allocated memory was 140.5MB in the beginning and 358.6MB in the end (delta: 218.1MB). Free memory was 111.8MB in the beginning and 279.5MB in the end (delta: -167.7MB). Peak memory consumption was 179.0MB. Max. memory is 16.1GB. * Witness Printer took 156.91ms. Allocated memory is still 358.6MB. Free memory was 279.5MB in the beginning and 234.6MB in the end (delta: 44.9MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 571]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L7] int m_Protocol = 1; [L8] int m_msg_2 = 2; [L9] int m_recv_ack_2 = 3; [L10] int m_msg_1_1 = 4; [L11] int m_msg_1_2 = 5; [L12] int m_recv_ack_1_1 = 6; [L13] int m_recv_ack_1_2 = 7; VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L18] int q = 0; [L19] int method_id; [L22] int this_expect = 0; [L23] int this_buffer_empty = 0; VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=0, this_buffer_empty=0, this_expect=0] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, P1=4, P2=0, P3=0, P4=0, P5=0, P6=0, P7=-4, P8=-3, P9=5, q=0, this_buffer_empty=0, this_expect=0] [L45] COND TRUE q == 0 [L46] COND TRUE __VERIFIER_nondet_int() [L50] method_id = 1 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=1, P1=4, P2=0, P3=0, P4=0, P5=0, P6=0, P7=-4, P8=-3, P9=5, q=0, this_buffer_empty=0, this_expect=0] [L52] COND FALSE !(0) [L56] q = 1 [L58] this_expect=0 [L58] this_buffer_empty=1 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=1, P1=4, P2=0, P3=0, P4=0, P5=0, P6=0, P7=-4, P8=-3, P9=5, q=1, this_buffer_empty=1, this_expect=0] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=1, P1=58, P2=0, P3=0, P4=0, P5=0, P6=0, P7=6, P8=-5, P9=-6, q=1, this_buffer_empty=1, this_expect=0] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=1, P1=58, P2=0, P3=0, P4=0, P5=0, P6=0, P7=6, P8=-5, P9=-6, q=1, this_buffer_empty=1, this_expect=0] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=58, P2=0, P3=0, P4=0, P5=0, P6=0, P7=6, P8=-5, P9=-6, q=1, this_buffer_empty=1, this_expect=0] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=58, P2=0, P3=0, P4=0, P5=0, P6=0, P7=6, P8=-5, P9=-6, q=3, this_buffer_empty=0, this_expect=1] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=0, P3=-1, P4=0, P5=0, P6=0, P7=-7, P8=7, P9=8, q=3, this_buffer_empty=0, this_expect=1] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=0, P3=-1, P4=0, P5=0, P6=0, P7=-7, P8=7, P9=8, q=3, this_buffer_empty=0, this_expect=1] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=0, P3=-1, P4=0, P5=0, P6=0, P7=-7, P8=7, P9=8, q=3, this_buffer_empty=0, this_expect=1] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=0, P3=-1, P4=0, P5=0, P6=0, P7=-7, P8=7, P9=8, q=3, this_buffer_empty=0, this_expect=1] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=0, P3=-1, P4=0, P5=0, P6=0, P7=-7, P8=7, P9=8, q=3, this_buffer_empty=0, this_expect=1] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=0, P3=-1, P4=0, P5=0, P6=0, P7=-7, P8=7, P9=8, q=4, this_buffer_empty=1, this_expect=1] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=55, P2=0, P3=0, P4=0, P5=0, P6=-2, P7=9, P8=-8, P9=-9, q=4, this_buffer_empty=1, this_expect=1] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=55, P2=0, P3=0, P4=0, P5=0, P6=-2, P7=9, P8=-8, P9=-9, q=4, this_buffer_empty=1, this_expect=1] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=55, P2=0, P3=0, P4=0, P5=0, P6=-2, P7=9, P8=-8, P9=-9, q=4, this_buffer_empty=1, this_expect=1] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=55, P2=0, P3=0, P4=0, P5=0, P6=-2, P7=9, P8=-8, P9=-9, q=4, this_buffer_empty=1, this_expect=1] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=55, P2=0, P3=0, P4=0, P5=0, P6=-2, P7=9, P8=-8, P9=-9, q=4, this_buffer_empty=1, this_expect=1] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=55, P2=0, P3=0, P4=0, P5=0, P6=-2, P7=9, P8=-8, P9=-9, q=4, this_buffer_empty=1, this_expect=1] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=55, P2=0, P3=0, P4=0, P5=0, P6=-2, P7=9, P8=-8, P9=-9, q=5, this_buffer_empty=0, this_expect=2] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=-10, P8=10, P9=0, q=5, this_buffer_empty=0, this_expect=2] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=-10, P8=10, P9=0, q=5, this_buffer_empty=0, this_expect=2] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=-10, P8=10, P9=0, q=5, this_buffer_empty=0, this_expect=2] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=-10, P8=10, P9=0, q=5, this_buffer_empty=0, this_expect=2] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=-10, P8=10, P9=0, q=5, this_buffer_empty=0, this_expect=2] [L365] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=-10, P8=10, P9=0, q=5, this_buffer_empty=0, this_expect=2] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=-10, P8=10, P9=0, q=5, this_buffer_empty=0, this_expect=2] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=-10, P8=10, P9=0, q=1, this_buffer_empty=1, this_expect=2] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=60, P2=0, P3=0, P4=0, P5=0, P6=0, P7=-11, P8=11, P9=-12, q=1, this_buffer_empty=1, this_expect=2] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=60, P2=0, P3=0, P4=0, P5=0, P6=0, P7=-11, P8=11, P9=-12, q=1, this_buffer_empty=1, this_expect=2] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=60, P2=0, P3=0, P4=0, P5=0, P6=0, P7=-11, P8=11, P9=-12, q=1, this_buffer_empty=1, this_expect=2] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=60, P2=0, P3=0, P4=0, P5=0, P6=0, P7=-11, P8=11, P9=-12, q=3, this_buffer_empty=0, this_expect=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=0, P3=1, P4=0, P5=0, P6=0, P7=-13, P8=13, P9=14, q=3, this_buffer_empty=0, this_expect=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=0, P3=1, P4=0, P5=0, P6=0, P7=-13, P8=13, P9=14, q=3, this_buffer_empty=0, this_expect=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=0, P3=1, P4=0, P5=0, P6=0, P7=-13, P8=13, P9=14, q=3, this_buffer_empty=0, this_expect=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=0, P3=1, P4=0, P5=0, P6=0, P7=-13, P8=13, P9=14, q=3, this_buffer_empty=0, this_expect=3] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=0, P3=1, P4=0, P5=0, P6=0, P7=-13, P8=13, P9=14, q=3, this_buffer_empty=0, this_expect=3] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=0, P3=1, P4=0, P5=0, P6=0, P7=-13, P8=13, P9=14, q=4, this_buffer_empty=1, this_expect=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=57, P2=0, P3=0, P4=0, P5=0, P6=-2, P7=15, P8=-14, P9=-15, q=4, this_buffer_empty=1, this_expect=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=57, P2=0, P3=0, P4=0, P5=0, P6=-2, P7=15, P8=-14, P9=-15, q=4, this_buffer_empty=1, this_expect=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=57, P2=0, P3=0, P4=0, P5=0, P6=-2, P7=15, P8=-14, P9=-15, q=4, this_buffer_empty=1, this_expect=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=57, P2=0, P3=0, P4=0, P5=0, P6=-2, P7=15, P8=-14, P9=-15, q=4, this_buffer_empty=1, this_expect=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=57, P2=0, P3=0, P4=0, P5=0, P6=-2, P7=15, P8=-14, P9=-15, q=4, this_buffer_empty=1, this_expect=3] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=57, P2=0, P3=0, P4=0, P5=0, P6=-2, P7=15, P8=-14, P9=-15, q=4, this_buffer_empty=1, this_expect=3] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=57, P2=0, P3=0, P4=0, P5=0, P6=-2, P7=15, P8=-14, P9=-15, q=5, this_buffer_empty=0, this_expect=4] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=17, P8=-16, P9=0, q=5, this_buffer_empty=0, this_expect=4] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=17, P8=-16, P9=0, q=5, this_buffer_empty=0, this_expect=4] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=17, P8=-16, P9=0, q=5, this_buffer_empty=0, this_expect=4] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=17, P8=-16, P9=0, q=5, this_buffer_empty=0, this_expect=4] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=17, P8=-16, P9=0, q=5, this_buffer_empty=0, this_expect=4] [L365] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=17, P8=-16, P9=0, q=5, this_buffer_empty=0, this_expect=4] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=17, P8=-16, P9=0, q=5, this_buffer_empty=0, this_expect=4] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=17, P8=-16, P9=0, q=1, this_buffer_empty=1, this_expect=4] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=62, P2=0, P3=0, P4=0, P5=0, P6=0, P7=18, P8=-17, P9=-18, q=1, this_buffer_empty=1, this_expect=4] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=62, P2=0, P3=0, P4=0, P5=0, P6=0, P7=18, P8=-17, P9=-18, q=1, this_buffer_empty=1, this_expect=4] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=62, P2=0, P3=0, P4=0, P5=0, P6=0, P7=18, P8=-17, P9=-18, q=1, this_buffer_empty=1, this_expect=4] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=62, P2=0, P3=0, P4=0, P5=0, P6=0, P7=18, P8=-17, P9=-18, q=3, this_buffer_empty=0, this_expect=5] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=-19, P8=19, P9=20, q=3, this_buffer_empty=0, this_expect=5] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=-19, P8=19, P9=20, q=3, this_buffer_empty=0, this_expect=5] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=-19, P8=19, P9=20, q=3, this_buffer_empty=0, this_expect=5] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=-19, P8=19, P9=20, q=3, this_buffer_empty=0, this_expect=5] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=-19, P8=19, P9=20, q=3, this_buffer_empty=0, this_expect=5] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=-19, P8=19, P9=20, q=4, this_buffer_empty=1, this_expect=5] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=59, P2=0, P3=0, P4=0, P5=0, P6=1, P7=21, P8=-20, P9=-21, q=4, this_buffer_empty=1, this_expect=5] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=59, P2=0, P3=0, P4=0, P5=0, P6=1, P7=21, P8=-20, P9=-21, q=4, this_buffer_empty=1, this_expect=5] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=59, P2=0, P3=0, P4=0, P5=0, P6=1, P7=21, P8=-20, P9=-21, q=4, this_buffer_empty=1, this_expect=5] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=59, P2=0, P3=0, P4=0, P5=0, P6=1, P7=21, P8=-20, P9=-21, q=4, this_buffer_empty=1, this_expect=5] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=59, P2=0, P3=0, P4=0, P5=0, P6=1, P7=21, P8=-20, P9=-21, q=4, this_buffer_empty=1, this_expect=5] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=59, P2=0, P3=0, P4=0, P5=0, P6=1, P7=21, P8=-20, P9=-21, q=4, this_buffer_empty=1, this_expect=5] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=59, P2=0, P3=0, P4=0, P5=0, P6=1, P7=21, P8=-20, P9=-21, q=5, this_buffer_empty=0, this_expect=6] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=-22, P8=22, P9=56, q=5, this_buffer_empty=0, this_expect=6] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=-22, P8=22, P9=56, q=5, this_buffer_empty=0, this_expect=6] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=-22, P8=22, P9=56, q=5, this_buffer_empty=0, this_expect=6] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=-22, P8=22, P9=56, q=5, this_buffer_empty=0, this_expect=6] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=-22, P8=22, P9=56, q=5, this_buffer_empty=0, this_expect=6] [L365] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=-22, P8=22, P9=56, q=5, this_buffer_empty=0, this_expect=6] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=-22, P8=22, P9=56, q=5, this_buffer_empty=0, this_expect=6] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=-22, P8=22, P9=56, q=1, this_buffer_empty=1, this_expect=6] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=-54, P2=0, P3=0, P4=0, P5=0, P6=0, P7=-23, P8=23, P9=24, q=1, this_buffer_empty=1, this_expect=6] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=-54, P2=0, P3=0, P4=0, P5=0, P6=0, P7=-23, P8=23, P9=24, q=1, this_buffer_empty=1, this_expect=6] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=-54, P2=0, P3=0, P4=0, P5=0, P6=0, P7=-23, P8=23, P9=24, q=1, this_buffer_empty=1, this_expect=6] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=-54, P2=0, P3=0, P4=0, P5=0, P6=0, P7=-23, P8=23, P9=24, q=3, this_buffer_empty=0, this_expect=7] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=25, P8=-24, P9=-25, q=3, this_buffer_empty=0, this_expect=7] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=25, P8=-24, P9=-25, q=3, this_buffer_empty=0, this_expect=7] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=25, P8=-24, P9=-25, q=3, this_buffer_empty=0, this_expect=7] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=25, P8=-24, P9=-25, q=3, this_buffer_empty=0, this_expect=7] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=25, P8=-24, P9=-25, q=3, this_buffer_empty=0, this_expect=7] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=25, P8=-24, P9=-25, q=4, this_buffer_empty=1, this_expect=7] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=61, P2=0, P3=0, P4=0, P5=0, P6=-1, P7=-26, P8=26, P9=27, q=4, this_buffer_empty=1, this_expect=7] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=61, P2=0, P3=0, P4=0, P5=0, P6=-1, P7=-26, P8=26, P9=27, q=4, this_buffer_empty=1, this_expect=7] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=61, P2=0, P3=0, P4=0, P5=0, P6=-1, P7=-26, P8=26, P9=27, q=4, this_buffer_empty=1, this_expect=7] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=61, P2=0, P3=0, P4=0, P5=0, P6=-1, P7=-26, P8=26, P9=27, q=4, this_buffer_empty=1, this_expect=7] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=61, P2=0, P3=0, P4=0, P5=0, P6=-1, P7=-26, P8=26, P9=27, q=4, this_buffer_empty=1, this_expect=7] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=61, P2=0, P3=0, P4=0, P5=0, P6=-1, P7=-26, P8=26, P9=27, q=4, this_buffer_empty=1, this_expect=7] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=61, P2=0, P3=0, P4=0, P5=0, P6=-1, P7=-26, P8=26, P9=27, q=5, this_buffer_empty=0, this_expect=8] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=28, P8=-27, P9=1, q=5, this_buffer_empty=0, this_expect=8] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=28, P8=-27, P9=1, q=5, this_buffer_empty=0, this_expect=8] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=28, P8=-27, P9=1, q=5, this_buffer_empty=0, this_expect=8] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=28, P8=-27, P9=1, q=5, this_buffer_empty=0, this_expect=8] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=28, P8=-27, P9=1, q=5, this_buffer_empty=0, this_expect=8] [L365] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=28, P8=-27, P9=1, q=5, this_buffer_empty=0, this_expect=8] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=28, P8=-27, P9=1, q=5, this_buffer_empty=0, this_expect=8] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=28, P8=-27, P9=1, q=1, this_buffer_empty=1, this_expect=8] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=-56, P2=0, P3=0, P4=0, P5=0, P6=0, P7=29, P8=-28, P9=-29, q=1, this_buffer_empty=1, this_expect=8] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=-56, P2=0, P3=0, P4=0, P5=0, P6=0, P7=29, P8=-28, P9=-29, q=1, this_buffer_empty=1, this_expect=8] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=-56, P2=0, P3=0, P4=0, P5=0, P6=0, P7=29, P8=-28, P9=-29, q=1, this_buffer_empty=1, this_expect=8] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=-56, P2=0, P3=0, P4=0, P5=0, P6=0, P7=29, P8=-28, P9=-29, q=3, this_buffer_empty=0, this_expect=9] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=0, P3=-1, P4=0, P5=0, P6=0, P7=-30, P8=30, P9=31, q=3, this_buffer_empty=0, this_expect=9] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=0, P3=-1, P4=0, P5=0, P6=0, P7=-30, P8=30, P9=31, q=3, this_buffer_empty=0, this_expect=9] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=0, P3=-1, P4=0, P5=0, P6=0, P7=-30, P8=30, P9=31, q=3, this_buffer_empty=0, this_expect=9] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=0, P3=-1, P4=0, P5=0, P6=0, P7=-30, P8=30, P9=31, q=3, this_buffer_empty=0, this_expect=9] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=0, P3=-1, P4=0, P5=0, P6=0, P7=-30, P8=30, P9=31, q=3, this_buffer_empty=0, this_expect=9] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=0, P3=-1, P4=0, P5=0, P6=0, P7=-30, P8=30, P9=31, q=4, this_buffer_empty=1, this_expect=9] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=63, P2=0, P3=0, P4=0, P5=0, P6=-2, P7=32, P8=-31, P9=-32, q=4, this_buffer_empty=1, this_expect=9] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=63, P2=0, P3=0, P4=0, P5=0, P6=-2, P7=32, P8=-31, P9=-32, q=4, this_buffer_empty=1, this_expect=9] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=63, P2=0, P3=0, P4=0, P5=0, P6=-2, P7=32, P8=-31, P9=-32, q=4, this_buffer_empty=1, this_expect=9] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=63, P2=0, P3=0, P4=0, P5=0, P6=-2, P7=32, P8=-31, P9=-32, q=4, this_buffer_empty=1, this_expect=9] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=63, P2=0, P3=0, P4=0, P5=0, P6=-2, P7=32, P8=-31, P9=-32, q=4, this_buffer_empty=1, this_expect=9] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=63, P2=0, P3=0, P4=0, P5=0, P6=-2, P7=32, P8=-31, P9=-32, q=4, this_buffer_empty=1, this_expect=9] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=63, P2=0, P3=0, P4=0, P5=0, P6=-2, P7=32, P8=-31, P9=-32, q=5, this_buffer_empty=0, this_expect=10] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=-33, P8=33, P9=1, q=5, this_buffer_empty=0, this_expect=10] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=-33, P8=33, P9=1, q=5, this_buffer_empty=0, this_expect=10] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=-33, P8=33, P9=1, q=5, this_buffer_empty=0, this_expect=10] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=-33, P8=33, P9=1, q=5, this_buffer_empty=0, this_expect=10] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=-33, P8=33, P9=1, q=5, this_buffer_empty=0, this_expect=10] [L365] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=-33, P8=33, P9=1, q=5, this_buffer_empty=0, this_expect=10] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=-33, P8=33, P9=1, q=5, this_buffer_empty=0, this_expect=10] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=-33, P8=33, P9=1, q=1, this_buffer_empty=1, this_expect=10] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=64, P2=0, P3=0, P4=0, P5=0, P6=0, P7=-34, P8=34, P9=35, q=1, this_buffer_empty=1, this_expect=10] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=64, P2=0, P3=0, P4=0, P5=0, P6=0, P7=-34, P8=34, P9=35, q=1, this_buffer_empty=1, this_expect=10] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=64, P2=0, P3=0, P4=0, P5=0, P6=0, P7=-34, P8=34, P9=35, q=1, this_buffer_empty=1, this_expect=10] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=64, P2=0, P3=0, P4=0, P5=0, P6=0, P7=-34, P8=34, P9=35, q=3, this_buffer_empty=0, this_expect=11] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=0, P3=-1, P4=0, P5=0, P6=0, P7=36, P8=-35, P9=-36, q=3, this_buffer_empty=0, this_expect=11] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=0, P3=-1, P4=0, P5=0, P6=0, P7=36, P8=-35, P9=-36, q=3, this_buffer_empty=0, this_expect=11] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=0, P3=-1, P4=0, P5=0, P6=0, P7=36, P8=-35, P9=-36, q=3, this_buffer_empty=0, this_expect=11] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=0, P3=-1, P4=0, P5=0, P6=0, P7=36, P8=-35, P9=-36, q=3, this_buffer_empty=0, this_expect=11] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=0, P3=-1, P4=0, P5=0, P6=0, P7=36, P8=-35, P9=-36, q=3, this_buffer_empty=0, this_expect=11] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=0, P3=-1, P4=0, P5=0, P6=0, P7=36, P8=-35, P9=-36, q=4, this_buffer_empty=1, this_expect=11] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=65, P2=0, P3=0, P4=0, P5=0, P6=1, P7=-37, P8=37, P9=38, q=4, this_buffer_empty=1, this_expect=11] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=65, P2=0, P3=0, P4=0, P5=0, P6=1, P7=-37, P8=37, P9=38, q=4, this_buffer_empty=1, this_expect=11] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=65, P2=0, P3=0, P4=0, P5=0, P6=1, P7=-37, P8=37, P9=38, q=4, this_buffer_empty=1, this_expect=11] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=65, P2=0, P3=0, P4=0, P5=0, P6=1, P7=-37, P8=37, P9=38, q=4, this_buffer_empty=1, this_expect=11] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=65, P2=0, P3=0, P4=0, P5=0, P6=1, P7=-37, P8=37, P9=38, q=4, this_buffer_empty=1, this_expect=11] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=65, P2=0, P3=0, P4=0, P5=0, P6=1, P7=-37, P8=37, P9=38, q=4, this_buffer_empty=1, this_expect=11] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=65, P2=0, P3=0, P4=0, P5=0, P6=1, P7=-37, P8=37, P9=38, q=5, this_buffer_empty=0, this_expect=12] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=39, P8=-38, P9=1, q=5, this_buffer_empty=0, this_expect=12] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=39, P8=-38, P9=1, q=5, this_buffer_empty=0, this_expect=12] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=39, P8=-38, P9=1, q=5, this_buffer_empty=0, this_expect=12] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=39, P8=-38, P9=1, q=5, this_buffer_empty=0, this_expect=12] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=39, P8=-38, P9=1, q=5, this_buffer_empty=0, this_expect=12] [L365] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=39, P8=-38, P9=1, q=5, this_buffer_empty=0, this_expect=12] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=39, P8=-38, P9=1, q=5, this_buffer_empty=0, this_expect=12] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=39, P8=-38, P9=1, q=1, this_buffer_empty=1, this_expect=12] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=42, P2=0, P3=0, P4=0, P5=0, P6=0, P7=40, P8=-39, P9=-40, q=1, this_buffer_empty=1, this_expect=12] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=42, P2=0, P3=0, P4=0, P5=0, P6=0, P7=40, P8=-39, P9=-40, q=1, this_buffer_empty=1, this_expect=12] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=42, P2=0, P3=0, P4=0, P5=0, P6=0, P7=40, P8=-39, P9=-40, q=1, this_buffer_empty=1, this_expect=12] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=42, P2=0, P3=0, P4=0, P5=0, P6=0, P7=40, P8=-39, P9=-40, q=3, this_buffer_empty=0, this_expect=13] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=0, P3=-1, P4=0, P5=0, P6=0, P7=-41, P8=41, P9=-42, q=3, this_buffer_empty=0, this_expect=13] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=0, P3=-1, P4=0, P5=0, P6=0, P7=-41, P8=41, P9=-42, q=3, this_buffer_empty=0, this_expect=13] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=0, P3=-1, P4=0, P5=0, P6=0, P7=-41, P8=41, P9=-42, q=3, this_buffer_empty=0, this_expect=13] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=0, P3=-1, P4=0, P5=0, P6=0, P7=-41, P8=41, P9=-42, q=3, this_buffer_empty=0, this_expect=13] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=0, P3=-1, P4=0, P5=0, P6=0, P7=-41, P8=41, P9=-42, q=3, this_buffer_empty=0, this_expect=13] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=0, P3=-1, P4=0, P5=0, P6=0, P7=-41, P8=41, P9=-42, q=4, this_buffer_empty=1, this_expect=13] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=67, P2=0, P3=0, P4=0, P5=0, P6=1, P7=-43, P8=43, P9=44, q=4, this_buffer_empty=1, this_expect=13] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=67, P2=0, P3=0, P4=0, P5=0, P6=1, P7=-43, P8=43, P9=44, q=4, this_buffer_empty=1, this_expect=13] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=67, P2=0, P3=0, P4=0, P5=0, P6=1, P7=-43, P8=43, P9=44, q=4, this_buffer_empty=1, this_expect=13] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=67, P2=0, P3=0, P4=0, P5=0, P6=1, P7=-43, P8=43, P9=44, q=4, this_buffer_empty=1, this_expect=13] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=67, P2=0, P3=0, P4=0, P5=0, P6=1, P7=-43, P8=43, P9=44, q=4, this_buffer_empty=1, this_expect=13] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=67, P2=0, P3=0, P4=0, P5=0, P6=1, P7=-43, P8=43, P9=44, q=4, this_buffer_empty=1, this_expect=13] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=67, P2=0, P3=0, P4=0, P5=0, P6=1, P7=-43, P8=43, P9=44, q=5, this_buffer_empty=0, this_expect=14] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=45, P8=-44, P9=1, q=5, this_buffer_empty=0, this_expect=14] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=45, P8=-44, P9=1, q=5, this_buffer_empty=0, this_expect=14] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=45, P8=-44, P9=1, q=5, this_buffer_empty=0, this_expect=14] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=45, P8=-44, P9=1, q=5, this_buffer_empty=0, this_expect=14] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=45, P8=-44, P9=1, q=5, this_buffer_empty=0, this_expect=14] [L365] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=45, P8=-44, P9=1, q=5, this_buffer_empty=0, this_expect=14] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=45, P8=-44, P9=1, q=5, this_buffer_empty=0, this_expect=14] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=45, P8=-44, P9=1, q=1, this_buffer_empty=1, this_expect=14] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=66, P2=0, P3=0, P4=0, P5=0, P6=0, P7=46, P8=-45, P9=-46, q=1, this_buffer_empty=1, this_expect=14] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=66, P2=0, P3=0, P4=0, P5=0, P6=0, P7=46, P8=-45, P9=-46, q=1, this_buffer_empty=1, this_expect=14] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=66, P2=0, P3=0, P4=0, P5=0, P6=0, P7=46, P8=-45, P9=-46, q=1, this_buffer_empty=1, this_expect=14] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=66, P2=0, P3=0, P4=0, P5=0, P6=0, P7=46, P8=-45, P9=-46, q=3, this_buffer_empty=0, this_expect=15] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=0, P3=-1, P4=0, P5=0, P6=0, P7=-47, P8=47, P9=-48, q=3, this_buffer_empty=0, this_expect=15] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=0, P3=-1, P4=0, P5=0, P6=0, P7=-47, P8=47, P9=-48, q=3, this_buffer_empty=0, this_expect=15] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=0, P3=-1, P4=0, P5=0, P6=0, P7=-47, P8=47, P9=-48, q=3, this_buffer_empty=0, this_expect=15] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=0, P3=-1, P4=0, P5=0, P6=0, P7=-47, P8=47, P9=-48, q=3, this_buffer_empty=0, this_expect=15] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=0, P3=-1, P4=0, P5=0, P6=0, P7=-47, P8=47, P9=-48, q=3, this_buffer_empty=0, this_expect=15] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=0, P3=-1, P4=0, P5=0, P6=0, P7=-47, P8=47, P9=-48, q=4, this_buffer_empty=1, this_expect=15] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=69, P2=0, P3=0, P4=0, P5=0, P6=1, P7=-49, P8=49, P9=50, q=4, this_buffer_empty=1, this_expect=15] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=69, P2=0, P3=0, P4=0, P5=0, P6=1, P7=-49, P8=49, P9=50, q=4, this_buffer_empty=1, this_expect=15] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=69, P2=0, P3=0, P4=0, P5=0, P6=1, P7=-49, P8=49, P9=50, q=4, this_buffer_empty=1, this_expect=15] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=69, P2=0, P3=0, P4=0, P5=0, P6=1, P7=-49, P8=49, P9=50, q=4, this_buffer_empty=1, this_expect=15] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=69, P2=0, P3=0, P4=0, P5=0, P6=1, P7=-49, P8=49, P9=50, q=4, this_buffer_empty=1, this_expect=15] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=69, P2=0, P3=0, P4=0, P5=0, P6=1, P7=-49, P8=49, P9=50, q=4, this_buffer_empty=1, this_expect=15] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=69, P2=0, P3=0, P4=0, P5=0, P6=1, P7=-49, P8=49, P9=50, q=5, this_buffer_empty=0, this_expect=16] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=51, P8=-50, P9=1, q=5, this_buffer_empty=0, this_expect=16] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=51, P8=-50, P9=1, q=5, this_buffer_empty=0, this_expect=16] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=51, P8=-50, P9=1, q=5, this_buffer_empty=0, this_expect=16] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=51, P8=-50, P9=1, q=5, this_buffer_empty=0, this_expect=16] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=51, P8=-50, P9=1, q=5, this_buffer_empty=0, this_expect=16] [L365] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=51, P8=-50, P9=1, q=5, this_buffer_empty=0, this_expect=16] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=51, P8=-50, P9=1, q=5, this_buffer_empty=0, this_expect=16] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=51, P8=-50, P9=1, q=1, this_buffer_empty=1, this_expect=16] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=-2, P2=0, P3=0, P4=0, P5=0, P6=0, P7=52, P8=-51, P9=-52, q=1, this_buffer_empty=1, this_expect=16] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=-2, P2=0, P3=0, P4=0, P5=0, P6=0, P7=52, P8=-51, P9=-52, q=1, this_buffer_empty=1, this_expect=16] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=-2, P2=0, P3=0, P4=0, P5=0, P6=0, P7=52, P8=-51, P9=-52, q=1, this_buffer_empty=1, this_expect=16] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=-2, P2=0, P3=0, P4=0, P5=0, P6=0, P7=52, P8=-51, P9=-52, q=3, this_buffer_empty=0, this_expect=17] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND TRUE this_expect > 16 [L41] this_expect = -16 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=-53, P8=53, P9=54, q=3, this_buffer_empty=0, this_expect=-16] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=-53, P8=53, P9=54, q=3, this_buffer_empty=0, this_expect=-16] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=-53, P8=53, P9=54, q=3, this_buffer_empty=0, this_expect=-16] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=-53, P8=53, P9=54, q=3, this_buffer_empty=0, this_expect=-16] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=-53, P8=53, P9=54, q=3, this_buffer_empty=0, this_expect=-16] [L288] COND TRUE (((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2)))) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=-53, P8=53, P9=54, q=3, this_buffer_empty=0, this_expect=-16] [L571] reach_error() VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=-53, P8=53, P9=54, q=3, this_buffer_empty=0, this_expect=-16] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 110 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.6s, OverallIterations: 22, TraceHistogramMax: 35, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7596 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7596 mSDsluCounter, 19131 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15156 mSDsCounter, 525 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2923 IncrementalHoareTripleChecker+Invalid, 3448 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 525 mSolverCounterUnsat, 3975 mSDtfsCounter, 2923 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2296 GetRequests, 2118 SyntacticMatches, 18 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1486occurred in iteration=21, InterpolantAutomatonStates: 167, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 21 MinimizatonAttempts, 268 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 8.3s InterpolantComputationTime, 2821 NumberOfCodeBlocks, 2821 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 3434 ConstructedInterpolants, 0 QuantifiedInterpolants, 19915 SizeOfPredicates, 31 NumberOfNonLiveVariables, 6967 ConjunctsInSsa, 209 ConjunctsInUnsatCore, 46 InterpolantComputations, 9 PerfectInterpolantSequences, 2091/11697 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-14 12:58:32,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE