./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix026_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/mix026_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 a0c922061e4dc1feb6389a43fa3f654e69e326084cac4d5446a529710663ff29 --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:47:36,982 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 09:47:36,984 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 09:47:37,018 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 09:47:37,019 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 09:47:37,020 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 09:47:37,020 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 09:47:37,022 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 09:47:37,023 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 09:47:37,027 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 09:47:37,027 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 09:47:37,029 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 09:47:37,030 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 09:47:37,031 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 09:47:37,032 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 09:47:37,033 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 09:47:37,034 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 09:47:37,035 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 09:47:37,038 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 09:47:37,039 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 09:47:37,042 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 09:47:37,045 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 09:47:37,045 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 09:47:37,046 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 09:47:37,048 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 09:47:37,051 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 09:47:37,051 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 09:47:37,052 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 09:47:37,053 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 09:47:37,053 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 09:47:37,053 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 09:47:37,054 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 09:47:37,055 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 09:47:37,056 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 09:47:37,056 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 09:47:37,057 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 09:47:37,057 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 09:47:37,058 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 09:47:37,058 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 09:47:37,058 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 09:47:37,059 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 09:47:37,060 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:47:37,086 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 09:47:37,087 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 09:47:37,087 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 09:47:37,088 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 09:47:37,088 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 09:47:37,088 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 09:47:37,089 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 09:47:37,089 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 09:47:37,089 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 09:47:37,089 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 09:47:37,090 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 09:47:37,090 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 09:47:37,090 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 09:47:37,090 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 09:47:37,090 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-01 09:47:37,090 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 09:47:37,091 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-01 09:47:37,091 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 09:47:37,091 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-09-01 09:47:37,091 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 09:47:37,091 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-01 09:47:37,091 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 09:47:37,091 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 09:47:37,092 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 09:47:37,092 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:47:37,092 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 09:47:37,092 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 09:47:37,092 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-01 09:47:37,092 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 09:47:37,092 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 09:47:37,093 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 09:47:37,093 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-01 09:47:37,093 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 09:47:37,093 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 09:47:37,093 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 09:47:37,093 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 -> a0c922061e4dc1feb6389a43fa3f654e69e326084cac4d5446a529710663ff29 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:47:37,449 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 09:47:37,463 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 09:47:37,465 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 09:47:37,466 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 09:47:37,466 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 09:47:37,467 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix026_pso.opt_rmo.opt.i [2023-09-01 09:47:38,565 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 09:47:38,806 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 09:47:38,806 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix026_pso.opt_rmo.opt.i [2023-09-01 09:47:38,833 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95cc8050e/30361724f510439b8f457365d1739918/FLAG52da2fb10 [2023-09-01 09:47:38,857 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95cc8050e/30361724f510439b8f457365d1739918 [2023-09-01 09:47:38,858 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 09:47:38,859 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 09:47:38,860 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 09:47:38,865 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 09:47:38,874 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 09:47:38,874 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:47:38" (1/1) ... [2023-09-01 09:47:38,875 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ced5b07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:47:38, skipping insertion in model container [2023-09-01 09:47:38,875 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:47:38" (1/1) ... [2023-09-01 09:47:38,880 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 09:47:38,928 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 09:47:39,061 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/mix026_pso.opt_rmo.opt.i[956,969] [2023-09-01 09:47:39,234 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:47:39,261 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 09:47:39,272 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/mix026_pso.opt_rmo.opt.i[956,969] [2023-09-01 09:47:39,322 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:47:39,363 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:47:39,363 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:47:39,369 INFO L208 MainTranslator]: Completed translation [2023-09-01 09:47:39,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:47:39 WrapperNode [2023-09-01 09:47:39,370 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 09:47:39,371 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 09:47:39,371 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 09:47:39,371 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 09:47:39,377 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:47:39" (1/1) ... [2023-09-01 09:47:39,405 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:47:39" (1/1) ... [2023-09-01 09:47:39,440 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2023-09-01 09:47:39,441 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 09:47:39,442 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 09:47:39,442 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 09:47:39,442 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 09:47:39,449 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:47:39" (1/1) ... [2023-09-01 09:47:39,450 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:47:39" (1/1) ... [2023-09-01 09:47:39,461 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:47:39" (1/1) ... [2023-09-01 09:47:39,464 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:47:39" (1/1) ... [2023-09-01 09:47:39,470 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:47:39" (1/1) ... [2023-09-01 09:47:39,480 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:47:39" (1/1) ... [2023-09-01 09:47:39,488 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:47:39" (1/1) ... [2023-09-01 09:47:39,489 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:47:39" (1/1) ... [2023-09-01 09:47:39,492 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 09:47:39,496 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 09:47:39,496 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 09:47:39,497 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 09:47:39,497 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:47:39" (1/1) ... [2023-09-01 09:47:39,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:47:39,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 09:47:39,538 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:47:39,566 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:47:39,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 09:47:39,592 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-01 09:47:39,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 09:47:39,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 09:47:39,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 09:47:39,594 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-09-01 09:47:39,594 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-09-01 09:47:39,594 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-09-01 09:47:39,595 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-09-01 09:47:39,595 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-09-01 09:47:39,595 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-09-01 09:47:39,595 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-09-01 09:47:39,595 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-09-01 09:47:39,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 09:47:39,595 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-01 09:47:39,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 09:47:39,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 09:47:39,597 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:47:39,787 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 09:47:39,802 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 09:47:40,109 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 09:47:40,219 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 09:47:40,219 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-09-01 09:47:40,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:47:40 BoogieIcfgContainer [2023-09-01 09:47:40,221 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 09:47:40,223 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 09:47:40,223 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 09:47:40,225 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 09:47:40,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 09:47:38" (1/3) ... [2023-09-01 09:47:40,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75221f8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:47:40, skipping insertion in model container [2023-09-01 09:47:40,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:47:39" (2/3) ... [2023-09-01 09:47:40,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75221f8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:47:40, skipping insertion in model container [2023-09-01 09:47:40,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:47:40" (3/3) ... [2023-09-01 09:47:40,227 INFO L112 eAbstractionObserver]: Analyzing ICFG mix026_pso.opt_rmo.opt.i [2023-09-01 09:47:40,233 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-01 09:47:40,239 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 09:47:40,240 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-09-01 09:47:40,240 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 09:47:40,294 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-09-01 09:47:40,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 278 flow [2023-09-01 09:47:40,380 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2023-09-01 09:47:40,380 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:47:40,384 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 68 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2023-09-01 09:47:40,384 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 129 transitions, 278 flow [2023-09-01 09:47:40,392 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 125 transitions, 262 flow [2023-09-01 09:47:40,394 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 09:47:40,403 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 125 transitions, 262 flow [2023-09-01 09:47:40,405 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 125 transitions, 262 flow [2023-09-01 09:47:40,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 125 transitions, 262 flow [2023-09-01 09:47:40,431 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2023-09-01 09:47:40,432 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:47:40,433 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 68 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2023-09-01 09:47:40,434 INFO L119 LiptonReduction]: Number of co-enabled transitions 2852 [2023-09-01 09:47:44,034 INFO L134 LiptonReduction]: Checked pairs total: 8050 [2023-09-01 09:47:44,035 INFO L136 LiptonReduction]: Total number of compositions: 110 [2023-09-01 09:47:44,044 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 09:47:44,055 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;@35510aa0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 09:47:44,072 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-09-01 09:47:44,097 INFO L130 PetriNetUnfolder]: 0/12 cut-off events. [2023-09-01 09:47:44,097 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:47:44,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:47:44,098 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:47:44,098 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:47:44,108 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:47:44,109 INFO L85 PathProgramCache]: Analyzing trace with hash 2017430224, now seen corresponding path program 1 times [2023-09-01 09:47:44,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:47:44,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485597120] [2023-09-01 09:47:44,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:47:44,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:47:44,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:47:44,368 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:47:44,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:47:44,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485597120] [2023-09-01 09:47:44,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485597120] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:47:44,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:47:44,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:47:44,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997227157] [2023-09-01 09:47:44,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:47:44,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:47:44,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:47:44,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:47:44,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:47:44,398 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 239 [2023-09-01 09:47:44,401 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 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:47:44,401 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:47:44,401 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 239 [2023-09-01 09:47:44,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:47:44,864 INFO L130 PetriNetUnfolder]: 2855/4136 cut-off events. [2023-09-01 09:47:44,864 INFO L131 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2023-09-01 09:47:44,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8212 conditions, 4136 events. 2855/4136 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 21089 event pairs, 785 based on Foata normal form. 0/3895 useless extension candidates. Maximal degree in co-relation 8200. Up to 3103 conditions per place. [2023-09-01 09:47:44,884 INFO L137 encePairwiseOnDemand]: 235/239 looper letters, 33 selfloop transitions, 2 changer transitions 2/41 dead transitions. [2023-09-01 09:47:44,884 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 41 transitions, 171 flow [2023-09-01 09:47:44,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:47:44,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:47:44,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 385 transitions. [2023-09-01 09:47:44,898 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5369595536959554 [2023-09-01 09:47:44,899 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 385 transitions. [2023-09-01 09:47:44,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 385 transitions. [2023-09-01 09:47:44,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:47:44,903 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 385 transitions. [2023-09-01 09:47:44,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 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:47:44,911 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 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:47:44,912 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 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:47:44,913 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 3 states and 385 transitions. [2023-09-01 09:47:44,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 41 transitions, 171 flow [2023-09-01 09:47:44,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 41 transitions, 166 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-09-01 09:47:44,918 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 64 flow [2023-09-01 09:47:44,920 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2023-09-01 09:47:44,923 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2023-09-01 09:47:44,924 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 64 flow [2023-09-01 09:47:44,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 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:47:44,926 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:47:44,926 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:47:44,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 09:47:44,926 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:47:44,933 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:47:44,933 INFO L85 PathProgramCache]: Analyzing trace with hash -392258494, now seen corresponding path program 1 times [2023-09-01 09:47:44,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:47:44,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699988703] [2023-09-01 09:47:44,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:47:44,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:47:45,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:47:45,229 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:47:45,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:47:45,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699988703] [2023-09-01 09:47:45,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699988703] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:47:45,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:47:45,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:47:45,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468199812] [2023-09-01 09:47:45,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:47:45,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:47:45,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:47:45,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:47:45,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:47:45,249 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 239 [2023-09-01 09:47:45,250 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 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:47:45,250 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:47:45,250 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 239 [2023-09-01 09:47:45,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:47:46,160 INFO L130 PetriNetUnfolder]: 8755/12032 cut-off events. [2023-09-01 09:47:46,160 INFO L131 PetriNetUnfolder]: For 408/408 co-relation queries the response was YES. [2023-09-01 09:47:46,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24754 conditions, 12032 events. 8755/12032 cut-off events. For 408/408 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 59508 event pairs, 2987 based on Foata normal form. 296/12328 useless extension candidates. Maximal degree in co-relation 24744. Up to 8389 conditions per place. [2023-09-01 09:47:46,199 INFO L137 encePairwiseOnDemand]: 231/239 looper letters, 42 selfloop transitions, 7 changer transitions 0/49 dead transitions. [2023-09-01 09:47:46,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 49 transitions, 216 flow [2023-09-01 09:47:46,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:47:46,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:47:46,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2023-09-01 09:47:46,201 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5132496513249651 [2023-09-01 09:47:46,201 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 368 transitions. [2023-09-01 09:47:46,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 368 transitions. [2023-09-01 09:47:46,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:47:46,201 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 368 transitions. [2023-09-01 09:47:46,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 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:47:46,203 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 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:47:46,204 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 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:47:46,204 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 64 flow. Second operand 3 states and 368 transitions. [2023-09-01 09:47:46,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 49 transitions, 216 flow [2023-09-01 09:47:46,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 49 transitions, 210 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:47:46,206 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 114 flow [2023-09-01 09:47:46,206 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=39, PETRI_TRANSITIONS=32} [2023-09-01 09:47:46,207 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -2 predicate places. [2023-09-01 09:47:46,207 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 114 flow [2023-09-01 09:47:46,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 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:47:46,207 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:47:46,207 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:47:46,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 09:47:46,208 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:47:46,208 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:47:46,208 INFO L85 PathProgramCache]: Analyzing trace with hash 724886369, now seen corresponding path program 1 times [2023-09-01 09:47:46,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:47:46,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453642272] [2023-09-01 09:47:46,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:47:46,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:47:46,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:47:46,414 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:47:46,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:47:46,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453642272] [2023-09-01 09:47:46,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453642272] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:47:46,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:47:46,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 09:47:46,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373204789] [2023-09-01 09:47:46,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:47:46,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:47:46,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:47:46,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:47:46,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:47:46,428 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 239 [2023-09-01 09:47:46,429 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 32 transitions, 114 flow. Second operand has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 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:47:46,429 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:47:46,429 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 239 [2023-09-01 09:47:46,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:47:47,287 INFO L130 PetriNetUnfolder]: 8127/11180 cut-off events. [2023-09-01 09:47:47,287 INFO L131 PetriNetUnfolder]: For 3893/3893 co-relation queries the response was YES. [2023-09-01 09:47:47,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27576 conditions, 11180 events. 8127/11180 cut-off events. For 3893/3893 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 53529 event pairs, 2207 based on Foata normal form. 140/11320 useless extension candidates. Maximal degree in co-relation 27564. Up to 5569 conditions per place. [2023-09-01 09:47:47,327 INFO L137 encePairwiseOnDemand]: 232/239 looper letters, 49 selfloop transitions, 7 changer transitions 0/56 dead transitions. [2023-09-01 09:47:47,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 56 transitions, 290 flow [2023-09-01 09:47:47,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:47:47,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:47:47,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 476 transitions. [2023-09-01 09:47:47,328 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.497907949790795 [2023-09-01 09:47:47,329 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 476 transitions. [2023-09-01 09:47:47,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 476 transitions. [2023-09-01 09:47:47,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:47:47,329 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 476 transitions. [2023-09-01 09:47:47,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 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:47:47,331 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 239.0) internal successors, (1195), 5 states have internal predecessors, (1195), 0 states have call successors, (0), 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:47:47,332 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 239.0) internal successors, (1195), 5 states have internal predecessors, (1195), 0 states have call successors, (0), 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:47:47,332 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 114 flow. Second operand 4 states and 476 transitions. [2023-09-01 09:47:47,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 56 transitions, 290 flow [2023-09-01 09:47:47,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 56 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:47:47,347 INFO L231 Difference]: Finished difference. Result has 43 places, 35 transitions, 148 flow [2023-09-01 09:47:47,347 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2023-09-01 09:47:47,347 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2023-09-01 09:47:47,348 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 148 flow [2023-09-01 09:47:47,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 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:47:47,348 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:47:47,348 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:47:47,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 09:47:47,349 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:47:47,349 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:47:47,349 INFO L85 PathProgramCache]: Analyzing trace with hash 994245151, now seen corresponding path program 1 times [2023-09-01 09:47:47,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:47:47,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591299466] [2023-09-01 09:47:47,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:47:47,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:47:47,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:47:47,504 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:47:47,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:47:47,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591299466] [2023-09-01 09:47:47,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591299466] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:47:47,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:47:47,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:47:47,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180870582] [2023-09-01 09:47:47,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:47:47,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:47:47,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:47:47,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:47:47,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:47:47,519 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 239 [2023-09-01 09:47:47,520 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 35 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 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:47:47,520 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:47:47,520 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 239 [2023-09-01 09:47:47,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:47:48,049 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([384] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][69], [Black: 155#(= ~__unbuffered_p3_EAX~0 0), 161#true, P0Thread1of1ForFork1InUse, 122#L756true, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, 153#true, P1Thread1of1ForFork3InUse, 40#L784true, 61#P2EXITtrue, Black: 149#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 58#L839true, 68#L2true, Black: 156#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2023-09-01 09:47:48,050 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-09-01 09:47:48,050 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:47:48,050 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:47:48,050 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:47:48,108 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([384] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][69], [Black: 155#(= ~__unbuffered_p3_EAX~0 0), 161#true, P0Thread1of1ForFork1InUse, 122#L756true, 107#P1EXITtrue, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, 153#true, P1Thread1of1ForFork3InUse, 61#P2EXITtrue, Black: 149#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 58#L839true, 68#L2true, Black: 156#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2023-09-01 09:47:48,109 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-09-01 09:47:48,109 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:47:48,109 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:47:48,109 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:47:48,110 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([492] L874-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (let ((.cse0 (mod (mod v_~main$tmp_guard1~0_16 256) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_19|) (= v_~main$tmp_guard1~0_16 (ite (= 0 (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_16) (= v_~z~0_18 2) (= 0 v_~__unbuffered_p3_EBX~0_12) (= v_~__unbuffered_p1_EAX~0_24 0) (= v_~__unbuffered_p0_EAX~0_16 0))) 1 0)) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_19| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_31|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_31| 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_16, ~z~0=v_~z~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_31|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_19|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~z~0=v_~z~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][78], [120#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 155#(= ~__unbuffered_p3_EAX~0 0), 161#true, P0Thread1of1ForFork1InUse, 122#L756true, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, 153#true, P1Thread1of1ForFork3InUse, 119#L832true, 40#L784true, 61#P2EXITtrue, Black: 149#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 156#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2023-09-01 09:47:48,110 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-09-01 09:47:48,110 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:47:48,110 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:47:48,111 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:47:48,111 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([384] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][69], [Black: 155#(= ~__unbuffered_p3_EAX~0 0), 161#true, P0Thread1of1ForFork1InUse, 122#L756true, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, 153#true, P1Thread1of1ForFork3InUse, 40#L784true, 61#P2EXITtrue, 78#L874true, Black: 149#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 58#L839true, Black: 156#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2023-09-01 09:47:48,111 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-09-01 09:47:48,111 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:47:48,111 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:47:48,111 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:47:48,149 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([492] L874-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (let ((.cse0 (mod (mod v_~main$tmp_guard1~0_16 256) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_19|) (= v_~main$tmp_guard1~0_16 (ite (= 0 (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_16) (= v_~z~0_18 2) (= 0 v_~__unbuffered_p3_EBX~0_12) (= v_~__unbuffered_p1_EAX~0_24 0) (= v_~__unbuffered_p0_EAX~0_16 0))) 1 0)) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_19| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_31|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_31| 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_16, ~z~0=v_~z~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_31|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_19|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~z~0=v_~z~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][78], [120#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 155#(= ~__unbuffered_p3_EAX~0 0), 161#true, P0Thread1of1ForFork1InUse, 122#L756true, 107#P1EXITtrue, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, 153#true, P1Thread1of1ForFork3InUse, 119#L832true, 61#P2EXITtrue, Black: 149#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 156#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2023-09-01 09:47:48,149 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-09-01 09:47:48,149 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-09-01 09:47:48,149 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-09-01 09:47:48,149 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-09-01 09:47:48,150 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([384] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][69], [Black: 155#(= ~__unbuffered_p3_EAX~0 0), 161#true, P0Thread1of1ForFork1InUse, 122#L756true, 107#P1EXITtrue, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, 153#true, P1Thread1of1ForFork3InUse, 61#P2EXITtrue, 78#L874true, Black: 149#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 58#L839true, Black: 156#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2023-09-01 09:47:48,150 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-09-01 09:47:48,150 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-09-01 09:47:48,150 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-09-01 09:47:48,150 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-09-01 09:47:48,174 INFO L130 PetriNetUnfolder]: 5047/7554 cut-off events. [2023-09-01 09:47:48,175 INFO L131 PetriNetUnfolder]: For 2573/2704 co-relation queries the response was YES. [2023-09-01 09:47:48,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17728 conditions, 7554 events. 5047/7554 cut-off events. For 2573/2704 co-relation queries the response was YES. Maximal size of possible extension queue 519. Compared 44939 event pairs, 929 based on Foata normal form. 594/7863 useless extension candidates. Maximal degree in co-relation 17713. Up to 4925 conditions per place. [2023-09-01 09:47:48,213 INFO L137 encePairwiseOnDemand]: 232/239 looper letters, 64 selfloop transitions, 10 changer transitions 0/84 dead transitions. [2023-09-01 09:47:48,213 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 84 transitions, 448 flow [2023-09-01 09:47:48,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:47:48,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:47:48,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 614 transitions. [2023-09-01 09:47:48,215 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5138075313807532 [2023-09-01 09:47:48,215 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 614 transitions. [2023-09-01 09:47:48,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 614 transitions. [2023-09-01 09:47:48,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:47:48,216 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 614 transitions. [2023-09-01 09:47:48,217 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:47:48,219 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 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:47:48,219 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 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:47:48,219 INFO L175 Difference]: Start difference. First operand has 43 places, 35 transitions, 148 flow. Second operand 5 states and 614 transitions. [2023-09-01 09:47:48,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 84 transitions, 448 flow [2023-09-01 09:47:48,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 84 transitions, 445 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 09:47:48,227 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 220 flow [2023-09-01 09:47:48,227 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=220, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2023-09-01 09:47:48,227 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 8 predicate places. [2023-09-01 09:47:48,228 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 220 flow [2023-09-01 09:47:48,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 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:47:48,228 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:47:48,228 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:47:48,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 09:47:48,228 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:47:48,229 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:47:48,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1627285210, now seen corresponding path program 1 times [2023-09-01 09:47:48,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:47:48,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668979710] [2023-09-01 09:47:48,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:47:48,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:47:48,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:47:48,367 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:47:48,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:47:48,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668979710] [2023-09-01 09:47:48,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668979710] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:47:48,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:47:48,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:47:48,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477154870] [2023-09-01 09:47:48,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:47:48,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:47:48,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:47:48,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:47:48,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:47:48,386 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 239 [2023-09-01 09:47:48,386 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 220 flow. Second operand has 5 states, 5 states have (on average 112.8) internal successors, (564), 5 states have internal predecessors, (564), 0 states have call successors, (0), 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:47:48,386 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:47:48,386 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 239 [2023-09-01 09:47:48,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:47:48,803 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([384] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][75], [Black: 155#(= ~__unbuffered_p3_EAX~0 0), 161#true, P0Thread1of1ForFork1InUse, 122#L756true, Black: 164#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 166#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P3Thread1of1ForFork2InUse, Black: 163#(= ~__unbuffered_cnt~0 0), P2Thread1of1ForFork0InUse, 153#true, P1Thread1of1ForFork3InUse, 40#L784true, 179#(and (not (= 4 ~__unbuffered_cnt~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 61#P2EXITtrue, Black: 149#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 58#L839true, 68#L2true, Black: 156#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2023-09-01 09:47:48,803 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-09-01 09:47:48,803 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:47:48,804 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:47:48,804 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:47:48,834 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([384] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][103], [Black: 155#(= ~__unbuffered_p3_EAX~0 0), 161#true, P0Thread1of1ForFork1InUse, 122#L756true, Black: 164#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 107#P1EXITtrue, P3Thread1of1ForFork2InUse, Black: 166#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 163#(= ~__unbuffered_cnt~0 0), P2Thread1of1ForFork0InUse, 153#true, P1Thread1of1ForFork3InUse, 61#P2EXITtrue, 175#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 149#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 58#L839true, 68#L2true, Black: 156#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2023-09-01 09:47:48,834 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-09-01 09:47:48,834 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:47:48,834 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:47:48,834 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:47:48,872 INFO L130 PetriNetUnfolder]: 4012/6224 cut-off events. [2023-09-01 09:47:48,872 INFO L131 PetriNetUnfolder]: For 4612/4688 co-relation queries the response was YES. [2023-09-01 09:47:48,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19238 conditions, 6224 events. 4012/6224 cut-off events. For 4612/4688 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 37970 event pairs, 410 based on Foata normal form. 416/6447 useless extension candidates. Maximal degree in co-relation 19219. Up to 2171 conditions per place. [2023-09-01 09:47:48,897 INFO L137 encePairwiseOnDemand]: 232/239 looper letters, 87 selfloop transitions, 19 changer transitions 1/117 dead transitions. [2023-09-01 09:47:48,897 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 117 transitions, 720 flow [2023-09-01 09:47:48,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 09:47:48,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 09:47:48,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 861 transitions. [2023-09-01 09:47:48,899 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5146443514644351 [2023-09-01 09:47:48,899 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 861 transitions. [2023-09-01 09:47:48,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 861 transitions. [2023-09-01 09:47:48,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:47:48,900 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 861 transitions. [2023-09-01 09:47:48,901 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.0) internal successors, (861), 7 states have internal predecessors, (861), 0 states have call successors, (0), 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:47:48,903 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 0 states have call successors, (0), 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:47:48,904 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 0 states have call successors, (0), 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:47:48,904 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 220 flow. Second operand 7 states and 861 transitions. [2023-09-01 09:47:48,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 117 transitions, 720 flow [2023-09-01 09:47:48,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 117 transitions, 715 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 09:47:48,916 INFO L231 Difference]: Finished difference. Result has 57 places, 53 transitions, 349 flow [2023-09-01 09:47:48,916 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=349, PETRI_PLACES=57, PETRI_TRANSITIONS=53} [2023-09-01 09:47:48,916 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 16 predicate places. [2023-09-01 09:47:48,916 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 53 transitions, 349 flow [2023-09-01 09:47:48,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.8) internal successors, (564), 5 states have internal predecessors, (564), 0 states have call successors, (0), 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:47:48,917 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:47:48,917 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:47:48,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-01 09:47:48,917 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:47:48,917 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:47:48,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1632423467, now seen corresponding path program 1 times [2023-09-01 09:47:48,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:47:48,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468375761] [2023-09-01 09:47:48,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:47:48,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:47:48,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:47:49,062 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:47:49,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:47:49,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468375761] [2023-09-01 09:47:49,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468375761] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:47:49,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:47:49,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:47:49,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304851756] [2023-09-01 09:47:49,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:47:49,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:47:49,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:47:49,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:47:49,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:47:49,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 239 [2023-09-01 09:47:49,077 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 53 transitions, 349 flow. Second operand has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 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:47:49,077 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:47:49,077 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 239 [2023-09-01 09:47:49,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:47:49,808 INFO L130 PetriNetUnfolder]: 7067/10435 cut-off events. [2023-09-01 09:47:49,809 INFO L131 PetriNetUnfolder]: For 25553/25553 co-relation queries the response was YES. [2023-09-01 09:47:49,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40376 conditions, 10435 events. 7067/10435 cut-off events. For 25553/25553 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 59505 event pairs, 706 based on Foata normal form. 56/10491 useless extension candidates. Maximal degree in co-relation 40353. Up to 4947 conditions per place. [2023-09-01 09:47:49,842 INFO L137 encePairwiseOnDemand]: 230/239 looper letters, 103 selfloop transitions, 21 changer transitions 36/160 dead transitions. [2023-09-01 09:47:49,843 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 160 transitions, 1381 flow [2023-09-01 09:47:49,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:47:49,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:47:49,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 609 transitions. [2023-09-01 09:47:49,844 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5096234309623431 [2023-09-01 09:47:49,845 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 609 transitions. [2023-09-01 09:47:49,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 609 transitions. [2023-09-01 09:47:49,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:47:49,845 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 609 transitions. [2023-09-01 09:47:49,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.8) internal successors, (609), 5 states have internal predecessors, (609), 0 states have call successors, (0), 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:47:49,847 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 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:47:49,848 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 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:47:49,848 INFO L175 Difference]: Start difference. First operand has 57 places, 53 transitions, 349 flow. Second operand 5 states and 609 transitions. [2023-09-01 09:47:49,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 160 transitions, 1381 flow [2023-09-01 09:47:50,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 160 transitions, 1209 flow, removed 60 selfloop flow, removed 3 redundant places. [2023-09-01 09:47:50,053 INFO L231 Difference]: Finished difference. Result has 61 places, 55 transitions, 387 flow [2023-09-01 09:47:50,053 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=387, PETRI_PLACES=61, PETRI_TRANSITIONS=55} [2023-09-01 09:47:50,054 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 20 predicate places. [2023-09-01 09:47:50,054 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 55 transitions, 387 flow [2023-09-01 09:47:50,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 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:47:50,054 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:47:50,054 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:47:50,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-01 09:47:50,055 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:47:50,055 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:47:50,055 INFO L85 PathProgramCache]: Analyzing trace with hash -261349626, now seen corresponding path program 1 times [2023-09-01 09:47:50,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:47:50,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309692796] [2023-09-01 09:47:50,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:47:50,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:47:50,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:47:50,180 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:47:50,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:47:50,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309692796] [2023-09-01 09:47:50,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309692796] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:47:50,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:47:50,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:47:50,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559524282] [2023-09-01 09:47:50,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:47:50,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:47:50,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:47:50,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:47:50,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:47:50,190 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 239 [2023-09-01 09:47:50,191 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 55 transitions, 387 flow. Second operand has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 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:47:50,191 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:47:50,191 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 239 [2023-09-01 09:47:50,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:47:50,698 INFO L130 PetriNetUnfolder]: 3989/6345 cut-off events. [2023-09-01 09:47:50,698 INFO L131 PetriNetUnfolder]: For 14670/14879 co-relation queries the response was YES. [2023-09-01 09:47:50,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24816 conditions, 6345 events. 3989/6345 cut-off events. For 14670/14879 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 38582 event pairs, 689 based on Foata normal form. 144/6336 useless extension candidates. Maximal degree in co-relation 24790. Up to 3307 conditions per place. [2023-09-01 09:47:50,720 INFO L137 encePairwiseOnDemand]: 236/239 looper letters, 73 selfloop transitions, 4 changer transitions 20/110 dead transitions. [2023-09-01 09:47:50,721 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 110 transitions, 911 flow [2023-09-01 09:47:50,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:47:50,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:47:50,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 503 transitions. [2023-09-01 09:47:50,722 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5261506276150628 [2023-09-01 09:47:50,722 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 503 transitions. [2023-09-01 09:47:50,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 503 transitions. [2023-09-01 09:47:50,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:47:50,723 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 503 transitions. [2023-09-01 09:47:50,724 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 0 states have call successors, (0), 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:47:50,725 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 239.0) internal successors, (1195), 5 states have internal predecessors, (1195), 0 states have call successors, (0), 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:47:50,725 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 239.0) internal successors, (1195), 5 states have internal predecessors, (1195), 0 states have call successors, (0), 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:47:50,725 INFO L175 Difference]: Start difference. First operand has 61 places, 55 transitions, 387 flow. Second operand 4 states and 503 transitions. [2023-09-01 09:47:50,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 110 transitions, 911 flow [2023-09-01 09:47:50,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 110 transitions, 871 flow, removed 20 selfloop flow, removed 3 redundant places. [2023-09-01 09:47:50,747 INFO L231 Difference]: Finished difference. Result has 59 places, 58 transitions, 424 flow [2023-09-01 09:47:50,747 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=424, PETRI_PLACES=59, PETRI_TRANSITIONS=58} [2023-09-01 09:47:50,747 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 18 predicate places. [2023-09-01 09:47:50,747 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 58 transitions, 424 flow [2023-09-01 09:47:50,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 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:47:50,748 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:47:50,748 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:47:50,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-01 09:47:50,748 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:47:50,748 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:47:50,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1783341666, now seen corresponding path program 2 times [2023-09-01 09:47:50,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:47:50,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686954698] [2023-09-01 09:47:50,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:47:50,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:47:50,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:47:50,964 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:47:50,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:47:50,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686954698] [2023-09-01 09:47:50,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686954698] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:47:50,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:47:50,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:47:50,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097059372] [2023-09-01 09:47:50,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:47:50,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:47:50,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:47:50,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:47:50,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:47:50,976 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 239 [2023-09-01 09:47:50,977 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 58 transitions, 424 flow. Second operand has 6 states, 6 states have (on average 112.83333333333333) internal successors, (677), 6 states have internal predecessors, (677), 0 states have call successors, (0), 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:47:50,977 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:47:50,977 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 239 [2023-09-01 09:47:50,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:47:51,408 INFO L130 PetriNetUnfolder]: 2893/4768 cut-off events. [2023-09-01 09:47:51,409 INFO L131 PetriNetUnfolder]: For 8082/8263 co-relation queries the response was YES. [2023-09-01 09:47:51,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17028 conditions, 4768 events. 2893/4768 cut-off events. For 8082/8263 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 29737 event pairs, 326 based on Foata normal form. 402/5034 useless extension candidates. Maximal degree in co-relation 17002. Up to 1488 conditions per place. [2023-09-01 09:47:51,427 INFO L137 encePairwiseOnDemand]: 232/239 looper letters, 87 selfloop transitions, 17 changer transitions 24/148 dead transitions. [2023-09-01 09:47:51,427 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 148 transitions, 1211 flow [2023-09-01 09:47:51,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 09:47:51,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 09:47:51,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 862 transitions. [2023-09-01 09:47:51,429 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5152420800956365 [2023-09-01 09:47:51,430 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 862 transitions. [2023-09-01 09:47:51,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 862 transitions. [2023-09-01 09:47:51,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:47:51,430 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 862 transitions. [2023-09-01 09:47:51,432 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.14285714285714) internal successors, (862), 7 states have internal predecessors, (862), 0 states have call successors, (0), 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:47:51,433 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 0 states have call successors, (0), 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:47:51,434 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 0 states have call successors, (0), 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:47:51,434 INFO L175 Difference]: Start difference. First operand has 59 places, 58 transitions, 424 flow. Second operand 7 states and 862 transitions. [2023-09-01 09:47:51,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 148 transitions, 1211 flow [2023-09-01 09:47:51,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 148 transitions, 1205 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 09:47:51,445 INFO L231 Difference]: Finished difference. Result has 67 places, 66 transitions, 551 flow [2023-09-01 09:47:51,445 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=423, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=551, PETRI_PLACES=67, PETRI_TRANSITIONS=66} [2023-09-01 09:47:51,445 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 26 predicate places. [2023-09-01 09:47:51,445 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 66 transitions, 551 flow [2023-09-01 09:47:51,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.83333333333333) internal successors, (677), 6 states have internal predecessors, (677), 0 states have call successors, (0), 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:47:51,446 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:47:51,446 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] [2023-09-01 09:47:51,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-09-01 09:47:51,446 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:47:51,447 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:47:51,447 INFO L85 PathProgramCache]: Analyzing trace with hash 795056870, now seen corresponding path program 1 times [2023-09-01 09:47:51,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:47:51,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322144851] [2023-09-01 09:47:51,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:47:51,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:47:51,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:47:51,819 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:47:51,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:47:51,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322144851] [2023-09-01 09:47:51,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322144851] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:47:51,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:47:51,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:47:51,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605454456] [2023-09-01 09:47:51,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:47:51,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:47:51,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:47:51,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:47:51,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:47:51,859 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 239 [2023-09-01 09:47:51,861 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 66 transitions, 551 flow. Second operand has 6 states, 6 states have (on average 105.83333333333333) internal successors, (635), 6 states have internal predecessors, (635), 0 states have call successors, (0), 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:47:51,861 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:47:51,861 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 239 [2023-09-01 09:47:51,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:47:53,224 INFO L130 PetriNetUnfolder]: 5960/9509 cut-off events. [2023-09-01 09:47:53,224 INFO L131 PetriNetUnfolder]: For 36036/36036 co-relation queries the response was YES. [2023-09-01 09:47:53,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43410 conditions, 9509 events. 5960/9509 cut-off events. For 36036/36036 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 60220 event pairs, 505 based on Foata normal form. 9/9518 useless extension candidates. Maximal degree in co-relation 43380. Up to 2914 conditions per place. [2023-09-01 09:47:53,279 INFO L137 encePairwiseOnDemand]: 227/239 looper letters, 168 selfloop transitions, 62 changer transitions 61/291 dead transitions. [2023-09-01 09:47:53,280 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 291 transitions, 2956 flow [2023-09-01 09:47:53,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-01 09:47:53,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-09-01 09:47:53,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1057 transitions. [2023-09-01 09:47:53,284 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49139934913993494 [2023-09-01 09:47:53,284 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1057 transitions. [2023-09-01 09:47:53,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1057 transitions. [2023-09-01 09:47:53,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:47:53,285 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1057 transitions. [2023-09-01 09:47:53,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 117.44444444444444) internal successors, (1057), 9 states have internal predecessors, (1057), 0 states have call successors, (0), 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:47:53,291 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 239.0) internal successors, (2390), 10 states have internal predecessors, (2390), 0 states have call successors, (0), 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:47:53,291 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 239.0) internal successors, (2390), 10 states have internal predecessors, (2390), 0 states have call successors, (0), 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:47:53,291 INFO L175 Difference]: Start difference. First operand has 67 places, 66 transitions, 551 flow. Second operand 9 states and 1057 transitions. [2023-09-01 09:47:53,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 291 transitions, 2956 flow [2023-09-01 09:47:53,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 291 transitions, 2594 flow, removed 143 selfloop flow, removed 2 redundant places. [2023-09-01 09:47:53,704 INFO L231 Difference]: Finished difference. Result has 79 places, 107 transitions, 1082 flow [2023-09-01 09:47:53,704 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1082, PETRI_PLACES=79, PETRI_TRANSITIONS=107} [2023-09-01 09:47:53,705 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 38 predicate places. [2023-09-01 09:47:53,705 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 107 transitions, 1082 flow [2023-09-01 09:47:53,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.83333333333333) internal successors, (635), 6 states have internal predecessors, (635), 0 states have call successors, (0), 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:47:53,706 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:47:53,706 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] [2023-09-01 09:47:53,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-09-01 09:47:53,706 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:47:53,707 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:47:53,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1467396562, now seen corresponding path program 1 times [2023-09-01 09:47:53,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:47:53,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212369252] [2023-09-01 09:47:53,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:47:53,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:47:53,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:47:53,948 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:47:53,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:47:53,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212369252] [2023-09-01 09:47:53,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212369252] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:47:53,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:47:53,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:47:53,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841431032] [2023-09-01 09:47:53,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:47:53,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:47:53,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:47:53,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:47:53,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:47:53,966 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 239 [2023-09-01 09:47:53,966 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 107 transitions, 1082 flow. Second operand has 5 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 0 states have call successors, (0), 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:47:53,967 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:47:53,967 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 239 [2023-09-01 09:47:53,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:47:54,943 INFO L130 PetriNetUnfolder]: 5577/9088 cut-off events. [2023-09-01 09:47:54,944 INFO L131 PetriNetUnfolder]: For 37759/37759 co-relation queries the response was YES. [2023-09-01 09:47:54,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43360 conditions, 9088 events. 5577/9088 cut-off events. For 37759/37759 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 58918 event pairs, 976 based on Foata normal form. 13/9101 useless extension candidates. Maximal degree in co-relation 43323. Up to 3319 conditions per place. [2023-09-01 09:47:54,993 INFO L137 encePairwiseOnDemand]: 230/239 looper letters, 131 selfloop transitions, 45 changer transitions 60/236 dead transitions. [2023-09-01 09:47:54,994 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 236 transitions, 2482 flow [2023-09-01 09:47:54,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 09:47:54,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 09:47:54,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 726 transitions. [2023-09-01 09:47:54,996 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5062761506276151 [2023-09-01 09:47:54,996 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 726 transitions. [2023-09-01 09:47:54,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 726 transitions. [2023-09-01 09:47:54,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:47:54,996 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 726 transitions. [2023-09-01 09:47:54,998 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 121.0) internal successors, (726), 6 states have internal predecessors, (726), 0 states have call successors, (0), 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:47:54,999 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 239.0) internal successors, (1673), 7 states have internal predecessors, (1673), 0 states have call successors, (0), 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:47:54,999 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 239.0) internal successors, (1673), 7 states have internal predecessors, (1673), 0 states have call successors, (0), 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:47:55,000 INFO L175 Difference]: Start difference. First operand has 79 places, 107 transitions, 1082 flow. Second operand 6 states and 726 transitions. [2023-09-01 09:47:55,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 236 transitions, 2482 flow [2023-09-01 09:47:55,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 236 transitions, 2408 flow, removed 37 selfloop flow, removed 2 redundant places. [2023-09-01 09:47:55,243 INFO L231 Difference]: Finished difference. Result has 81 places, 100 transitions, 1061 flow [2023-09-01 09:47:55,243 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=1056, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1061, PETRI_PLACES=81, PETRI_TRANSITIONS=100} [2023-09-01 09:47:55,244 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 40 predicate places. [2023-09-01 09:47:55,244 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 100 transitions, 1061 flow [2023-09-01 09:47:55,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 0 states have call successors, (0), 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:47:55,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:47:55,245 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] [2023-09-01 09:47:55,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-09-01 09:47:55,245 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:47:55,245 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:47:55,246 INFO L85 PathProgramCache]: Analyzing trace with hash -674152556, now seen corresponding path program 2 times [2023-09-01 09:47:55,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:47:55,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33664285] [2023-09-01 09:47:55,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:47:55,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:47:55,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:47:55,422 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:47:55,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:47:55,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33664285] [2023-09-01 09:47:55,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33664285] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:47:55,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:47:55,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-01 09:47:55,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438731751] [2023-09-01 09:47:55,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:47:55,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 09:47:55,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:47:55,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 09:47:55,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-09-01 09:47:55,435 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 239 [2023-09-01 09:47:55,436 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 100 transitions, 1061 flow. Second operand has 7 states, 7 states have (on average 112.71428571428571) internal successors, (789), 7 states have internal predecessors, (789), 0 states have call successors, (0), 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:47:55,436 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:47:55,436 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 239 [2023-09-01 09:47:55,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:47:55,949 INFO L130 PetriNetUnfolder]: 3203/5496 cut-off events. [2023-09-01 09:47:55,950 INFO L131 PetriNetUnfolder]: For 18986/19288 co-relation queries the response was YES. [2023-09-01 09:47:55,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24266 conditions, 5496 events. 3203/5496 cut-off events. For 18986/19288 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 37697 event pairs, 280 based on Foata normal form. 294/5626 useless extension candidates. Maximal degree in co-relation 24228. Up to 1938 conditions per place. [2023-09-01 09:47:55,970 INFO L137 encePairwiseOnDemand]: 232/239 looper letters, 68 selfloop transitions, 17 changer transitions 104/205 dead transitions. [2023-09-01 09:47:55,970 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 205 transitions, 2313 flow [2023-09-01 09:47:55,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 09:47:55,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 09:47:55,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 961 transitions. [2023-09-01 09:47:55,972 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5026150627615062 [2023-09-01 09:47:55,973 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 961 transitions. [2023-09-01 09:47:55,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 961 transitions. [2023-09-01 09:47:55,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:47:55,973 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 961 transitions. [2023-09-01 09:47:55,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 120.125) internal successors, (961), 8 states have internal predecessors, (961), 0 states have call successors, (0), 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:47:55,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 239.0) internal successors, (2151), 9 states have internal predecessors, (2151), 0 states have call successors, (0), 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:47:55,978 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 239.0) internal successors, (2151), 9 states have internal predecessors, (2151), 0 states have call successors, (0), 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:47:55,978 INFO L175 Difference]: Start difference. First operand has 81 places, 100 transitions, 1061 flow. Second operand 8 states and 961 transitions. [2023-09-01 09:47:55,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 205 transitions, 2313 flow [2023-09-01 09:47:56,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 205 transitions, 2080 flow, removed 10 selfloop flow, removed 7 redundant places. [2023-09-01 09:47:56,149 INFO L231 Difference]: Finished difference. Result has 84 places, 64 transitions, 570 flow [2023-09-01 09:47:56,150 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=900, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=570, PETRI_PLACES=84, PETRI_TRANSITIONS=64} [2023-09-01 09:47:56,150 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 43 predicate places. [2023-09-01 09:47:56,150 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 64 transitions, 570 flow [2023-09-01 09:47:56,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.71428571428571) internal successors, (789), 7 states have internal predecessors, (789), 0 states have call successors, (0), 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:47:56,151 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:47:56,151 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] [2023-09-01 09:47:56,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-09-01 09:47:56,151 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:47:56,151 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:47:56,151 INFO L85 PathProgramCache]: Analyzing trace with hash 2046740600, now seen corresponding path program 1 times [2023-09-01 09:47:56,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:47:56,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53986738] [2023-09-01 09:47:56,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:47:56,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:47:56,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:47:56,322 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:47:56,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:47:56,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53986738] [2023-09-01 09:47:56,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53986738] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:47:56,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:47:56,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:47:56,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500426196] [2023-09-01 09:47:56,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:47:56,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:47:56,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:47:56,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:47:56,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:47:56,333 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 239 [2023-09-01 09:47:56,333 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 64 transitions, 570 flow. Second operand has 4 states, 4 states have (on average 112.5) internal successors, (450), 4 states have internal predecessors, (450), 0 states have call successors, (0), 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:47:56,333 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:47:56,333 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 239 [2023-09-01 09:47:56,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:47:56,591 INFO L130 PetriNetUnfolder]: 1672/2809 cut-off events. [2023-09-01 09:47:56,591 INFO L131 PetriNetUnfolder]: For 11643/11643 co-relation queries the response was YES. [2023-09-01 09:47:56,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12958 conditions, 2809 events. 1672/2809 cut-off events. For 11643/11643 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 15613 event pairs, 575 based on Foata normal form. 1/2810 useless extension candidates. Maximal degree in co-relation 12926. Up to 1619 conditions per place. [2023-09-01 09:47:56,600 INFO L137 encePairwiseOnDemand]: 235/239 looper letters, 43 selfloop transitions, 4 changer transitions 51/98 dead transitions. [2023-09-01 09:47:56,600 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 98 transitions, 1027 flow [2023-09-01 09:47:56,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:47:56,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:47:56,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 472 transitions. [2023-09-01 09:47:56,602 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49372384937238495 [2023-09-01 09:47:56,602 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 472 transitions. [2023-09-01 09:47:56,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 472 transitions. [2023-09-01 09:47:56,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:47:56,603 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 472 transitions. [2023-09-01 09:47:56,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 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:47:56,604 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 239.0) internal successors, (1195), 5 states have internal predecessors, (1195), 0 states have call successors, (0), 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:47:56,605 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 239.0) internal successors, (1195), 5 states have internal predecessors, (1195), 0 states have call successors, (0), 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:47:56,605 INFO L175 Difference]: Start difference. First operand has 84 places, 64 transitions, 570 flow. Second operand 4 states and 472 transitions. [2023-09-01 09:47:56,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 98 transitions, 1027 flow [2023-09-01 09:47:56,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 98 transitions, 847 flow, removed 46 selfloop flow, removed 13 redundant places. [2023-09-01 09:47:56,640 INFO L231 Difference]: Finished difference. Result has 71 places, 44 transitions, 260 flow [2023-09-01 09:47:56,641 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=260, PETRI_PLACES=71, PETRI_TRANSITIONS=44} [2023-09-01 09:47:56,641 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 30 predicate places. [2023-09-01 09:47:56,641 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 44 transitions, 260 flow [2023-09-01 09:47:56,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.5) internal successors, (450), 4 states have internal predecessors, (450), 0 states have call successors, (0), 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:47:56,641 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:47:56,642 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] [2023-09-01 09:47:56,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-09-01 09:47:56,642 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:47:56,642 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:47:56,642 INFO L85 PathProgramCache]: Analyzing trace with hash -961502186, now seen corresponding path program 2 times [2023-09-01 09:47:56,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:47:56,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555072972] [2023-09-01 09:47:56,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:47:56,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:47:56,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:47:57,136 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:47:57,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:47:57,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555072972] [2023-09-01 09:47:57,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555072972] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:47:57,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:47:57,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:47:57,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655724483] [2023-09-01 09:47:57,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:47:57,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 09:47:57,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:47:57,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 09:47:57,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-09-01 09:47:57,178 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 239 [2023-09-01 09:47:57,179 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 44 transitions, 260 flow. Second operand has 7 states, 7 states have (on average 104.71428571428571) internal successors, (733), 7 states have internal predecessors, (733), 0 states have call successors, (0), 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:47:57,179 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:47:57,179 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 239 [2023-09-01 09:47:57,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:47:57,364 INFO L130 PetriNetUnfolder]: 437/751 cut-off events. [2023-09-01 09:47:57,365 INFO L131 PetriNetUnfolder]: For 1540/1540 co-relation queries the response was YES. [2023-09-01 09:47:57,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2939 conditions, 751 events. 437/751 cut-off events. For 1540/1540 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2963 event pairs, 114 based on Foata normal form. 1/752 useless extension candidates. Maximal degree in co-relation 2909. Up to 302 conditions per place. [2023-09-01 09:47:57,367 INFO L137 encePairwiseOnDemand]: 232/239 looper letters, 41 selfloop transitions, 5 changer transitions 47/93 dead transitions. [2023-09-01 09:47:57,367 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 93 transitions, 721 flow [2023-09-01 09:47:57,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 09:47:57,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 09:47:57,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 868 transitions. [2023-09-01 09:47:57,369 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45397489539748953 [2023-09-01 09:47:57,369 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 868 transitions. [2023-09-01 09:47:57,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 868 transitions. [2023-09-01 09:47:57,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:47:57,370 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 868 transitions. [2023-09-01 09:47:57,371 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 108.5) internal successors, (868), 8 states have internal predecessors, (868), 0 states have call successors, (0), 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:47:57,373 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 239.0) internal successors, (2151), 9 states have internal predecessors, (2151), 0 states have call successors, (0), 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:47:57,373 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 239.0) internal successors, (2151), 9 states have internal predecessors, (2151), 0 states have call successors, (0), 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:47:57,373 INFO L175 Difference]: Start difference. First operand has 71 places, 44 transitions, 260 flow. Second operand 8 states and 868 transitions. [2023-09-01 09:47:57,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 93 transitions, 721 flow [2023-09-01 09:47:57,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 93 transitions, 673 flow, removed 11 selfloop flow, removed 9 redundant places. [2023-09-01 09:47:57,378 INFO L231 Difference]: Finished difference. Result has 68 places, 40 transitions, 221 flow [2023-09-01 09:47:57,378 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=221, PETRI_PLACES=68, PETRI_TRANSITIONS=40} [2023-09-01 09:47:57,378 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 27 predicate places. [2023-09-01 09:47:57,378 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 40 transitions, 221 flow [2023-09-01 09:47:57,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 104.71428571428571) internal successors, (733), 7 states have internal predecessors, (733), 0 states have call successors, (0), 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:47:57,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:47:57,379 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] [2023-09-01 09:47:57,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-09-01 09:47:57,379 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:47:57,379 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:47:57,379 INFO L85 PathProgramCache]: Analyzing trace with hash -2031276882, now seen corresponding path program 3 times [2023-09-01 09:47:57,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:47:57,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167036686] [2023-09-01 09:47:57,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:47:57,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:47:57,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:47:57,409 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-01 09:47:57,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:47:57,481 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-01 09:47:57,481 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-09-01 09:47:57,482 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-09-01 09:47:57,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-09-01 09:47:57,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-09-01 09:47:57,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-09-01 09:47:57,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-09-01 09:47:57,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-09-01 09:47:57,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-09-01 09:47:57,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-09-01 09:47:57,487 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:47:57,492 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-01 09:47:57,492 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-01 09:47:57,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.09 09:47:57 BasicIcfg [2023-09-01 09:47:57,577 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-01 09:47:57,578 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-09-01 09:47:57,578 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-09-01 09:47:57,578 INFO L275 PluginConnector]: Witness Printer initialized [2023-09-01 09:47:57,578 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:47:40" (3/4) ... [2023-09-01 09:47:57,579 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-09-01 09:47:57,647 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-09-01 09:47:57,647 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-09-01 09:47:57,647 INFO L158 Benchmark]: Toolchain (without parser) took 18788.12ms. Allocated memory was 67.1MB in the beginning and 2.0GB in the end (delta: 2.0GB). Free memory was 39.0MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 548.6MB. Max. memory is 16.1GB. [2023-09-01 09:47:57,647 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 54.5MB. Free memory was 32.6MB in the beginning and 32.5MB in the end (delta: 46.0kB). There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 09:47:57,648 INFO L158 Benchmark]: CACSL2BoogieTranslator took 510.08ms. Allocated memory is still 67.1MB. Free memory was 38.8MB in the beginning and 31.1MB in the end (delta: 7.8MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2023-09-01 09:47:57,648 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.30ms. Allocated memory is still 67.1MB. Free memory was 31.1MB in the beginning and 45.9MB in the end (delta: -14.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-09-01 09:47:57,648 INFO L158 Benchmark]: Boogie Preprocessor took 54.01ms. Allocated memory is still 67.1MB. Free memory was 45.9MB in the beginning and 43.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 09:47:57,648 INFO L158 Benchmark]: RCFGBuilder took 724.46ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 43.8MB in the beginning and 41.0MB in the end (delta: 2.8MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. [2023-09-01 09:47:57,649 INFO L158 Benchmark]: TraceAbstraction took 17354.35ms. Allocated memory was 81.8MB in the beginning and 2.0GB in the end (delta: 2.0GB). Free memory was 40.2MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 521.3MB. Max. memory is 16.1GB. [2023-09-01 09:47:57,649 INFO L158 Benchmark]: Witness Printer took 69.39ms. Allocated memory is still 2.0GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-09-01 09:47:57,652 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.14ms. Allocated memory is still 54.5MB. Free memory was 32.6MB in the beginning and 32.5MB in the end (delta: 46.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 510.08ms. Allocated memory is still 67.1MB. Free memory was 38.8MB in the beginning and 31.1MB in the end (delta: 7.8MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.30ms. Allocated memory is still 67.1MB. Free memory was 31.1MB in the beginning and 45.9MB in the end (delta: -14.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.01ms. Allocated memory is still 67.1MB. Free memory was 45.9MB in the beginning and 43.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 724.46ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 43.8MB in the beginning and 41.0MB in the end (delta: 2.8MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. * TraceAbstraction took 17354.35ms. Allocated memory was 81.8MB in the beginning and 2.0GB in the end (delta: 2.0GB). Free memory was 40.2MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 521.3MB. Max. memory is 16.1GB. * Witness Printer took 69.39ms. Allocated memory is still 2.0GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.6s, 136 PlacesBefore, 41 PlacesAfterwards, 125 TransitionsBefore, 29 TransitionsAfterwards, 2852 CoEnabledTransitionPairs, 8 FixpointIterations, 43 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 110 TotalNumberOfCompositions, 8050 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3416, independent: 3172, independent conditional: 0, independent unconditional: 3172, dependent: 244, dependent conditional: 0, dependent unconditional: 244, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1560, independent: 1521, independent conditional: 0, independent unconditional: 1521, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3416, independent: 1651, independent conditional: 0, independent unconditional: 1651, dependent: 205, dependent conditional: 0, dependent unconditional: 205, unknown: 1560, unknown conditional: 0, unknown unconditional: 1560] , Statistics on independence cache: Total cache size (in pairs): 130, Positive cache size: 113, Positive conditional cache size: 0, Positive unconditional cache size: 113, 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_p1_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L727] 0 _Bool y$flush_delayed; [L728] 0 int y$mem_tmp; [L729] 0 _Bool y$r_buff0_thd0; [L730] 0 _Bool y$r_buff0_thd1; [L731] 0 _Bool y$r_buff0_thd2; [L732] 0 _Bool y$r_buff0_thd3; [L733] 0 _Bool y$r_buff0_thd4; [L734] 0 _Bool y$r_buff1_thd0; [L735] 0 _Bool y$r_buff1_thd1; [L736] 0 _Bool y$r_buff1_thd2; [L737] 0 _Bool y$r_buff1_thd3; [L738] 0 _Bool y$r_buff1_thd4; [L739] 0 _Bool y$read_delayed; [L740] 0 int *y$read_delayed_var; [L741] 0 int y$w_buff0; [L742] 0 _Bool y$w_buff0_used; [L743] 0 int y$w_buff1; [L744] 0 _Bool y$w_buff1_used; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L856] 0 pthread_t t693; [L857] FCALL, FORK 0 pthread_create(&t693, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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(&t693, ((void *)0), P0, ((void *)0))=-3, t693={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] [L858] 0 pthread_t t694; [L859] FCALL, FORK 0 pthread_create(&t694, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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(&t694, ((void *)0), P1, ((void *)0))=-2, t693={5:0}, t694={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] [L860] 0 pthread_t t695; [L861] FCALL, FORK 0 pthread_create(&t695, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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(&t695, ((void *)0), P2, ((void *)0))=-1, t693={5:0}, t694={6:0}, t695={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] [L862] 0 pthread_t t696; [L863] FCALL, FORK 0 pthread_create(&t696, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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(&t696, ((void *)0), P3, ((void *)0))=0, t693={5:0}, t694={6:0}, t695={7:0}, t696={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_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] [L795] 3 y$w_buff1 = y$w_buff0 [L796] 3 y$w_buff0 = 1 [L797] 3 y$w_buff1_used = y$w_buff0_used [L798] 3 y$w_buff0_used = (_Bool)1 [L799] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L799] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L800] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L801] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L802] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L803] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L804] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L805] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L808] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L825] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L828] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L831] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L752] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L755] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L767] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L770] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L771] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L772] 2 y$flush_delayed = weak$$choice2 [L773] 2 y$mem_tmp = y [L774] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L775] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L776] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L777] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L778] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L780] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 __unbuffered_p1_EAX = y [L782] 2 y = y$flush_delayed ? y$mem_tmp : y [L783] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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$$choice2=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L788] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L790] 2 return 0; [L811] 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) [L812] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L813] 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 [L814] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L815] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_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$$choice2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L834] 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) [L835] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L836] 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 [L837] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L838] 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_p1_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$$choice2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L843] 4 return 0; [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 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) [L870] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L871] 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 [L872] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L873] 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_p1_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, t693={5:0}, t694={6:0}, t695={7:0}, t696={3:0}, weak$$choice2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L876] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L878] 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_p1_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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, 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: 857]: 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: 863]: 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: 861]: 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: 859]: 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, 164 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: 17.2s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 10.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 787 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 635 mSDsluCounter, 341 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 238 mSDsCounter, 85 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1683 IncrementalHoareTripleChecker+Invalid, 1768 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 85 mSolverCounterUnsat, 103 mSDtfsCounter, 1683 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1082occurred in iteration=9, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 262 NumberOfCodeBlocks, 262 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 223 ConstructedInterpolants, 0 QuantifiedInterpolants, 1612 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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:47:57,689 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