./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --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/mix029_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 0b278c8af08551c2e27294e2c5dca8c5bd0f6f00874366f88466c32210c557af --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-09-01 09:48:37,795 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 09:48:37,798 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 09:48:37,841 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 09:48:37,842 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 09:48:37,845 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 09:48:37,847 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 09:48:37,850 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 09:48:37,852 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 09:48:37,856 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 09:48:37,857 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 09:48:37,859 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 09:48:37,860 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 09:48:37,861 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 09:48:37,863 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 09:48:37,868 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 09:48:37,868 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 09:48:37,870 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 09:48:37,871 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 09:48:37,876 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 09:48:37,877 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 09:48:37,878 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 09:48:37,879 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 09:48:37,880 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 09:48:37,886 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 09:48:37,886 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 09:48:37,886 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 09:48:37,888 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 09:48:37,889 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 09:48:37,889 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 09:48:37,890 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 09:48:37,891 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 09:48:37,893 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 09:48:37,894 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 09:48:37,894 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 09:48:37,894 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 09:48:37,895 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 09:48:37,895 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 09:48:37,895 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 09:48:37,896 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 09:48:37,897 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 09:48:37,898 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-09-01 09:48:37,932 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 09:48:37,932 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 09:48:37,933 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 09:48:37,933 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 09:48:37,934 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 09:48:37,934 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 09:48:37,935 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 09:48:37,935 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 09:48:37,935 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 09:48:37,936 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 09:48:37,936 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 09:48:37,937 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 09:48:37,937 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 09:48:37,937 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 09:48:37,937 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-01 09:48:37,937 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 09:48:37,938 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-01 09:48:37,938 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 09:48:37,938 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-09-01 09:48:37,938 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 09:48:37,938 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-01 09:48:37,938 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 09:48:37,939 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 09:48:37,939 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 09:48:37,939 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:48:37,939 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 09:48:37,939 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 09:48:37,940 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-01 09:48:37,940 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 09:48:37,940 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 09:48:37,940 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 09:48:37,940 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-01 09:48:37,941 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 09:48:37,941 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 09:48:37,941 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 09:48:37,941 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 -> 0b278c8af08551c2e27294e2c5dca8c5bd0f6f00874366f88466c32210c557af 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 -> BEFORE [2023-09-01 09:48:38,260 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 09:48:38,279 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 09:48:38,281 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 09:48:38,282 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 09:48:38,282 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 09:48:38,283 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i [2023-09-01 09:48:39,585 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 09:48:39,912 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 09:48:39,913 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i [2023-09-01 09:48:39,927 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76c1ea4cd/06a3b489c6774d09b16c8cef912f449d/FLAG55652c123 [2023-09-01 09:48:39,939 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76c1ea4cd/06a3b489c6774d09b16c8cef912f449d [2023-09-01 09:48:39,941 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 09:48:39,942 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 09:48:39,943 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 09:48:39,943 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 09:48:39,946 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 09:48:39,946 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:48:39" (1/1) ... [2023-09-01 09:48:39,947 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c614661 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:48:39, skipping insertion in model container [2023-09-01 09:48:39,947 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:48:39" (1/1) ... [2023-09-01 09:48:39,953 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 09:48:40,006 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 09:48:40,123 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/mix029_power.opt_pso.opt_rmo.opt.i[966,979] [2023-09-01 09:48:40,335 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:48:40,344 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 09:48:40,359 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/mix029_power.opt_pso.opt_rmo.opt.i[966,979] [2023-09-01 09:48:40,426 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:48:40,464 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:48:40,464 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:48:40,470 INFO L208 MainTranslator]: Completed translation [2023-09-01 09:48:40,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:48:40 WrapperNode [2023-09-01 09:48:40,471 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 09:48:40,472 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 09:48:40,472 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 09:48:40,472 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 09:48:40,478 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:48:40" (1/1) ... [2023-09-01 09:48:40,508 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:48:40" (1/1) ... [2023-09-01 09:48:40,549 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 161 [2023-09-01 09:48:40,555 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 09:48:40,556 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 09:48:40,556 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 09:48:40,556 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 09:48:40,563 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:48:40" (1/1) ... [2023-09-01 09:48:40,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:48:40" (1/1) ... [2023-09-01 09:48:40,567 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:48:40" (1/1) ... [2023-09-01 09:48:40,567 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:48:40" (1/1) ... [2023-09-01 09:48:40,577 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:48:40" (1/1) ... [2023-09-01 09:48:40,587 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:48:40" (1/1) ... [2023-09-01 09:48:40,589 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:48:40" (1/1) ... [2023-09-01 09:48:40,594 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:48:40" (1/1) ... [2023-09-01 09:48:40,602 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 09:48:40,606 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 09:48:40,606 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 09:48:40,606 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 09:48:40,607 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:48:40" (1/1) ... [2023-09-01 09:48:40,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:48:40,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 09:48:40,637 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-09-01 09:48:40,657 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-09-01 09:48:40,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 09:48:40,673 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-01 09:48:40,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 09:48:40,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 09:48:40,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 09:48:40,675 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-09-01 09:48:40,676 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-09-01 09:48:40,676 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-09-01 09:48:40,676 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-09-01 09:48:40,676 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-09-01 09:48:40,676 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-09-01 09:48:40,676 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-09-01 09:48:40,677 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-09-01 09:48:40,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 09:48:40,677 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-01 09:48:40,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 09:48:40,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 09:48:40,678 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-01 09:48:40,861 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 09:48:40,871 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 09:48:41,155 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 09:48:41,256 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 09:48:41,256 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-09-01 09:48:41,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:48:41 BoogieIcfgContainer [2023-09-01 09:48:41,259 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 09:48:41,261 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 09:48:41,261 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 09:48:41,264 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 09:48:41,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 09:48:39" (1/3) ... [2023-09-01 09:48:41,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b29f34b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:48:41, skipping insertion in model container [2023-09-01 09:48:41,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:48:40" (2/3) ... [2023-09-01 09:48:41,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b29f34b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:48:41, skipping insertion in model container [2023-09-01 09:48:41,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:48:41" (3/3) ... [2023-09-01 09:48:41,266 INFO L112 eAbstractionObserver]: Analyzing ICFG mix029_power.opt_pso.opt_rmo.opt.i [2023-09-01 09:48:41,273 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-01 09:48:41,282 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 09:48:41,282 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-09-01 09:48:41,282 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 09:48:41,345 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-09-01 09:48:41,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 278 flow [2023-09-01 09:48:41,457 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2023-09-01 09:48:41,457 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:48:41,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-09-01 09:48:41,463 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 129 transitions, 278 flow [2023-09-01 09:48:41,470 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 125 transitions, 262 flow [2023-09-01 09:48:41,473 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 09:48:41,486 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 125 transitions, 262 flow [2023-09-01 09:48:41,490 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 125 transitions, 262 flow [2023-09-01 09:48:41,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 125 transitions, 262 flow [2023-09-01 09:48:41,539 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2023-09-01 09:48:41,540 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:48:41,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-09-01 09:48:41,545 INFO L119 LiptonReduction]: Number of co-enabled transitions 2986 [2023-09-01 09:48:45,251 INFO L134 LiptonReduction]: Checked pairs total: 8489 [2023-09-01 09:48:45,251 INFO L136 LiptonReduction]: Total number of compositions: 106 [2023-09-01 09:48:45,263 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 09:48:45,268 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;@5084c9df, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 09:48:45,269 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-09-01 09:48:45,274 INFO L130 PetriNetUnfolder]: 0/13 cut-off events. [2023-09-01 09:48:45,274 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:48:45,274 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:48:45,275 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:48:45,275 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:48:45,279 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:48:45,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1745103999, now seen corresponding path program 1 times [2023-09-01 09:48:45,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:48:45,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980346596] [2023-09-01 09:48:45,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:48:45,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:48:45,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:48:45,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:48:45,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:48:45,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980346596] [2023-09-01 09:48:45,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980346596] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:48:45,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:48:45,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:48:45,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056688400] [2023-09-01 09:48:45,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:48:45,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:48:45,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:48:45,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:48:45,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:48:45,751 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 235 [2023-09-01 09:48:45,755 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 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-09-01 09:48:45,756 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:48:45,756 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 235 [2023-09-01 09:48:45,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:48:46,554 INFO L130 PetriNetUnfolder]: 3975/5715 cut-off events. [2023-09-01 09:48:46,555 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2023-09-01 09:48:46,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11295 conditions, 5715 events. 3975/5715 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 30661 event pairs, 1089 based on Foata normal form. 192/5483 useless extension candidates. Maximal degree in co-relation 11283. Up to 4303 conditions per place. [2023-09-01 09:48:46,588 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 35 selfloop transitions, 2 changer transitions 4/46 dead transitions. [2023-09-01 09:48:46,588 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 46 transitions, 189 flow [2023-09-01 09:48:46,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:48:46,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:48:46,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 386 transitions. [2023-09-01 09:48:46,604 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5475177304964539 [2023-09-01 09:48:46,604 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 386 transitions. [2023-09-01 09:48:46,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 386 transitions. [2023-09-01 09:48:46,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:48:46,608 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 386 transitions. [2023-09-01 09:48:46,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 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-09-01 09:48:46,620 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 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-09-01 09:48:46,621 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 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-09-01 09:48:46,622 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 76 flow. Second operand 3 states and 386 transitions. [2023-09-01 09:48:46,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 46 transitions, 189 flow [2023-09-01 09:48:46,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 46 transitions, 184 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-09-01 09:48:46,629 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 68 flow [2023-09-01 09:48:46,631 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2023-09-01 09:48:46,635 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2023-09-01 09:48:46,636 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 68 flow [2023-09-01 09:48:46,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 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-09-01 09:48:46,639 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:48:46,640 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:48:46,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 09:48:46,641 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:48:46,649 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:48:46,650 INFO L85 PathProgramCache]: Analyzing trace with hash 2095058766, now seen corresponding path program 1 times [2023-09-01 09:48:46,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:48:46,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387883910] [2023-09-01 09:48:46,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:48:46,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:48:46,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:48:47,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:48:47,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:48:47,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387883910] [2023-09-01 09:48:47,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387883910] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:48:47,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:48:47,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 09:48:47,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059886446] [2023-09-01 09:48:47,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:48:47,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:48:47,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:48:47,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:48:47,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:48:47,101 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 235 [2023-09-01 09:48:47,102 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 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-09-01 09:48:47,102 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:48:47,102 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 235 [2023-09-01 09:48:47,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:48:47,814 INFO L130 PetriNetUnfolder]: 3957/5913 cut-off events. [2023-09-01 09:48:47,814 INFO L131 PetriNetUnfolder]: For 279/279 co-relation queries the response was YES. [2023-09-01 09:48:47,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11857 conditions, 5913 events. 3957/5913 cut-off events. For 279/279 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 33527 event pairs, 1037 based on Foata normal form. 240/6077 useless extension candidates. Maximal degree in co-relation 11847. Up to 4369 conditions per place. [2023-09-01 09:48:47,843 INFO L137 encePairwiseOnDemand]: 230/235 looper letters, 33 selfloop transitions, 3 changer transitions 21/61 dead transitions. [2023-09-01 09:48:47,843 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 61 transitions, 256 flow [2023-09-01 09:48:47,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:48:47,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:48:47,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 614 transitions. [2023-09-01 09:48:47,846 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5225531914893617 [2023-09-01 09:48:47,846 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 614 transitions. [2023-09-01 09:48:47,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 614 transitions. [2023-09-01 09:48:47,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:48:47,847 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 614 transitions. [2023-09-01 09:48:47,848 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.8) internal successors, (614), 5 states have internal predecessors, (614), 0 states have call successors, (0), 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-09-01 09:48:47,851 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 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-09-01 09:48:47,852 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 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-09-01 09:48:47,852 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 68 flow. Second operand 5 states and 614 transitions. [2023-09-01 09:48:47,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 61 transitions, 256 flow [2023-09-01 09:48:47,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 61 transitions, 246 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:48:47,855 INFO L231 Difference]: Finished difference. Result has 44 places, 30 transitions, 91 flow [2023-09-01 09:48:47,855 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=91, PETRI_PLACES=44, PETRI_TRANSITIONS=30} [2023-09-01 09:48:47,857 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 0 predicate places. [2023-09-01 09:48:47,857 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 30 transitions, 91 flow [2023-09-01 09:48:47,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 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-09-01 09:48:47,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:48:47,858 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:48:47,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 09:48:47,858 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:48:47,860 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:48:47,861 INFO L85 PathProgramCache]: Analyzing trace with hash 522280250, now seen corresponding path program 1 times [2023-09-01 09:48:47,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:48:47,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293442365] [2023-09-01 09:48:47,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:48:47,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:48:47,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:48:49,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:48:49,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:48:49,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293442365] [2023-09-01 09:48:49,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293442365] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:48:49,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:48:49,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:48:49,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663884135] [2023-09-01 09:48:49,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:48:49,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:48:49,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:48:49,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:48:49,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:48:49,297 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 235 [2023-09-01 09:48:49,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 30 transitions, 91 flow. Second operand has 5 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 0 states have call successors, (0), 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-09-01 09:48:49,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:48:49,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 235 [2023-09-01 09:48:49,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:48:50,579 INFO L130 PetriNetUnfolder]: 8599/11715 cut-off events. [2023-09-01 09:48:50,580 INFO L131 PetriNetUnfolder]: For 3656/3656 co-relation queries the response was YES. [2023-09-01 09:48:50,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26548 conditions, 11715 events. 8599/11715 cut-off events. For 3656/3656 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 57541 event pairs, 2039 based on Foata normal form. 512/12223 useless extension candidates. Maximal degree in co-relation 26535. Up to 6785 conditions per place. [2023-09-01 09:48:50,645 INFO L137 encePairwiseOnDemand]: 224/235 looper letters, 45 selfloop transitions, 9 changer transitions 37/92 dead transitions. [2023-09-01 09:48:50,646 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 92 transitions, 421 flow [2023-09-01 09:48:50,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 09:48:50,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 09:48:50,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 799 transitions. [2023-09-01 09:48:50,649 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2023-09-01 09:48:50,649 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 799 transitions. [2023-09-01 09:48:50,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 799 transitions. [2023-09-01 09:48:50,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:48:50,650 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 799 transitions. [2023-09-01 09:48:50,651 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 114.14285714285714) internal successors, (799), 7 states have internal predecessors, (799), 0 states have call successors, (0), 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-09-01 09:48:50,654 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 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-09-01 09:48:50,655 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 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-09-01 09:48:50,655 INFO L175 Difference]: Start difference. First operand has 44 places, 30 transitions, 91 flow. Second operand 7 states and 799 transitions. [2023-09-01 09:48:50,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 92 transitions, 421 flow [2023-09-01 09:48:50,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 92 transitions, 410 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-09-01 09:48:50,710 INFO L231 Difference]: Finished difference. Result has 52 places, 37 transitions, 174 flow [2023-09-01 09:48:50,710 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=174, PETRI_PLACES=52, PETRI_TRANSITIONS=37} [2023-09-01 09:48:50,711 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 8 predicate places. [2023-09-01 09:48:50,715 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 37 transitions, 174 flow [2023-09-01 09:48:50,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 0 states have call successors, (0), 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-09-01 09:48:50,715 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:48:50,716 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:48:50,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 09:48:50,716 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:48:50,717 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:48:50,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1629075003, now seen corresponding path program 1 times [2023-09-01 09:48:50,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:48:50,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846903254] [2023-09-01 09:48:50,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:48:50,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:48:50,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:48:51,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:48:51,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:48:51,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846903254] [2023-09-01 09:48:51,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846903254] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:48:51,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:48:51,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:48:51,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798855525] [2023-09-01 09:48:51,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:48:51,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:48:51,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:48:51,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:48:51,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:48:51,269 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 235 [2023-09-01 09:48:51,270 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 37 transitions, 174 flow. Second operand has 5 states, 5 states have (on average 115.6) internal successors, (578), 5 states have internal predecessors, (578), 0 states have call successors, (0), 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-09-01 09:48:51,271 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:48:51,271 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 235 [2023-09-01 09:48:51,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:48:52,629 INFO L130 PetriNetUnfolder]: 7688/11067 cut-off events. [2023-09-01 09:48:52,629 INFO L131 PetriNetUnfolder]: For 17857/18226 co-relation queries the response was YES. [2023-09-01 09:48:52,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34215 conditions, 11067 events. 7688/11067 cut-off events. For 17857/18226 co-relation queries the response was YES. Maximal size of possible extension queue 485. Compared 61660 event pairs, 2881 based on Foata normal form. 465/11178 useless extension candidates. Maximal degree in co-relation 34196. Up to 7930 conditions per place. [2023-09-01 09:48:52,704 INFO L137 encePairwiseOnDemand]: 230/235 looper letters, 40 selfloop transitions, 3 changer transitions 22/73 dead transitions. [2023-09-01 09:48:52,705 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 73 transitions, 422 flow [2023-09-01 09:48:52,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:48:52,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:48:52,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 624 transitions. [2023-09-01 09:48:52,710 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.531063829787234 [2023-09-01 09:48:52,710 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 624 transitions. [2023-09-01 09:48:52,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 624 transitions. [2023-09-01 09:48:52,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:48:52,711 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 624 transitions. [2023-09-01 09:48:52,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 124.8) internal successors, (624), 5 states have internal predecessors, (624), 0 states have call successors, (0), 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-09-01 09:48:52,715 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 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-09-01 09:48:52,716 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 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-09-01 09:48:52,716 INFO L175 Difference]: Start difference. First operand has 52 places, 37 transitions, 174 flow. Second operand 5 states and 624 transitions. [2023-09-01 09:48:52,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 73 transitions, 422 flow [2023-09-01 09:48:52,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 73 transitions, 414 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-09-01 09:48:52,820 INFO L231 Difference]: Finished difference. Result has 53 places, 39 transitions, 193 flow [2023-09-01 09:48:52,820 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=193, PETRI_PLACES=53, PETRI_TRANSITIONS=39} [2023-09-01 09:48:52,821 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 9 predicate places. [2023-09-01 09:48:52,821 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 39 transitions, 193 flow [2023-09-01 09:48:52,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.6) internal successors, (578), 5 states have internal predecessors, (578), 0 states have call successors, (0), 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-09-01 09:48:52,822 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:48:52,822 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:48:52,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 09:48:52,822 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:48:52,822 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:48:52,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1038300100, now seen corresponding path program 1 times [2023-09-01 09:48:52,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:48:52,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414025373] [2023-09-01 09:48:52,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:48:52,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:48:52,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:48:53,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:48:53,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:48:53,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414025373] [2023-09-01 09:48:53,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414025373] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:48:53,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:48:53,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:48:53,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361061738] [2023-09-01 09:48:53,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:48:53,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:48:53,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:48:53,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:48:53,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:48:53,729 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 235 [2023-09-01 09:48:53,730 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 39 transitions, 193 flow. Second operand has 6 states, 6 states have (on average 112.33333333333333) internal successors, (674), 6 states have internal predecessors, (674), 0 states have call successors, (0), 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-09-01 09:48:53,730 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:48:53,730 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 235 [2023-09-01 09:48:53,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:48:54,712 INFO L130 PetriNetUnfolder]: 7382/10503 cut-off events. [2023-09-01 09:48:54,712 INFO L131 PetriNetUnfolder]: For 18508/19152 co-relation queries the response was YES. [2023-09-01 09:48:54,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34148 conditions, 10503 events. 7382/10503 cut-off events. For 18508/19152 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 56771 event pairs, 2899 based on Foata normal form. 481/10629 useless extension candidates. Maximal degree in co-relation 34127. Up to 7609 conditions per place. [2023-09-01 09:48:54,807 INFO L137 encePairwiseOnDemand]: 228/235 looper letters, 50 selfloop transitions, 9 changer transitions 22/89 dead transitions. [2023-09-01 09:48:54,807 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 89 transitions, 561 flow [2023-09-01 09:48:54,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 09:48:54,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 09:48:54,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 727 transitions. [2023-09-01 09:48:54,810 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5156028368794326 [2023-09-01 09:48:54,810 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 727 transitions. [2023-09-01 09:48:54,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 727 transitions. [2023-09-01 09:48:54,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:48:54,811 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 727 transitions. [2023-09-01 09:48:54,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 121.16666666666667) internal successors, (727), 6 states have internal predecessors, (727), 0 states have call successors, (0), 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-09-01 09:48:54,814 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 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-09-01 09:48:54,815 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 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-09-01 09:48:54,815 INFO L175 Difference]: Start difference. First operand has 53 places, 39 transitions, 193 flow. Second operand 6 states and 727 transitions. [2023-09-01 09:48:54,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 89 transitions, 561 flow [2023-09-01 09:48:54,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 89 transitions, 554 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-09-01 09:48:54,837 INFO L231 Difference]: Finished difference. Result has 58 places, 47 transitions, 288 flow [2023-09-01 09:48:54,838 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=288, PETRI_PLACES=58, PETRI_TRANSITIONS=47} [2023-09-01 09:48:54,838 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 14 predicate places. [2023-09-01 09:48:54,838 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 47 transitions, 288 flow [2023-09-01 09:48:54,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.33333333333333) internal successors, (674), 6 states have internal predecessors, (674), 0 states have call successors, (0), 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-09-01 09:48:54,839 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:48:54,839 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:48:54,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-01 09:48:54,840 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:48:54,840 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:48:54,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1835565281, now seen corresponding path program 1 times [2023-09-01 09:48:54,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:48:54,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978017648] [2023-09-01 09:48:54,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:48:54,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:48:54,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:48:55,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:48:55,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:48:55,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978017648] [2023-09-01 09:48:55,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978017648] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:48:55,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:48:55,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:48:55,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863187440] [2023-09-01 09:48:55,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:48:55,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:48:55,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:48:55,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:48:55,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:48:55,104 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 235 [2023-09-01 09:48:55,105 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 47 transitions, 288 flow. Second operand has 5 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 0 states have call successors, (0), 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-09-01 09:48:55,105 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:48:55,105 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 235 [2023-09-01 09:48:55,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:48:56,160 INFO L130 PetriNetUnfolder]: 7178/10290 cut-off events. [2023-09-01 09:48:56,160 INFO L131 PetriNetUnfolder]: For 28795/29537 co-relation queries the response was YES. [2023-09-01 09:48:56,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37850 conditions, 10290 events. 7178/10290 cut-off events. For 28795/29537 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 56108 event pairs, 2105 based on Foata normal form. 407/10381 useless extension candidates. Maximal degree in co-relation 37825. Up to 6831 conditions per place. [2023-09-01 09:48:56,225 INFO L137 encePairwiseOnDemand]: 227/235 looper letters, 56 selfloop transitions, 10 changer transitions 19/93 dead transitions. [2023-09-01 09:48:56,225 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 93 transitions, 670 flow [2023-09-01 09:48:56,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 09:48:56,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 09:48:56,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 742 transitions. [2023-09-01 09:48:56,227 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.526241134751773 [2023-09-01 09:48:56,228 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 742 transitions. [2023-09-01 09:48:56,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 742 transitions. [2023-09-01 09:48:56,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:48:56,228 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 742 transitions. [2023-09-01 09:48:56,230 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 123.66666666666667) internal successors, (742), 6 states have internal predecessors, (742), 0 states have call successors, (0), 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-09-01 09:48:56,232 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 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-09-01 09:48:56,232 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 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-09-01 09:48:56,232 INFO L175 Difference]: Start difference. First operand has 58 places, 47 transitions, 288 flow. Second operand 6 states and 742 transitions. [2023-09-01 09:48:56,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 93 transitions, 670 flow [2023-09-01 09:48:56,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 93 transitions, 662 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-09-01 09:48:56,260 INFO L231 Difference]: Finished difference. Result has 63 places, 51 transitions, 344 flow [2023-09-01 09:48:56,261 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=344, PETRI_PLACES=63, PETRI_TRANSITIONS=51} [2023-09-01 09:48:56,263 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 19 predicate places. [2023-09-01 09:48:56,263 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 51 transitions, 344 flow [2023-09-01 09:48:56,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 0 states have call successors, (0), 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-09-01 09:48:56,264 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:48:56,264 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:48:56,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-01 09:48:56,264 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:48:56,265 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:48:56,266 INFO L85 PathProgramCache]: Analyzing trace with hash -445133995, now seen corresponding path program 2 times [2023-09-01 09:48:56,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:48:56,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474251974] [2023-09-01 09:48:56,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:48:56,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:48:56,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:48:56,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:48:56,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:48:56,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474251974] [2023-09-01 09:48:56,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474251974] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:48:56,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:48:56,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:48:56,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593052732] [2023-09-01 09:48:56,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:48:56,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:48:56,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:48:56,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:48:56,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:48:56,777 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 235 [2023-09-01 09:48:56,778 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 51 transitions, 344 flow. Second operand has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 0 states have call successors, (0), 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-09-01 09:48:56,778 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:48:56,778 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 235 [2023-09-01 09:48:56,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:48:57,951 INFO L130 PetriNetUnfolder]: 7640/10899 cut-off events. [2023-09-01 09:48:57,951 INFO L131 PetriNetUnfolder]: For 41127/42400 co-relation queries the response was YES. [2023-09-01 09:48:57,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43528 conditions, 10899 events. 7640/10899 cut-off events. For 41127/42400 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 59604 event pairs, 2163 based on Foata normal form. 551/11119 useless extension candidates. Maximal degree in co-relation 43499. Up to 7086 conditions per place. [2023-09-01 09:48:58,040 INFO L137 encePairwiseOnDemand]: 226/235 looper letters, 65 selfloop transitions, 20 changer transitions 35/128 dead transitions. [2023-09-01 09:48:58,040 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 128 transitions, 1014 flow [2023-09-01 09:48:58,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-01 09:48:58,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-09-01 09:48:58,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1095 transitions. [2023-09-01 09:48:58,044 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5177304964539007 [2023-09-01 09:48:58,045 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1095 transitions. [2023-09-01 09:48:58,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1095 transitions. [2023-09-01 09:48:58,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:48:58,046 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1095 transitions. [2023-09-01 09:48:58,048 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 121.66666666666667) internal successors, (1095), 9 states have internal predecessors, (1095), 0 states have call successors, (0), 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-09-01 09:48:58,051 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 235.0) internal successors, (2350), 10 states have internal predecessors, (2350), 0 states have call successors, (0), 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-09-01 09:48:58,052 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 235.0) internal successors, (2350), 10 states have internal predecessors, (2350), 0 states have call successors, (0), 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-09-01 09:48:58,052 INFO L175 Difference]: Start difference. First operand has 63 places, 51 transitions, 344 flow. Second operand 9 states and 1095 transitions. [2023-09-01 09:48:58,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 128 transitions, 1014 flow [2023-09-01 09:48:58,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 128 transitions, 992 flow, removed 7 selfloop flow, removed 3 redundant places. [2023-09-01 09:48:58,103 INFO L231 Difference]: Finished difference. Result has 72 places, 62 transitions, 526 flow [2023-09-01 09:48:58,104 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=526, PETRI_PLACES=72, PETRI_TRANSITIONS=62} [2023-09-01 09:48:58,104 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 28 predicate places. [2023-09-01 09:48:58,104 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 62 transitions, 526 flow [2023-09-01 09:48:58,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 0 states have call successors, (0), 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-09-01 09:48:58,105 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:48:58,105 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:48:58,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-01 09:48:58,106 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:48:58,106 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:48:58,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1168469844, now seen corresponding path program 1 times [2023-09-01 09:48:58,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:48:58,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396852774] [2023-09-01 09:48:58,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:48:58,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:48:58,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:48:58,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:48:58,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:48:58,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396852774] [2023-09-01 09:48:58,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396852774] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:48:58,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:48:58,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:48:58,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581390874] [2023-09-01 09:48:58,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:48:58,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 09:48:58,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:48:58,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 09:48:58,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-09-01 09:48:58,707 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 235 [2023-09-01 09:48:58,708 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 62 transitions, 526 flow. Second operand has 7 states, 7 states have (on average 114.28571428571429) internal successors, (800), 7 states have internal predecessors, (800), 0 states have call successors, (0), 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-09-01 09:48:58,708 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:48:58,709 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 235 [2023-09-01 09:48:58,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:48:59,903 INFO L130 PetriNetUnfolder]: 7381/10512 cut-off events. [2023-09-01 09:48:59,903 INFO L131 PetriNetUnfolder]: For 72624/74294 co-relation queries the response was YES. [2023-09-01 09:48:59,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50033 conditions, 10512 events. 7381/10512 cut-off events. For 72624/74294 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 56964 event pairs, 1833 based on Foata normal form. 449/10622 useless extension candidates. Maximal degree in co-relation 49999. Up to 7320 conditions per place. [2023-09-01 09:48:59,975 INFO L137 encePairwiseOnDemand]: 229/235 looper letters, 68 selfloop transitions, 12 changer transitions 21/109 dead transitions. [2023-09-01 09:48:59,976 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 109 transitions, 1011 flow [2023-09-01 09:48:59,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 09:48:59,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 09:48:59,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 859 transitions. [2023-09-01 09:48:59,978 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5221884498480243 [2023-09-01 09:48:59,979 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 859 transitions. [2023-09-01 09:48:59,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 859 transitions. [2023-09-01 09:48:59,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:48:59,979 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 859 transitions. [2023-09-01 09:48:59,981 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.71428571428571) internal successors, (859), 7 states have internal predecessors, (859), 0 states have call successors, (0), 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-09-01 09:48:59,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 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-09-01 09:48:59,984 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 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-09-01 09:48:59,984 INFO L175 Difference]: Start difference. First operand has 72 places, 62 transitions, 526 flow. Second operand 7 states and 859 transitions. [2023-09-01 09:48:59,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 109 transitions, 1011 flow [2023-09-01 09:49:00,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 109 transitions, 946 flow, removed 25 selfloop flow, removed 4 redundant places. [2023-09-01 09:49:00,126 INFO L231 Difference]: Finished difference. Result has 74 places, 64 transitions, 546 flow [2023-09-01 09:49:00,126 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=546, PETRI_PLACES=74, PETRI_TRANSITIONS=64} [2023-09-01 09:49:00,128 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 30 predicate places. [2023-09-01 09:49:00,128 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 64 transitions, 546 flow [2023-09-01 09:49:00,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.28571428571429) internal successors, (800), 7 states have internal predecessors, (800), 0 states have call successors, (0), 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-09-01 09:49:00,129 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:49:00,129 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:49:00,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-09-01 09:49:00,130 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:49:00,130 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:49:00,130 INFO L85 PathProgramCache]: Analyzing trace with hash 428915926, now seen corresponding path program 1 times [2023-09-01 09:49:00,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:49:00,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541780573] [2023-09-01 09:49:00,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:49:00,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:49:00,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:49:01,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:49:01,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:49:01,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541780573] [2023-09-01 09:49:01,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541780573] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:49:01,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:49:01,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-01 09:49:01,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340627923] [2023-09-01 09:49:01,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:49:01,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-09-01 09:49:01,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:49:01,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-09-01 09:49:01,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-09-01 09:49:01,405 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 235 [2023-09-01 09:49:01,406 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 64 transitions, 546 flow. Second operand has 8 states, 8 states have (on average 100.125) internal successors, (801), 8 states have internal predecessors, (801), 0 states have call successors, (0), 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-09-01 09:49:01,406 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:49:01,406 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 235 [2023-09-01 09:49:01,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:49:02,771 INFO L130 PetriNetUnfolder]: 10111/13768 cut-off events. [2023-09-01 09:49:02,771 INFO L131 PetriNetUnfolder]: For 74550/74550 co-relation queries the response was YES. [2023-09-01 09:49:02,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62204 conditions, 13768 events. 10111/13768 cut-off events. For 74550/74550 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 66711 event pairs, 1083 based on Foata normal form. 264/14032 useless extension candidates. Maximal degree in co-relation 62168. Up to 8267 conditions per place. [2023-09-01 09:49:02,854 INFO L137 encePairwiseOnDemand]: 221/235 looper letters, 108 selfloop transitions, 50 changer transitions 35/193 dead transitions. [2023-09-01 09:49:02,854 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 193 transitions, 1760 flow [2023-09-01 09:49:02,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-09-01 09:49:02,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-09-01 09:49:02,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1231 transitions. [2023-09-01 09:49:02,863 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4762088974854932 [2023-09-01 09:49:02,863 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1231 transitions. [2023-09-01 09:49:02,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1231 transitions. [2023-09-01 09:49:02,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:49:02,866 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1231 transitions. [2023-09-01 09:49:02,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 111.9090909090909) internal successors, (1231), 11 states have internal predecessors, (1231), 0 states have call successors, (0), 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-09-01 09:49:02,872 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 235.0) internal successors, (2820), 12 states have internal predecessors, (2820), 0 states have call successors, (0), 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-09-01 09:49:02,873 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 235.0) internal successors, (2820), 12 states have internal predecessors, (2820), 0 states have call successors, (0), 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-09-01 09:49:02,873 INFO L175 Difference]: Start difference. First operand has 74 places, 64 transitions, 546 flow. Second operand 11 states and 1231 transitions. [2023-09-01 09:49:02,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 193 transitions, 1760 flow [2023-09-01 09:49:03,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 193 transitions, 1717 flow, removed 17 selfloop flow, removed 4 redundant places. [2023-09-01 09:49:03,080 INFO L231 Difference]: Finished difference. Result has 85 places, 90 transitions, 1003 flow [2023-09-01 09:49:03,080 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1003, PETRI_PLACES=85, PETRI_TRANSITIONS=90} [2023-09-01 09:49:03,080 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 41 predicate places. [2023-09-01 09:49:03,080 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 90 transitions, 1003 flow [2023-09-01 09:49:03,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 100.125) internal successors, (801), 8 states have internal predecessors, (801), 0 states have call successors, (0), 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-09-01 09:49:03,081 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:49:03,081 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:49:03,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-09-01 09:49:03,081 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:49:03,081 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:49:03,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1369540629, now seen corresponding path program 1 times [2023-09-01 09:49:03,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:49:03,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398370716] [2023-09-01 09:49:03,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:49:03,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:49:03,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:49:03,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:49:03,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:49:03,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398370716] [2023-09-01 09:49:03,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398370716] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:49:03,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:49:03,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 09:49:03,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492714465] [2023-09-01 09:49:03,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:49:03,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:49:03,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:49:03,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:49:03,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:49:03,306 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 235 [2023-09-01 09:49:03,307 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 90 transitions, 1003 flow. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 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-09-01 09:49:03,307 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:49:03,307 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 235 [2023-09-01 09:49:03,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:49:04,202 INFO L130 PetriNetUnfolder]: 4642/6795 cut-off events. [2023-09-01 09:49:04,202 INFO L131 PetriNetUnfolder]: For 68971/69914 co-relation queries the response was YES. [2023-09-01 09:49:04,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37250 conditions, 6795 events. 4642/6795 cut-off events. For 68971/69914 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 36579 event pairs, 1418 based on Foata normal form. 462/6933 useless extension candidates. Maximal degree in co-relation 37208. Up to 5168 conditions per place. [2023-09-01 09:49:04,258 INFO L137 encePairwiseOnDemand]: 229/235 looper letters, 115 selfloop transitions, 5 changer transitions 0/139 dead transitions. [2023-09-01 09:49:04,258 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 139 transitions, 1796 flow [2023-09-01 09:49:04,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:49:04,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:49:04,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 371 transitions. [2023-09-01 09:49:04,260 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.526241134751773 [2023-09-01 09:49:04,260 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 371 transitions. [2023-09-01 09:49:04,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 371 transitions. [2023-09-01 09:49:04,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:49:04,261 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 371 transitions. [2023-09-01 09:49:04,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 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-09-01 09:49:04,263 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 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-09-01 09:49:04,263 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 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-09-01 09:49:04,263 INFO L175 Difference]: Start difference. First operand has 85 places, 90 transitions, 1003 flow. Second operand 3 states and 371 transitions. [2023-09-01 09:49:04,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 139 transitions, 1796 flow [2023-09-01 09:49:04,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 139 transitions, 1708 flow, removed 38 selfloop flow, removed 4 redundant places. [2023-09-01 09:49:04,348 INFO L231 Difference]: Finished difference. Result has 81 places, 94 transitions, 984 flow [2023-09-01 09:49:04,348 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=951, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=984, PETRI_PLACES=81, PETRI_TRANSITIONS=94} [2023-09-01 09:49:04,349 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 37 predicate places. [2023-09-01 09:49:04,349 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 94 transitions, 984 flow [2023-09-01 09:49:04,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 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-09-01 09:49:04,349 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:49:04,349 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:49:04,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-09-01 09:49:04,350 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:49:04,350 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:49:04,350 INFO L85 PathProgramCache]: Analyzing trace with hash -455219962, now seen corresponding path program 1 times [2023-09-01 09:49:04,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:49:04,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82207775] [2023-09-01 09:49:04,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:49:04,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:49:04,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:49:04,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:49:04,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:49:04,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82207775] [2023-09-01 09:49:04,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82207775] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:49:04,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:49:04,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:49:04,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253434369] [2023-09-01 09:49:04,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:49:04,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:49:04,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:49:04,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:49:04,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:49:04,529 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 235 [2023-09-01 09:49:04,530 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 94 transitions, 984 flow. Second operand has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 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-09-01 09:49:04,530 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:49:04,530 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 235 [2023-09-01 09:49:04,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:49:04,997 INFO L130 PetriNetUnfolder]: 2275/3541 cut-off events. [2023-09-01 09:49:04,997 INFO L131 PetriNetUnfolder]: For 29051/29467 co-relation queries the response was YES. [2023-09-01 09:49:05,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19168 conditions, 3541 events. 2275/3541 cut-off events. For 29051/29467 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 18525 event pairs, 482 based on Foata normal form. 375/3771 useless extension candidates. Maximal degree in co-relation 19127. Up to 1543 conditions per place. [2023-09-01 09:49:05,031 INFO L137 encePairwiseOnDemand]: 229/235 looper letters, 139 selfloop transitions, 9 changer transitions 0/167 dead transitions. [2023-09-01 09:49:05,032 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 167 transitions, 2061 flow [2023-09-01 09:49:05,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:49:05,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:49:05,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 496 transitions. [2023-09-01 09:49:05,034 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5276595744680851 [2023-09-01 09:49:05,034 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 496 transitions. [2023-09-01 09:49:05,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 496 transitions. [2023-09-01 09:49:05,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:49:05,035 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 496 transitions. [2023-09-01 09:49:05,036 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 124.0) internal successors, (496), 4 states have internal predecessors, (496), 0 states have call successors, (0), 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-09-01 09:49:05,039 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 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-09-01 09:49:05,039 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 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-09-01 09:49:05,039 INFO L175 Difference]: Start difference. First operand has 81 places, 94 transitions, 984 flow. Second operand 4 states and 496 transitions. [2023-09-01 09:49:05,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 167 transitions, 2061 flow [2023-09-01 09:49:05,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 167 transitions, 1987 flow, removed 8 selfloop flow, removed 6 redundant places. [2023-09-01 09:49:05,072 INFO L231 Difference]: Finished difference. Result has 79 places, 92 transitions, 920 flow [2023-09-01 09:49:05,073 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=868, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=920, PETRI_PLACES=79, PETRI_TRANSITIONS=92} [2023-09-01 09:49:05,073 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 35 predicate places. [2023-09-01 09:49:05,073 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 92 transitions, 920 flow [2023-09-01 09:49:05,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 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-09-01 09:49:05,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:49:05,074 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, 1] [2023-09-01 09:49:05,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-09-01 09:49:05,074 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:49:05,075 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:49:05,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1042853925, now seen corresponding path program 1 times [2023-09-01 09:49:05,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:49:05,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889473325] [2023-09-01 09:49:05,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:49:05,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:49:05,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:49:05,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:49:05,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:49:05,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889473325] [2023-09-01 09:49:05,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889473325] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:49:05,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:49:05,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:49:05,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513148713] [2023-09-01 09:49:05,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:49:05,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:49:05,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:49:05,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:49:05,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:49:05,274 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 235 [2023-09-01 09:49:05,275 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 92 transitions, 920 flow. Second operand has 5 states, 5 states have (on average 113.6) internal successors, (568), 5 states have internal predecessors, (568), 0 states have call successors, (0), 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-09-01 09:49:05,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:49:05,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 235 [2023-09-01 09:49:05,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:49:05,626 INFO L130 PetriNetUnfolder]: 1570/2445 cut-off events. [2023-09-01 09:49:05,626 INFO L131 PetriNetUnfolder]: For 18663/18919 co-relation queries the response was YES. [2023-09-01 09:49:05,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13249 conditions, 2445 events. 1570/2445 cut-off events. For 18663/18919 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 12495 event pairs, 308 based on Foata normal form. 204/2521 useless extension candidates. Maximal degree in co-relation 13210. Up to 946 conditions per place. [2023-09-01 09:49:05,646 INFO L137 encePairwiseOnDemand]: 229/235 looper letters, 137 selfloop transitions, 13 changer transitions 0/169 dead transitions. [2023-09-01 09:49:05,646 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 169 transitions, 2017 flow [2023-09-01 09:49:05,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:49:05,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:49:05,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 619 transitions. [2023-09-01 09:49:05,648 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5268085106382979 [2023-09-01 09:49:05,648 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 619 transitions. [2023-09-01 09:49:05,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 619 transitions. [2023-09-01 09:49:05,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:49:05,649 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 619 transitions. [2023-09-01 09:49:05,651 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.8) internal successors, (619), 5 states have internal predecessors, (619), 0 states have call successors, (0), 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-09-01 09:49:05,652 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 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-09-01 09:49:05,653 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 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-09-01 09:49:05,653 INFO L175 Difference]: Start difference. First operand has 79 places, 92 transitions, 920 flow. Second operand 5 states and 619 transitions. [2023-09-01 09:49:05,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 169 transitions, 2017 flow [2023-09-01 09:49:05,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 169 transitions, 1896 flow, removed 30 selfloop flow, removed 5 redundant places. [2023-09-01 09:49:05,683 INFO L231 Difference]: Finished difference. Result has 79 places, 87 transitions, 841 flow [2023-09-01 09:49:05,683 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=773, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=841, PETRI_PLACES=79, PETRI_TRANSITIONS=87} [2023-09-01 09:49:05,684 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 35 predicate places. [2023-09-01 09:49:05,684 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 87 transitions, 841 flow [2023-09-01 09:49:05,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.6) internal successors, (568), 5 states have internal predecessors, (568), 0 states have call successors, (0), 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-09-01 09:49:05,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:49:05,685 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, 1, 1, 1, 1] [2023-09-01 09:49:05,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-09-01 09:49:05,685 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:49:05,686 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:49:05,686 INFO L85 PathProgramCache]: Analyzing trace with hash -513631286, now seen corresponding path program 1 times [2023-09-01 09:49:05,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:49:05,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313956505] [2023-09-01 09:49:05,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:49:05,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:49:05,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:49:06,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:49:06,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:49:06,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313956505] [2023-09-01 09:49:06,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313956505] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:49:06,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:49:06,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:49:06,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468816238] [2023-09-01 09:49:06,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:49:06,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:49:06,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:49:06,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:49:06,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:49:06,670 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 235 [2023-09-01 09:49:06,671 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 87 transitions, 841 flow. Second operand has 6 states, 6 states have (on average 102.83333333333333) internal successors, (617), 6 states have internal predecessors, (617), 0 states have call successors, (0), 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-09-01 09:49:06,671 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:49:06,671 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 235 [2023-09-01 09:49:06,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:49:07,439 INFO L130 PetriNetUnfolder]: 2872/4299 cut-off events. [2023-09-01 09:49:07,439 INFO L131 PetriNetUnfolder]: For 25693/25797 co-relation queries the response was YES. [2023-09-01 09:49:07,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22868 conditions, 4299 events. 2872/4299 cut-off events. For 25693/25797 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 21140 event pairs, 330 based on Foata normal form. 86/4378 useless extension candidates. Maximal degree in co-relation 22830. Up to 2277 conditions per place. [2023-09-01 09:49:07,467 INFO L137 encePairwiseOnDemand]: 221/235 looper letters, 156 selfloop transitions, 74 changer transitions 44/278 dead transitions. [2023-09-01 09:49:07,467 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 278 transitions, 3227 flow [2023-09-01 09:49:07,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 09:49:07,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 09:49:07,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 805 transitions. [2023-09-01 09:49:07,470 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48936170212765956 [2023-09-01 09:49:07,470 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 805 transitions. [2023-09-01 09:49:07,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 805 transitions. [2023-09-01 09:49:07,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:49:07,471 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 805 transitions. [2023-09-01 09:49:07,473 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 115.0) internal successors, (805), 7 states have internal predecessors, (805), 0 states have call successors, (0), 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-09-01 09:49:07,476 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 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-09-01 09:49:07,476 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 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-09-01 09:49:07,477 INFO L175 Difference]: Start difference. First operand has 79 places, 87 transitions, 841 flow. Second operand 7 states and 805 transitions. [2023-09-01 09:49:07,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 278 transitions, 3227 flow [2023-09-01 09:49:07,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 278 transitions, 3107 flow, removed 28 selfloop flow, removed 3 redundant places. [2023-09-01 09:49:07,548 INFO L231 Difference]: Finished difference. Result has 87 places, 140 transitions, 1701 flow [2023-09-01 09:49:07,548 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=807, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1701, PETRI_PLACES=87, PETRI_TRANSITIONS=140} [2023-09-01 09:49:07,548 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 43 predicate places. [2023-09-01 09:49:07,548 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 140 transitions, 1701 flow [2023-09-01 09:49:07,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 102.83333333333333) internal successors, (617), 6 states have internal predecessors, (617), 0 states have call successors, (0), 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-09-01 09:49:07,549 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:49:07,549 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, 1, 1, 1, 1] [2023-09-01 09:49:07,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-09-01 09:49:07,550 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:49:07,550 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:49:07,550 INFO L85 PathProgramCache]: Analyzing trace with hash -904028653, now seen corresponding path program 1 times [2023-09-01 09:49:07,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:49:07,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259922657] [2023-09-01 09:49:07,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:49:07,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:49:07,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:49:08,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:49:08,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:49:08,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259922657] [2023-09-01 09:49:08,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259922657] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:49:08,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:49:08,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:49:08,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966041742] [2023-09-01 09:49:08,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:49:08,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:49:08,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:49:08,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:49:08,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:49:08,482 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 235 [2023-09-01 09:49:08,482 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 140 transitions, 1701 flow. Second operand has 5 states, 5 states have (on average 105.8) internal successors, (529), 5 states have internal predecessors, (529), 0 states have call successors, (0), 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-09-01 09:49:08,482 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:49:08,482 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 235 [2023-09-01 09:49:08,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:49:09,072 INFO L130 PetriNetUnfolder]: 3660/5576 cut-off events. [2023-09-01 09:49:09,073 INFO L131 PetriNetUnfolder]: For 38355/38544 co-relation queries the response was YES. [2023-09-01 09:49:09,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32225 conditions, 5576 events. 3660/5576 cut-off events. For 38355/38544 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 29406 event pairs, 463 based on Foata normal form. 128/5692 useless extension candidates. Maximal degree in co-relation 32182. Up to 2755 conditions per place. [2023-09-01 09:49:09,103 INFO L137 encePairwiseOnDemand]: 227/235 looper letters, 108 selfloop transitions, 20 changer transitions 67/199 dead transitions. [2023-09-01 09:49:09,103 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 199 transitions, 2608 flow [2023-09-01 09:49:09,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:49:09,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:49:09,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 575 transitions. [2023-09-01 09:49:09,105 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48936170212765956 [2023-09-01 09:49:09,105 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 575 transitions. [2023-09-01 09:49:09,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 575 transitions. [2023-09-01 09:49:09,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:49:09,106 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 575 transitions. [2023-09-01 09:49:09,108 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 0 states have call successors, (0), 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-09-01 09:49:09,109 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 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-09-01 09:49:09,110 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 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-09-01 09:49:09,110 INFO L175 Difference]: Start difference. First operand has 87 places, 140 transitions, 1701 flow. Second operand 5 states and 575 transitions. [2023-09-01 09:49:09,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 199 transitions, 2608 flow [2023-09-01 09:49:09,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 199 transitions, 2578 flow, removed 15 selfloop flow, removed 1 redundant places. [2023-09-01 09:49:09,236 INFO L231 Difference]: Finished difference. Result has 92 places, 97 transitions, 1107 flow [2023-09-01 09:49:09,237 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=1673, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1107, PETRI_PLACES=92, PETRI_TRANSITIONS=97} [2023-09-01 09:49:09,237 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 48 predicate places. [2023-09-01 09:49:09,237 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 97 transitions, 1107 flow [2023-09-01 09:49:09,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.8) internal successors, (529), 5 states have internal predecessors, (529), 0 states have call successors, (0), 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-09-01 09:49:09,238 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:49:09,238 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, 1, 1, 1, 1] [2023-09-01 09:49:09,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-09-01 09:49:09,238 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:49:09,238 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:49:09,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1308259690, now seen corresponding path program 2 times [2023-09-01 09:49:09,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:49:09,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178203353] [2023-09-01 09:49:09,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:49:09,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:49:09,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:49:09,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:49:09,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:49:09,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178203353] [2023-09-01 09:49:09,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178203353] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:49:09,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:49:09,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:49:09,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753781675] [2023-09-01 09:49:09,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:49:09,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:49:09,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:49:09,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:49:09,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:49:09,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 235 [2023-09-01 09:49:09,465 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 97 transitions, 1107 flow. Second operand has 5 states, 5 states have (on average 114.2) internal successors, (571), 5 states have internal predecessors, (571), 0 states have call successors, (0), 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-09-01 09:49:09,465 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:49:09,465 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 235 [2023-09-01 09:49:09,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:49:10,147 INFO L130 PetriNetUnfolder]: 3283/5437 cut-off events. [2023-09-01 09:49:10,147 INFO L131 PetriNetUnfolder]: For 45923/46310 co-relation queries the response was YES. [2023-09-01 09:49:10,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31152 conditions, 5437 events. 3283/5437 cut-off events. For 45923/46310 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 33296 event pairs, 533 based on Foata normal form. 180/5532 useless extension candidates. Maximal degree in co-relation 31105. Up to 2650 conditions per place. [2023-09-01 09:49:10,187 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 129 selfloop transitions, 2 changer transitions 60/203 dead transitions. [2023-09-01 09:49:10,188 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 203 transitions, 2635 flow [2023-09-01 09:49:10,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:49:10,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:49:10,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 617 transitions. [2023-09-01 09:49:10,189 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5251063829787234 [2023-09-01 09:49:10,190 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 617 transitions. [2023-09-01 09:49:10,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 617 transitions. [2023-09-01 09:49:10,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:49:10,190 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 617 transitions. [2023-09-01 09:49:10,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 0 states have call successors, (0), 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-09-01 09:49:10,193 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 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-09-01 09:49:10,194 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 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-09-01 09:49:10,194 INFO L175 Difference]: Start difference. First operand has 92 places, 97 transitions, 1107 flow. Second operand 5 states and 617 transitions. [2023-09-01 09:49:10,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 203 transitions, 2635 flow [2023-09-01 09:49:10,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 203 transitions, 2555 flow, removed 20 selfloop flow, removed 3 redundant places. [2023-09-01 09:49:10,314 INFO L231 Difference]: Finished difference. Result has 95 places, 93 transitions, 1016 flow [2023-09-01 09:49:10,314 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=1061, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1016, PETRI_PLACES=95, PETRI_TRANSITIONS=93} [2023-09-01 09:49:10,314 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 51 predicate places. [2023-09-01 09:49:10,314 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 93 transitions, 1016 flow [2023-09-01 09:49:10,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.2) internal successors, (571), 5 states have internal predecessors, (571), 0 states have call successors, (0), 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-09-01 09:49:10,315 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:49:10,315 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, 1, 1, 1, 1] [2023-09-01 09:49:10,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-09-01 09:49:10,315 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:49:10,315 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:49:10,316 INFO L85 PathProgramCache]: Analyzing trace with hash 917104062, now seen corresponding path program 3 times [2023-09-01 09:49:10,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:49:10,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603959534] [2023-09-01 09:49:10,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:49:10,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:49:10,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:49:10,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:49:10,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:49:10,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603959534] [2023-09-01 09:49:10,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603959534] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:49:10,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:49:10,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-01 09:49:10,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24789703] [2023-09-01 09:49:10,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:49:10,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-09-01 09:49:10,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:49:10,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-09-01 09:49:10,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-09-01 09:49:10,937 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 235 [2023-09-01 09:49:10,938 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 93 transitions, 1016 flow. Second operand has 8 states, 8 states have (on average 114.625) internal successors, (917), 8 states have internal predecessors, (917), 0 states have call successors, (0), 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-09-01 09:49:10,938 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:49:10,938 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 235 [2023-09-01 09:49:10,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:49:11,521 INFO L130 PetriNetUnfolder]: 3106/5168 cut-off events. [2023-09-01 09:49:11,522 INFO L131 PetriNetUnfolder]: For 41462/41911 co-relation queries the response was YES. [2023-09-01 09:49:11,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29328 conditions, 5168 events. 3106/5168 cut-off events. For 41462/41911 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 31154 event pairs, 677 based on Foata normal form. 133/5171 useless extension candidates. Maximal degree in co-relation 29280. Up to 3946 conditions per place. [2023-09-01 09:49:11,553 INFO L137 encePairwiseOnDemand]: 230/235 looper letters, 94 selfloop transitions, 12 changer transitions 9/127 dead transitions. [2023-09-01 09:49:11,553 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 127 transitions, 1483 flow [2023-09-01 09:49:11,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 09:49:11,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 09:49:11,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 725 transitions. [2023-09-01 09:49:11,555 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5141843971631206 [2023-09-01 09:49:11,556 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 725 transitions. [2023-09-01 09:49:11,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 725 transitions. [2023-09-01 09:49:11,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:49:11,556 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 725 transitions. [2023-09-01 09:49:11,558 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 120.83333333333333) internal successors, (725), 6 states have internal predecessors, (725), 0 states have call successors, (0), 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-09-01 09:49:11,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 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-09-01 09:49:11,560 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 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-09-01 09:49:11,560 INFO L175 Difference]: Start difference. First operand has 95 places, 93 transitions, 1016 flow. Second operand 6 states and 725 transitions. [2023-09-01 09:49:11,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 127 transitions, 1483 flow [2023-09-01 09:49:11,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 127 transitions, 1461 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-09-01 09:49:11,682 INFO L231 Difference]: Finished difference. Result has 100 places, 93 transitions, 1034 flow [2023-09-01 09:49:11,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=997, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1034, PETRI_PLACES=100, PETRI_TRANSITIONS=93} [2023-09-01 09:49:11,684 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 56 predicate places. [2023-09-01 09:49:11,684 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 93 transitions, 1034 flow [2023-09-01 09:49:11,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 114.625) internal successors, (917), 8 states have internal predecessors, (917), 0 states have call successors, (0), 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-09-01 09:49:11,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:49:11,685 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, 1, 1, 1, 1] [2023-09-01 09:49:11,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-09-01 09:49:11,685 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:49:11,685 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:49:11,685 INFO L85 PathProgramCache]: Analyzing trace with hash -289034443, now seen corresponding path program 2 times [2023-09-01 09:49:11,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:49:11,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017936017] [2023-09-01 09:49:11,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:49:11,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:49:11,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:49:11,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:49:11,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:49:11,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017936017] [2023-09-01 09:49:11,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017936017] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:49:11,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:49:11,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:49:11,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489318897] [2023-09-01 09:49:11,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:49:11,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:49:11,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:49:11,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:49:11,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:49:11,903 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 235 [2023-09-01 09:49:11,915 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 93 transitions, 1034 flow. Second operand has 6 states, 6 states have (on average 113.33333333333333) internal successors, (680), 6 states have internal predecessors, (680), 0 states have call successors, (0), 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-09-01 09:49:11,915 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:49:11,915 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 235 [2023-09-01 09:49:11,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:49:12,506 INFO L130 PetriNetUnfolder]: 2718/4421 cut-off events. [2023-09-01 09:49:12,506 INFO L131 PetriNetUnfolder]: For 38313/38651 co-relation queries the response was YES. [2023-09-01 09:49:12,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25376 conditions, 4421 events. 2718/4421 cut-off events. For 38313/38651 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 26946 event pairs, 332 based on Foata normal form. 260/4582 useless extension candidates. Maximal degree in co-relation 25331. Up to 1595 conditions per place. [2023-09-01 09:49:12,530 INFO L137 encePairwiseOnDemand]: 229/235 looper letters, 47 selfloop transitions, 17 changer transitions 99/169 dead transitions. [2023-09-01 09:49:12,530 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 169 transitions, 2193 flow [2023-09-01 09:49:12,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 09:49:12,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 09:49:12,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 729 transitions. [2023-09-01 09:49:12,533 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5170212765957447 [2023-09-01 09:49:12,533 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 729 transitions. [2023-09-01 09:49:12,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 729 transitions. [2023-09-01 09:49:12,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:49:12,534 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 729 transitions. [2023-09-01 09:49:12,535 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 121.5) internal successors, (729), 6 states have internal predecessors, (729), 0 states have call successors, (0), 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-09-01 09:49:12,537 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 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-09-01 09:49:12,537 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 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-09-01 09:49:12,537 INFO L175 Difference]: Start difference. First operand has 100 places, 93 transitions, 1034 flow. Second operand 6 states and 729 transitions. [2023-09-01 09:49:12,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 169 transitions, 2193 flow [2023-09-01 09:49:12,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 169 transitions, 2041 flow, removed 51 selfloop flow, removed 8 redundant places. [2023-09-01 09:49:12,678 INFO L231 Difference]: Finished difference. Result has 96 places, 48 transitions, 435 flow [2023-09-01 09:49:12,679 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=940, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=435, PETRI_PLACES=96, PETRI_TRANSITIONS=48} [2023-09-01 09:49:12,679 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 52 predicate places. [2023-09-01 09:49:12,679 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 48 transitions, 435 flow [2023-09-01 09:49:12,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.33333333333333) internal successors, (680), 6 states have internal predecessors, (680), 0 states have call successors, (0), 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-09-01 09:49:12,680 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:49:12,680 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:49:12,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-09-01 09:49:12,680 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:49:12,681 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:49:12,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1828544641, now seen corresponding path program 1 times [2023-09-01 09:49:12,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:49:12,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960987614] [2023-09-01 09:49:12,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:49:12,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:49:12,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:49:12,721 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-01 09:49:12,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:49:12,802 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-01 09:49:12,803 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-09-01 09:49:12,803 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-09-01 09:49:12,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-09-01 09:49:12,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-09-01 09:49:12,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-09-01 09:49:12,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-09-01 09:49:12,809 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-09-01 09:49:12,809 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-09-01 09:49:12,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-09-01 09:49:12,809 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:49:12,814 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-01 09:49:12,814 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-01 09:49:12,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.09 09:49:12 BasicIcfg [2023-09-01 09:49:12,893 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-01 09:49:12,894 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-09-01 09:49:12,894 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-09-01 09:49:12,894 INFO L275 PluginConnector]: Witness Printer initialized [2023-09-01 09:49:12,894 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:48:41" (3/4) ... [2023-09-01 09:49:12,896 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-09-01 09:49:12,973 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-09-01 09:49:12,974 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-09-01 09:49:12,974 INFO L158 Benchmark]: Toolchain (without parser) took 33032.05ms. Allocated memory was 65.0MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 41.3MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2023-09-01 09:49:12,975 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 52.4MB. Free memory is still 29.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 09:49:12,975 INFO L158 Benchmark]: CACSL2BoogieTranslator took 527.84ms. Allocated memory is still 65.0MB. Free memory was 41.2MB in the beginning and 32.9MB in the end (delta: 8.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-09-01 09:49:12,975 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.69ms. Allocated memory is still 65.0MB. Free memory was 32.6MB in the beginning and 29.9MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-09-01 09:49:12,975 INFO L158 Benchmark]: Boogie Preprocessor took 49.27ms. Allocated memory is still 65.0MB. Free memory was 29.9MB in the beginning and 43.8MB in the end (delta: -13.8MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. [2023-09-01 09:49:12,976 INFO L158 Benchmark]: RCFGBuilder took 653.24ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 43.8MB in the beginning and 54.5MB in the end (delta: -10.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-09-01 09:49:12,978 INFO L158 Benchmark]: TraceAbstraction took 31632.48ms. Allocated memory was 79.7MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 54.1MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2023-09-01 09:49:12,979 INFO L158 Benchmark]: Witness Printer took 80.27ms. Allocated memory is still 2.8GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-09-01 09:49:12,980 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 52.4MB. Free memory is still 29.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 527.84ms. Allocated memory is still 65.0MB. Free memory was 41.2MB in the beginning and 32.9MB in the end (delta: 8.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.69ms. Allocated memory is still 65.0MB. Free memory was 32.6MB in the beginning and 29.9MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.27ms. Allocated memory is still 65.0MB. Free memory was 29.9MB in the beginning and 43.8MB in the end (delta: -13.8MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. * RCFGBuilder took 653.24ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 43.8MB in the beginning and 54.5MB in the end (delta: -10.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 31632.48ms. Allocated memory was 79.7MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 54.1MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. * Witness Printer took 80.27ms. Allocated memory is still 2.8GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 136 PlacesBefore, 44 PlacesAfterwards, 125 TransitionsBefore, 32 TransitionsAfterwards, 2986 CoEnabledTransitionPairs, 7 FixpointIterations, 42 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 106 TotalNumberOfCompositions, 8489 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3282, independent: 3048, independent conditional: 0, independent unconditional: 3048, dependent: 234, dependent conditional: 0, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1531, independent: 1501, independent conditional: 0, independent unconditional: 1501, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3282, independent: 1547, independent conditional: 0, independent unconditional: 1547, dependent: 204, dependent conditional: 0, dependent unconditional: 204, unknown: 1531, unknown conditional: 0, unknown unconditional: 1531] , Statistics on independence cache: Total cache size (in pairs): 155, Positive cache size: 138, Positive conditional cache size: 0, Positive unconditional cache size: 138, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L725] 0 _Bool y$flush_delayed; [L726] 0 int y$mem_tmp; [L727] 0 _Bool y$r_buff0_thd0; [L728] 0 _Bool y$r_buff0_thd1; [L729] 0 _Bool y$r_buff0_thd2; [L730] 0 _Bool y$r_buff0_thd3; [L731] 0 _Bool y$r_buff0_thd4; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$r_buff1_thd4; [L737] 0 _Bool y$read_delayed; [L738] 0 int *y$read_delayed_var; [L739] 0 int y$w_buff0; [L740] 0 _Bool y$w_buff0_used; [L741] 0 int y$w_buff1; [L742] 0 _Bool y$w_buff1_used; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L846] 0 pthread_t t773; [L847] FCALL, FORK 0 pthread_create(&t773, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t773, ((void *)0), P0, ((void *)0))=-4, t773={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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L848] 0 pthread_t t774; [L849] FCALL, FORK 0 pthread_create(&t774, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t774, ((void *)0), P1, ((void *)0))=-3, t773={5:0}, t774={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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L850] 0 pthread_t t775; [L851] FCALL, FORK 0 pthread_create(&t775, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t775, ((void *)0), P2, ((void *)0))=-2, t773={5:0}, t774={6:0}, t775={7: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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L852] 0 pthread_t t776; [L785] 3 y$w_buff1 = y$w_buff0 [L786] 3 y$w_buff0 = 2 [L787] 3 y$w_buff1_used = y$w_buff0_used [L788] 3 y$w_buff0_used = (_Bool)1 [L789] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L789] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L790] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L791] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L792] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L793] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L794] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L795] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L798] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L853] FCALL, FORK 0 pthread_create(&t776, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t776, ((void *)0), P3, ((void *)0))=-1, t773={5:0}, t774={6:0}, t775={7:0}, t776={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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L815] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L818] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L821] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L753] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L765] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L768] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L771] 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) [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 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 [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] 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, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L801] 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) [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] 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 [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] 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, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L824] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L825] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L826] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L827] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L828] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 2 return 0; [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 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) [L860] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L861] 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 [L862] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L863] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t773={5:0}, t774={6:0}, t775={7:0}, t776={3: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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 y$flush_delayed = weak$$choice2 [L869] 0 y$mem_tmp = y [L870] 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) [L871] 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)) [L872] 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)) [L873] 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)) [L874] 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)) [L875] 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)) [L876] 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)) [L877] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L878] 0 y = y$flush_delayed ? y$mem_tmp : y [L879] 0 y$flush_delayed = (_Bool)0 [L881] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, 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=1, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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: 853]: 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: 847]: 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: 851]: 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: 849]: 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 9 procedures, 165 locations, 7 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: 31.4s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 17.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1029 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 834 mSDsluCounter, 576 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 519 mSDsCounter, 213 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2737 IncrementalHoareTripleChecker+Invalid, 2950 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 213 mSolverCounterUnsat, 57 mSDtfsCounter, 2737 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1701occurred in iteration=13, InterpolantAutomatonStates: 100, 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.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 8.7s InterpolantComputationTime, 331 NumberOfCodeBlocks, 331 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 286 ConstructedInterpolants, 0 QuantifiedInterpolants, 2631 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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-09-01 09:49:13,002 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