./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 6c24879c 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-?-6c24879 [2022-07-12 01:53:22,973 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 01:53:22,975 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 01:53:23,028 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 01:53:23,029 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 01:53:23,031 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 01:53:23,033 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 01:53:23,035 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 01:53:23,037 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 01:53:23,041 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 01:53:23,042 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 01:53:23,044 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 01:53:23,045 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 01:53:23,046 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 01:53:23,047 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 01:53:23,050 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 01:53:23,051 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 01:53:23,053 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 01:53:23,054 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 01:53:23,061 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 01:53:23,063 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 01:53:23,064 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 01:53:23,065 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 01:53:23,065 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 01:53:23,067 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 01:53:23,070 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 01:53:23,070 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 01:53:23,070 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 01:53:23,071 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 01:53:23,072 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 01:53:23,073 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 01:53:23,073 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 01:53:23,074 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 01:53:23,075 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 01:53:23,075 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 01:53:23,076 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 01:53:23,077 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 01:53:23,077 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 01:53:23,077 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 01:53:23,078 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 01:53:23,078 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 01:53:23,080 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 01:53:23,081 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 01:53:23,110 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 01:53:23,110 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 01:53:23,110 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 01:53:23,111 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 01:53:23,111 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 01:53:23,112 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 01:53:23,112 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 01:53:23,112 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 01:53:23,113 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 01:53:23,113 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 01:53:23,114 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 01:53:23,114 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 01:53:23,114 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 01:53:23,114 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 01:53:23,114 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 01:53:23,115 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 01:53:23,115 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 01:53:23,115 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 01:53:23,115 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 01:53:23,115 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 01:53:23,116 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 01:53:23,117 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 01:53:23,117 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 01:53:23,117 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 01:53:23,117 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 01:53:23,118 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 01:53:23,118 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 01:53:23,118 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 01:53:23,118 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 01:53:23,118 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 01:53:23,119 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 01:53:23,119 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 01:53:23,119 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 01:53:23,119 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 [2022-07-12 01:53:23,337 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 01:53:23,362 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 01:53:23,365 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 01:53:23,366 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 01:53:23,366 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 01:53:23,368 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 [2022-07-12 01:53:23,422 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3baafd20/e74e94139d82420fad9dbaee26b62080/FLAG1d5ad46f2 [2022-07-12 01:53:23,889 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 01:53:23,890 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/psyco/psyco_abp_1-1.c [2022-07-12 01:53:23,904 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3baafd20/e74e94139d82420fad9dbaee26b62080/FLAG1d5ad46f2 [2022-07-12 01:53:24,249 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3baafd20/e74e94139d82420fad9dbaee26b62080 [2022-07-12 01:53:24,252 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 01:53:24,254 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 01:53:24,258 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 01:53:24,258 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 01:53:24,262 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 01:53:24,263 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 01:53:24" (1/1) ... [2022-07-12 01:53:24,264 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a6bf858 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:53:24, skipping insertion in model container [2022-07-12 01:53:24,264 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 01:53:24" (1/1) ... [2022-07-12 01:53:24,269 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 01:53:24,311 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 01:53:24,535 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] [2022-07-12 01:53:24,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 01:53:24,547 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 01:53:24,635 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] [2022-07-12 01:53:24,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 01:53:24,658 INFO L208 MainTranslator]: Completed translation [2022-07-12 01:53:24,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:53:24 WrapperNode [2022-07-12 01:53:24,659 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 01:53:24,660 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 01:53:24,660 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 01:53:24,660 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 01:53:24,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:53:24" (1/1) ... [2022-07-12 01:53:24,689 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:53:24" (1/1) ... [2022-07-12 01:53:24,725 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 417 [2022-07-12 01:53:24,728 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 01:53:24,730 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 01:53:24,730 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 01:53:24,730 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 01:53:24,737 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:53:24" (1/1) ... [2022-07-12 01:53:24,737 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:53:24" (1/1) ... [2022-07-12 01:53:24,746 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:53:24" (1/1) ... [2022-07-12 01:53:24,746 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:53:24" (1/1) ... [2022-07-12 01:53:24,763 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:53:24" (1/1) ... [2022-07-12 01:53:24,780 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:53:24" (1/1) ... [2022-07-12 01:53:24,787 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:53:24" (1/1) ... [2022-07-12 01:53:24,792 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 01:53:24,795 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 01:53:24,796 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 01:53:24,796 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 01:53:24,797 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:53:24" (1/1) ... [2022-07-12 01:53:24,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 01:53:24,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 01:53:24,824 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) [2022-07-12 01:53:24,850 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 [2022-07-12 01:53:24,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 01:53:24,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 01:53:24,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 01:53:24,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 01:53:24,956 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 01:53:24,958 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 01:53:25,569 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 01:53:25,577 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 01:53:25,577 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-12 01:53:25,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 01:53:25 BoogieIcfgContainer [2022-07-12 01:53:25,579 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 01:53:25,582 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 01:53:25,582 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 01:53:25,586 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 01:53:25,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 01:53:24" (1/3) ... [2022-07-12 01:53:25,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fd95bc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 01:53:25, skipping insertion in model container [2022-07-12 01:53:25,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:53:24" (2/3) ... [2022-07-12 01:53:25,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fd95bc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 01:53:25, skipping insertion in model container [2022-07-12 01:53:25,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 01:53:25" (3/3) ... [2022-07-12 01:53:25,588 INFO L111 eAbstractionObserver]: Analyzing ICFG psyco_abp_1-1.c [2022-07-12 01:53:25,598 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 01:53:25,598 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 01:53:25,646 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 01:53:25,654 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@73823011, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@69886c64 [2022-07-12 01:53:25,654 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 01:53:25,665 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) [2022-07-12 01:53:25,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 01:53:25,670 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:53:25,671 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 01:53:25,671 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:53:25,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:53:25,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1895078531, now seen corresponding path program 1 times [2022-07-12 01:53:25,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:53:25,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600185176] [2022-07-12 01:53:25,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:53:25,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:53:25,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:53:25,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 01:53:25,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:53:25,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600185176] [2022-07-12 01:53:25,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600185176] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:53:25,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:53:25,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 01:53:25,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548844253] [2022-07-12 01:53:25,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:53:25,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 01:53:25,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:53:25,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 01:53:25,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 01:53:25,894 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) [2022-07-12 01:53:25,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:53:25,941 INFO L93 Difference]: Finished difference Result 218 states and 420 transitions. [2022-07-12 01:53:25,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 01:53:25,944 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 [2022-07-12 01:53:25,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:53:25,953 INFO L225 Difference]: With dead ends: 218 [2022-07-12 01:53:25,953 INFO L226 Difference]: Without dead ends: 106 [2022-07-12 01:53:25,956 INFO L412 NwaCegarLoop]: 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 [2022-07-12 01:53:25,960 INFO L413 NwaCegarLoop]: 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 [2022-07-12 01:53:25,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 01:53:25,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-07-12 01:53:25,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-07-12 01:53:25,998 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) [2022-07-12 01:53:26,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 177 transitions. [2022-07-12 01:53:26,006 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 177 transitions. Word has length 10 [2022-07-12 01:53:26,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:53:26,006 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 177 transitions. [2022-07-12 01:53:26,007 INFO L496 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) [2022-07-12 01:53:26,007 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 177 transitions. [2022-07-12 01:53:26,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 01:53:26,010 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:53:26,010 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 01:53:26,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 01:53:26,010 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:53:26,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:53:26,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1914595175, now seen corresponding path program 1 times [2022-07-12 01:53:26,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:53:26,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388241854] [2022-07-12 01:53:26,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:53:26,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:53:26,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:53:26,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 01:53:26,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:53:26,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388241854] [2022-07-12 01:53:26,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388241854] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:53:26,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:53:26,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 01:53:26,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470666598] [2022-07-12 01:53:26,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:53:26,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 01:53:26,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:53:26,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 01:53:26,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 01:53:26,115 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) [2022-07-12 01:53:26,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:53:26,187 INFO L93 Difference]: Finished difference Result 214 states and 358 transitions. [2022-07-12 01:53:26,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 01:53:26,188 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 [2022-07-12 01:53:26,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:53:26,189 INFO L225 Difference]: With dead ends: 214 [2022-07-12 01:53:26,189 INFO L226 Difference]: Without dead ends: 110 [2022-07-12 01:53:26,190 INFO L412 NwaCegarLoop]: 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 [2022-07-12 01:53:26,191 INFO L413 NwaCegarLoop]: 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 [2022-07-12 01:53:26,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 332 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 01:53:26,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-07-12 01:53:26,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-07-12 01:53:26,201 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) [2022-07-12 01:53:26,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 182 transitions. [2022-07-12 01:53:26,202 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 182 transitions. Word has length 11 [2022-07-12 01:53:26,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:53:26,203 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 182 transitions. [2022-07-12 01:53:26,204 INFO L496 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) [2022-07-12 01:53:26,204 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 182 transitions. [2022-07-12 01:53:26,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 01:53:26,206 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:53:26,206 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 01:53:26,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 01:53:26,207 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:53:26,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:53:26,208 INFO L85 PathProgramCache]: Analyzing trace with hash 100490260, now seen corresponding path program 1 times [2022-07-12 01:53:26,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:53:26,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574724281] [2022-07-12 01:53:26,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:53:26,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:53:26,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:53:26,424 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 01:53:26,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:53:26,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574724281] [2022-07-12 01:53:26,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574724281] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:53:26,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:53:26,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 01:53:26,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475412947] [2022-07-12 01:53:26,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:53:26,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 01:53:26,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:53:26,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 01:53:26,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 01:53:26,428 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) [2022-07-12 01:53:26,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:53:26,704 INFO L93 Difference]: Finished difference Result 326 states and 541 transitions. [2022-07-12 01:53:26,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 01:53:26,705 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 [2022-07-12 01:53:26,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:53:26,707 INFO L225 Difference]: With dead ends: 326 [2022-07-12 01:53:26,707 INFO L226 Difference]: Without dead ends: 197 [2022-07-12 01:53:26,708 INFO L412 NwaCegarLoop]: 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 [2022-07-12 01:53:26,709 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 148 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2022-07-12 01:53:26,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 389 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 01:53:26,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-07-12 01:53:26,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 184. [2022-07-12 01:53:26,723 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) [2022-07-12 01:53:26,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 301 transitions. [2022-07-12 01:53:26,724 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 301 transitions. Word has length 17 [2022-07-12 01:53:26,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:53:26,727 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 301 transitions. [2022-07-12 01:53:26,727 INFO L496 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) [2022-07-12 01:53:26,727 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 301 transitions. [2022-07-12 01:53:26,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 01:53:26,728 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:53:26,728 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 01:53:26,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 01:53:26,743 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:53:26,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:53:26,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1571478032, now seen corresponding path program 1 times [2022-07-12 01:53:26,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:53:26,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381681678] [2022-07-12 01:53:26,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:53:26,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:53:26,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:53:26,780 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 01:53:26,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:53:26,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381681678] [2022-07-12 01:53:26,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381681678] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:53:26,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:53:26,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 01:53:26,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178471477] [2022-07-12 01:53:26,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:53:26,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 01:53:26,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:53:26,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 01:53:26,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 01:53:26,786 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) [2022-07-12 01:53:26,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:53:26,809 INFO L93 Difference]: Finished difference Result 314 states and 514 transitions. [2022-07-12 01:53:26,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 01:53:26,810 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 [2022-07-12 01:53:26,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:53:26,811 INFO L225 Difference]: With dead ends: 314 [2022-07-12 01:53:26,811 INFO L226 Difference]: Without dead ends: 133 [2022-07-12 01:53:26,812 INFO L412 NwaCegarLoop]: 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 [2022-07-12 01:53:26,813 INFO L413 NwaCegarLoop]: 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 [2022-07-12 01:53:26,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 307 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 01:53:26,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-07-12 01:53:26,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2022-07-12 01:53:26,822 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) [2022-07-12 01:53:26,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 211 transitions. [2022-07-12 01:53:26,823 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 211 transitions. Word has length 18 [2022-07-12 01:53:26,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:53:26,823 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 211 transitions. [2022-07-12 01:53:26,823 INFO L496 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) [2022-07-12 01:53:26,823 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 211 transitions. [2022-07-12 01:53:26,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-12 01:53:26,824 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:53:26,825 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 01:53:26,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 01:53:26,825 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:53:26,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:53:26,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1260642915, now seen corresponding path program 1 times [2022-07-12 01:53:26,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:53:26,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43557735] [2022-07-12 01:53:26,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:53:26,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:53:26,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:53:26,889 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 01:53:26,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:53:26,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43557735] [2022-07-12 01:53:26,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43557735] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:53:26,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:53:26,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 01:53:26,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137367507] [2022-07-12 01:53:26,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:53:26,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 01:53:26,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:53:26,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 01:53:26,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 01:53:26,892 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) [2022-07-12 01:53:26,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:53:26,919 INFO L93 Difference]: Finished difference Result 267 states and 431 transitions. [2022-07-12 01:53:26,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 01:53:26,919 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 [2022-07-12 01:53:26,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:53:26,924 INFO L225 Difference]: With dead ends: 267 [2022-07-12 01:53:26,924 INFO L226 Difference]: Without dead ends: 139 [2022-07-12 01:53:26,926 INFO L412 NwaCegarLoop]: 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 [2022-07-12 01:53:26,928 INFO L413 NwaCegarLoop]: 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 [2022-07-12 01:53:26,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 306 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 01:53:26,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-07-12 01:53:26,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2022-07-12 01:53:26,941 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) [2022-07-12 01:53:26,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 218 transitions. [2022-07-12 01:53:26,942 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 218 transitions. Word has length 24 [2022-07-12 01:53:26,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:53:26,942 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 218 transitions. [2022-07-12 01:53:26,942 INFO L496 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) [2022-07-12 01:53:26,943 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 218 transitions. [2022-07-12 01:53:26,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-12 01:53:26,943 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:53:26,943 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 01:53:26,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 01:53:26,944 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:53:26,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:53:26,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1813922334, now seen corresponding path program 1 times [2022-07-12 01:53:26,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:53:26,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199605713] [2022-07-12 01:53:26,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:53:26,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:53:26,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:53:26,989 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 01:53:26,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:53:26,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199605713] [2022-07-12 01:53:26,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199605713] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 01:53:26,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704260675] [2022-07-12 01:53:26,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:53:26,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 01:53:26,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 01:53:26,998 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) [2022-07-12 01:53:26,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 01:53:27,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:53:27,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 01:53:27,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 01:53:27,132 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 01:53:27,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 01:53:27,173 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 01:53:27,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704260675] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 01:53:27,173 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 01:53:27,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-07-12 01:53:27,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333103712] [2022-07-12 01:53:27,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 01:53:27,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 01:53:27,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:53:27,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 01:53:27,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 01:53:27,175 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) [2022-07-12 01:53:27,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:53:27,323 INFO L93 Difference]: Finished difference Result 258 states and 411 transitions. [2022-07-12 01:53:27,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 01:53:27,324 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 [2022-07-12 01:53:27,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:53:27,325 INFO L225 Difference]: With dead ends: 258 [2022-07-12 01:53:27,325 INFO L226 Difference]: Without dead ends: 243 [2022-07-12 01:53:27,331 INFO L412 NwaCegarLoop]: 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 [2022-07-12 01:53:27,336 INFO L413 NwaCegarLoop]: 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 [2022-07-12 01:53:27,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 708 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 01:53:27,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-07-12 01:53:27,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 220. [2022-07-12 01:53:27,353 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) [2022-07-12 01:53:27,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 361 transitions. [2022-07-12 01:53:27,354 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 361 transitions. Word has length 26 [2022-07-12 01:53:27,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:53:27,355 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 361 transitions. [2022-07-12 01:53:27,355 INFO L496 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) [2022-07-12 01:53:27,355 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 361 transitions. [2022-07-12 01:53:27,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 01:53:27,357 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:53:27,357 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 01:53:27,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 01:53:27,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-07-12 01:53:27,581 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:53:27,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:53:27,581 INFO L85 PathProgramCache]: Analyzing trace with hash 408461028, now seen corresponding path program 1 times [2022-07-12 01:53:27,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:53:27,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069715846] [2022-07-12 01:53:27,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:53:27,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:53:27,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:53:27,726 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 01:53:27,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:53:27,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069715846] [2022-07-12 01:53:27,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069715846] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 01:53:27,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826034015] [2022-07-12 01:53:27,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:53:27,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 01:53:27,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 01:53:27,732 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) [2022-07-12 01:53:27,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 01:53:27,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:53:27,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 01:53:27,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 01:53:27,928 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 01:53:27,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 01:53:28,025 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 01:53:28,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826034015] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 01:53:28,025 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 01:53:28,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-07-12 01:53:28,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327839493] [2022-07-12 01:53:28,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 01:53:28,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 01:53:28,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:53:28,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 01:53:28,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-12 01:53:28,027 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) [2022-07-12 01:53:28,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:53:28,180 INFO L93 Difference]: Finished difference Result 462 states and 753 transitions. [2022-07-12 01:53:28,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 01:53:28,180 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 [2022-07-12 01:53:28,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:53:28,182 INFO L225 Difference]: With dead ends: 462 [2022-07-12 01:53:28,182 INFO L226 Difference]: Without dead ends: 243 [2022-07-12 01:53:28,182 INFO L412 NwaCegarLoop]: 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 [2022-07-12 01:53:28,183 INFO L413 NwaCegarLoop]: 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 [2022-07-12 01:53:28,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 886 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 01:53:28,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-07-12 01:53:28,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 239. [2022-07-12 01:53:28,201 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) [2022-07-12 01:53:28,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 387 transitions. [2022-07-12 01:53:28,202 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 387 transitions. Word has length 27 [2022-07-12 01:53:28,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:53:28,203 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 387 transitions. [2022-07-12 01:53:28,203 INFO L496 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) [2022-07-12 01:53:28,203 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 387 transitions. [2022-07-12 01:53:28,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 01:53:28,206 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:53:28,206 INFO L195 NwaCegarLoop]: 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] [2022-07-12 01:53:28,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 01:53:28,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-07-12 01:53:28,420 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:53:28,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:53:28,420 INFO L85 PathProgramCache]: Analyzing trace with hash -895020851, now seen corresponding path program 1 times [2022-07-12 01:53:28,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:53:28,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471479675] [2022-07-12 01:53:28,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:53:28,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:53:28,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:53:28,454 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 01:53:28,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:53:28,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471479675] [2022-07-12 01:53:28,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471479675] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:53:28,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:53:28,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 01:53:28,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942381049] [2022-07-12 01:53:28,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:53:28,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 01:53:28,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:53:28,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 01:53:28,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 01:53:28,457 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) [2022-07-12 01:53:28,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:53:28,482 INFO L93 Difference]: Finished difference Result 447 states and 721 transitions. [2022-07-12 01:53:28,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 01:53:28,483 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 [2022-07-12 01:53:28,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:53:28,484 INFO L225 Difference]: With dead ends: 447 [2022-07-12 01:53:28,484 INFO L226 Difference]: Without dead ends: 211 [2022-07-12 01:53:28,485 INFO L412 NwaCegarLoop]: 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 [2022-07-12 01:53:28,485 INFO L413 NwaCegarLoop]: 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 [2022-07-12 01:53:28,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 214 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 01:53:28,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-07-12 01:53:28,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2022-07-12 01:53:28,491 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) [2022-07-12 01:53:28,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 328 transitions. [2022-07-12 01:53:28,492 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 328 transitions. Word has length 34 [2022-07-12 01:53:28,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:53:28,492 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 328 transitions. [2022-07-12 01:53:28,493 INFO L496 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) [2022-07-12 01:53:28,493 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 328 transitions. [2022-07-12 01:53:28,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-12 01:53:28,494 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:53:28,494 INFO L195 NwaCegarLoop]: 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] [2022-07-12 01:53:28,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 01:53:28,495 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:53:28,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:53:28,496 INFO L85 PathProgramCache]: Analyzing trace with hash -936850633, now seen corresponding path program 1 times [2022-07-12 01:53:28,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:53:28,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655123134] [2022-07-12 01:53:28,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:53:28,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:53:28,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:53:28,629 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 01:53:28,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:53:28,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655123134] [2022-07-12 01:53:28,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655123134] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 01:53:28,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228236076] [2022-07-12 01:53:28,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:53:28,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 01:53:28,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 01:53:28,632 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) [2022-07-12 01:53:28,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 01:53:28,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:53:28,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 01:53:28,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 01:53:28,797 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 01:53:28,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 01:53:28,943 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 01:53:28,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228236076] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 01:53:28,944 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 01:53:28,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2022-07-12 01:53:28,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555086166] [2022-07-12 01:53:28,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 01:53:28,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 01:53:28,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:53:28,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 01:53:28,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-12 01:53:28,947 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) [2022-07-12 01:53:29,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:53:29,431 INFO L93 Difference]: Finished difference Result 673 states and 1050 transitions. [2022-07-12 01:53:29,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 01:53:29,435 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 [2022-07-12 01:53:29,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:53:29,437 INFO L225 Difference]: With dead ends: 673 [2022-07-12 01:53:29,437 INFO L226 Difference]: Without dead ends: 438 [2022-07-12 01:53:29,438 INFO L412 NwaCegarLoop]: 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 [2022-07-12 01:53:29,438 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 523 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2022-07-12 01:53:29,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 851 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 01:53:29,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2022-07-12 01:53:29,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 400. [2022-07-12 01:53:29,451 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) [2022-07-12 01:53:29,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 618 transitions. [2022-07-12 01:53:29,452 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 618 transitions. Word has length 37 [2022-07-12 01:53:29,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:53:29,453 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 618 transitions. [2022-07-12 01:53:29,453 INFO L496 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) [2022-07-12 01:53:29,453 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 618 transitions. [2022-07-12 01:53:29,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-12 01:53:29,455 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:53:29,456 INFO L195 NwaCegarLoop]: 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] [2022-07-12 01:53:29,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-12 01:53:29,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 01:53:29,679 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:53:29,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:53:29,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1033847947, now seen corresponding path program 1 times [2022-07-12 01:53:29,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:53:29,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047588389] [2022-07-12 01:53:29,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:53:29,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:53:29,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:53:29,743 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 01:53:29,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:53:29,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047588389] [2022-07-12 01:53:29,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047588389] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 01:53:29,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365716599] [2022-07-12 01:53:29,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:53:29,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 01:53:29,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 01:53:29,746 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) [2022-07-12 01:53:29,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 01:53:29,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:53:29,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 01:53:29,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 01:53:29,872 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 01:53:29,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 01:53:29,920 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 01:53:29,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365716599] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 01:53:29,921 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 01:53:29,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2022-07-12 01:53:29,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230078481] [2022-07-12 01:53:29,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 01:53:29,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 01:53:29,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:53:29,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 01:53:29,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 01:53:29,924 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) [2022-07-12 01:53:29,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:53:29,989 INFO L93 Difference]: Finished difference Result 415 states and 631 transitions. [2022-07-12 01:53:29,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 01:53:29,990 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 [2022-07-12 01:53:29,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:53:29,992 INFO L225 Difference]: With dead ends: 415 [2022-07-12 01:53:29,992 INFO L226 Difference]: Without dead ends: 403 [2022-07-12 01:53:29,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 70 SyntacticMatches, 7 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 01:53:29,994 INFO L413 NwaCegarLoop]: 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 [2022-07-12 01:53:29,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 437 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 01:53:29,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2022-07-12 01:53:30,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 400. [2022-07-12 01:53:30,005 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) [2022-07-12 01:53:30,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 606 transitions. [2022-07-12 01:53:30,007 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 606 transitions. Word has length 38 [2022-07-12 01:53:30,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:53:30,007 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 606 transitions. [2022-07-12 01:53:30,007 INFO L496 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) [2022-07-12 01:53:30,007 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 606 transitions. [2022-07-12 01:53:30,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-12 01:53:30,008 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:53:30,009 INFO L195 NwaCegarLoop]: 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] [2022-07-12 01:53:30,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 01:53:30,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 01:53:30,232 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:53:30,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:53:30,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1756734972, now seen corresponding path program 1 times [2022-07-12 01:53:30,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:53:30,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533273052] [2022-07-12 01:53:30,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:53:30,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:53:30,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:53:30,422 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 01:53:30,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:53:30,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533273052] [2022-07-12 01:53:30,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533273052] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 01:53:30,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444467644] [2022-07-12 01:53:30,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:53:30,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 01:53:30,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 01:53:30,428 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) [2022-07-12 01:53:30,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 01:53:30,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:53:30,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-12 01:53:30,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 01:53:30,724 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 01:53:30,724 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 01:53:30,966 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 01:53:30,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444467644] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 01:53:30,966 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 01:53:30,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2022-07-12 01:53:30,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662026490] [2022-07-12 01:53:30,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 01:53:30,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 01:53:30,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:53:30,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 01:53:30,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-12 01:53:30,968 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) [2022-07-12 01:53:31,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:53:31,096 INFO L93 Difference]: Finished difference Result 412 states and 615 transitions. [2022-07-12 01:53:31,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 01:53:31,097 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 [2022-07-12 01:53:31,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:53:31,099 INFO L225 Difference]: With dead ends: 412 [2022-07-12 01:53:31,099 INFO L226 Difference]: Without dead ends: 410 [2022-07-12 01:53:31,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 74 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-12 01:53:31,100 INFO L413 NwaCegarLoop]: 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 [2022-07-12 01:53:31,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 659 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 01:53:31,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2022-07-12 01:53:31,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 401. [2022-07-12 01:53:31,109 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) [2022-07-12 01:53:31,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 607 transitions. [2022-07-12 01:53:31,111 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 607 transitions. Word has length 40 [2022-07-12 01:53:31,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:53:31,111 INFO L495 AbstractCegarLoop]: Abstraction has 401 states and 607 transitions. [2022-07-12 01:53:31,112 INFO L496 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) [2022-07-12 01:53:31,112 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 607 transitions. [2022-07-12 01:53:31,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-12 01:53:31,112 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:53:31,112 INFO L195 NwaCegarLoop]: 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] [2022-07-12 01:53:31,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 01:53:31,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-12 01:53:31,328 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:53:31,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:53:31,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1250552987, now seen corresponding path program 1 times [2022-07-12 01:53:31,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:53:31,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652840977] [2022-07-12 01:53:31,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:53:31,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:53:31,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:53:31,354 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 01:53:31,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:53:31,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652840977] [2022-07-12 01:53:31,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652840977] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:53:31,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:53:31,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 01:53:31,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755105889] [2022-07-12 01:53:31,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:53:31,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 01:53:31,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:53:31,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 01:53:31,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 01:53:31,356 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) [2022-07-12 01:53:31,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:53:31,390 INFO L93 Difference]: Finished difference Result 756 states and 1142 transitions. [2022-07-12 01:53:31,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 01:53:31,390 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 [2022-07-12 01:53:31,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:53:31,392 INFO L225 Difference]: With dead ends: 756 [2022-07-12 01:53:31,392 INFO L226 Difference]: Without dead ends: 400 [2022-07-12 01:53:31,393 INFO L412 NwaCegarLoop]: 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 [2022-07-12 01:53:31,393 INFO L413 NwaCegarLoop]: 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 [2022-07-12 01:53:31,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 246 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 01:53:31,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2022-07-12 01:53:31,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 398. [2022-07-12 01:53:31,404 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) [2022-07-12 01:53:31,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 589 transitions. [2022-07-12 01:53:31,405 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 589 transitions. Word has length 41 [2022-07-12 01:53:31,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:53:31,406 INFO L495 AbstractCegarLoop]: Abstraction has 398 states and 589 transitions. [2022-07-12 01:53:31,407 INFO L496 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) [2022-07-12 01:53:31,407 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 589 transitions. [2022-07-12 01:53:31,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-12 01:53:31,407 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:53:31,408 INFO L195 NwaCegarLoop]: 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] [2022-07-12 01:53:31,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 01:53:31,408 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:53:31,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:53:31,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1798904348, now seen corresponding path program 1 times [2022-07-12 01:53:31,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:53:31,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093437912] [2022-07-12 01:53:31,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:53:31,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:53:31,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:53:31,445 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-12 01:53:31,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:53:31,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093437912] [2022-07-12 01:53:31,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093437912] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:53:31,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:53:31,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 01:53:31,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74998437] [2022-07-12 01:53:31,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:53:31,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 01:53:31,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:53:31,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 01:53:31,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 01:53:31,448 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) [2022-07-12 01:53:31,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:53:31,469 INFO L93 Difference]: Finished difference Result 566 states and 838 transitions. [2022-07-12 01:53:31,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 01:53:31,470 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 [2022-07-12 01:53:31,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:53:31,471 INFO L225 Difference]: With dead ends: 566 [2022-07-12 01:53:31,471 INFO L226 Difference]: Without dead ends: 233 [2022-07-12 01:53:31,471 INFO L412 NwaCegarLoop]: 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 [2022-07-12 01:53:31,472 INFO L413 NwaCegarLoop]: 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 [2022-07-12 01:53:31,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 203 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 01:53:31,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-07-12 01:53:31,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 231. [2022-07-12 01:53:31,479 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) [2022-07-12 01:53:31,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 333 transitions. [2022-07-12 01:53:31,479 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 333 transitions. Word has length 53 [2022-07-12 01:53:31,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:53:31,480 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 333 transitions. [2022-07-12 01:53:31,480 INFO L496 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) [2022-07-12 01:53:31,480 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 333 transitions. [2022-07-12 01:53:31,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-12 01:53:31,481 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:53:31,481 INFO L195 NwaCegarLoop]: 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] [2022-07-12 01:53:31,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 01:53:31,481 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:53:31,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:53:31,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1723595032, now seen corresponding path program 1 times [2022-07-12 01:53:31,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:53:31,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781245975] [2022-07-12 01:53:31,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:53:31,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:53:31,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:53:31,537 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 14 proven. 23 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 01:53:31,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:53:31,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781245975] [2022-07-12 01:53:31,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781245975] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 01:53:31,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649881765] [2022-07-12 01:53:31,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:53:31,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 01:53:31,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 01:53:31,576 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) [2022-07-12 01:53:31,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 01:53:31,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:53:31,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 01:53:31,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 01:53:31,723 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 01:53:31,723 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 01:53:31,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649881765] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:53:31,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 01:53:31,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-07-12 01:53:31,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111253138] [2022-07-12 01:53:31,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:53:31,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 01:53:31,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:53:31,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 01:53:31,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-07-12 01:53:31,726 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) [2022-07-12 01:53:31,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:53:31,784 INFO L93 Difference]: Finished difference Result 317 states and 455 transitions. [2022-07-12 01:53:31,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 01:53:31,785 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 [2022-07-12 01:53:31,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:53:31,786 INFO L225 Difference]: With dead ends: 317 [2022-07-12 01:53:31,786 INFO L226 Difference]: Without dead ends: 313 [2022-07-12 01:53:31,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-07-12 01:53:31,787 INFO L413 NwaCegarLoop]: 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 [2022-07-12 01:53:31,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 427 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 01:53:31,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-07-12 01:53:31,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 309. [2022-07-12 01:53:31,796 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) [2022-07-12 01:53:31,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 448 transitions. [2022-07-12 01:53:31,797 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 448 transitions. Word has length 55 [2022-07-12 01:53:31,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:53:31,797 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 448 transitions. [2022-07-12 01:53:31,797 INFO L496 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) [2022-07-12 01:53:31,797 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 448 transitions. [2022-07-12 01:53:31,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-12 01:53:31,798 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:53:31,798 INFO L195 NwaCegarLoop]: 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] [2022-07-12 01:53:31,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-12 01:53:32,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 01:53:32,022 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:53:32,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:53:32,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1291508586, now seen corresponding path program 1 times [2022-07-12 01:53:32,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:53:32,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190332435] [2022-07-12 01:53:32,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:53:32,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:53:32,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:53:32,063 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 23 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 01:53:32,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:53:32,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190332435] [2022-07-12 01:53:32,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190332435] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 01:53:32,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566538582] [2022-07-12 01:53:32,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:53:32,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 01:53:32,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 01:53:32,066 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) [2022-07-12 01:53:32,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-12 01:53:32,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:53:32,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 01:53:32,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 01:53:32,184 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 23 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 01:53:32,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 01:53:32,236 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 23 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 01:53:32,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566538582] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 01:53:32,236 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 01:53:32,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-07-12 01:53:32,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99158047] [2022-07-12 01:53:32,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 01:53:32,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 01:53:32,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:53:32,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 01:53:32,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2022-07-12 01:53:32,238 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) [2022-07-12 01:53:32,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:53:32,348 INFO L93 Difference]: Finished difference Result 810 states and 1182 transitions. [2022-07-12 01:53:32,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 01:53:32,349 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 [2022-07-12 01:53:32,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:53:32,351 INFO L225 Difference]: With dead ends: 810 [2022-07-12 01:53:32,351 INFO L226 Difference]: Without dead ends: 643 [2022-07-12 01:53:32,352 INFO L412 NwaCegarLoop]: 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 [2022-07-12 01:53:32,352 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 603 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 01:53:32,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 688 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 01:53:32,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2022-07-12 01:53:32,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 628. [2022-07-12 01:53:32,368 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) [2022-07-12 01:53:32,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 896 transitions. [2022-07-12 01:53:32,369 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 896 transitions. Word has length 55 [2022-07-12 01:53:32,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:53:32,370 INFO L495 AbstractCegarLoop]: Abstraction has 628 states and 896 transitions. [2022-07-12 01:53:32,370 INFO L496 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) [2022-07-12 01:53:32,370 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 896 transitions. [2022-07-12 01:53:32,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-12 01:53:32,370 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:53:32,371 INFO L195 NwaCegarLoop]: 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] [2022-07-12 01:53:32,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-12 01:53:32,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 01:53:32,594 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:53:32,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:53:32,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1903289774, now seen corresponding path program 1 times [2022-07-12 01:53:32,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:53:32,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899830872] [2022-07-12 01:53:32,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:53:32,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:53:32,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:53:32,742 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 01:53:32,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:53:32,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899830872] [2022-07-12 01:53:32,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899830872] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 01:53:32,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975018362] [2022-07-12 01:53:32,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:53:32,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 01:53:32,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 01:53:32,745 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) [2022-07-12 01:53:32,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-12 01:53:32,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:53:32,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-12 01:53:32,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 01:53:32,978 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 01:53:32,979 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 01:53:33,205 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 01:53:33,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975018362] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 01:53:33,206 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 01:53:33,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-07-12 01:53:33,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087521150] [2022-07-12 01:53:33,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 01:53:33,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 01:53:33,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:53:33,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 01:53:33,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-07-12 01:53:33,209 INFO L87 Difference]: Start difference. First operand 628 states and 896 transitions. Second operand has 13 states, 13 states have (on average 11.0) internal successors, (143), 13 states have internal predecessors, (143), 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) [2022-07-12 01:53:33,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:53:33,351 INFO L93 Difference]: Finished difference Result 636 states and 900 transitions. [2022-07-12 01:53:33,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 01:53:33,352 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 11.0) internal successors, (143), 13 states have internal predecessors, (143), 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 [2022-07-12 01:53:33,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:53:33,354 INFO L225 Difference]: With dead ends: 636 [2022-07-12 01:53:33,354 INFO L226 Difference]: Without dead ends: 634 [2022-07-12 01:53:33,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 103 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-07-12 01:53:33,355 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 142 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 01:53:33,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 1079 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 01:53:33,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2022-07-12 01:53:33,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 628. [2022-07-12 01:53:33,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 627 states have (on average 1.4210526315789473) internal successors, (891), 627 states have internal predecessors, (891), 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) [2022-07-12 01:53:33,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 891 transitions. [2022-07-12 01:53:33,373 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 891 transitions. Word has length 56 [2022-07-12 01:53:33,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:53:33,373 INFO L495 AbstractCegarLoop]: Abstraction has 628 states and 891 transitions. [2022-07-12 01:53:33,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 11.0) internal successors, (143), 13 states have internal predecessors, (143), 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) [2022-07-12 01:53:33,373 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 891 transitions. [2022-07-12 01:53:33,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-12 01:53:33,374 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:53:33,374 INFO L195 NwaCegarLoop]: 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] [2022-07-12 01:53:33,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-12 01:53:33,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-12 01:53:33,599 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:53:33,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:53:33,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1029731011, now seen corresponding path program 1 times [2022-07-12 01:53:33,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:53:33,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787262558] [2022-07-12 01:53:33,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:53:33,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:53:33,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:53:33,818 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 01:53:33,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:53:33,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787262558] [2022-07-12 01:53:33,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787262558] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 01:53:33,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295058609] [2022-07-12 01:53:33,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:53:33,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 01:53:33,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 01:53:33,820 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) [2022-07-12 01:53:33,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-12 01:53:33,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:53:33,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-12 01:53:33,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 01:53:34,195 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 01:53:34,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 01:53:34,471 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 43 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-12 01:53:34,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295058609] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 01:53:34,471 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 01:53:34,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 12 [2022-07-12 01:53:34,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528746607] [2022-07-12 01:53:34,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 01:53:34,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 01:53:34,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:53:34,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 01:53:34,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-07-12 01:53:34,472 INFO L87 Difference]: Start difference. First operand 628 states and 891 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) [2022-07-12 01:53:34,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:53:34,794 INFO L93 Difference]: Finished difference Result 638 states and 896 transitions. [2022-07-12 01:53:34,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 01:53:34,795 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 [2022-07-12 01:53:34,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:53:34,797 INFO L225 Difference]: With dead ends: 638 [2022-07-12 01:53:34,797 INFO L226 Difference]: Without dead ends: 636 [2022-07-12 01:53:34,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 118 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-07-12 01:53:34,798 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 254 mSDsluCounter, 1913 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 2141 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 01:53:34,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 2141 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 01:53:34,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2022-07-12 01:53:34,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 628. [2022-07-12 01:53:34,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 627 states have (on average 1.405103668261563) internal successors, (881), 627 states have internal predecessors, (881), 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) [2022-07-12 01:53:34,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 881 transitions. [2022-07-12 01:53:34,816 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 881 transitions. Word has length 63 [2022-07-12 01:53:34,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:53:34,816 INFO L495 AbstractCegarLoop]: Abstraction has 628 states and 881 transitions. [2022-07-12 01:53:34,816 INFO L496 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) [2022-07-12 01:53:34,816 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 881 transitions. [2022-07-12 01:53:34,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-12 01:53:34,819 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:53:34,819 INFO L195 NwaCegarLoop]: 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] [2022-07-12 01:53:34,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-12 01:53:35,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-12 01:53:35,033 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:53:35,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:53:35,034 INFO L85 PathProgramCache]: Analyzing trace with hash -112559507, now seen corresponding path program 1 times [2022-07-12 01:53:35,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:53:35,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195902070] [2022-07-12 01:53:35,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:53:35,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:53:35,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:53:35,241 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 21 proven. 110 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 01:53:35,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:53:35,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195902070] [2022-07-12 01:53:35,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195902070] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 01:53:35,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508361366] [2022-07-12 01:53:35,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:53:35,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 01:53:35,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 01:53:35,244 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) [2022-07-12 01:53:35,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-12 01:53:35,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:53:35,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-12 01:53:35,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 01:53:35,673 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 21 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 01:53:35,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 01:53:36,138 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 51 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 01:53:36,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508361366] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 01:53:36,139 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 01:53:36,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 20 [2022-07-12 01:53:36,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631996345] [2022-07-12 01:53:36,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 01:53:36,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-12 01:53:36,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:53:36,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-12 01:53:36,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2022-07-12 01:53:36,140 INFO L87 Difference]: Start difference. First operand 628 states and 881 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) [2022-07-12 01:53:36,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:53:36,408 INFO L93 Difference]: Finished difference Result 632 states and 883 transitions. [2022-07-12 01:53:36,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 01:53:36,409 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 [2022-07-12 01:53:36,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:53:36,411 INFO L225 Difference]: With dead ends: 632 [2022-07-12 01:53:36,411 INFO L226 Difference]: Without dead ends: 630 [2022-07-12 01:53:36,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 161 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2022-07-12 01:53:36,412 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 245 mSDsluCounter, 2165 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 2364 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 01:53:36,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 2364 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 01:53:36,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2022-07-12 01:53:36,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 628. [2022-07-12 01:53:36,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 627 states have (on average 1.4019138755980862) internal successors, (879), 627 states have internal predecessors, (879), 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) [2022-07-12 01:53:36,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 879 transitions. [2022-07-12 01:53:36,431 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 879 transitions. Word has length 86 [2022-07-12 01:53:36,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:53:36,431 INFO L495 AbstractCegarLoop]: Abstraction has 628 states and 879 transitions. [2022-07-12 01:53:36,432 INFO L496 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) [2022-07-12 01:53:36,432 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 879 transitions. [2022-07-12 01:53:36,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-12 01:53:36,436 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:53:36,436 INFO L195 NwaCegarLoop]: 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] [2022-07-12 01:53:36,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-12 01:53:36,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-12 01:53:36,651 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:53:36,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:53:36,652 INFO L85 PathProgramCache]: Analyzing trace with hash -520376012, now seen corresponding path program 1 times [2022-07-12 01:53:36,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:53:36,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797923563] [2022-07-12 01:53:36,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:53:36,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:53:36,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:53:36,792 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 91 proven. 330 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-12 01:53:36,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:53:36,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797923563] [2022-07-12 01:53:36,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797923563] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 01:53:36,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109117390] [2022-07-12 01:53:36,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:53:36,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 01:53:36,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 01:53:36,795 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) [2022-07-12 01:53:36,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-12 01:53:36,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:53:36,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 887 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-12 01:53:36,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 01:53:37,107 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 91 proven. 330 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-12 01:53:37,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 01:53:37,298 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 91 proven. 330 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-12 01:53:37,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109117390] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 01:53:37,299 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 01:53:37,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2022-07-12 01:53:37,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471806550] [2022-07-12 01:53:37,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 01:53:37,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-12 01:53:37,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:53:37,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-12 01:53:37,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2022-07-12 01:53:37,301 INFO L87 Difference]: Start difference. First operand 628 states and 879 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) [2022-07-12 01:53:37,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:53:37,527 INFO L93 Difference]: Finished difference Result 1687 states and 2343 transitions. [2022-07-12 01:53:37,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 01:53:37,528 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 [2022-07-12 01:53:37,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:53:37,533 INFO L225 Difference]: With dead ends: 1687 [2022-07-12 01:53:37,533 INFO L226 Difference]: Without dead ends: 1323 [2022-07-12 01:53:37,534 INFO L412 NwaCegarLoop]: 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 [2022-07-12 01:53:37,535 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 2257 mSDsluCounter, 1251 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2257 SdHoareTripleChecker+Valid, 1420 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 01:53:37,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2257 Valid, 1420 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 01:53:37,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2022-07-12 01:53:37,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 1252. [2022-07-12 01:53:37,569 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) [2022-07-12 01:53:37,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1751 transitions. [2022-07-12 01:53:37,572 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 1751 transitions. Word has length 147 [2022-07-12 01:53:37,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:53:37,572 INFO L495 AbstractCegarLoop]: Abstraction has 1252 states and 1751 transitions. [2022-07-12 01:53:37,573 INFO L496 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) [2022-07-12 01:53:37,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1751 transitions. [2022-07-12 01:53:37,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2022-07-12 01:53:37,577 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:53:37,577 INFO L195 NwaCegarLoop]: 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] [2022-07-12 01:53:37,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-12 01:53:37,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 01:53:37,787 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:53:37,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:53:37,788 INFO L85 PathProgramCache]: Analyzing trace with hash -691826832, now seen corresponding path program 2 times [2022-07-12 01:53:37,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:53:37,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961493474] [2022-07-12 01:53:37,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:53:37,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:53:37,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:53:38,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2551 backedges. 227 proven. 2258 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-12 01:53:38,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:53:38,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961493474] [2022-07-12 01:53:38,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961493474] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 01:53:38,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957149383] [2022-07-12 01:53:38,147 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 01:53:38,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 01:53:38,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 01:53:38,152 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) [2022-07-12 01:53:38,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-12 01:53:38,456 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 01:53:38,456 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 01:53:38,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 1947 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-12 01:53:38,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 01:53:38,792 INFO L134 CoverageAnalysis]: Checked inductivity of 2551 backedges. 227 proven. 2258 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-12 01:53:38,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 01:53:39,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2551 backedges. 227 proven. 2258 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-12 01:53:39,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957149383] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 01:53:39,211 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 01:53:39,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 20 [2022-07-12 01:53:39,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299294400] [2022-07-12 01:53:39,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 01:53:39,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-12 01:53:39,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:53:39,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-12 01:53:39,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2022-07-12 01:53:39,216 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) [2022-07-12 01:53:39,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:53:39,464 INFO L93 Difference]: Finished difference Result 2222 states and 3089 transitions. [2022-07-12 01:53:39,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-12 01:53:39,464 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 [2022-07-12 01:53:39,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:53:39,470 INFO L225 Difference]: With dead ends: 2222 [2022-07-12 01:53:39,470 INFO L226 Difference]: Without dead ends: 1546 [2022-07-12 01:53:39,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 690 GetRequests, 672 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2022-07-12 01:53:39,472 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 2164 mSDsluCounter, 1303 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2164 SdHoareTripleChecker+Valid, 1472 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 01:53:39,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2164 Valid, 1472 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 01:53:39,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2022-07-12 01:53:39,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1486. [2022-07-12 01:53:39,514 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) [2022-07-12 01:53:39,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1486 states and 2077 transitions. [2022-07-12 01:53:39,517 INFO L78 Accepts]: Start accepts. Automaton has 1486 states and 2077 transitions. Word has length 331 [2022-07-12 01:53:39,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:53:39,518 INFO L495 AbstractCegarLoop]: Abstraction has 1486 states and 2077 transitions. [2022-07-12 01:53:39,518 INFO L496 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) [2022-07-12 01:53:39,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 2077 transitions. [2022-07-12 01:53:39,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2022-07-12 01:53:39,523 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:53:39,523 INFO L195 NwaCegarLoop]: 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] [2022-07-12 01:53:39,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-12 01:53:39,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 01:53:39,739 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:53:39,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:53:39,740 INFO L85 PathProgramCache]: Analyzing trace with hash 49372446, now seen corresponding path program 1 times [2022-07-12 01:53:39,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:53:39,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278181862] [2022-07-12 01:53:39,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:53:39,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:53:40,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 01:53:40,797 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 01:53:41,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 01:53:41,894 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 01:53:41,894 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 01:53:41,895 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 01:53:41,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-12 01:53:41,900 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 01:53:41,904 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 01:53:42,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 01:53:42 BoogieIcfgContainer [2022-07-12 01:53:42,100 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 01:53:42,102 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 01:53:42,102 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 01:53:42,102 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 01:53:42,103 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 01:53:25" (3/4) ... [2022-07-12 01:53:42,104 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-12 01:53:42,302 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 01:53:42,303 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 01:53:42,303 INFO L158 Benchmark]: Toolchain (without parser) took 18049.03ms. Allocated memory was 107.0MB in the beginning and 337.6MB in the end (delta: 230.7MB). Free memory was 75.4MB in the beginning and 239.5MB in the end (delta: -164.2MB). Peak memory consumption was 68.2MB. Max. memory is 16.1GB. [2022-07-12 01:53:42,303 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 107.0MB. Free memory was 61.2MB in the beginning and 61.2MB in the end (delta: 48.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 01:53:42,304 INFO L158 Benchmark]: CACSL2BoogieTranslator took 401.68ms. Allocated memory is still 107.0MB. Free memory was 75.4MB in the beginning and 74.2MB in the end (delta: 1.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-12 01:53:42,304 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.50ms. Allocated memory is still 107.0MB. Free memory was 73.9MB in the beginning and 69.4MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-12 01:53:42,304 INFO L158 Benchmark]: Boogie Preprocessor took 64.52ms. Allocated memory is still 107.0MB. Free memory was 69.4MB in the beginning and 66.5MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-12 01:53:42,308 INFO L158 Benchmark]: RCFGBuilder took 784.28ms. Allocated memory was 107.0MB in the beginning and 142.6MB in the end (delta: 35.7MB). Free memory was 66.5MB in the beginning and 98.3MB in the end (delta: -31.8MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. [2022-07-12 01:53:42,308 INFO L158 Benchmark]: TraceAbstraction took 16518.26ms. Allocated memory was 142.6MB in the beginning and 337.6MB in the end (delta: 195.0MB). Free memory was 97.6MB in the beginning and 272.4MB in the end (delta: -174.8MB). Peak memory consumption was 152.0MB. Max. memory is 16.1GB. [2022-07-12 01:53:42,308 INFO L158 Benchmark]: Witness Printer took 200.47ms. Allocated memory is still 337.6MB. Free memory was 272.4MB in the beginning and 239.5MB in the end (delta: 32.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2022-07-12 01:53:42,313 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.21ms. Allocated memory is still 107.0MB. Free memory was 61.2MB in the beginning and 61.2MB in the end (delta: 48.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 401.68ms. Allocated memory is still 107.0MB. Free memory was 75.4MB in the beginning and 74.2MB in the end (delta: 1.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.50ms. Allocated memory is still 107.0MB. Free memory was 73.9MB in the beginning and 69.4MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.52ms. Allocated memory is still 107.0MB. Free memory was 69.4MB in the beginning and 66.5MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 784.28ms. Allocated memory was 107.0MB in the beginning and 142.6MB in the end (delta: 35.7MB). Free memory was 66.5MB in the beginning and 98.3MB in the end (delta: -31.8MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. * TraceAbstraction took 16518.26ms. Allocated memory was 142.6MB in the beginning and 337.6MB in the end (delta: 195.0MB). Free memory was 97.6MB in the beginning and 272.4MB in the end (delta: -174.8MB). Peak memory consumption was 152.0MB. Max. memory is 16.1GB. * Witness Printer took 200.47ms. Allocated memory is still 337.6MB. Free memory was 272.4MB in the beginning and 239.5MB in the end (delta: 32.8MB). Peak memory consumption was 33.6MB. 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=-3, P2=0, P3=0, P4=0, P5=0, P6=-1, P7=4, P8=0, P9=-4, 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=-3, P2=0, P3=0, P4=0, P5=0, P6=-1, P7=4, P8=0, P9=-4, 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=-3, P2=0, P3=0, P4=0, P5=0, P6=-1, P7=4, P8=0, P9=-4, 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=56, P2=0, P3=0, P4=0, P5=0, P6=5, P7=-5, P8=0, 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=56, P2=0, P3=0, P4=0, P5=0, P6=5, P7=-5, P8=0, 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=56, P2=0, P3=0, P4=0, P5=0, P6=5, P7=-5, P8=0, 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=56, P2=0, P3=0, P4=0, P5=0, P6=5, P7=-5, P8=0, 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=-6, P7=7, P8=0, P9=-7, 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=-6, P7=7, P8=0, P9=-7, 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=-6, P7=7, P8=0, P9=-7, 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=-6, P7=7, P8=0, P9=-7, 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=-6, P7=7, P8=0, P9=-7, 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=-6, P7=7, P8=0, P9=-7, 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=51, P2=0, P3=0, P4=0, P5=0, P6=69, P7=8, P8=0, P9=-8, 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=51, P2=0, P3=0, P4=0, P5=0, P6=69, P7=8, P8=0, P9=-8, 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=51, P2=0, P3=0, P4=0, P5=0, P6=69, P7=8, P8=0, P9=-8, 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=51, P2=0, P3=0, P4=0, P5=0, P6=69, P7=8, P8=0, P9=-8, 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=51, P2=0, P3=0, P4=0, P5=0, P6=69, P7=8, P8=0, P9=-8, 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=51, P2=0, P3=0, P4=0, P5=0, P6=69, P7=8, P8=0, P9=-8, 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=51, P2=0, P3=0, P4=0, P5=0, P6=69, P7=8, P8=0, P9=-8, 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=9, P7=-9, P8=0, P9=54, 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=9, P7=-9, P8=0, P9=54, 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=9, P7=-9, P8=0, P9=54, 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=9, P7=-9, P8=0, P9=54, 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=9, P7=-9, P8=0, P9=54, 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=9, P7=-9, P8=0, P9=54, 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=9, P7=-9, P8=0, P9=54, 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=9, P7=-9, P8=0, P9=54, 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=-50, P2=0, P3=0, P4=0, P5=0, P6=10, P7=-10, P8=0, P9=11, 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=-50, P2=0, P3=0, P4=0, P5=0, P6=10, P7=-10, P8=0, P9=11, 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=-50, P2=0, P3=0, P4=0, P5=0, P6=10, P7=-10, P8=0, P9=11, 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=-50, P2=0, P3=0, P4=0, P5=0, P6=10, P7=-10, P8=0, P9=11, 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=0, P4=0, P5=0, P6=-11, P7=-12, P8=0, P9=13, 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=0, P4=0, P5=0, P6=-11, P7=-12, P8=0, P9=13, 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=0, P4=0, P5=0, P6=-11, P7=-12, P8=0, P9=13, 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=0, P4=0, P5=0, P6=-11, P7=-12, P8=0, P9=13, 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=0, P4=0, P5=0, P6=-11, P7=-12, P8=0, P9=13, 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=0, P4=0, P5=0, P6=-11, P7=-12, P8=0, P9=13, 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=53, P2=0, P3=0, P4=0, P5=0, P6=72, P7=-13, P8=0, P9=14, 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=53, P2=0, P3=0, P4=0, P5=0, P6=72, P7=-13, P8=0, P9=14, 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=53, P2=0, P3=0, P4=0, P5=0, P6=72, P7=-13, P8=0, P9=14, 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=53, P2=0, P3=0, P4=0, P5=0, P6=72, P7=-13, P8=0, P9=14, 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=53, P2=0, P3=0, P4=0, P5=0, P6=72, P7=-13, P8=0, P9=14, 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=53, P2=0, P3=0, P4=0, P5=0, P6=72, P7=-13, P8=0, P9=14, 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=53, P2=0, P3=0, P4=0, P5=0, P6=72, P7=-13, P8=0, P9=14, 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=-14, P7=15, P8=0, P9=1, 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=-14, P7=15, P8=0, P9=1, 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=-14, P7=15, P8=0, P9=1, 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=-14, P7=15, P8=0, P9=1, 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=-14, P7=15, P8=0, P9=1, 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=-14, P7=15, P8=0, P9=1, 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=-14, P7=15, P8=0, P9=1, 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=-14, P7=15, P8=0, P9=1, 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=-52, P2=0, P3=0, P4=0, P5=0, P6=-15, P7=-16, P8=0, P9=17, 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=-52, P2=0, P3=0, P4=0, P5=0, P6=-15, P7=-16, P8=0, P9=17, 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=-52, P2=0, P3=0, P4=0, P5=0, P6=-15, P7=-16, P8=0, P9=17, 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=-52, P2=0, P3=0, P4=0, P5=0, P6=-15, P7=-16, P8=0, P9=17, 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=1, P4=0, P5=0, P6=-17, P7=18, P8=0, P9=-18, 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=1, P4=0, P5=0, P6=-17, P7=18, P8=0, P9=-18, 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=1, P4=0, P5=0, P6=-17, P7=18, P8=0, P9=-18, 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=1, P4=0, P5=0, P6=-17, P7=18, P8=0, P9=-18, 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=1, P4=0, P5=0, P6=-17, P7=18, P8=0, P9=-18, 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=1, P4=0, P5=0, P6=-17, P7=18, P8=0, P9=-18, 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=55, P2=0, P3=0, P4=0, P5=0, P6=73, P7=19, P8=0, P9=-19, 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=55, P2=0, P3=0, P4=0, P5=0, P6=73, P7=19, P8=0, P9=-19, 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=55, P2=0, P3=0, P4=0, P5=0, P6=73, P7=19, P8=0, P9=-19, 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=55, P2=0, P3=0, P4=0, P5=0, P6=73, P7=19, P8=0, P9=-19, 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=55, P2=0, P3=0, P4=0, P5=0, P6=73, P7=19, P8=0, P9=-19, 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=55, P2=0, P3=0, P4=0, P5=0, P6=73, P7=19, P8=0, P9=-19, 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=55, P2=0, P3=0, P4=0, P5=0, P6=73, P7=19, P8=0, P9=-19, 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=20, P7=-20, P8=0, P9=-51, 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=20, P7=-20, P8=0, P9=-51, 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=20, P7=-20, P8=0, P9=-51, 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=20, P7=-20, P8=0, P9=-51, 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=20, P7=-20, P8=0, P9=-51, 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=20, P7=-20, P8=0, P9=-51, 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=20, P7=-20, P8=0, P9=-51, 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=20, P7=-20, P8=0, P9=-51, 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=21, P7=-21, P8=0, P9=22, 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=21, P7=-21, P8=0, P9=22, 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=21, P7=-21, P8=0, P9=22, 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=21, P7=-21, P8=0, P9=22, 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=1, P4=0, P5=0, P6=-22, P7=23, P8=0, P9=-23, 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=1, P4=0, P5=0, P6=-22, P7=23, P8=0, P9=-23, 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=1, P4=0, P5=0, P6=-22, P7=23, P8=0, P9=-23, 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=1, P4=0, P5=0, P6=-22, P7=23, P8=0, P9=-23, 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=1, P4=0, P5=0, P6=-22, P7=23, P8=0, P9=-23, 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=1, P4=0, P5=0, P6=-22, P7=23, P8=0, P9=-23, 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=57, P2=0, P3=0, P4=0, P5=0, P6=75, P7=24, P8=0, P9=-24, 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=57, P2=0, P3=0, P4=0, P5=0, P6=75, P7=24, P8=0, P9=-24, 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=57, P2=0, P3=0, P4=0, P5=0, P6=75, P7=24, P8=0, P9=-24, 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=57, P2=0, P3=0, P4=0, P5=0, P6=75, P7=24, P8=0, P9=-24, 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=57, P2=0, P3=0, P4=0, P5=0, P6=75, P7=24, P8=0, P9=-24, 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=57, P2=0, P3=0, P4=0, P5=0, P6=75, P7=24, P8=0, P9=-24, 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=57, P2=0, P3=0, P4=0, P5=0, P6=75, P7=24, P8=0, P9=-24, 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=25, P7=-25, P8=0, P9=0, 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=25, P7=-25, P8=0, P9=0, 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=25, P7=-25, P8=0, P9=0, 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=25, P7=-25, P8=0, P9=0, 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=25, P7=-25, P8=0, P9=0, 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=25, P7=-25, P8=0, P9=0, 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=25, P7=-25, P8=0, P9=0, 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=25, P7=-25, P8=0, P9=0, 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=58, P2=0, P3=0, P4=0, P5=0, P6=26, P7=-26, P8=0, P9=27, 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=58, P2=0, P3=0, P4=0, P5=0, P6=26, P7=-26, P8=0, P9=27, 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=58, P2=0, P3=0, P4=0, P5=0, P6=26, P7=-26, P8=0, P9=27, 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=58, P2=0, P3=0, P4=0, P5=0, P6=26, P7=-26, P8=0, P9=27, 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=-27, P7=28, P8=0, P9=-28, 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=-27, P7=28, P8=0, P9=-28, 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=-27, P7=28, P8=0, P9=-28, 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=-27, P7=28, P8=0, P9=-28, 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=-27, P7=28, P8=0, P9=-28, 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=-27, P7=28, P8=0, P9=-28, 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=59, P2=0, P3=0, P4=0, P5=0, P6=61, P7=29, P8=0, P9=-29, 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=59, P2=0, P3=0, P4=0, P5=0, P6=61, P7=29, P8=0, P9=-29, 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=59, P2=0, P3=0, P4=0, P5=0, P6=61, P7=29, P8=0, P9=-29, 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=59, P2=0, P3=0, P4=0, P5=0, P6=61, P7=29, P8=0, P9=-29, 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=59, P2=0, P3=0, P4=0, P5=0, P6=61, P7=29, P8=0, P9=-29, 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=59, P2=0, P3=0, P4=0, P5=0, P6=61, P7=29, P8=0, P9=-29, 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=59, P2=0, P3=0, P4=0, P5=0, P6=61, P7=29, P8=0, P9=-29, 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=30, P7=-30, P8=0, P9=0, 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=30, P7=-30, P8=0, P9=0, 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=30, P7=-30, P8=0, P9=0, 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=30, P7=-30, P8=0, P9=0, 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=30, P7=-30, P8=0, P9=0, 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=30, P7=-30, P8=0, P9=0, 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=30, P7=-30, P8=0, P9=0, 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=30, P7=-30, P8=0, P9=0, 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=-56, P2=0, P3=0, P4=0, P5=0, P6=31, P7=-31, P8=0, P9=32, 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=-56, P2=0, P3=0, P4=0, P5=0, P6=31, P7=-31, P8=0, P9=32, 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=-56, P2=0, P3=0, P4=0, P5=0, P6=31, P7=-31, P8=0, P9=32, 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=-56, P2=0, P3=0, P4=0, P5=0, P6=31, P7=-31, P8=0, P9=32, 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=-32, P7=33, P8=0, P9=-33, 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=-32, P7=33, P8=0, P9=-33, 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=-32, P7=33, P8=0, P9=-33, 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=-32, P7=33, P8=0, P9=-33, 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=-32, P7=33, P8=0, P9=-33, 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=-32, P7=33, P8=0, P9=-33, 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=63, P2=0, P3=0, P4=0, P5=0, P6=-36, P7=34, P8=0, P9=-34, 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=63, P2=0, P3=0, P4=0, P5=0, P6=-36, P7=34, P8=0, P9=-34, 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=63, P2=0, P3=0, P4=0, P5=0, P6=-36, P7=34, P8=0, P9=-34, 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=63, P2=0, P3=0, P4=0, P5=0, P6=-36, P7=34, P8=0, P9=-34, 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=63, P2=0, P3=0, P4=0, P5=0, P6=-36, P7=34, P8=0, P9=-34, 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=63, P2=0, P3=0, P4=0, P5=0, P6=-36, P7=34, P8=0, P9=-34, 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=63, P2=0, P3=0, P4=0, P5=0, P6=-36, P7=34, P8=0, P9=-34, 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=35, P7=-35, P8=0, 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=35, P7=-35, P8=0, 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=35, P7=-35, P8=0, 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=35, P7=-35, P8=0, 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=35, P7=-35, P8=0, 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=35, P7=-35, P8=0, 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=35, P7=-35, P8=0, 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=35, P7=-35, P8=0, 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=-58, P2=0, P3=0, P4=0, P5=0, P6=36, P7=37, P8=0, P9=-37, 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=-58, P2=0, P3=0, P4=0, P5=0, P6=36, P7=37, P8=0, P9=-37, 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=-58, P2=0, P3=0, P4=0, P5=0, P6=36, P7=37, P8=0, P9=-37, 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=-58, P2=0, P3=0, P4=0, P5=0, P6=36, P7=37, P8=0, P9=-37, 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=0, P4=0, P5=0, P6=38, P7=-38, P8=0, P9=39, 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=0, P4=0, P5=0, P6=38, P7=-38, P8=0, P9=39, 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=0, P4=0, P5=0, P6=38, P7=-38, P8=0, P9=39, 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=0, P4=0, P5=0, P6=38, P7=-38, P8=0, P9=39, 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=0, P4=0, P5=0, P6=38, P7=-38, P8=0, P9=39, 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=0, P4=0, P5=0, P6=38, P7=-38, P8=0, P9=39, 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=65, P2=0, P3=0, P4=0, P5=0, P6=77, P7=-39, P8=0, P9=40, 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=65, P2=0, P3=0, P4=0, P5=0, P6=77, P7=-39, P8=0, P9=40, 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=65, P2=0, P3=0, P4=0, P5=0, P6=77, P7=-39, P8=0, P9=40, 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=65, P2=0, P3=0, P4=0, P5=0, P6=77, P7=-39, P8=0, P9=40, 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=65, P2=0, P3=0, P4=0, P5=0, P6=77, P7=-39, P8=0, P9=40, 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=65, P2=0, P3=0, P4=0, P5=0, P6=77, P7=-39, P8=0, P9=40, 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=65, P2=0, P3=0, P4=0, P5=0, P6=77, P7=-39, P8=0, P9=40, 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=-40, P7=41, P8=0, P9=50, 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=-40, P7=41, P8=0, P9=50, 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=-40, P7=41, P8=0, P9=50, 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=-40, P7=41, P8=0, P9=50, 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=-40, P7=41, P8=0, P9=50, 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=-40, P7=41, P8=0, P9=50, 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=-40, P7=41, P8=0, P9=50, 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=-40, P7=41, P8=0, P9=50, 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=60, P2=0, P3=0, P4=0, P5=0, P6=-41, P7=42, P8=0, P9=-42, 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=60, P2=0, P3=0, P4=0, P5=0, P6=-41, P7=42, P8=0, P9=-42, 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=60, P2=0, P3=0, P4=0, P5=0, P6=-41, P7=42, P8=0, P9=-42, 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=60, P2=0, P3=0, P4=0, P5=0, P6=-41, P7=42, P8=0, P9=-42, 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=0, P4=0, P5=0, P6=43, P7=-43, P8=0, P9=44, 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=0, P4=0, P5=0, P6=43, P7=-43, P8=0, P9=44, 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=0, P4=0, P5=0, P6=43, P7=-43, P8=0, P9=44, 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=0, P4=0, P5=0, P6=43, P7=-43, P8=0, P9=44, 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=0, P4=0, P5=0, P6=43, P7=-43, P8=0, P9=44, 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=0, P4=0, P5=0, P6=43, P7=-43, P8=0, P9=44, 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=67, P2=0, P3=0, P4=0, P5=0, P6=79, P7=-44, P8=0, P9=45, 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=67, P2=0, P3=0, P4=0, P5=0, P6=79, P7=-44, P8=0, P9=45, 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=67, P2=0, P3=0, P4=0, P5=0, P6=79, P7=-44, P8=0, P9=45, 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=67, P2=0, P3=0, P4=0, P5=0, P6=79, P7=-44, P8=0, P9=45, 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=67, P2=0, P3=0, P4=0, P5=0, P6=79, P7=-44, P8=0, P9=45, 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=67, P2=0, P3=0, P4=0, P5=0, P6=79, P7=-44, P8=0, P9=45, 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=67, P2=0, P3=0, P4=0, P5=0, P6=79, P7=-44, P8=0, P9=45, 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=-45, P7=46, P8=0, P9=52, 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=-45, P7=46, P8=0, P9=52, 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=-45, P7=46, P8=0, P9=52, 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=-45, P7=46, P8=0, P9=52, 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=-45, P7=46, P8=0, P9=52, 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=-45, P7=46, P8=0, P9=52, 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=-45, P7=46, P8=0, P9=52, 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=-45, P7=46, P8=0, P9=52, 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=-46, P7=47, P8=0, P9=-47, 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=-46, P7=47, P8=0, P9=-47, 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=-46, P7=47, P8=0, P9=-47, 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=-46, P7=47, P8=0, P9=-47, 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=-48, P7=49, P8=0, P9=-49, 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=-48, P7=49, P8=0, P9=-49, 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=-48, P7=49, P8=0, P9=-49, 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=-48, P7=49, P8=0, P9=-49, 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=-48, P7=49, P8=0, P9=-49, 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=-48, P7=49, P8=0, P9=-49, 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=-48, P7=49, P8=0, P9=-49, 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: 16.3s, OverallIterations: 21, TraceHistogramMax: 35, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7563 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7563 mSDsluCounter, 15335 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11688 mSDsCounter, 542 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2403 IncrementalHoareTripleChecker+Invalid, 2945 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 542 mSolverCounterUnsat, 3647 mSDtfsCounter, 2403 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1985 GetRequests, 1837 SyntacticMatches, 22 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1486occurred in iteration=20, InterpolantAutomatonStates: 148, 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, 20 MinimizatonAttempts, 266 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 2525 NumberOfCodeBlocks, 2525 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2993 ConstructedInterpolants, 0 QuantifiedInterpolants, 15369 SizeOfPredicates, 27 NumberOfNonLiveVariables, 6082 ConjunctsInSsa, 164 ConjunctsInUnsatCore, 43 InterpolantComputations, 9 PerfectInterpolantSequences, 1827/10338 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! [2022-07-12 01:53:42,369 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