./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/parallel-ticket-6.wvr.c --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/parallel-ticket-6.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c7095f70ba7104a12a93da2a0b557c5b5c6880d23caa33c7c2fd19334f4cb537 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 02:09:45,014 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 02:09:45,016 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 02:09:45,054 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 02:09:45,055 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 02:09:45,058 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 02:09:45,059 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 02:09:45,061 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 02:09:45,063 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 02:09:45,068 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 02:09:45,068 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 02:09:45,073 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 02:09:45,074 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 02:09:45,076 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 02:09:45,076 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 02:09:45,078 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 02:09:45,079 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 02:09:45,082 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 02:09:45,084 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 02:09:45,085 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 02:09:45,098 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 02:09:45,099 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 02:09:45,100 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 02:09:45,101 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 02:09:45,110 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 02:09:45,111 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 02:09:45,111 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 02:09:45,112 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 02:09:45,113 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 02:09:45,114 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 02:09:45,114 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 02:09:45,115 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 02:09:45,116 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 02:09:45,117 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 02:09:45,118 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 02:09:45,119 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 02:09:45,120 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 02:09:45,120 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 02:09:45,120 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 02:09:45,121 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 02:09:45,122 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 02:09:45,123 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-31 02:09:45,156 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 02:09:45,157 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 02:09:45,157 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 02:09:45,157 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 02:09:45,158 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 02:09:45,158 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 02:09:45,159 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 02:09:45,159 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 02:09:45,159 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 02:09:45,159 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 02:09:45,160 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 02:09:45,160 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 02:09:45,161 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 02:09:45,161 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 02:09:45,161 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-31 02:09:45,161 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 02:09:45,161 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-31 02:09:45,162 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 02:09:45,162 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-31 02:09:45,162 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 02:09:45,162 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-31 02:09:45,162 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 02:09:45,163 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 02:09:45,163 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 02:09:45,163 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 02:09:45,163 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 02:09:45,163 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 02:09:45,164 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-31 02:09:45,164 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-31 02:09:45,164 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-31 02:09:45,164 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 02:09:45,164 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-31 02:09:45,165 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 02:09:45,165 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 02:09:45,165 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 02:09:45,165 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 -> c7095f70ba7104a12a93da2a0b557c5b5c6880d23caa33c7c2fd19334f4cb537 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-31 02:09:45,473 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 02:09:45,492 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 02:09:45,495 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 02:09:45,496 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 02:09:45,496 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 02:09:45,497 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-ticket-6.wvr.c [2023-08-31 02:09:46,594 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 02:09:46,813 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 02:09:46,813 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-6.wvr.c [2023-08-31 02:09:46,819 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fb48a764/f198eef90adb474394bea611c521f894/FLAG8bfceddc2 [2023-08-31 02:09:46,833 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fb48a764/f198eef90adb474394bea611c521f894 [2023-08-31 02:09:46,836 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 02:09:46,837 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 02:09:46,838 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 02:09:46,838 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 02:09:46,841 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 02:09:46,842 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 02:09:46" (1/1) ... [2023-08-31 02:09:46,842 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ad6f8da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:09:46, skipping insertion in model container [2023-08-31 02:09:46,843 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 02:09:46" (1/1) ... [2023-08-31 02:09:46,848 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 02:09:46,865 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 02:09:47,030 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-6.wvr.c[4400,4413] [2023-08-31 02:09:47,036 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 02:09:47,044 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 02:09:47,071 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-6.wvr.c[4400,4413] [2023-08-31 02:09:47,072 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 02:09:47,080 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 02:09:47,080 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 02:09:47,086 INFO L208 MainTranslator]: Completed translation [2023-08-31 02:09:47,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:09:47 WrapperNode [2023-08-31 02:09:47,087 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 02:09:47,088 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 02:09:47,088 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 02:09:47,088 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 02:09:47,094 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:09:47" (1/1) ... [2023-08-31 02:09:47,103 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:09:47" (1/1) ... [2023-08-31 02:09:47,130 INFO L138 Inliner]: procedures = 25, calls = 100, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 288 [2023-08-31 02:09:47,131 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 02:09:47,132 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 02:09:47,132 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 02:09:47,132 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 02:09:47,140 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:09:47" (1/1) ... [2023-08-31 02:09:47,140 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:09:47" (1/1) ... [2023-08-31 02:09:47,144 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:09:47" (1/1) ... [2023-08-31 02:09:47,144 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:09:47" (1/1) ... [2023-08-31 02:09:47,151 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:09:47" (1/1) ... [2023-08-31 02:09:47,162 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:09:47" (1/1) ... [2023-08-31 02:09:47,164 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:09:47" (1/1) ... [2023-08-31 02:09:47,166 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:09:47" (1/1) ... [2023-08-31 02:09:47,169 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 02:09:47,178 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 02:09:47,178 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 02:09:47,178 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 02:09:47,179 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:09:47" (1/1) ... [2023-08-31 02:09:47,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 02:09:47,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 02:09:47,210 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-31 02:09:47,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-31 02:09:47,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 02:09:47,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 02:09:47,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-31 02:09:47,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-31 02:09:47,256 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-31 02:09:47,256 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-31 02:09:47,257 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-31 02:09:47,257 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-31 02:09:47,257 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-31 02:09:47,257 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-31 02:09:47,257 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-08-31 02:09:47,257 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-08-31 02:09:47,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-31 02:09:47,258 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2023-08-31 02:09:47,258 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2023-08-31 02:09:47,258 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2023-08-31 02:09:47,258 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2023-08-31 02:09:47,258 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 02:09:47,258 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 02:09:47,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 02:09:47,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 02:09:47,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 02:09:47,260 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 02:09:47,445 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 02:09:47,447 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 02:09:47,797 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 02:09:47,961 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 02:09:47,967 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 02:09:47,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 02:09:47 BoogieIcfgContainer [2023-08-31 02:09:47,971 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 02:09:47,972 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 02:09:47,972 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 02:09:47,975 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 02:09:47,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 02:09:46" (1/3) ... [2023-08-31 02:09:47,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@572a75b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 02:09:47, skipping insertion in model container [2023-08-31 02:09:47,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:09:47" (2/3) ... [2023-08-31 02:09:47,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@572a75b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 02:09:47, skipping insertion in model container [2023-08-31 02:09:47,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 02:09:47" (3/3) ... [2023-08-31 02:09:47,979 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-ticket-6.wvr.c [2023-08-31 02:09:47,985 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-31 02:09:47,993 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 02:09:47,994 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-31 02:09:47,994 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 02:09:48,125 INFO L144 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2023-08-31 02:09:48,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 208 places, 191 transitions, 430 flow [2023-08-31 02:09:48,281 INFO L130 PetriNetUnfolder]: 2/185 cut-off events. [2023-08-31 02:09:48,281 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-08-31 02:09:48,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 185 events. 2/185 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 76 event pairs, 0 based on Foata normal form. 0/182 useless extension candidates. Maximal degree in co-relation 144. Up to 2 conditions per place. [2023-08-31 02:09:48,286 INFO L82 GeneralOperation]: Start removeDead. Operand has 208 places, 191 transitions, 430 flow [2023-08-31 02:09:48,294 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 186 places, 169 transitions, 374 flow [2023-08-31 02:09:48,297 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 02:09:48,312 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 186 places, 169 transitions, 374 flow [2023-08-31 02:09:48,316 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 186 places, 169 transitions, 374 flow [2023-08-31 02:09:48,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 169 transitions, 374 flow [2023-08-31 02:09:48,370 INFO L130 PetriNetUnfolder]: 2/169 cut-off events. [2023-08-31 02:09:48,371 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-08-31 02:09:48,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 169 events. 2/169 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/167 useless extension candidates. Maximal degree in co-relation 144. Up to 2 conditions per place. [2023-08-31 02:09:48,375 INFO L119 LiptonReduction]: Number of co-enabled transitions 3042 [2023-08-31 02:09:54,589 INFO L134 LiptonReduction]: Checked pairs total: 15662 [2023-08-31 02:09:54,590 INFO L136 LiptonReduction]: Total number of compositions: 126 [2023-08-31 02:09:54,601 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 02:09:54,607 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;@4cdc5405, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 02:09:54,608 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-31 02:09:54,616 INFO L130 PetriNetUnfolder]: 0/49 cut-off events. [2023-08-31 02:09:54,617 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-08-31 02:09:54,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:09:54,618 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 02:09:54,618 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-31 02:09:54,622 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:09:54,622 INFO L85 PathProgramCache]: Analyzing trace with hash 477829290, now seen corresponding path program 1 times [2023-08-31 02:09:54,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:09:54,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91080559] [2023-08-31 02:09:54,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:09:54,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:09:55,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:09:57,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:09:57,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:09:57,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91080559] [2023-08-31 02:09:57,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91080559] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 02:09:57,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 02:09:57,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 02:09:57,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584380879] [2023-08-31 02:09:57,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:09:57,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 02:09:57,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:09:57,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 02:09:57,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2023-08-31 02:09:57,171 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 317 [2023-08-31 02:09:57,177 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 50 transitions, 136 flow. Second operand has 7 states, 7 states have (on average 154.14285714285714) internal successors, (1079), 7 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:09:57,177 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:09:57,177 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 317 [2023-08-31 02:09:57,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:10:24,764 INFO L130 PetriNetUnfolder]: 421515/526270 cut-off events. [2023-08-31 02:10:24,764 INFO L131 PetriNetUnfolder]: For 30975/30975 co-relation queries the response was YES. [2023-08-31 02:10:26,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1079754 conditions, 526270 events. 421515/526270 cut-off events. For 30975/30975 co-relation queries the response was YES. Maximal size of possible extension queue 9895. Compared 3008673 event pairs, 87704 based on Foata normal form. 2/526272 useless extension candidates. Maximal degree in co-relation 953919. Up to 234423 conditions per place. [2023-08-31 02:10:27,305 INFO L137 encePairwiseOnDemand]: 308/317 looper letters, 143 selfloop transitions, 18 changer transitions 58/219 dead transitions. [2023-08-31 02:10:27,305 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 219 transitions, 1014 flow [2023-08-31 02:10:27,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 02:10:27,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 02:10:27,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1250 transitions. [2023-08-31 02:10:27,322 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5633168093735917 [2023-08-31 02:10:27,322 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1250 transitions. [2023-08-31 02:10:27,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1250 transitions. [2023-08-31 02:10:27,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:10:27,329 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1250 transitions. [2023-08-31 02:10:27,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 178.57142857142858) internal successors, (1250), 7 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:10:27,341 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 317.0) internal successors, (2536), 8 states have internal predecessors, (2536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:10:27,342 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 317.0) internal successors, (2536), 8 states have internal predecessors, (2536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:10:27,344 INFO L175 Difference]: Start difference. First operand has 69 places, 50 transitions, 136 flow. Second operand 7 states and 1250 transitions. [2023-08-31 02:10:27,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 219 transitions, 1014 flow [2023-08-31 02:10:42,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 219 transitions, 922 flow, removed 0 selfloop flow, removed 12 redundant places. [2023-08-31 02:10:42,373 INFO L231 Difference]: Finished difference. Result has 67 places, 71 transitions, 236 flow [2023-08-31 02:10:42,375 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=317, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=236, PETRI_PLACES=67, PETRI_TRANSITIONS=71} [2023-08-31 02:10:42,378 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, -2 predicate places. [2023-08-31 02:10:42,378 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 71 transitions, 236 flow [2023-08-31 02:10:42,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 154.14285714285714) internal successors, (1079), 7 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:10:42,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:10:42,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, 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-08-31 02:10:42,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-31 02:10:42,380 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-31 02:10:42,387 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:10:42,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1298141890, now seen corresponding path program 2 times [2023-08-31 02:10:42,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:10:42,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528181189] [2023-08-31 02:10:42,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:10:42,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:10:42,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:10:42,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:10:42,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:10:42,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528181189] [2023-08-31 02:10:42,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528181189] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 02:10:42,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 02:10:42,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 02:10:42,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448193342] [2023-08-31 02:10:42,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:10:42,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 02:10:42,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:10:42,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 02:10:42,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-31 02:10:42,850 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 317 [2023-08-31 02:10:42,851 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 71 transitions, 236 flow. Second operand has 6 states, 6 states have (on average 158.16666666666666) internal successors, (949), 6 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:10:42,851 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:10:42,851 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 317 [2023-08-31 02:10:42,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:10:50,059 INFO L130 PetriNetUnfolder]: 110776/147831 cut-off events. [2023-08-31 02:10:50,059 INFO L131 PetriNetUnfolder]: For 4523/5029 co-relation queries the response was YES. [2023-08-31 02:10:50,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 303404 conditions, 147831 events. 110776/147831 cut-off events. For 4523/5029 co-relation queries the response was YES. Maximal size of possible extension queue 5871. Compared 982459 event pairs, 16644 based on Foata normal form. 1180/139833 useless extension candidates. Maximal degree in co-relation 303393. Up to 115357 conditions per place. [2023-08-31 02:10:51,459 INFO L137 encePairwiseOnDemand]: 303/317 looper letters, 126 selfloop transitions, 30 changer transitions 0/184 dead transitions. [2023-08-31 02:10:51,460 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 184 transitions, 794 flow [2023-08-31 02:10:51,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 02:10:51,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 02:10:51,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1215 transitions. [2023-08-31 02:10:51,464 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5475439387111312 [2023-08-31 02:10:51,464 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1215 transitions. [2023-08-31 02:10:51,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1215 transitions. [2023-08-31 02:10:51,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:10:51,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1215 transitions. [2023-08-31 02:10:51,468 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 173.57142857142858) internal successors, (1215), 7 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:10:51,473 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 317.0) internal successors, (2536), 8 states have internal predecessors, (2536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:10:51,474 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 317.0) internal successors, (2536), 8 states have internal predecessors, (2536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:10:51,474 INFO L175 Difference]: Start difference. First operand has 67 places, 71 transitions, 236 flow. Second operand 7 states and 1215 transitions. [2023-08-31 02:10:51,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 184 transitions, 794 flow [2023-08-31 02:10:51,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 184 transitions, 784 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-31 02:10:51,537 INFO L231 Difference]: Finished difference. Result has 74 places, 100 transitions, 403 flow [2023-08-31 02:10:51,537 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=317, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=403, PETRI_PLACES=74, PETRI_TRANSITIONS=100} [2023-08-31 02:10:51,538 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 5 predicate places. [2023-08-31 02:10:51,538 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 100 transitions, 403 flow [2023-08-31 02:10:51,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 158.16666666666666) internal successors, (949), 6 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:10:51,539 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:10:51,539 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 02:10:51,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-31 02:10:51,540 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-31 02:10:51,540 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:10:51,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1863345826, now seen corresponding path program 3 times [2023-08-31 02:10:51,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:10:51,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454704947] [2023-08-31 02:10:51,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:10:51,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:10:51,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:10:51,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:10:51,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:10:51,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454704947] [2023-08-31 02:10:51,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454704947] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 02:10:51,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 02:10:51,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-31 02:10:51,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951483815] [2023-08-31 02:10:51,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:10:51,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 02:10:51,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:10:51,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 02:10:51,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-31 02:10:51,990 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 317 [2023-08-31 02:10:51,992 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 100 transitions, 403 flow. Second operand has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:10:51,992 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:10:51,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 317 [2023-08-31 02:10:51,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:11:09,858 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][273], [60#L181-4true, 72#L150true, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), 50#L45true, Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true, 147#L74true, 49#thread5EXITtrue, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 129#L93true, 245#(<= (+ ~s~0 4) ~t~0), 223#true, 216#(and (= ~b~0 0) (not (= ~x~0 1))), Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-08-31 02:11:09,858 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2023-08-31 02:11:09,858 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-31 02:11:09,859 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-31 02:11:09,859 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-31 02:11:11,628 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][273], [60#L181-4true, 72#L150true, 44#L49true, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true, 147#L74true, 49#thread5EXITtrue, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 129#L93true, 245#(<= (+ ~s~0 4) ~t~0), 223#true, 216#(and (= ~b~0 0) (not (= ~x~0 1))), Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-08-31 02:11:11,629 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-31 02:11:11,629 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-31 02:11:11,629 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-31 02:11:11,629 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-31 02:11:11,696 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][273], [72#L150true, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), 50#L45true, Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 87#L182-1true, 150#L112true, 147#L74true, 49#thread5EXITtrue, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 245#(<= (+ ~s~0 4) ~t~0), 129#L93true, 223#true, 216#(and (= ~b~0 0) (not (= ~x~0 1))), Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-08-31 02:11:11,696 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-31 02:11:11,696 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-31 02:11:11,696 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-31 02:11:11,696 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-31 02:11:12,942 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][313], [60#L181-4true, 72#L150true, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true, 211#true, 147#L74true, 49#thread5EXITtrue, 13#L52true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 129#L93true, 245#(<= (+ ~s~0 4) ~t~0), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-08-31 02:11:12,942 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-31 02:11:12,942 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-31 02:11:12,942 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-31 02:11:12,942 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-31 02:11:13,502 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][312], [60#L181-4true, 72#L150true, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true, 211#true, 147#L74true, 49#thread5EXITtrue, 13#L52true, 129#L93true, 245#(<= (+ ~s~0 4) ~t~0), Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-08-31 02:11:13,503 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-31 02:11:13,503 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-31 02:11:13,503 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-31 02:11:13,503 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-31 02:11:13,517 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][273], [72#L150true, 44#L49true, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 87#L182-1true, Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true, 147#L74true, 49#thread5EXITtrue, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 245#(<= (+ ~s~0 4) ~t~0), 129#L93true, 216#(and (= ~b~0 0) (not (= ~x~0 1))), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-08-31 02:11:13,517 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-31 02:11:13,517 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-31 02:11:13,517 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-31 02:11:13,517 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-31 02:11:14,646 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][313], [72#L150true, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 87#L182-1true, 150#L112true, 211#true, 147#L74true, 49#thread5EXITtrue, 13#L52true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 245#(<= (+ ~s~0 4) ~t~0), 129#L93true, 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-08-31 02:11:14,647 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-31 02:11:14,647 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-31 02:11:14,647 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-31 02:11:14,647 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-31 02:11:14,813 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][312], [72#L150true, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 87#L182-1true, Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true, 211#true, 147#L74true, 49#thread5EXITtrue, 13#L52true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 245#(<= (+ ~s~0 4) ~t~0), 129#L93true, 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-08-31 02:11:14,813 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-31 02:11:14,813 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-31 02:11:14,813 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-31 02:11:14,813 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-31 02:11:16,290 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([557] L109-->L112: Formula: (= (ite (= (ite (or (not (= (mod v_~b~0_6 256) 0)) (= v_~x~0_5 1)) 1 0) 0) 0 1) v_~b~0_5) InVars {~b~0=v_~b~0_6, ~x~0=v_~x~0_5} OutVars{~b~0=v_~b~0_5, ~x~0=v_~x~0_5} AuxVars[] AssignedVars[~b~0][199], [60#L181-4true, 243#(<= (+ 2 ~s~0) ~t~0), 80#thread3EXITtrue, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true, 211#true, 147#L74true, 194#thread1EXITtrue, 7#thread6EXITtrue, 22#L131true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-08-31 02:11:16,291 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-31 02:11:16,291 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-31 02:11:16,291 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-31 02:11:16,291 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-31 02:11:16,617 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([658] L74-->thread2EXIT: Formula: (and (= (+ v_~s~0_127 1) v_~s~0_126) (= |v_thread2Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_7| 0)) InVars {~s~0=v_~s~0_127} OutVars{thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_7|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_7|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_5|, ~s~0=v_~s~0_126} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_#t~post4#1, ~s~0][263], [72#L150true, 37#thread2EXITtrue, 157#L183-1true, 243#(<= (+ 2 ~s~0) ~t~0), Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 211#true, 195#L105true, 49#thread5EXITtrue, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 129#L93true, 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-08-31 02:11:16,618 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-31 02:11:16,618 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-31 02:11:16,618 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-31 02:11:16,618 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-31 02:11:16,980 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([557] L109-->L112: Formula: (= (ite (= (ite (or (not (= (mod v_~b~0_6 256) 0)) (= v_~x~0_5 1)) 1 0) 0) 0 1) v_~b~0_5) InVars {~b~0=v_~b~0_6, ~x~0=v_~x~0_5} OutVars{~b~0=v_~b~0_5, ~x~0=v_~x~0_5} AuxVars[] AssignedVars[~b~0][199], [243#(<= (+ 2 ~s~0) ~t~0), 80#thread3EXITtrue, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 87#L182-1true, Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true, 211#true, 147#L74true, 194#thread1EXITtrue, 7#thread6EXITtrue, 22#L131true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-08-31 02:11:16,980 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-31 02:11:16,980 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-31 02:11:16,988 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-31 02:11:16,988 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-31 02:11:17,209 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([658] L74-->thread2EXIT: Formula: (and (= (+ v_~s~0_127 1) v_~s~0_126) (= |v_thread2Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_7| 0)) InVars {~s~0=v_~s~0_127} OutVars{thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_7|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_7|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_5|, ~s~0=v_~s~0_126} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_#t~post4#1, ~s~0][263], [72#L150true, 37#thread2EXITtrue, 157#L183-1true, 243#(<= (+ 2 ~s~0) ~t~0), Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 52#L109true, 211#true, 49#thread5EXITtrue, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 129#L93true, 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-08-31 02:11:17,209 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-31 02:11:17,209 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-31 02:11:17,209 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-31 02:11:17,209 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-31 02:11:17,235 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([668] L93-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res#1.offset_7| 0) (= (+ v_~s~0_135 1) v_~s~0_134) (= |v_thread3Thread1of1ForFork2_#res#1.base_7| 0)) InVars {~s~0=v_~s~0_135} OutVars{thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_7|, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_7|, thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_7|, ~s~0=v_~s~0_134} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork2_#res#1.base, thread3Thread1of1ForFork2_#t~post6#1, ~s~0][177], [72#L150true, 37#thread2EXITtrue, 110#L128true, 157#L183-1true, 80#thread3EXITtrue, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true, 211#true, 242#(<= (+ ~s~0 1) ~t~0), Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-08-31 02:11:17,236 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-31 02:11:17,236 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-31 02:11:17,236 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-31 02:11:17,236 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-31 02:11:17,237 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([658] L74-->thread2EXIT: Formula: (and (= (+ v_~s~0_127 1) v_~s~0_126) (= |v_thread2Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_7| 0)) InVars {~s~0=v_~s~0_127} OutVars{thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_7|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_7|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_5|, ~s~0=v_~s~0_126} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_#t~post4#1, ~s~0][202], [72#L150true, 37#thread2EXITtrue, 157#L183-1true, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 52#L109true, 211#true, 49#thread5EXITtrue, 242#(<= (+ ~s~0 1) ~t~0), Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 129#L93true, 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-08-31 02:11:17,237 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-31 02:11:17,237 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-31 02:11:17,237 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-31 02:11:17,237 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-31 02:11:17,382 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([668] L93-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res#1.offset_7| 0) (= (+ v_~s~0_135 1) v_~s~0_134) (= |v_thread3Thread1of1ForFork2_#res#1.base_7| 0)) InVars {~s~0=v_~s~0_135} OutVars{thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_7|, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_7|, thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_7|, ~s~0=v_~s~0_134} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork2_#res#1.base, thread3Thread1of1ForFork2_#t~post6#1, ~s~0][177], [113#L183-2true, 72#L150true, 110#L128true, 80#thread3EXITtrue, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true, 211#true, 242#(<= (+ ~s~0 1) ~t~0), Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-08-31 02:11:17,382 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-31 02:11:17,382 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-31 02:11:17,382 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-31 02:11:17,382 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-31 02:11:17,469 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([668] L93-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res#1.offset_7| 0) (= (+ v_~s~0_135 1) v_~s~0_134) (= |v_thread3Thread1of1ForFork2_#res#1.base_7| 0)) InVars {~s~0=v_~s~0_135} OutVars{thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_7|, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_7|, thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_7|, ~s~0=v_~s~0_134} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork2_#res#1.base, thread3Thread1of1ForFork2_#t~post6#1, ~s~0][177], [72#L150true, 110#L128true, 80#thread3EXITtrue, 79#L184-1true, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true, 211#true, 242#(<= (+ ~s~0 1) ~t~0), Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-08-31 02:11:17,469 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-31 02:11:17,469 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-31 02:11:17,469 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-31 02:11:17,469 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-31 02:11:17,608 INFO L130 PetriNetUnfolder]: 248438/349622 cut-off events. [2023-08-31 02:11:17,609 INFO L131 PetriNetUnfolder]: For 185337/185821 co-relation queries the response was YES. [2023-08-31 02:11:19,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 913048 conditions, 349622 events. 248438/349622 cut-off events. For 185337/185821 co-relation queries the response was YES. Maximal size of possible extension queue 15070. Compared 2920985 event pairs, 49714 based on Foata normal form. 1114/325906 useless extension candidates. Maximal degree in co-relation 488008. Up to 92985 conditions per place. [2023-08-31 02:11:20,498 INFO L137 encePairwiseOnDemand]: 303/317 looper letters, 213 selfloop transitions, 153 changer transitions 0/394 dead transitions. [2023-08-31 02:11:20,498 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 394 transitions, 2129 flow [2023-08-31 02:11:20,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-31 02:11:20,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-31 02:11:20,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2254 transitions. [2023-08-31 02:11:20,504 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5469546226644019 [2023-08-31 02:11:20,504 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2254 transitions. [2023-08-31 02:11:20,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2254 transitions. [2023-08-31 02:11:20,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:11:20,506 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2254 transitions. [2023-08-31 02:11:20,510 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 173.3846153846154) internal successors, (2254), 13 states have internal predecessors, (2254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:11:20,517 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 317.0) internal successors, (4438), 14 states have internal predecessors, (4438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:11:20,518 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 317.0) internal successors, (4438), 14 states have internal predecessors, (4438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:11:20,518 INFO L175 Difference]: Start difference. First operand has 74 places, 100 transitions, 403 flow. Second operand 13 states and 2254 transitions. [2023-08-31 02:11:20,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 394 transitions, 2129 flow [2023-08-31 02:11:21,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 394 transitions, 2129 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 02:11:21,193 INFO L231 Difference]: Finished difference. Result has 91 places, 240 transitions, 1596 flow [2023-08-31 02:11:21,194 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=317, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1596, PETRI_PLACES=91, PETRI_TRANSITIONS=240} [2023-08-31 02:11:21,194 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 22 predicate places. [2023-08-31 02:11:21,195 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 240 transitions, 1596 flow [2023-08-31 02:11:21,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:11:21,195 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:11:21,196 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 02:11:21,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-31 02:11:21,196 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-31 02:11:21,196 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:11:21,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1998415786, now seen corresponding path program 4 times [2023-08-31 02:11:21,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:11:21,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712948688] [2023-08-31 02:11:21,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:11:21,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:11:21,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:11:21,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:11:21,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:11:21,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712948688] [2023-08-31 02:11:21,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712948688] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 02:11:21,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 02:11:21,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 02:11:21,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766220057] [2023-08-31 02:11:21,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:11:21,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 02:11:21,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:11:21,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 02:11:21,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-31 02:11:21,713 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 317 [2023-08-31 02:11:21,715 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 240 transitions, 1596 flow. Second operand has 7 states, 7 states have (on average 157.14285714285714) internal successors, (1100), 7 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:11:21,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:11:21,715 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 317 [2023-08-31 02:11:21,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand