./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d 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 ../../../trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i -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 6e0191a7c0154db5e6d5798f5b20e5814ce0ff555e18a7acf1f1e5e323a36576 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 23:22:04,611 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 23:22:04,614 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 23:22:04,656 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 23:22:04,656 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 23:22:04,659 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 23:22:04,661 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 23:22:04,664 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 23:22:04,665 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 23:22:04,669 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 23:22:04,670 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 23:22:04,673 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 23:22:04,673 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 23:22:04,675 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 23:22:04,676 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 23:22:04,681 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 23:22:04,682 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 23:22:04,683 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 23:22:04,685 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 23:22:04,696 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 23:22:04,698 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 23:22:04,699 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 23:22:04,700 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 23:22:04,701 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 23:22:04,708 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 23:22:04,708 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 23:22:04,708 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 23:22:04,710 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 23:22:04,710 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 23:22:04,711 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 23:22:04,712 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 23:22:04,713 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 23:22:04,714 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 23:22:04,715 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 23:22:04,716 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 23:22:04,716 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 23:22:04,717 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 23:22:04,717 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 23:22:04,718 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 23:22:04,718 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 23:22:04,719 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 23:22:04,720 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 23:22:04,753 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 23:22:04,753 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 23:22:04,754 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 23:22:04,755 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 23:22:04,755 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 23:22:04,756 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 23:22:04,756 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 23:22:04,756 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 23:22:04,757 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 23:22:04,757 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 23:22:04,758 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 23:22:04,758 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 23:22:04,758 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 23:22:04,758 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 23:22:04,758 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 23:22:04,759 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 23:22:04,759 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 23:22:04,759 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 23:22:04,759 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 23:22:04,759 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 23:22:04,759 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 23:22:04,760 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 23:22:04,760 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 23:22:04,760 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 23:22:04,760 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 23:22:04,761 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 23:22:04,761 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 23:22:04,761 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 23:22:04,761 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 23:22:04,761 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 23:22:04,762 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 23:22:04,762 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 23:22:04,762 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 23:22:04,762 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 23:22:04,762 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 23:22:04,763 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 6e0191a7c0154db5e6d5798f5b20e5814ce0ff555e18a7acf1f1e5e323a36576 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-30 23:22:05,082 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 23:22:05,106 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 23:22:05,109 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 23:22:05,110 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 23:22:05,110 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 23:22:05,111 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2023-08-30 23:22:06,299 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 23:22:06,490 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 23:22:06,491 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2023-08-30 23:22:06,506 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c1b5524f/24f823d8b23c4c59b16990fb0b0a2a42/FLAG33103f48b [2023-08-30 23:22:06,521 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c1b5524f/24f823d8b23c4c59b16990fb0b0a2a42 [2023-08-30 23:22:06,523 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 23:22:06,524 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 23:22:06,525 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 23:22:06,526 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 23:22:06,530 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 23:22:06,530 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 11:22:06" (1/1) ... [2023-08-30 23:22:06,531 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@193de7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:22:06, skipping insertion in model container [2023-08-30 23:22:06,531 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 11:22:06" (1/1) ... [2023-08-30 23:22:06,537 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 23:22:06,573 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 23:22:06,709 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i[967,980] [2023-08-30 23:22:06,846 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 23:22:06,862 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 23:22:06,874 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i[967,980] [2023-08-30 23:22:06,935 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 23:22:06,975 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 23:22:06,976 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 23:22:06,982 INFO L208 MainTranslator]: Completed translation [2023-08-30 23:22:06,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:22:06 WrapperNode [2023-08-30 23:22:06,983 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 23:22:06,984 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 23:22:06,984 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 23:22:06,984 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 23:22:06,989 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:22:06" (1/1) ... [2023-08-30 23:22:07,006 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:22:06" (1/1) ... [2023-08-30 23:22:07,034 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2023-08-30 23:22:07,034 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 23:22:07,035 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 23:22:07,035 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 23:22:07,035 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 23:22:07,043 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:22:06" (1/1) ... [2023-08-30 23:22:07,043 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:22:06" (1/1) ... [2023-08-30 23:22:07,046 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:22:06" (1/1) ... [2023-08-30 23:22:07,046 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:22:06" (1/1) ... [2023-08-30 23:22:07,053 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:22:06" (1/1) ... [2023-08-30 23:22:07,054 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:22:06" (1/1) ... [2023-08-30 23:22:07,056 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:22:06" (1/1) ... [2023-08-30 23:22:07,057 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:22:06" (1/1) ... [2023-08-30 23:22:07,060 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 23:22:07,062 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 23:22:07,062 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 23:22:07,062 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 23:22:07,063 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:22:06" (1/1) ... [2023-08-30 23:22:07,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 23:22:07,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 23:22:07,118 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) [2023-08-30 23:22:07,142 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 [2023-08-30 23:22:07,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 23:22:07,155 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 23:22:07,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 23:22:07,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 23:22:07,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 23:22:07,157 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 23:22:07,157 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 23:22:07,157 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 23:22:07,157 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 23:22:07,157 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 23:22:07,157 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 23:22:07,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 23:22:07,158 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 23:22:07,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 23:22:07,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 23:22:07,159 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 23:22:07,323 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 23:22:07,325 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 23:22:07,703 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 23:22:07,838 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 23:22:07,838 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 23:22:07,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:22:07 BoogieIcfgContainer [2023-08-30 23:22:07,841 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 23:22:07,843 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 23:22:07,843 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 23:22:07,846 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 23:22:07,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 11:22:06" (1/3) ... [2023-08-30 23:22:07,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c0791f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 11:22:07, skipping insertion in model container [2023-08-30 23:22:07,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:22:06" (2/3) ... [2023-08-30 23:22:07,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c0791f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 11:22:07, skipping insertion in model container [2023-08-30 23:22:07,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:22:07" (3/3) ... [2023-08-30 23:22:07,850 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_power.opt_pso.opt_rmo.opt.i [2023-08-30 23:22:07,857 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 23:22:07,865 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 23:22:07,865 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 23:22:07,866 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 23:22:07,916 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 23:22:07,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 225 flow [2023-08-30 23:22:08,011 INFO L130 PetriNetUnfolder]: 2/102 cut-off events. [2023-08-30 23:22:08,011 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:22:08,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 102 events. 2/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 50 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-08-30 23:22:08,017 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 105 transitions, 225 flow [2023-08-30 23:22:08,020 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 102 transitions, 213 flow [2023-08-30 23:22:08,024 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 23:22:08,045 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 102 transitions, 213 flow [2023-08-30 23:22:08,049 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 102 transitions, 213 flow [2023-08-30 23:22:08,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 102 transitions, 213 flow [2023-08-30 23:22:08,076 INFO L130 PetriNetUnfolder]: 2/102 cut-off events. [2023-08-30 23:22:08,076 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:22:08,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 102 events. 2/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 50 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-08-30 23:22:08,078 INFO L119 LiptonReduction]: Number of co-enabled transitions 1776 [2023-08-30 23:22:12,024 INFO L134 LiptonReduction]: Checked pairs total: 4534 [2023-08-30 23:22:12,024 INFO L136 LiptonReduction]: Total number of compositions: 92 [2023-08-30 23:22:12,036 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 23:22:12,041 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@72af3929, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 23:22:12,042 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-30 23:22:12,046 INFO L130 PetriNetUnfolder]: 0/13 cut-off events. [2023-08-30 23:22:12,046 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:22:12,046 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:22:12,047 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:22:12,047 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:22:12,052 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:22:12,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1748915370, now seen corresponding path program 1 times [2023-08-30 23:22:12,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:22:12,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919914956] [2023-08-30 23:22:12,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:22:12,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:22:12,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:22:12,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:22:12,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:22:12,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919914956] [2023-08-30 23:22:12,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919914956] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:22:12,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:22:12,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 23:22:12,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908792990] [2023-08-30 23:22:12,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:22:12,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 23:22:12,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:22:12,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 23:22:12,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 23:22:12,574 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 197 [2023-08-30 23:22:12,577 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 53 flow. Second operand has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 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) [2023-08-30 23:22:12,577 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:22:12,577 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 197 [2023-08-30 23:22:12,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:22:12,812 INFO L130 PetriNetUnfolder]: 511/847 cut-off events. [2023-08-30 23:22:12,813 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2023-08-30 23:22:12,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1666 conditions, 847 events. 511/847 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4071 event pairs, 112 based on Foata normal form. 0/795 useless extension candidates. Maximal degree in co-relation 1655. Up to 580 conditions per place. [2023-08-30 23:22:12,823 INFO L137 encePairwiseOnDemand]: 194/197 looper letters, 23 selfloop transitions, 2 changer transitions 2/30 dead transitions. [2023-08-30 23:22:12,823 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 30 transitions, 123 flow [2023-08-30 23:22:12,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 23:22:12,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 23:22:12,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 304 transitions. [2023-08-30 23:22:12,842 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5143824027072758 [2023-08-30 23:22:12,843 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 304 transitions. [2023-08-30 23:22:12,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 304 transitions. [2023-08-30 23:22:12,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:22:12,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 304 transitions. [2023-08-30 23:22:12,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 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) [2023-08-30 23:22:12,857 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 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) [2023-08-30 23:22:12,858 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 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) [2023-08-30 23:22:12,859 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 53 flow. Second operand 3 states and 304 transitions. [2023-08-30 23:22:12,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 30 transitions, 123 flow [2023-08-30 23:22:12,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 30 transitions, 120 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 23:22:12,863 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 50 flow [2023-08-30 23:22:12,865 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2023-08-30 23:22:12,868 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2023-08-30 23:22:12,868 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 50 flow [2023-08-30 23:22:12,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 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) [2023-08-30 23:22:12,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:22:12,869 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:22:12,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 23:22:12,870 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:22:12,870 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:22:12,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1375404218, now seen corresponding path program 1 times [2023-08-30 23:22:12,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:22:12,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94360897] [2023-08-30 23:22:12,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:22:12,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:22:12,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:22:14,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:22:14,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:22:14,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94360897] [2023-08-30 23:22:14,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94360897] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:22:14,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:22:14,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 23:22:14,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109498110] [2023-08-30 23:22:14,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:22:14,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:22:14,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:22:14,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:22:14,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:22:14,056 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 197 [2023-08-30 23:22:14,057 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 50 flow. Second operand has 4 states, 4 states have (on average 85.25) internal successors, (341), 4 states have internal predecessors, (341), 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) [2023-08-30 23:22:14,057 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:22:14,057 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 197 [2023-08-30 23:22:14,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:22:14,337 INFO L130 PetriNetUnfolder]: 967/1566 cut-off events. [2023-08-30 23:22:14,338 INFO L131 PetriNetUnfolder]: For 86/86 co-relation queries the response was YES. [2023-08-30 23:22:14,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3210 conditions, 1566 events. 967/1566 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 7952 event pairs, 89 based on Foata normal form. 56/1622 useless extension candidates. Maximal degree in co-relation 3200. Up to 1009 conditions per place. [2023-08-30 23:22:14,371 INFO L137 encePairwiseOnDemand]: 187/197 looper letters, 35 selfloop transitions, 11 changer transitions 0/47 dead transitions. [2023-08-30 23:22:14,371 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 47 transitions, 206 flow [2023-08-30 23:22:14,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 23:22:14,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 23:22:14,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 380 transitions. [2023-08-30 23:22:14,374 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48223350253807107 [2023-08-30 23:22:14,374 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 380 transitions. [2023-08-30 23:22:14,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 380 transitions. [2023-08-30 23:22:14,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:22:14,375 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 380 transitions. [2023-08-30 23:22:14,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 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) [2023-08-30 23:22:14,379 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 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) [2023-08-30 23:22:14,380 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 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) [2023-08-30 23:22:14,380 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 50 flow. Second operand 4 states and 380 transitions. [2023-08-30 23:22:14,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 47 transitions, 206 flow [2023-08-30 23:22:14,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 47 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 23:22:14,383 INFO L231 Difference]: Finished difference. Result has 33 places, 30 transitions, 130 flow [2023-08-30 23:22:14,383 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=130, PETRI_PLACES=33, PETRI_TRANSITIONS=30} [2023-08-30 23:22:14,384 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 1 predicate places. [2023-08-30 23:22:14,384 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 30 transitions, 130 flow [2023-08-30 23:22:14,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.25) internal successors, (341), 4 states have internal predecessors, (341), 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) [2023-08-30 23:22:14,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:22:14,384 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:22:14,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 23:22:14,385 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:22:14,388 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:22:14,388 INFO L85 PathProgramCache]: Analyzing trace with hash 312141289, now seen corresponding path program 1 times [2023-08-30 23:22:14,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:22:14,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795718260] [2023-08-30 23:22:14,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:22:14,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:22:14,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:22:15,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:22:15,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:22:15,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795718260] [2023-08-30 23:22:15,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795718260] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:22:15,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:22:15,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 23:22:15,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037984414] [2023-08-30 23:22:15,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:22:15,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:22:15,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:22:15,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:22:15,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:22:15,209 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 197 [2023-08-30 23:22:15,210 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 30 transitions, 130 flow. Second operand has 4 states, 4 states have (on average 85.5) internal successors, (342), 4 states have internal predecessors, (342), 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) [2023-08-30 23:22:15,210 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:22:15,210 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 197 [2023-08-30 23:22:15,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:22:15,465 INFO L130 PetriNetUnfolder]: 956/1515 cut-off events. [2023-08-30 23:22:15,465 INFO L131 PetriNetUnfolder]: For 731/734 co-relation queries the response was YES. [2023-08-30 23:22:15,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4434 conditions, 1515 events. 956/1515 cut-off events. For 731/734 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 7362 event pairs, 100 based on Foata normal form. 6/1520 useless extension candidates. Maximal degree in co-relation 4421. Up to 995 conditions per place. [2023-08-30 23:22:15,474 INFO L137 encePairwiseOnDemand]: 187/197 looper letters, 38 selfloop transitions, 18 changer transitions 0/57 dead transitions. [2023-08-30 23:22:15,474 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 57 transitions, 338 flow [2023-08-30 23:22:15,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 23:22:15,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 23:22:15,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 380 transitions. [2023-08-30 23:22:15,476 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48223350253807107 [2023-08-30 23:22:15,476 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 380 transitions. [2023-08-30 23:22:15,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 380 transitions. [2023-08-30 23:22:15,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:22:15,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 380 transitions. [2023-08-30 23:22:15,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 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) [2023-08-30 23:22:15,479 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 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) [2023-08-30 23:22:15,480 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 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) [2023-08-30 23:22:15,480 INFO L175 Difference]: Start difference. First operand has 33 places, 30 transitions, 130 flow. Second operand 4 states and 380 transitions. [2023-08-30 23:22:15,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 57 transitions, 338 flow [2023-08-30 23:22:15,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 57 transitions, 338 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 23:22:15,483 INFO L231 Difference]: Finished difference. Result has 39 places, 39 transitions, 258 flow [2023-08-30 23:22:15,483 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=258, PETRI_PLACES=39, PETRI_TRANSITIONS=39} [2023-08-30 23:22:15,484 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 7 predicate places. [2023-08-30 23:22:15,484 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 39 transitions, 258 flow [2023-08-30 23:22:15,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.5) internal successors, (342), 4 states have internal predecessors, (342), 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) [2023-08-30 23:22:15,485 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:22:15,485 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:22:15,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 23:22:15,485 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:22:15,486 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:22:15,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1084925299, now seen corresponding path program 1 times [2023-08-30 23:22:15,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:22:15,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382652323] [2023-08-30 23:22:15,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:22:15,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:22:15,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:22:16,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:22:16,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:22:16,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382652323] [2023-08-30 23:22:16,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382652323] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:22:16,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:22:16,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:22:16,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39794958] [2023-08-30 23:22:16,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:22:16,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:22:16,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:22:16,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:22:16,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:22:16,185 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 197 [2023-08-30 23:22:16,185 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 39 transitions, 258 flow. Second operand has 4 states, 4 states have (on average 85.75) internal successors, (343), 4 states have internal predecessors, (343), 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) [2023-08-30 23:22:16,185 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:22:16,185 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 197 [2023-08-30 23:22:16,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:22:16,483 INFO L130 PetriNetUnfolder]: 1128/1813 cut-off events. [2023-08-30 23:22:16,483 INFO L131 PetriNetUnfolder]: For 2704/2704 co-relation queries the response was YES. [2023-08-30 23:22:16,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6500 conditions, 1813 events. 1128/1813 cut-off events. For 2704/2704 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 9268 event pairs, 287 based on Foata normal form. 40/1853 useless extension candidates. Maximal degree in co-relation 6482. Up to 878 conditions per place. [2023-08-30 23:22:16,495 INFO L137 encePairwiseOnDemand]: 187/197 looper letters, 42 selfloop transitions, 23 changer transitions 0/66 dead transitions. [2023-08-30 23:22:16,495 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 66 transitions, 512 flow [2023-08-30 23:22:16,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 23:22:16,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 23:22:16,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 380 transitions. [2023-08-30 23:22:16,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48223350253807107 [2023-08-30 23:22:16,498 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 380 transitions. [2023-08-30 23:22:16,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 380 transitions. [2023-08-30 23:22:16,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:22:16,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 380 transitions. [2023-08-30 23:22:16,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 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) [2023-08-30 23:22:16,501 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 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) [2023-08-30 23:22:16,502 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 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) [2023-08-30 23:22:16,502 INFO L175 Difference]: Start difference. First operand has 39 places, 39 transitions, 258 flow. Second operand 4 states and 380 transitions. [2023-08-30 23:22:16,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 66 transitions, 512 flow [2023-08-30 23:22:16,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 66 transitions, 510 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-30 23:22:16,508 INFO L231 Difference]: Finished difference. Result has 45 places, 47 transitions, 432 flow [2023-08-30 23:22:16,509 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=432, PETRI_PLACES=45, PETRI_TRANSITIONS=47} [2023-08-30 23:22:16,510 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 13 predicate places. [2023-08-30 23:22:16,510 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 47 transitions, 432 flow [2023-08-30 23:22:16,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.75) internal successors, (343), 4 states have internal predecessors, (343), 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) [2023-08-30 23:22:16,511 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:22:16,511 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:22:16,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 23:22:16,511 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:22:16,512 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:22:16,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1084985842, now seen corresponding path program 1 times [2023-08-30 23:22:16,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:22:16,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272505431] [2023-08-30 23:22:16,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:22:16,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:22:16,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:22:16,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:22:16,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:22:16,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272505431] [2023-08-30 23:22:16,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272505431] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:22:16,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:22:16,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 23:22:16,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086585464] [2023-08-30 23:22:16,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:22:16,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:22:16,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:22:16,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:22:16,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:22:16,970 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 197 [2023-08-30 23:22:16,971 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 47 transitions, 432 flow. Second operand has 4 states, 4 states have (on average 94.75) internal successors, (379), 4 states have internal predecessors, (379), 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) [2023-08-30 23:22:16,971 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:22:16,971 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 197 [2023-08-30 23:22:16,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:22:17,240 INFO L130 PetriNetUnfolder]: 1268/2054 cut-off events. [2023-08-30 23:22:17,241 INFO L131 PetriNetUnfolder]: For 5304/5312 co-relation queries the response was YES. [2023-08-30 23:22:17,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8478 conditions, 2054 events. 1268/2054 cut-off events. For 5304/5312 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 10511 event pairs, 290 based on Foata normal form. 8/2033 useless extension candidates. Maximal degree in co-relation 8455. Up to 1753 conditions per place. [2023-08-30 23:22:17,256 INFO L137 encePairwiseOnDemand]: 193/197 looper letters, 45 selfloop transitions, 5 changer transitions 0/60 dead transitions. [2023-08-30 23:22:17,256 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 60 transitions, 622 flow [2023-08-30 23:22:17,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 23:22:17,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 23:22:17,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 304 transitions. [2023-08-30 23:22:17,258 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5143824027072758 [2023-08-30 23:22:17,258 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 304 transitions. [2023-08-30 23:22:17,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 304 transitions. [2023-08-30 23:22:17,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:22:17,258 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 304 transitions. [2023-08-30 23:22:17,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 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) [2023-08-30 23:22:17,260 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 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) [2023-08-30 23:22:17,261 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 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) [2023-08-30 23:22:17,261 INFO L175 Difference]: Start difference. First operand has 45 places, 47 transitions, 432 flow. Second operand 3 states and 304 transitions. [2023-08-30 23:22:17,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 60 transitions, 622 flow [2023-08-30 23:22:17,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 60 transitions, 595 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-30 23:22:17,271 INFO L231 Difference]: Finished difference. Result has 47 places, 50 transitions, 449 flow [2023-08-30 23:22:17,272 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=449, PETRI_PLACES=47, PETRI_TRANSITIONS=50} [2023-08-30 23:22:17,274 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 15 predicate places. [2023-08-30 23:22:17,274 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 50 transitions, 449 flow [2023-08-30 23:22:17,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.75) internal successors, (379), 4 states have internal predecessors, (379), 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) [2023-08-30 23:22:17,274 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:22:17,275 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:22:17,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 23:22:17,275 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:22:17,275 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:22:17,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1521680318, now seen corresponding path program 1 times [2023-08-30 23:22:17,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:22:17,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160666685] [2023-08-30 23:22:17,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:22:17,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:22:17,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:22:17,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:22:17,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:22:17,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160666685] [2023-08-30 23:22:17,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160666685] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:22:17,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:22:17,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 23:22:17,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494072685] [2023-08-30 23:22:17,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:22:17,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:22:17,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:22:17,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:22:17,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:22:17,576 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 197 [2023-08-30 23:22:17,577 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 50 transitions, 449 flow. Second operand has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 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) [2023-08-30 23:22:17,577 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:22:17,577 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 197 [2023-08-30 23:22:17,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:22:17,881 INFO L130 PetriNetUnfolder]: 1283/2076 cut-off events. [2023-08-30 23:22:17,881 INFO L131 PetriNetUnfolder]: For 4846/4858 co-relation queries the response was YES. [2023-08-30 23:22:17,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8796 conditions, 2076 events. 1283/2076 cut-off events. For 4846/4858 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 10654 event pairs, 164 based on Foata normal form. 12/2062 useless extension candidates. Maximal degree in co-relation 8771. Up to 1504 conditions per place. [2023-08-30 23:22:17,899 INFO L137 encePairwiseOnDemand]: 191/197 looper letters, 50 selfloop transitions, 12 changer transitions 1/73 dead transitions. [2023-08-30 23:22:17,899 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 73 transitions, 739 flow [2023-08-30 23:22:17,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 23:22:17,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 23:22:17,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 396 transitions. [2023-08-30 23:22:17,901 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5025380710659898 [2023-08-30 23:22:17,901 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 396 transitions. [2023-08-30 23:22:17,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 396 transitions. [2023-08-30 23:22:17,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:22:17,902 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 396 transitions. [2023-08-30 23:22:17,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 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) [2023-08-30 23:22:17,904 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 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) [2023-08-30 23:22:17,906 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 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) [2023-08-30 23:22:17,906 INFO L175 Difference]: Start difference. First operand has 47 places, 50 transitions, 449 flow. Second operand 4 states and 396 transitions. [2023-08-30 23:22:17,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 73 transitions, 739 flow [2023-08-30 23:22:17,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 73 transitions, 734 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 23:22:17,914 INFO L231 Difference]: Finished difference. Result has 50 places, 55 transitions, 526 flow [2023-08-30 23:22:17,915 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=526, PETRI_PLACES=50, PETRI_TRANSITIONS=55} [2023-08-30 23:22:17,917 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 18 predicate places. [2023-08-30 23:22:17,917 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 55 transitions, 526 flow [2023-08-30 23:22:17,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 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) [2023-08-30 23:22:17,919 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:22:17,920 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:22:17,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 23:22:17,920 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:22:17,920 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:22:17,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1503212466, now seen corresponding path program 2 times [2023-08-30 23:22:17,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:22:17,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946077277] [2023-08-30 23:22:17,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:22:17,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:22:17,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:22:18,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:22:18,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:22:18,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946077277] [2023-08-30 23:22:18,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946077277] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:22:18,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:22:18,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:22:18,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141690690] [2023-08-30 23:22:18,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:22:18,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:22:18,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:22:18,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:22:18,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:22:18,302 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 197 [2023-08-30 23:22:18,303 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 55 transitions, 526 flow. Second operand has 5 states, 5 states have (on average 93.4) internal successors, (467), 5 states have internal predecessors, (467), 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) [2023-08-30 23:22:18,303 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:22:18,303 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 197 [2023-08-30 23:22:18,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:22:18,620 INFO L130 PetriNetUnfolder]: 1266/2047 cut-off events. [2023-08-30 23:22:18,620 INFO L131 PetriNetUnfolder]: For 6368/6392 co-relation queries the response was YES. [2023-08-30 23:22:18,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9230 conditions, 2047 events. 1266/2047 cut-off events. For 6368/6392 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 10426 event pairs, 175 based on Foata normal form. 22/2036 useless extension candidates. Maximal degree in co-relation 9203. Up to 1495 conditions per place. [2023-08-30 23:22:18,638 INFO L137 encePairwiseOnDemand]: 192/197 looper letters, 49 selfloop transitions, 15 changer transitions 0/74 dead transitions. [2023-08-30 23:22:18,638 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 74 transitions, 798 flow [2023-08-30 23:22:18,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 23:22:18,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 23:22:18,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 399 transitions. [2023-08-30 23:22:18,640 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5063451776649747 [2023-08-30 23:22:18,640 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 399 transitions. [2023-08-30 23:22:18,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 399 transitions. [2023-08-30 23:22:18,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:22:18,641 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 399 transitions. [2023-08-30 23:22:18,642 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 99.75) internal successors, (399), 4 states have internal predecessors, (399), 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) [2023-08-30 23:22:18,643 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 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) [2023-08-30 23:22:18,643 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 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) [2023-08-30 23:22:18,644 INFO L175 Difference]: Start difference. First operand has 50 places, 55 transitions, 526 flow. Second operand 4 states and 399 transitions. [2023-08-30 23:22:18,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 74 transitions, 798 flow [2023-08-30 23:22:18,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 74 transitions, 784 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-30 23:22:18,653 INFO L231 Difference]: Finished difference. Result has 53 places, 59 transitions, 599 flow [2023-08-30 23:22:18,654 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=599, PETRI_PLACES=53, PETRI_TRANSITIONS=59} [2023-08-30 23:22:18,654 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 21 predicate places. [2023-08-30 23:22:18,654 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 59 transitions, 599 flow [2023-08-30 23:22:18,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 93.4) internal successors, (467), 5 states have internal predecessors, (467), 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) [2023-08-30 23:22:18,655 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:22:18,655 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:22:18,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 23:22:18,655 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:22:18,656 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:22:18,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1503301343, now seen corresponding path program 1 times [2023-08-30 23:22:18,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:22:18,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689381727] [2023-08-30 23:22:18,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:22:18,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:22:18,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:22:19,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:22:19,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:22:19,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689381727] [2023-08-30 23:22:19,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689381727] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:22:19,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:22:19,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:22:19,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288572627] [2023-08-30 23:22:19,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:22:19,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:22:19,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:22:19,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:22:19,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:22:19,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 197 [2023-08-30 23:22:19,099 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 59 transitions, 599 flow. Second operand has 5 states, 5 states have (on average 93.4) internal successors, (467), 5 states have internal predecessors, (467), 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) [2023-08-30 23:22:19,099 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:22:19,099 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 197 [2023-08-30 23:22:19,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:22:19,401 INFO L130 PetriNetUnfolder]: 1237/2001 cut-off events. [2023-08-30 23:22:19,401 INFO L131 PetriNetUnfolder]: For 7613/7649 co-relation queries the response was YES. [2023-08-30 23:22:19,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9307 conditions, 2001 events. 1237/2001 cut-off events. For 7613/7649 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 10179 event pairs, 197 based on Foata normal form. 36/2005 useless extension candidates. Maximal degree in co-relation 9278. Up to 1552 conditions per place. [2023-08-30 23:22:19,417 INFO L137 encePairwiseOnDemand]: 192/197 looper letters, 64 selfloop transitions, 10 changer transitions 0/84 dead transitions. [2023-08-30 23:22:19,417 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 84 transitions, 953 flow [2023-08-30 23:22:19,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 23:22:19,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 23:22:19,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 399 transitions. [2023-08-30 23:22:19,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5063451776649747 [2023-08-30 23:22:19,420 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 399 transitions. [2023-08-30 23:22:19,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 399 transitions. [2023-08-30 23:22:19,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:22:19,420 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 399 transitions. [2023-08-30 23:22:19,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 99.75) internal successors, (399), 4 states have internal predecessors, (399), 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) [2023-08-30 23:22:19,422 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 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) [2023-08-30 23:22:19,423 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 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) [2023-08-30 23:22:19,423 INFO L175 Difference]: Start difference. First operand has 53 places, 59 transitions, 599 flow. Second operand 4 states and 399 transitions. [2023-08-30 23:22:19,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 84 transitions, 953 flow [2023-08-30 23:22:19,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 84 transitions, 939 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-30 23:22:19,433 INFO L231 Difference]: Finished difference. Result has 56 places, 63 transitions, 657 flow [2023-08-30 23:22:19,433 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=585, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=657, PETRI_PLACES=56, PETRI_TRANSITIONS=63} [2023-08-30 23:22:19,434 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 24 predicate places. [2023-08-30 23:22:19,434 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 63 transitions, 657 flow [2023-08-30 23:22:19,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 93.4) internal successors, (467), 5 states have internal predecessors, (467), 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) [2023-08-30 23:22:19,435 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:22:19,435 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:22:19,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 23:22:19,435 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:22:19,435 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:22:19,436 INFO L85 PathProgramCache]: Analyzing trace with hash -642346439, now seen corresponding path program 1 times [2023-08-30 23:22:19,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:22:19,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695475058] [2023-08-30 23:22:19,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:22:19,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:22:19,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:22:20,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:22:20,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:22:20,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695475058] [2023-08-30 23:22:20,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695475058] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:22:20,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:22:20,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 23:22:20,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955022545] [2023-08-30 23:22:20,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:22:20,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 23:22:20,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:22:20,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 23:22:20,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 23:22:20,492 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 197 [2023-08-30 23:22:20,493 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 63 transitions, 657 flow. Second operand has 6 states, 6 states have (on average 83.16666666666667) internal successors, (499), 6 states have internal predecessors, (499), 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) [2023-08-30 23:22:20,493 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:22:20,493 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 197 [2023-08-30 23:22:20,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:22:20,930 INFO L130 PetriNetUnfolder]: 1509/2351 cut-off events. [2023-08-30 23:22:20,930 INFO L131 PetriNetUnfolder]: For 9338/9338 co-relation queries the response was YES. [2023-08-30 23:22:20,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11104 conditions, 2351 events. 1509/2351 cut-off events. For 9338/9338 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 11285 event pairs, 52 based on Foata normal form. 15/2366 useless extension candidates. Maximal degree in co-relation 11073. Up to 1241 conditions per place. [2023-08-30 23:22:20,949 INFO L137 encePairwiseOnDemand]: 186/197 looper letters, 56 selfloop transitions, 42 changer transitions 10/108 dead transitions. [2023-08-30 23:22:20,949 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 108 transitions, 1212 flow [2023-08-30 23:22:20,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 23:22:20,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 23:22:20,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 548 transitions. [2023-08-30 23:22:20,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46362098138747887 [2023-08-30 23:22:20,951 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 548 transitions. [2023-08-30 23:22:20,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 548 transitions. [2023-08-30 23:22:20,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:22:20,952 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 548 transitions. [2023-08-30 23:22:20,953 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 91.33333333333333) internal successors, (548), 6 states have internal predecessors, (548), 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) [2023-08-30 23:22:20,955 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 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) [2023-08-30 23:22:20,955 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 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) [2023-08-30 23:22:20,956 INFO L175 Difference]: Start difference. First operand has 56 places, 63 transitions, 657 flow. Second operand 6 states and 548 transitions. [2023-08-30 23:22:20,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 108 transitions, 1212 flow [2023-08-30 23:22:20,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 108 transitions, 1192 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-30 23:22:20,968 INFO L231 Difference]: Finished difference. Result has 63 places, 74 transitions, 932 flow [2023-08-30 23:22:20,968 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=643, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=932, PETRI_PLACES=63, PETRI_TRANSITIONS=74} [2023-08-30 23:22:20,969 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 31 predicate places. [2023-08-30 23:22:20,969 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 74 transitions, 932 flow [2023-08-30 23:22:20,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.16666666666667) internal successors, (499), 6 states have internal predecessors, (499), 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) [2023-08-30 23:22:20,970 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:22:20,970 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:22:20,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 23:22:20,970 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:22:20,970 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:22:20,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1008496799, now seen corresponding path program 1 times [2023-08-30 23:22:20,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:22:20,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155987340] [2023-08-30 23:22:20,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:22:20,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:22:20,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:22:21,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:22:21,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:22:21,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155987340] [2023-08-30 23:22:21,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155987340] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:22:21,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:22:21,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 23:22:21,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137479301] [2023-08-30 23:22:21,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:22:21,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 23:22:21,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:22:21,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 23:22:21,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 23:22:21,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 197 [2023-08-30 23:22:21,488 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 74 transitions, 932 flow. Second operand has 6 states, 6 states have (on average 82.16666666666667) internal successors, (493), 6 states have internal predecessors, (493), 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) [2023-08-30 23:22:21,488 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:22:21,488 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 197 [2023-08-30 23:22:21,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:22:21,922 INFO L130 PetriNetUnfolder]: 1458/2272 cut-off events. [2023-08-30 23:22:21,923 INFO L131 PetriNetUnfolder]: For 13761/13761 co-relation queries the response was YES. [2023-08-30 23:22:21,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12623 conditions, 2272 events. 1458/2272 cut-off events. For 13761/13761 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 10807 event pairs, 160 based on Foata normal form. 9/2281 useless extension candidates. Maximal degree in co-relation 12588. Up to 1899 conditions per place. [2023-08-30 23:22:21,942 INFO L137 encePairwiseOnDemand]: 187/197 looper letters, 87 selfloop transitions, 43 changer transitions 12/142 dead transitions. [2023-08-30 23:22:21,942 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 142 transitions, 1977 flow [2023-08-30 23:22:21,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 23:22:21,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 23:22:21,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 626 transitions. [2023-08-30 23:22:21,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45395213923132705 [2023-08-30 23:22:21,945 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 626 transitions. [2023-08-30 23:22:21,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 626 transitions. [2023-08-30 23:22:21,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:22:21,946 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 626 transitions. [2023-08-30 23:22:21,947 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 89.42857142857143) internal successors, (626), 7 states have internal predecessors, (626), 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) [2023-08-30 23:22:21,949 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 197.0) internal successors, (1576), 8 states have internal predecessors, (1576), 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) [2023-08-30 23:22:21,949 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 197.0) internal successors, (1576), 8 states have internal predecessors, (1576), 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) [2023-08-30 23:22:21,950 INFO L175 Difference]: Start difference. First operand has 63 places, 74 transitions, 932 flow. Second operand 7 states and 626 transitions. [2023-08-30 23:22:21,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 142 transitions, 1977 flow [2023-08-30 23:22:21,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 142 transitions, 1933 flow, removed 19 selfloop flow, removed 1 redundant places. [2023-08-30 23:22:21,987 INFO L231 Difference]: Finished difference. Result has 70 places, 100 transitions, 1439 flow [2023-08-30 23:22:21,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=908, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1439, PETRI_PLACES=70, PETRI_TRANSITIONS=100} [2023-08-30 23:22:21,988 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 38 predicate places. [2023-08-30 23:22:21,988 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 100 transitions, 1439 flow [2023-08-30 23:22:21,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 82.16666666666667) internal successors, (493), 6 states have internal predecessors, (493), 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) [2023-08-30 23:22:21,989 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:22:21,989 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:22:21,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 23:22:21,989 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:22:21,989 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:22:21,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1005699359, now seen corresponding path program 2 times [2023-08-30 23:22:21,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:22:21,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039664498] [2023-08-30 23:22:21,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:22:21,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:22:22,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:22:22,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:22:22,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:22:22,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039664498] [2023-08-30 23:22:22,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039664498] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:22:22,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:22:22,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:22:22,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969895026] [2023-08-30 23:22:22,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:22:22,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:22:22,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:22:22,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:22:22,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:22:22,312 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 197 [2023-08-30 23:22:22,312 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 100 transitions, 1439 flow. Second operand has 5 states, 5 states have (on average 91.6) internal successors, (458), 5 states have internal predecessors, (458), 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) [2023-08-30 23:22:22,313 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:22:22,313 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 197 [2023-08-30 23:22:22,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:22:22,684 INFO L130 PetriNetUnfolder]: 1345/2178 cut-off events. [2023-08-30 23:22:22,684 INFO L131 PetriNetUnfolder]: For 18211/18300 co-relation queries the response was YES. [2023-08-30 23:22:22,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13284 conditions, 2178 events. 1345/2178 cut-off events. For 18211/18300 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 11427 event pairs, 166 based on Foata normal form. 95/2256 useless extension candidates. Maximal degree in co-relation 13246. Up to 1517 conditions per place. [2023-08-30 23:22:22,705 INFO L137 encePairwiseOnDemand]: 190/197 looper letters, 82 selfloop transitions, 29 changer transitions 1/127 dead transitions. [2023-08-30 23:22:22,705 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 127 transitions, 1954 flow [2023-08-30 23:22:22,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 23:22:22,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 23:22:22,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 576 transitions. [2023-08-30 23:22:22,708 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4873096446700508 [2023-08-30 23:22:22,708 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 576 transitions. [2023-08-30 23:22:22,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 576 transitions. [2023-08-30 23:22:22,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:22:22,709 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 576 transitions. [2023-08-30 23:22:22,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 96.0) internal successors, (576), 6 states have internal predecessors, (576), 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) [2023-08-30 23:22:22,712 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 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) [2023-08-30 23:22:22,713 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 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) [2023-08-30 23:22:22,713 INFO L175 Difference]: Start difference. First operand has 70 places, 100 transitions, 1439 flow. Second operand 6 states and 576 transitions. [2023-08-30 23:22:22,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 127 transitions, 1954 flow [2023-08-30 23:22:22,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 127 transitions, 1922 flow, removed 9 selfloop flow, removed 2 redundant places. [2023-08-30 23:22:22,750 INFO L231 Difference]: Finished difference. Result has 74 places, 108 transitions, 1637 flow [2023-08-30 23:22:22,750 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=1407, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1637, PETRI_PLACES=74, PETRI_TRANSITIONS=108} [2023-08-30 23:22:22,751 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 42 predicate places. [2023-08-30 23:22:22,751 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 108 transitions, 1637 flow [2023-08-30 23:22:22,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.6) internal successors, (458), 5 states have internal predecessors, (458), 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) [2023-08-30 23:22:22,752 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:22:22,752 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:22:22,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 23:22:22,752 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:22:22,752 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:22:22,753 INFO L85 PathProgramCache]: Analyzing trace with hash -643743733, now seen corresponding path program 3 times [2023-08-30 23:22:22,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:22:22,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059129652] [2023-08-30 23:22:22,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:22:22,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:22:22,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:22:23,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:22:23,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:22:23,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059129652] [2023-08-30 23:22:23,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059129652] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:22:23,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:22:23,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 23:22:23,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624593203] [2023-08-30 23:22:23,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:22:23,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 23:22:23,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:22:23,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 23:22:23,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 23:22:23,256 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 197 [2023-08-30 23:22:23,257 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 108 transitions, 1637 flow. Second operand has 6 states, 6 states have (on average 89.16666666666667) internal successors, (535), 6 states have internal predecessors, (535), 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) [2023-08-30 23:22:23,257 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:22:23,257 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 197 [2023-08-30 23:22:23,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:22:23,638 INFO L130 PetriNetUnfolder]: 1339/2183 cut-off events. [2023-08-30 23:22:23,639 INFO L131 PetriNetUnfolder]: For 20750/20913 co-relation queries the response was YES. [2023-08-30 23:22:23,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14277 conditions, 2183 events. 1339/2183 cut-off events. For 20750/20913 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 11556 event pairs, 177 based on Foata normal form. 168/2334 useless extension candidates. Maximal degree in co-relation 14237. Up to 1496 conditions per place. [2023-08-30 23:22:23,658 INFO L137 encePairwiseOnDemand]: 191/197 looper letters, 90 selfloop transitions, 20 changer transitions 1/126 dead transitions. [2023-08-30 23:22:23,659 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 126 transitions, 2072 flow [2023-08-30 23:22:23,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:22:23,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:22:23,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 469 transitions. [2023-08-30 23:22:23,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4761421319796954 [2023-08-30 23:22:23,661 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 469 transitions. [2023-08-30 23:22:23,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 469 transitions. [2023-08-30 23:22:23,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:22:23,662 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 469 transitions. [2023-08-30 23:22:23,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 93.8) internal successors, (469), 5 states have internal predecessors, (469), 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) [2023-08-30 23:22:23,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 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) [2023-08-30 23:22:23,664 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 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) [2023-08-30 23:22:23,664 INFO L175 Difference]: Start difference. First operand has 74 places, 108 transitions, 1637 flow. Second operand 5 states and 469 transitions. [2023-08-30 23:22:23,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 126 transitions, 2072 flow [2023-08-30 23:22:23,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 126 transitions, 2047 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-30 23:22:23,696 INFO L231 Difference]: Finished difference. Result has 76 places, 113 transitions, 1769 flow [2023-08-30 23:22:23,696 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=1612, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1769, PETRI_PLACES=76, PETRI_TRANSITIONS=113} [2023-08-30 23:22:23,697 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 44 predicate places. [2023-08-30 23:22:23,697 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 113 transitions, 1769 flow [2023-08-30 23:22:23,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.16666666666667) internal successors, (535), 6 states have internal predecessors, (535), 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) [2023-08-30 23:22:23,698 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:22:23,698 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:22:23,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 23:22:23,698 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:22:23,699 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:22:23,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1591098199, now seen corresponding path program 4 times [2023-08-30 23:22:23,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:22:23,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088149907] [2023-08-30 23:22:23,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:22:23,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:22:23,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:22:24,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:22:24,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:22:24,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088149907] [2023-08-30 23:22:24,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088149907] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:22:24,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:22:24,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 23:22:24,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358088729] [2023-08-30 23:22:24,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:22:24,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 23:22:24,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:22:24,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 23:22:24,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-30 23:22:24,219 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 197 [2023-08-30 23:22:24,220 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 113 transitions, 1769 flow. Second operand has 7 states, 7 states have (on average 81.85714285714286) internal successors, (573), 7 states have internal predecessors, (573), 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) [2023-08-30 23:22:24,220 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:22:24,220 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 197 [2023-08-30 23:22:24,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:22:24,734 INFO L130 PetriNetUnfolder]: 1660/2622 cut-off events. [2023-08-30 23:22:24,734 INFO L131 PetriNetUnfolder]: For 25785/25785 co-relation queries the response was YES. [2023-08-30 23:22:24,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17203 conditions, 2622 events. 1660/2622 cut-off events. For 25785/25785 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 13303 event pairs, 268 based on Foata normal form. 16/2638 useless extension candidates. Maximal degree in co-relation 17162. Up to 1611 conditions per place. [2023-08-30 23:22:24,758 INFO L137 encePairwiseOnDemand]: 190/197 looper letters, 109 selfloop transitions, 45 changer transitions 14/168 dead transitions. [2023-08-30 23:22:24,758 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 168 transitions, 2817 flow [2023-08-30 23:22:24,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 23:22:24,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 23:22:24,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 537 transitions. [2023-08-30 23:22:24,760 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4543147208121827 [2023-08-30 23:22:24,760 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 537 transitions. [2023-08-30 23:22:24,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 537 transitions. [2023-08-30 23:22:24,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:22:24,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 537 transitions. [2023-08-30 23:22:24,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 89.5) internal successors, (537), 6 states have internal predecessors, (537), 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) [2023-08-30 23:22:24,764 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 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) [2023-08-30 23:22:24,764 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 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) [2023-08-30 23:22:24,764 INFO L175 Difference]: Start difference. First operand has 76 places, 113 transitions, 1769 flow. Second operand 6 states and 537 transitions. [2023-08-30 23:22:24,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 168 transitions, 2817 flow [2023-08-30 23:22:24,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 168 transitions, 2776 flow, removed 16 selfloop flow, removed 2 redundant places. [2023-08-30 23:22:24,810 INFO L231 Difference]: Finished difference. Result has 81 places, 117 transitions, 1940 flow [2023-08-30 23:22:24,810 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=1736, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1940, PETRI_PLACES=81, PETRI_TRANSITIONS=117} [2023-08-30 23:22:24,811 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 49 predicate places. [2023-08-30 23:22:24,812 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 117 transitions, 1940 flow [2023-08-30 23:22:24,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 81.85714285714286) internal successors, (573), 7 states have internal predecessors, (573), 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) [2023-08-30 23:22:24,812 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:22:24,812 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:22:24,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 23:22:24,813 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:22:24,813 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:22:24,813 INFO L85 PathProgramCache]: Analyzing trace with hash 933724453, now seen corresponding path program 1 times [2023-08-30 23:22:24,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:22:24,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543710323] [2023-08-30 23:22:24,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:22:24,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:22:24,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:22:25,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:22:25,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:22:25,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543710323] [2023-08-30 23:22:25,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543710323] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:22:25,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:22:25,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:22:25,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75590051] [2023-08-30 23:22:25,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:22:25,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:22:25,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:22:25,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:22:25,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:22:25,451 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 197 [2023-08-30 23:22:25,451 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 117 transitions, 1940 flow. Second operand has 4 states, 4 states have (on average 86.25) internal successors, (345), 4 states have internal predecessors, (345), 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) [2023-08-30 23:22:25,451 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:22:25,451 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 197 [2023-08-30 23:22:25,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:22:25,977 INFO L130 PetriNetUnfolder]: 1842/3064 cut-off events. [2023-08-30 23:22:25,977 INFO L131 PetriNetUnfolder]: For 33668/33889 co-relation queries the response was YES. [2023-08-30 23:22:25,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20350 conditions, 3064 events. 1842/3064 cut-off events. For 33668/33889 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 17984 event pairs, 296 based on Foata normal form. 233/3273 useless extension candidates. Maximal degree in co-relation 20307. Up to 1393 conditions per place. [2023-08-30 23:22:26,004 INFO L137 encePairwiseOnDemand]: 187/197 looper letters, 106 selfloop transitions, 29 changer transitions 16/154 dead transitions. [2023-08-30 23:22:26,004 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 154 transitions, 2694 flow [2023-08-30 23:22:26,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 23:22:26,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 23:22:26,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 377 transitions. [2023-08-30 23:22:26,006 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4784263959390863 [2023-08-30 23:22:26,006 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 377 transitions. [2023-08-30 23:22:26,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 377 transitions. [2023-08-30 23:22:26,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:22:26,007 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 377 transitions. [2023-08-30 23:22:26,008 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 94.25) internal successors, (377), 4 states have internal predecessors, (377), 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) [2023-08-30 23:22:26,009 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 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) [2023-08-30 23:22:26,009 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 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) [2023-08-30 23:22:26,010 INFO L175 Difference]: Start difference. First operand has 81 places, 117 transitions, 1940 flow. Second operand 4 states and 377 transitions. [2023-08-30 23:22:26,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 154 transitions, 2694 flow [2023-08-30 23:22:26,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 154 transitions, 2640 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-30 23:22:26,062 INFO L231 Difference]: Finished difference. Result has 84 places, 110 transitions, 1916 flow [2023-08-30 23:22:26,063 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=1895, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1916, PETRI_PLACES=84, PETRI_TRANSITIONS=110} [2023-08-30 23:22:26,064 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 52 predicate places. [2023-08-30 23:22:26,064 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 110 transitions, 1916 flow [2023-08-30 23:22:26,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.25) internal successors, (345), 4 states have internal predecessors, (345), 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) [2023-08-30 23:22:26,064 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:22:26,064 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:22:26,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 23:22:26,065 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:22:26,065 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:22:26,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1198718836, now seen corresponding path program 1 times [2023-08-30 23:22:26,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:22:26,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86483714] [2023-08-30 23:22:26,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:22:26,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:22:26,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:22:26,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:22:26,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:22:26,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86483714] [2023-08-30 23:22:26,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86483714] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:22:26,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:22:26,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 23:22:26,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548680898] [2023-08-30 23:22:26,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:22:26,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 23:22:26,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:22:26,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 23:22:26,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-30 23:22:26,653 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 197 [2023-08-30 23:22:26,654 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 110 transitions, 1916 flow. Second operand has 6 states, 6 states have (on average 89.33333333333333) internal successors, (536), 6 states have internal predecessors, (536), 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) [2023-08-30 23:22:26,654 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:22:26,654 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 197 [2023-08-30 23:22:26,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:22:27,164 INFO L130 PetriNetUnfolder]: 1421/2445 cut-off events. [2023-08-30 23:22:27,164 INFO L131 PetriNetUnfolder]: For 30953/31324 co-relation queries the response was YES. [2023-08-30 23:22:27,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16280 conditions, 2445 events. 1421/2445 cut-off events. For 30953/31324 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 14568 event pairs, 267 based on Foata normal form. 157/2574 useless extension candidates. Maximal degree in co-relation 16234. Up to 1468 conditions per place. [2023-08-30 23:22:27,183 INFO L137 encePairwiseOnDemand]: 191/197 looper letters, 75 selfloop transitions, 39 changer transitions 30/150 dead transitions. [2023-08-30 23:22:27,183 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 150 transitions, 2650 flow [2023-08-30 23:22:27,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 23:22:27,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 23:22:27,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 664 transitions. [2023-08-30 23:22:27,186 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4815083393763597 [2023-08-30 23:22:27,186 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 664 transitions. [2023-08-30 23:22:27,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 664 transitions. [2023-08-30 23:22:27,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:22:27,187 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 664 transitions. [2023-08-30 23:22:27,188 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 94.85714285714286) internal successors, (664), 7 states have internal predecessors, (664), 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) [2023-08-30 23:22:27,190 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 197.0) internal successors, (1576), 8 states have internal predecessors, (1576), 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) [2023-08-30 23:22:27,190 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 197.0) internal successors, (1576), 8 states have internal predecessors, (1576), 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) [2023-08-30 23:22:27,190 INFO L175 Difference]: Start difference. First operand has 84 places, 110 transitions, 1916 flow. Second operand 7 states and 664 transitions. [2023-08-30 23:22:27,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 150 transitions, 2650 flow [2023-08-30 23:22:27,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 150 transitions, 2599 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 23:22:27,244 INFO L231 Difference]: Finished difference. Result has 91 places, 93 transitions, 1715 flow [2023-08-30 23:22:27,245 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=1872, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1715, PETRI_PLACES=91, PETRI_TRANSITIONS=93} [2023-08-30 23:22:27,245 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 59 predicate places. [2023-08-30 23:22:27,245 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 93 transitions, 1715 flow [2023-08-30 23:22:27,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.33333333333333) internal successors, (536), 6 states have internal predecessors, (536), 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) [2023-08-30 23:22:27,246 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:22:27,246 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:22:27,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 23:22:27,246 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:22:27,247 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:22:27,247 INFO L85 PathProgramCache]: Analyzing trace with hash -597213392, now seen corresponding path program 1 times [2023-08-30 23:22:27,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:22:27,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527302401] [2023-08-30 23:22:27,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:22:27,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:22:27,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:22:27,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:22:27,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:22:27,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527302401] [2023-08-30 23:22:27,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527302401] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:22:27,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:22:27,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:22:27,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590657503] [2023-08-30 23:22:27,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:22:27,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:22:27,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:22:27,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:22:27,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:22:27,431 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 197 [2023-08-30 23:22:27,431 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 93 transitions, 1715 flow. Second operand has 4 states, 4 states have (on average 88.25) internal successors, (353), 4 states have internal predecessors, (353), 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) [2023-08-30 23:22:27,432 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:22:27,432 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 197 [2023-08-30 23:22:27,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:22:27,644 INFO L130 PetriNetUnfolder]: 513/950 cut-off events. [2023-08-30 23:22:27,644 INFO L131 PetriNetUnfolder]: For 19063/19232 co-relation queries the response was YES. [2023-08-30 23:22:27,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6577 conditions, 950 events. 513/950 cut-off events. For 19063/19232 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 5197 event pairs, 76 based on Foata normal form. 293/1240 useless extension candidates. Maximal degree in co-relation 6528. Up to 576 conditions per place. [2023-08-30 23:22:27,652 INFO L137 encePairwiseOnDemand]: 191/197 looper letters, 72 selfloop transitions, 4 changer transitions 62/146 dead transitions. [2023-08-30 23:22:27,652 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 146 transitions, 2874 flow [2023-08-30 23:22:27,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:22:27,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:22:27,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 471 transitions. [2023-08-30 23:22:27,654 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4781725888324873 [2023-08-30 23:22:27,654 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 471 transitions. [2023-08-30 23:22:27,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 471 transitions. [2023-08-30 23:22:27,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:22:27,655 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 471 transitions. [2023-08-30 23:22:27,656 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 94.2) internal successors, (471), 5 states have internal predecessors, (471), 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) [2023-08-30 23:22:27,658 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 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) [2023-08-30 23:22:27,659 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 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) [2023-08-30 23:22:27,659 INFO L175 Difference]: Start difference. First operand has 91 places, 93 transitions, 1715 flow. Second operand 5 states and 471 transitions. [2023-08-30 23:22:27,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 146 transitions, 2874 flow [2023-08-30 23:22:27,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 146 transitions, 2432 flow, removed 89 selfloop flow, removed 17 redundant places. [2023-08-30 23:22:27,682 INFO L231 Difference]: Finished difference. Result has 81 places, 66 transitions, 987 flow [2023-08-30 23:22:27,683 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=931, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=987, PETRI_PLACES=81, PETRI_TRANSITIONS=66} [2023-08-30 23:22:27,684 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 49 predicate places. [2023-08-30 23:22:27,684 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 66 transitions, 987 flow [2023-08-30 23:22:27,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.25) internal successors, (353), 4 states have internal predecessors, (353), 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) [2023-08-30 23:22:27,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:22:27,684 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:22:27,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-30 23:22:27,685 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:22:27,685 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:22:27,685 INFO L85 PathProgramCache]: Analyzing trace with hash 157601065, now seen corresponding path program 1 times [2023-08-30 23:22:27,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:22:27,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831518621] [2023-08-30 23:22:27,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:22:27,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:22:27,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:22:27,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:22:27,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:22:27,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831518621] [2023-08-30 23:22:27,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831518621] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:22:27,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:22:27,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 23:22:27,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141940674] [2023-08-30 23:22:27,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:22:27,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:22:27,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:22:27,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:22:27,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:22:27,865 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 197 [2023-08-30 23:22:27,865 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 66 transitions, 987 flow. Second operand has 5 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 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) [2023-08-30 23:22:27,866 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:22:27,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 197 [2023-08-30 23:22:27,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:22:28,017 INFO L130 PetriNetUnfolder]: 238/489 cut-off events. [2023-08-30 23:22:28,018 INFO L131 PetriNetUnfolder]: For 8386/8475 co-relation queries the response was YES. [2023-08-30 23:22:28,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3189 conditions, 489 events. 238/489 cut-off events. For 8386/8475 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2454 event pairs, 10 based on Foata normal form. 164/651 useless extension candidates. Maximal degree in co-relation 3148. Up to 228 conditions per place. [2023-08-30 23:22:28,022 INFO L137 encePairwiseOnDemand]: 191/197 looper letters, 71 selfloop transitions, 7 changer transitions 40/126 dead transitions. [2023-08-30 23:22:28,022 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 126 transitions, 2043 flow [2023-08-30 23:22:28,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 23:22:28,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 23:22:28,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 562 transitions. [2023-08-30 23:22:28,025 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4754653130287648 [2023-08-30 23:22:28,025 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 562 transitions. [2023-08-30 23:22:28,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 562 transitions. [2023-08-30 23:22:28,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:22:28,026 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 562 transitions. [2023-08-30 23:22:28,027 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 93.66666666666667) internal successors, (562), 6 states have internal predecessors, (562), 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) [2023-08-30 23:22:28,029 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 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) [2023-08-30 23:22:28,029 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 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) [2023-08-30 23:22:28,029 INFO L175 Difference]: Start difference. First operand has 81 places, 66 transitions, 987 flow. Second operand 6 states and 562 transitions. [2023-08-30 23:22:28,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 126 transitions, 2043 flow [2023-08-30 23:22:28,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 126 transitions, 1947 flow, removed 25 selfloop flow, removed 6 redundant places. [2023-08-30 23:22:28,042 INFO L231 Difference]: Finished difference. Result has 81 places, 62 transitions, 851 flow [2023-08-30 23:22:28,042 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=833, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=851, PETRI_PLACES=81, PETRI_TRANSITIONS=62} [2023-08-30 23:22:28,043 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 49 predicate places. [2023-08-30 23:22:28,043 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 62 transitions, 851 flow [2023-08-30 23:22:28,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 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) [2023-08-30 23:22:28,043 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:22:28,044 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:22:28,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-30 23:22:28,044 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:22:28,044 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:22:28,044 INFO L85 PathProgramCache]: Analyzing trace with hash 427456573, now seen corresponding path program 1 times [2023-08-30 23:22:28,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:22:28,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165810476] [2023-08-30 23:22:28,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:22:28,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:22:28,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:22:28,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:22:28,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:22:28,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165810476] [2023-08-30 23:22:28,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165810476] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:22:28,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:22:28,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 23:22:28,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107853531] [2023-08-30 23:22:28,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:22:28,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 23:22:28,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:22:28,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 23:22:28,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 23:22:28,226 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 197 [2023-08-30 23:22:28,227 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 62 transitions, 851 flow. Second operand has 6 states, 6 states have (on average 87.5) internal successors, (525), 6 states have internal predecessors, (525), 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) [2023-08-30 23:22:28,227 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:22:28,227 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 197 [2023-08-30 23:22:28,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:22:28,354 INFO L130 PetriNetUnfolder]: 121/278 cut-off events. [2023-08-30 23:22:28,354 INFO L131 PetriNetUnfolder]: For 3176/3234 co-relation queries the response was YES. [2023-08-30 23:22:28,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1858 conditions, 278 events. 121/278 cut-off events. For 3176/3234 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1232 event pairs, 4 based on Foata normal form. 71/346 useless extension candidates. Maximal degree in co-relation 1817. Up to 126 conditions per place. [2023-08-30 23:22:28,356 INFO L137 encePairwiseOnDemand]: 191/197 looper letters, 36 selfloop transitions, 10 changer transitions 44/94 dead transitions. [2023-08-30 23:22:28,357 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 94 transitions, 1413 flow [2023-08-30 23:22:28,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 23:22:28,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 23:22:28,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 639 transitions. [2023-08-30 23:22:28,360 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46337926033357507 [2023-08-30 23:22:28,360 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 639 transitions. [2023-08-30 23:22:28,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 639 transitions. [2023-08-30 23:22:28,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:22:28,361 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 639 transitions. [2023-08-30 23:22:28,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 91.28571428571429) internal successors, (639), 7 states have internal predecessors, (639), 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) [2023-08-30 23:22:28,365 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 197.0) internal successors, (1576), 8 states have internal predecessors, (1576), 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) [2023-08-30 23:22:28,365 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 197.0) internal successors, (1576), 8 states have internal predecessors, (1576), 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) [2023-08-30 23:22:28,365 INFO L175 Difference]: Start difference. First operand has 81 places, 62 transitions, 851 flow. Second operand 7 states and 639 transitions. [2023-08-30 23:22:28,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 94 transitions, 1413 flow [2023-08-30 23:22:28,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 94 transitions, 1227 flow, removed 47 selfloop flow, removed 10 redundant places. [2023-08-30 23:22:28,374 INFO L231 Difference]: Finished difference. Result has 78 places, 35 transitions, 351 flow [2023-08-30 23:22:28,374 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=351, PETRI_PLACES=78, PETRI_TRANSITIONS=35} [2023-08-30 23:22:28,374 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 46 predicate places. [2023-08-30 23:22:28,375 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 35 transitions, 351 flow [2023-08-30 23:22:28,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 87.5) internal successors, (525), 6 states have internal predecessors, (525), 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) [2023-08-30 23:22:28,375 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:22:28,375 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:22:28,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-30 23:22:28,376 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:22:28,376 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:22:28,376 INFO L85 PathProgramCache]: Analyzing trace with hash -554742058, now seen corresponding path program 1 times [2023-08-30 23:22:28,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:22:28,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549680350] [2023-08-30 23:22:28,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:22:28,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:22:28,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 23:22:28,408 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 23:22:28,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 23:22:28,490 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 23:22:28,491 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 23:22:28,492 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-08-30 23:22:28,494 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-08-30 23:22:28,494 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-08-30 23:22:28,494 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-08-30 23:22:28,495 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-08-30 23:22:28,495 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-08-30 23:22:28,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-30 23:22:28,495 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:22:28,500 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 23:22:28,501 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 23:22:28,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 11:22:28 BasicIcfg [2023-08-30 23:22:28,577 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 23:22:28,578 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 23:22:28,578 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 23:22:28,578 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 23:22:28,578 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:22:07" (3/4) ... [2023-08-30 23:22:28,580 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 23:22:28,666 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 23:22:28,667 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 23:22:28,667 INFO L158 Benchmark]: Toolchain (without parser) took 22143.20ms. Allocated memory was 73.4MB in the beginning and 572.5MB in the end (delta: 499.1MB). Free memory was 44.9MB in the beginning and 479.9MB in the end (delta: -435.0MB). Peak memory consumption was 65.2MB. Max. memory is 16.1GB. [2023-08-30 23:22:28,668 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 58.7MB. Free memory was 36.4MB in the beginning and 36.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 23:22:28,668 INFO L158 Benchmark]: CACSL2BoogieTranslator took 457.60ms. Allocated memory is still 73.4MB. Free memory was 44.8MB in the beginning and 39.7MB in the end (delta: 5.1MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. [2023-08-30 23:22:28,668 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.81ms. Allocated memory is still 73.4MB. Free memory was 39.7MB in the beginning and 36.9MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-30 23:22:28,668 INFO L158 Benchmark]: Boogie Preprocessor took 25.10ms. Allocated memory is still 73.4MB. Free memory was 36.9MB in the beginning and 35.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 23:22:28,669 INFO L158 Benchmark]: RCFGBuilder took 779.67ms. Allocated memory is still 73.4MB. Free memory was 35.1MB in the beginning and 45.0MB in the end (delta: -9.9MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. [2023-08-30 23:22:28,669 INFO L158 Benchmark]: TraceAbstraction took 20733.97ms. Allocated memory was 73.4MB in the beginning and 572.5MB in the end (delta: 499.1MB). Free memory was 44.2MB in the beginning and 489.4MB in the end (delta: -445.1MB). Peak memory consumption was 53.9MB. Max. memory is 16.1GB. [2023-08-30 23:22:28,669 INFO L158 Benchmark]: Witness Printer took 89.09ms. Allocated memory is still 572.5MB. Free memory was 489.4MB in the beginning and 479.9MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-08-30 23:22:28,671 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.18ms. Allocated memory is still 58.7MB. Free memory was 36.4MB in the beginning and 36.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 457.60ms. Allocated memory is still 73.4MB. Free memory was 44.8MB in the beginning and 39.7MB in the end (delta: 5.1MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.81ms. Allocated memory is still 73.4MB. Free memory was 39.7MB in the beginning and 36.9MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.10ms. Allocated memory is still 73.4MB. Free memory was 36.9MB in the beginning and 35.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 779.67ms. Allocated memory is still 73.4MB. Free memory was 35.1MB in the beginning and 45.0MB in the end (delta: -9.9MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. * TraceAbstraction took 20733.97ms. Allocated memory was 73.4MB in the beginning and 572.5MB in the end (delta: 499.1MB). Free memory was 44.2MB in the beginning and 489.4MB in the end (delta: -445.1MB). Peak memory consumption was 53.9MB. Max. memory is 16.1GB. * Witness Printer took 89.09ms. Allocated memory is still 572.5MB. Free memory was 489.4MB in the beginning and 479.9MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.0s, 110 PlacesBefore, 32 PlacesAfterwards, 102 TransitionsBefore, 22 TransitionsAfterwards, 1776 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 92 TotalNumberOfCompositions, 4534 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1956, independent: 1791, independent conditional: 0, independent unconditional: 1791, dependent: 165, dependent conditional: 0, dependent unconditional: 165, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 993, independent: 945, independent conditional: 0, independent unconditional: 945, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1956, independent: 846, independent conditional: 0, independent unconditional: 846, dependent: 117, dependent conditional: 0, dependent unconditional: 117, unknown: 993, unknown conditional: 0, unknown unconditional: 993] , Statistics on independence cache: Total cache size (in pairs): 58, Positive cache size: 44, Positive conditional cache size: 0, Positive unconditional cache size: 44, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L716] 0 _Bool y$flush_delayed; [L717] 0 int y$mem_tmp; [L718] 0 _Bool y$r_buff0_thd0; [L719] 0 _Bool y$r_buff0_thd1; [L720] 0 _Bool y$r_buff0_thd2; [L721] 0 _Bool y$r_buff0_thd3; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$r_buff1_thd3; [L726] 0 _Bool y$read_delayed; [L727] 0 int *y$read_delayed_var; [L728] 0 int y$w_buff0; [L729] 0 _Bool y$w_buff0_used; [L730] 0 int y$w_buff1; [L731] 0 _Bool y$w_buff1_used; [L733] 0 int z = 0; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L811] 0 pthread_t t2492; [L812] FCALL, FORK 0 pthread_create(&t2492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2492, ((void *)0), P0, ((void *)0))=-2, t2492={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L813] 0 pthread_t t2493; [L814] FCALL, FORK 0 pthread_create(&t2493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2493, ((void *)0), P1, ((void *)0))=-1, t2492={5:0}, t2493={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L815] 0 pthread_t t2494; [L816] FCALL, FORK 0 pthread_create(&t2494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2494, ((void *)0), P2, ((void *)0))=0, t2492={5:0}, t2493={6:0}, t2494={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L774] 3 y$w_buff1 = y$w_buff0 [L775] 3 y$w_buff0 = 2 [L776] 3 y$w_buff1_used = y$w_buff0_used [L777] 3 y$w_buff0_used = (_Bool)1 [L778] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L778] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L786] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L739] 1 z = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L742] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L754] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L757] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L760] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L789] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L792] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 2 return 0; [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L749] 1 return 0; [L796] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 3 return 0; [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2492={5:0}, t2493={6:0}, t2494={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y [L833] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L834] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L837] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L839] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L841] 0 y = y$flush_delayed ? y$mem_tmp : y [L842] 0 y$flush_delayed = (_Bool)0 [L844] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 812]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 131 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 20.5s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 663 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 491 mSDsluCounter, 306 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 183 mSDsCounter, 218 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1484 IncrementalHoareTripleChecker+Invalid, 1702 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 218 mSolverCounterUnsat, 123 mSDtfsCounter, 1484 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1940occurred in iteration=13, InterpolantAutomatonStates: 89, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 8.3s InterpolantComputationTime, 242 NumberOfCodeBlocks, 242 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 204 ConstructedInterpolants, 0 QuantifiedInterpolants, 2269 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 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! [2023-08-30 23:22:28,703 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