./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix023_power.opt_pso.opt_rmo.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix023_power.opt_pso.opt_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 28f58acc3eb15266c6a84eca373e682a200492b696916dc340e2c03025141f5c --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:46:42,923 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 09:46:42,924 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 09:46:42,953 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 09:46:42,954 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 09:46:42,956 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 09:46:42,957 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 09:46:42,960 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 09:46:42,962 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 09:46:42,964 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 09:46:42,965 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 09:46:42,966 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 09:46:42,967 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 09:46:42,970 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 09:46:42,971 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 09:46:42,972 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 09:46:42,972 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 09:46:42,973 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 09:46:42,975 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 09:46:42,977 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 09:46:42,979 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 09:46:42,982 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 09:46:42,983 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 09:46:42,983 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 09:46:42,986 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 09:46:42,988 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 09:46:42,989 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 09:46:42,989 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 09:46:42,990 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 09:46:42,991 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 09:46:42,991 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 09:46:42,992 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 09:46:42,993 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 09:46:42,995 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 09:46:42,996 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 09:46:42,996 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 09:46:42,997 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 09:46:42,997 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 09:46:42,997 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 09:46:42,998 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 09:46:42,998 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 09:46:43,000 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:46:43,030 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 09:46:43,031 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 09:46:43,032 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 09:46:43,032 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 09:46:43,033 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 09:46:43,033 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 09:46:43,033 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 09:46:43,033 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 09:46:43,034 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 09:46:43,034 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 09:46:43,035 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 09:46:43,035 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 09:46:43,035 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 09:46:43,035 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 09:46:43,035 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-01 09:46:43,035 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 09:46:43,035 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-01 09:46:43,036 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 09:46:43,036 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-09-01 09:46:43,036 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 09:46:43,036 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-01 09:46:43,036 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 09:46:43,036 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 09:46:43,036 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 09:46:43,037 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:46:43,037 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 09:46:43,037 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 09:46:43,037 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-01 09:46:43,037 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 09:46:43,037 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 09:46:43,038 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 09:46:43,038 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-01 09:46:43,038 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 09:46:43,038 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 09:46:43,038 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 09:46:43,038 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 -> 28f58acc3eb15266c6a84eca373e682a200492b696916dc340e2c03025141f5c 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:46:43,303 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 09:46:43,318 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 09:46:43,320 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 09:46:43,321 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 09:46:43,321 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 09:46:43,322 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix023_power.opt_pso.opt_rmo.opt.i [2023-09-01 09:46:44,535 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 09:46:44,747 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 09:46:44,748 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_power.opt_pso.opt_rmo.opt.i [2023-09-01 09:46:44,758 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0afc29f76/5026783307f64f599923c969c67ec5ed/FLAG29bf437db [2023-09-01 09:46:44,769 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0afc29f76/5026783307f64f599923c969c67ec5ed [2023-09-01 09:46:44,771 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 09:46:44,771 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 09:46:44,772 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 09:46:44,772 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 09:46:44,783 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 09:46:44,784 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:46:44" (1/1) ... [2023-09-01 09:46:44,784 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56ec2a42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:46:44, skipping insertion in model container [2023-09-01 09:46:44,786 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:46:44" (1/1) ... [2023-09-01 09:46:44,790 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 09:46:44,829 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 09:46:44,934 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/mix023_power.opt_pso.opt_rmo.opt.i[966,979] [2023-09-01 09:46:45,081 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:46:45,092 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 09:46:45,101 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/mix023_power.opt_pso.opt_rmo.opt.i[966,979] [2023-09-01 09:46:45,150 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:46:45,180 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:46:45,180 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:46:45,185 INFO L208 MainTranslator]: Completed translation [2023-09-01 09:46:45,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:46:45 WrapperNode [2023-09-01 09:46:45,185 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 09:46:45,186 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 09:46:45,186 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 09:46:45,186 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 09:46:45,191 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:46:45" (1/1) ... [2023-09-01 09:46:45,221 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:46:45" (1/1) ... [2023-09-01 09:46:45,262 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2023-09-01 09:46:45,263 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 09:46:45,263 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 09:46:45,263 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 09:46:45,263 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 09:46:45,269 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:46:45" (1/1) ... [2023-09-01 09:46:45,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:46:45" (1/1) ... [2023-09-01 09:46:45,278 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:46:45" (1/1) ... [2023-09-01 09:46:45,279 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:46:45" (1/1) ... [2023-09-01 09:46:45,284 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:46:45" (1/1) ... [2023-09-01 09:46:45,294 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:46:45" (1/1) ... [2023-09-01 09:46:45,295 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:46:45" (1/1) ... [2023-09-01 09:46:45,296 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:46:45" (1/1) ... [2023-09-01 09:46:45,298 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 09:46:45,299 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 09:46:45,303 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 09:46:45,303 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 09:46:45,303 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:46:45" (1/1) ... [2023-09-01 09:46:45,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:46:45,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 09:46:45,345 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:46:45,375 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:46:45,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 09:46:45,382 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-01 09:46:45,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 09:46:45,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 09:46:45,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 09:46:45,382 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-09-01 09:46:45,382 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-09-01 09:46:45,382 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-09-01 09:46:45,382 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-09-01 09:46:45,383 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-09-01 09:46:45,383 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-09-01 09:46:45,383 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-09-01 09:46:45,383 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-09-01 09:46:45,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 09:46:45,383 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-01 09:46:45,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 09:46:45,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 09:46:45,384 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:46:45,548 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 09:46:45,549 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 09:46:45,744 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 09:46:45,844 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 09:46:45,844 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-09-01 09:46:45,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:46:45 BoogieIcfgContainer [2023-09-01 09:46:45,847 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 09:46:45,849 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 09:46:45,849 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 09:46:45,851 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 09:46:45,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 09:46:44" (1/3) ... [2023-09-01 09:46:45,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46b1dede and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:46:45, skipping insertion in model container [2023-09-01 09:46:45,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:46:45" (2/3) ... [2023-09-01 09:46:45,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46b1dede and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:46:45, skipping insertion in model container [2023-09-01 09:46:45,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:46:45" (3/3) ... [2023-09-01 09:46:45,854 INFO L112 eAbstractionObserver]: Analyzing ICFG mix023_power.opt_pso.opt_rmo.opt.i [2023-09-01 09:46:45,863 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-01 09:46:45,871 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 09:46:45,871 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-09-01 09:46:45,871 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 09:46:45,929 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-09-01 09:46:45,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 280 flow [2023-09-01 09:46:46,024 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2023-09-01 09:46:46,024 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:46:46,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 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/122 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-09-01 09:46:46,030 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 130 transitions, 280 flow [2023-09-01 09:46:46,035 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 126 transitions, 264 flow [2023-09-01 09:46:46,039 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 09:46:46,050 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 126 transitions, 264 flow [2023-09-01 09:46:46,053 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 126 transitions, 264 flow [2023-09-01 09:46:46,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 126 transitions, 264 flow [2023-09-01 09:46:46,081 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2023-09-01 09:46:46,082 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:46:46,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 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/122 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-09-01 09:46:46,085 INFO L119 LiptonReduction]: Number of co-enabled transitions 2986 [2023-09-01 09:46:49,026 INFO L134 LiptonReduction]: Checked pairs total: 7942 [2023-09-01 09:46:49,026 INFO L136 LiptonReduction]: Total number of compositions: 110 [2023-09-01 09:46:49,039 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 09:46:49,043 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;@4828847a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 09:46:49,043 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-09-01 09:46:49,048 INFO L130 PetriNetUnfolder]: 0/12 cut-off events. [2023-09-01 09:46:49,049 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:46:49,049 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:46:49,049 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:46:49,050 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:46:49,053 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:46:49,053 INFO L85 PathProgramCache]: Analyzing trace with hash 534499000, now seen corresponding path program 1 times [2023-09-01 09:46:49,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:46:49,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904200710] [2023-09-01 09:46:49,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:46:49,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:46:49,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:46:49,434 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:46:49,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:46:49,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904200710] [2023-09-01 09:46:49,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904200710] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:46:49,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:46:49,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:46:49,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669553162] [2023-09-01 09:46:49,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:46:49,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:46:49,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:46:49,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:46:49,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:46:49,461 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 240 [2023-09-01 09:46:49,463 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 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:46:49,463 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:46:49,463 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 240 [2023-09-01 09:46:49,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:46:49,905 INFO L130 PetriNetUnfolder]: 2855/4235 cut-off events. [2023-09-01 09:46:49,905 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2023-09-01 09:46:49,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8311 conditions, 4235 events. 2855/4235 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 24003 event pairs, 545 based on Foata normal form. 0/4003 useless extension candidates. Maximal degree in co-relation 8299. Up to 3103 conditions per place. [2023-09-01 09:46:49,940 INFO L137 encePairwiseOnDemand]: 236/240 looper letters, 33 selfloop transitions, 2 changer transitions 2/42 dead transitions. [2023-09-01 09:46:49,940 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 42 transitions, 173 flow [2023-09-01 09:46:49,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:46:49,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:46:49,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2023-09-01 09:46:49,950 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5388888888888889 [2023-09-01 09:46:49,950 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 388 transitions. [2023-09-01 09:46:49,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions. [2023-09-01 09:46:49,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:46:49,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions. [2023-09-01 09:46:49,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 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:46:49,958 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 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:46:49,958 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 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:46:49,959 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 72 flow. Second operand 3 states and 388 transitions. [2023-09-01 09:46:49,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 42 transitions, 173 flow [2023-09-01 09:46:49,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 42 transitions, 168 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-09-01 09:46:49,963 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 66 flow [2023-09-01 09:46:49,964 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2023-09-01 09:46:49,967 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2023-09-01 09:46:49,967 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 66 flow [2023-09-01 09:46:49,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 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:46:49,967 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:46:49,967 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:46:49,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 09:46:49,968 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:46:49,968 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:46:49,968 INFO L85 PathProgramCache]: Analyzing trace with hash 527391973, now seen corresponding path program 1 times [2023-09-01 09:46:49,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:46:49,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848293528] [2023-09-01 09:46:49,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:46:49,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:46:50,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:46:50,209 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:46:50,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:46:50,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848293528] [2023-09-01 09:46:50,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848293528] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:46:50,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:46:50,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:46:50,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336279511] [2023-09-01 09:46:50,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:46:50,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:46:50,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:46:50,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:46:50,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:46:50,229 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 240 [2023-09-01 09:46:50,229 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 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:46:50,230 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:46:50,230 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 240 [2023-09-01 09:46:50,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:46:51,464 INFO L130 PetriNetUnfolder]: 12556/17185 cut-off events. [2023-09-01 09:46:51,466 INFO L131 PetriNetUnfolder]: For 752/752 co-relation queries the response was YES. [2023-09-01 09:46:51,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35532 conditions, 17185 events. 12556/17185 cut-off events. For 752/752 co-relation queries the response was YES. Maximal size of possible extension queue 584. Compared 88981 event pairs, 4324 based on Foata normal form. 484/17669 useless extension candidates. Maximal degree in co-relation 35522. Up to 10805 conditions per place. [2023-09-01 09:46:51,564 INFO L137 encePairwiseOnDemand]: 230/240 looper letters, 40 selfloop transitions, 9 changer transitions 0/49 dead transitions. [2023-09-01 09:46:51,565 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 49 transitions, 214 flow [2023-09-01 09:46:51,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:46:51,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:46:51,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2023-09-01 09:46:51,568 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5027777777777778 [2023-09-01 09:46:51,568 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 362 transitions. [2023-09-01 09:46:51,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 362 transitions. [2023-09-01 09:46:51,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:46:51,569 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 362 transitions. [2023-09-01 09:46:51,570 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 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:46:51,572 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 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:46:51,572 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 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:46:51,573 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 66 flow. Second operand 3 states and 362 transitions. [2023-09-01 09:46:51,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 49 transitions, 214 flow [2023-09-01 09:46:51,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 49 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:46:51,576 INFO L231 Difference]: Finished difference. Result has 40 places, 35 transitions, 132 flow [2023-09-01 09:46:51,577 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=40, PETRI_TRANSITIONS=35} [2023-09-01 09:46:51,577 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2023-09-01 09:46:51,577 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 132 flow [2023-09-01 09:46:51,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 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:46:51,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:46:51,578 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:46:51,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 09:46:51,579 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:46:51,580 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:46:51,581 INFO L85 PathProgramCache]: Analyzing trace with hash -830719293, now seen corresponding path program 1 times [2023-09-01 09:46:51,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:46:51,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569935985] [2023-09-01 09:46:51,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:46:51,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:46:51,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:46:51,936 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:46:51,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:46:51,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569935985] [2023-09-01 09:46:51,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569935985] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:46:51,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:46:51,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:46:51,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101645896] [2023-09-01 09:46:51,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:46:51,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:46:51,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:46:51,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:46:51,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:46:51,944 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 240 [2023-09-01 09:46:51,944 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 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:46:51,944 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:46:51,945 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 240 [2023-09-01 09:46:51,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:46:52,875 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([370] L768-->L771: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~x~0_3) InVars {~x~0=v_~x~0_3} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~x~0=v_~x~0_3} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0][17], [17#L877true, 42#L756true, 154#true, 110#L771true, 32#L835true, 14#P2EXITtrue, P2Thread1of1ForFork1InUse, Black: 150#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P0Thread1of1ForFork2InUse, 148#true, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse]) [2023-09-01 09:46:52,876 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-09-01 09:46:52,876 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:46:52,876 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:46:52,876 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:46:52,877 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([471] L756-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.base_7| 0) (= |v_P0Thread1of1ForFork2_#res.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base][8], [17#L877true, 156#(= ~__unbuffered_p1_EAX~0 0), 32#L835true, 78#P0EXITtrue, 14#P2EXITtrue, Black: 148#true, P2Thread1of1ForFork1InUse, 21#L768true, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, 150#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2023-09-01 09:46:52,877 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-09-01 09:46:52,877 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:46:52,877 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:46:52,877 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:46:53,080 INFO L130 PetriNetUnfolder]: 8315/11992 cut-off events. [2023-09-01 09:46:53,081 INFO L131 PetriNetUnfolder]: For 5566/5733 co-relation queries the response was YES. [2023-09-01 09:46:53,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30167 conditions, 11992 events. 8315/11992 cut-off events. For 5566/5733 co-relation queries the response was YES. Maximal size of possible extension queue 595. Compared 71365 event pairs, 2393 based on Foata normal form. 216/11392 useless extension candidates. Maximal degree in co-relation 30155. Up to 7499 conditions per place. [2023-09-01 09:46:53,160 INFO L137 encePairwiseOnDemand]: 237/240 looper letters, 39 selfloop transitions, 3 changer transitions 0/50 dead transitions. [2023-09-01 09:46:53,160 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 50 transitions, 256 flow [2023-09-01 09:46:53,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:46:53,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:46:53,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 383 transitions. [2023-09-01 09:46:53,162 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5319444444444444 [2023-09-01 09:46:53,163 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 383 transitions. [2023-09-01 09:46:53,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 383 transitions. [2023-09-01 09:46:53,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:46:53,163 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 383 transitions. [2023-09-01 09:46:53,164 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 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:46:53,166 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 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:46:53,167 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 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:46:53,167 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 132 flow. Second operand 3 states and 383 transitions. [2023-09-01 09:46:53,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 50 transitions, 256 flow [2023-09-01 09:46:53,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 236 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:46:53,210 INFO L231 Difference]: Finished difference. Result has 41 places, 35 transitions, 125 flow [2023-09-01 09:46:53,210 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=41, PETRI_TRANSITIONS=35} [2023-09-01 09:46:53,211 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -1 predicate places. [2023-09-01 09:46:53,212 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 35 transitions, 125 flow [2023-09-01 09:46:53,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 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:46:53,212 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:46:53,212 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:46:53,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 09:46:53,213 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:46:53,213 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:46:53,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1197194893, now seen corresponding path program 1 times [2023-09-01 09:46:53,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:46:53,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240805914] [2023-09-01 09:46:53,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:46:53,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:46:53,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:46:53,522 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:46:53,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:46:53,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240805914] [2023-09-01 09:46:53,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240805914] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:46:53,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:46:53,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 09:46:53,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214553360] [2023-09-01 09:46:53,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:46:53,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:46:53,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:46:53,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:46:53,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:46:53,545 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 240 [2023-09-01 09:46:53,550 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 125 flow. Second operand has 4 states, 4 states have (on average 107.25) internal successors, (429), 4 states have internal predecessors, (429), 0 states have call successors, (0), 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:46:53,550 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:46:53,550 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 240 [2023-09-01 09:46:53,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:46:54,900 INFO L130 PetriNetUnfolder]: 10830/14847 cut-off events. [2023-09-01 09:46:54,901 INFO L131 PetriNetUnfolder]: For 5004/5004 co-relation queries the response was YES. [2023-09-01 09:46:54,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37530 conditions, 14847 events. 10830/14847 cut-off events. For 5004/5004 co-relation queries the response was YES. Maximal size of possible extension queue 477. Compared 73431 event pairs, 2795 based on Foata normal form. 120/14967 useless extension candidates. Maximal degree in co-relation 37517. Up to 6293 conditions per place. [2023-09-01 09:46:55,020 INFO L137 encePairwiseOnDemand]: 231/240 looper letters, 54 selfloop transitions, 9 changer transitions 0/63 dead transitions. [2023-09-01 09:46:55,020 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 63 transitions, 333 flow [2023-09-01 09:46:55,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:46:55,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:46:55,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 473 transitions. [2023-09-01 09:46:55,023 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49270833333333336 [2023-09-01 09:46:55,023 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 473 transitions. [2023-09-01 09:46:55,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 473 transitions. [2023-09-01 09:46:55,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:46:55,023 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 473 transitions. [2023-09-01 09:46:55,025 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.25) internal successors, (473), 4 states have internal predecessors, (473), 0 states have call successors, (0), 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:46:55,027 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 0 states have call successors, (0), 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:46:55,027 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 0 states have call successors, (0), 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:46:55,027 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 125 flow. Second operand 4 states and 473 transitions. [2023-09-01 09:46:55,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 63 transitions, 333 flow [2023-09-01 09:46:55,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 63 transitions, 323 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:46:55,034 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 188 flow [2023-09-01 09:46:55,034 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=188, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2023-09-01 09:46:55,035 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2023-09-01 09:46:55,035 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 188 flow [2023-09-01 09:46:55,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.25) internal successors, (429), 4 states have internal predecessors, (429), 0 states have call successors, (0), 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:46:55,036 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:46:55,036 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:46:55,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 09:46:55,037 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:46:55,037 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:46:55,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1526219066, now seen corresponding path program 1 times [2023-09-01 09:46:55,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:46:55,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199053071] [2023-09-01 09:46:55,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:46:55,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:46:55,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:46:55,243 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:46:55,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:46:55,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199053071] [2023-09-01 09:46:55,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199053071] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:46:55,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:46:55,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:46:55,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591299466] [2023-09-01 09:46:55,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:46:55,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:46:55,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:46:55,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:46:55,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:46:55,260 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 240 [2023-09-01 09:46:55,262 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 188 flow. Second operand has 4 states, 4 states have (on average 114.25) internal successors, (457), 4 states have internal predecessors, (457), 0 states have call successors, (0), 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:46:55,262 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:46:55,262 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 240 [2023-09-01 09:46:55,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:46:56,008 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([471] L756-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.base_7| 0) (= |v_P0Thread1of1ForFork2_#res.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base][84], [170#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 161#(= ~__unbuffered_p3_EAX~0 0), 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 32#L835true, Black: 159#true, 14#P2EXITtrue, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, 74#L2true, 78#P0EXITtrue, Black: 148#true, 21#L768true]) [2023-09-01 09:46:56,009 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-09-01 09:46:56,009 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-09-01 09:46:56,009 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-09-01 09:46:56,009 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-09-01 09:46:56,101 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([471] L756-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.base_7| 0) (= |v_P0Thread1of1ForFork2_#res.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base][84], [170#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 161#(= ~__unbuffered_p3_EAX~0 0), 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 32#L835true, 110#L771true, Black: 159#true, 14#P2EXITtrue, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, 74#L2true, 78#P0EXITtrue, Black: 148#true, Black: 156#(= ~__unbuffered_p1_EAX~0 0)]) [2023-09-01 09:46:56,102 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-09-01 09:46:56,102 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:46:56,102 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:46:56,102 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:46:56,103 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([371] L771-->L787: Formula: (let ((.cse8 (= (mod v_~y$r_buff1_thd2~0_52 256) 0)) (.cse3 (= (mod v_~y$r_buff0_thd2~0_52 256) 0))) (let ((.cse6 (not .cse3)) (.cse12 (= (mod v_~y$w_buff0_used~0_128 256) 0)) (.cse5 (and .cse3 .cse8)) (.cse11 (and (= 0 (mod v_~y$w_buff1_used~0_115 256)) .cse3))) (let ((.cse9 (or .cse12 .cse5 .cse11)) (.cse10 (and (not .cse12) .cse6))) (let ((.cse4 (= (mod v_~y$w_buff1_used~0_114 256) 0)) (.cse1 (ite .cse9 v_~y~0_86 (ite .cse10 v_~y$w_buff0~0_59 v_~y$w_buff1~0_52))) (.cse0 (not (= (mod v_~weak$$choice2~0_40 256) 0))) (.cse2 (= (mod v_~y$w_buff0_used~0_127 256) 0))) (and (= v_~y~0_86 v_~y$mem_tmp~0_24) (= v_~y$w_buff0~0_59 v_~y$w_buff0~0_58) (= v_~y~0_84 (ite .cse0 v_~y$mem_tmp~0_24 .cse1)) (= v_~y$r_buff0_thd2~0_51 (ite .cse0 v_~y$r_buff0_thd2~0_52 (ite (or .cse2 (and .cse3 .cse4) .cse5) v_~y$r_buff0_thd2~0_52 (ite (and .cse6 (not .cse2)) 0 v_~y$r_buff0_thd2~0_52)))) (= (ite .cse0 v_~y$r_buff1_thd2~0_52 (ite (let ((.cse7 (= (mod v_~y$r_buff0_thd2~0_51 256) 0))) (or .cse2 (and .cse7 .cse8) (and .cse7 .cse4))) v_~y$r_buff1_thd2~0_52 0)) v_~y$r_buff1_thd2~0_51) (= 0 v_~y$flush_delayed~0_27) (= v_~y$w_buff0_used~0_127 (ite .cse0 v_~y$w_buff0_used~0_128 (ite .cse9 v_~y$w_buff0_used~0_128 (ite .cse10 0 v_~y$w_buff0_used~0_128)))) (= v_~__unbuffered_p1_EBX~0_12 .cse1) (= v_~y$w_buff1~0_52 v_~y$w_buff1~0_51) (= v_~y$w_buff1_used~0_114 (ite .cse0 v_~y$w_buff1_used~0_115 (ite (or .cse2 .cse5 .cse11) v_~y$w_buff1_used~0_115 0)))))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_52, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_128, ~y$w_buff1~0=v_~y$w_buff1~0_52, ~y$w_buff0~0=v_~y$w_buff0~0_59, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_52, ~y~0=v_~y~0_86, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_115} OutVars{P1Thread1of1ForFork0_#t~nondet3=|v_P1Thread1of1ForFork0_#t~nondet3_1|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_12, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_127, P1Thread1of1ForFork0_#t~nondet4=|v_P1Thread1of1ForFork0_#t~nondet4_1|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_51, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~y$mem_tmp~0=v_~y$mem_tmp~0_24, ~y$w_buff1~0=v_~y$w_buff1~0_51, ~y$w_buff0~0=v_~y$w_buff0~0_58, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_51, ~y$flush_delayed~0=v_~y$flush_delayed~0_27, ~y~0=v_~y~0_84, ~weak$$choice2~0=v_~weak$$choice2~0_40, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_114} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~nondet3, ~__unbuffered_p1_EBX~0, ~y$w_buff0_used~0, P1Thread1of1ForFork0_#t~nondet4, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0][94], [42#L756true, 170#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 161#(= ~__unbuffered_p3_EAX~0 0), Black: 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 32#L835true, 14#P2EXITtrue, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 159#true, P3Thread1of1ForFork3InUse, 115#L787true, 74#L2true, Black: 150#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 156#(= ~__unbuffered_p1_EAX~0 0)]) [2023-09-01 09:46:56,103 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-09-01 09:46:56,103 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:46:56,103 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:46:56,103 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:46:56,170 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([471] L756-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.base_7| 0) (= |v_P0Thread1of1ForFork2_#res.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base][34], [Black: 161#(= ~__unbuffered_p3_EAX~0 0), 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 32#L835true, Black: 159#true, 14#P2EXITtrue, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, 167#true, 115#L787true, 74#L2true, 78#P0EXITtrue, Black: 148#true, Black: 156#(= ~__unbuffered_p1_EAX~0 0)]) [2023-09-01 09:46:56,170 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-09-01 09:46:56,170 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:46:56,170 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:46:56,170 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:46:56,171 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([471] L756-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.base_7| 0) (= |v_P0Thread1of1ForFork2_#res.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base][84], [170#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 161#(= ~__unbuffered_p3_EAX~0 0), 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 32#L835true, Black: 159#true, 14#P2EXITtrue, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, 115#L787true, 74#L2true, 78#P0EXITtrue, Black: 148#true, Black: 156#(= ~__unbuffered_p1_EAX~0 0)]) [2023-09-01 09:46:56,171 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-09-01 09:46:56,172 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:46:56,172 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:46:56,172 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:46:56,189 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([471] L756-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.base_7| 0) (= |v_P0Thread1of1ForFork2_#res.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base][34], [Black: 161#(= ~__unbuffered_p3_EAX~0 0), 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 32#L835true, Black: 159#true, 14#P2EXITtrue, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 167#true, P3Thread1of1ForFork3InUse, 74#L2true, 78#P0EXITtrue, 35#P1EXITtrue, Black: 148#true, Black: 156#(= ~__unbuffered_p1_EAX~0 0)]) [2023-09-01 09:46:56,190 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-09-01 09:46:56,190 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-09-01 09:46:56,193 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-09-01 09:46:56,193 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-09-01 09:46:56,194 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([471] L756-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.base_7| 0) (= |v_P0Thread1of1ForFork2_#res.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base][34], [Black: 161#(= ~__unbuffered_p3_EAX~0 0), 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 32#L835true, Black: 159#true, 14#P2EXITtrue, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 167#true, P3Thread1of1ForFork3InUse, 115#L787true, 17#L877true, 78#P0EXITtrue, Black: 148#true, Black: 156#(= ~__unbuffered_p1_EAX~0 0)]) [2023-09-01 09:46:56,194 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-09-01 09:46:56,195 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-09-01 09:46:56,195 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-09-01 09:46:56,195 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-09-01 09:46:56,214 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([471] L756-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.base_7| 0) (= |v_P0Thread1of1ForFork2_#res.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base][84], [170#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 161#(= ~__unbuffered_p3_EAX~0 0), 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 32#L835true, Black: 159#true, 14#P2EXITtrue, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, 74#L2true, 78#P0EXITtrue, 35#P1EXITtrue, Black: 148#true, Black: 156#(= ~__unbuffered_p1_EAX~0 0)]) [2023-09-01 09:46:56,214 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-09-01 09:46:56,214 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-09-01 09:46:56,215 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-09-01 09:46:56,215 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-09-01 09:46:56,240 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([471] L756-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.base_7| 0) (= |v_P0Thread1of1ForFork2_#res.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base][34], [Black: 161#(= ~__unbuffered_p3_EAX~0 0), 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 32#L835true, Black: 159#true, 14#P2EXITtrue, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 167#true, P3Thread1of1ForFork3InUse, 17#L877true, 78#P0EXITtrue, 35#P1EXITtrue, Black: 148#true, Black: 156#(= ~__unbuffered_p1_EAX~0 0)]) [2023-09-01 09:46:56,240 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2023-09-01 09:46:56,241 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-09-01 09:46:56,241 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-09-01 09:46:56,241 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-09-01 09:46:56,284 INFO L130 PetriNetUnfolder]: 6793/10099 cut-off events. [2023-09-01 09:46:56,284 INFO L131 PetriNetUnfolder]: For 6784/7285 co-relation queries the response was YES. [2023-09-01 09:46:56,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25698 conditions, 10099 events. 6793/10099 cut-off events. For 6784/7285 co-relation queries the response was YES. Maximal size of possible extension queue 686. Compared 63657 event pairs, 1155 based on Foata normal form. 802/10208 useless extension candidates. Maximal degree in co-relation 25682. Up to 6201 conditions per place. [2023-09-01 09:46:56,358 INFO L137 encePairwiseOnDemand]: 233/240 looper letters, 72 selfloop transitions, 10 changer transitions 0/95 dead transitions. [2023-09-01 09:46:56,359 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 95 transitions, 552 flow [2023-09-01 09:46:56,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:46:56,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:46:56,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 619 transitions. [2023-09-01 09:46:56,361 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5158333333333334 [2023-09-01 09:46:56,361 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 619 transitions. [2023-09-01 09:46:56,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 619 transitions. [2023-09-01 09:46:56,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:46:56,362 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 619 transitions. [2023-09-01 09:46:56,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.8) internal successors, (619), 5 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:56,365 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 240.0) internal successors, (1440), 6 states have internal predecessors, (1440), 0 states have call successors, (0), 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:46:56,366 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 240.0) internal successors, (1440), 6 states have internal predecessors, (1440), 0 states have call successors, (0), 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:46:56,366 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 188 flow. Second operand 5 states and 619 transitions. [2023-09-01 09:46:56,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 95 transitions, 552 flow [2023-09-01 09:46:56,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 95 transitions, 549 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 09:46:56,383 INFO L231 Difference]: Finished difference. Result has 51 places, 49 transitions, 260 flow [2023-09-01 09:46:56,383 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=260, PETRI_PLACES=51, PETRI_TRANSITIONS=49} [2023-09-01 09:46:56,385 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places. [2023-09-01 09:46:56,385 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 49 transitions, 260 flow [2023-09-01 09:46:56,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.25) internal successors, (457), 4 states have internal predecessors, (457), 0 states have call successors, (0), 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:46:56,387 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:46:56,387 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:46:56,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-01 09:46:56,389 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:46:56,389 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:46:56,389 INFO L85 PathProgramCache]: Analyzing trace with hash -888600060, now seen corresponding path program 1 times [2023-09-01 09:46:56,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:46:56,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875629259] [2023-09-01 09:46:56,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:46:56,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:46:56,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:46:56,645 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:46:56,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:46:56,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875629259] [2023-09-01 09:46:56,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875629259] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:46:56,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:46:56,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:46:56,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25295031] [2023-09-01 09:46:56,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:46:56,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:46:56,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:46:56,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:46:56,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:46:56,667 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 240 [2023-09-01 09:46:56,668 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 49 transitions, 260 flow. Second operand has 5 states, 5 states have (on average 114.0) internal successors, (570), 5 states have internal predecessors, (570), 0 states have call successors, (0), 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:46:56,668 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:46:56,668 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 240 [2023-09-01 09:46:56,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:46:57,310 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([471] L756-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.base_7| 0) (= |v_P0Thread1of1ForFork2_#res.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base][90], [170#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 161#(= ~__unbuffered_p3_EAX~0 0), 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 32#L835true, Black: 159#true, 14#P2EXITtrue, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, Black: 172#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 169#(= ~__unbuffered_cnt~0 0), 74#L2true, 181#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 78#P0EXITtrue, Black: 148#true, 21#L768true]) [2023-09-01 09:46:57,310 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-09-01 09:46:57,310 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-09-01 09:46:57,310 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-09-01 09:46:57,311 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-09-01 09:46:57,360 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([471] L756-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.base_7| 0) (= |v_P0Thread1of1ForFork2_#res.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base][90], [170#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 161#(= ~__unbuffered_p3_EAX~0 0), 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 32#L835true, 110#L771true, Black: 159#true, 14#P2EXITtrue, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, Black: 172#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 169#(= ~__unbuffered_cnt~0 0), 74#L2true, 181#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 78#P0EXITtrue, Black: 148#true, Black: 156#(= ~__unbuffered_p1_EAX~0 0)]) [2023-09-01 09:46:57,360 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-09-01 09:46:57,360 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:46:57,360 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:46:57,360 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:46:57,361 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([371] L771-->L787: Formula: (let ((.cse8 (= (mod v_~y$r_buff1_thd2~0_52 256) 0)) (.cse3 (= (mod v_~y$r_buff0_thd2~0_52 256) 0))) (let ((.cse6 (not .cse3)) (.cse12 (= (mod v_~y$w_buff0_used~0_128 256) 0)) (.cse5 (and .cse3 .cse8)) (.cse11 (and (= 0 (mod v_~y$w_buff1_used~0_115 256)) .cse3))) (let ((.cse9 (or .cse12 .cse5 .cse11)) (.cse10 (and (not .cse12) .cse6))) (let ((.cse4 (= (mod v_~y$w_buff1_used~0_114 256) 0)) (.cse1 (ite .cse9 v_~y~0_86 (ite .cse10 v_~y$w_buff0~0_59 v_~y$w_buff1~0_52))) (.cse0 (not (= (mod v_~weak$$choice2~0_40 256) 0))) (.cse2 (= (mod v_~y$w_buff0_used~0_127 256) 0))) (and (= v_~y~0_86 v_~y$mem_tmp~0_24) (= v_~y$w_buff0~0_59 v_~y$w_buff0~0_58) (= v_~y~0_84 (ite .cse0 v_~y$mem_tmp~0_24 .cse1)) (= v_~y$r_buff0_thd2~0_51 (ite .cse0 v_~y$r_buff0_thd2~0_52 (ite (or .cse2 (and .cse3 .cse4) .cse5) v_~y$r_buff0_thd2~0_52 (ite (and .cse6 (not .cse2)) 0 v_~y$r_buff0_thd2~0_52)))) (= (ite .cse0 v_~y$r_buff1_thd2~0_52 (ite (let ((.cse7 (= (mod v_~y$r_buff0_thd2~0_51 256) 0))) (or .cse2 (and .cse7 .cse8) (and .cse7 .cse4))) v_~y$r_buff1_thd2~0_52 0)) v_~y$r_buff1_thd2~0_51) (= 0 v_~y$flush_delayed~0_27) (= v_~y$w_buff0_used~0_127 (ite .cse0 v_~y$w_buff0_used~0_128 (ite .cse9 v_~y$w_buff0_used~0_128 (ite .cse10 0 v_~y$w_buff0_used~0_128)))) (= v_~__unbuffered_p1_EBX~0_12 .cse1) (= v_~y$w_buff1~0_52 v_~y$w_buff1~0_51) (= v_~y$w_buff1_used~0_114 (ite .cse0 v_~y$w_buff1_used~0_115 (ite (or .cse2 .cse5 .cse11) v_~y$w_buff1_used~0_115 0)))))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_52, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_128, ~y$w_buff1~0=v_~y$w_buff1~0_52, ~y$w_buff0~0=v_~y$w_buff0~0_59, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_52, ~y~0=v_~y~0_86, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_115} OutVars{P1Thread1of1ForFork0_#t~nondet3=|v_P1Thread1of1ForFork0_#t~nondet3_1|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_12, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_127, P1Thread1of1ForFork0_#t~nondet4=|v_P1Thread1of1ForFork0_#t~nondet4_1|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_51, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~y$mem_tmp~0=v_~y$mem_tmp~0_24, ~y$w_buff1~0=v_~y$w_buff1~0_51, ~y$w_buff0~0=v_~y$w_buff0~0_58, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_51, ~y$flush_delayed~0=v_~y$flush_delayed~0_27, ~y~0=v_~y~0_84, ~weak$$choice2~0=v_~weak$$choice2~0_40, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_114} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~nondet3, ~__unbuffered_p1_EBX~0, ~y$w_buff0_used~0, P1Thread1of1ForFork0_#t~nondet4, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0][115], [42#L756true, 170#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 161#(= ~__unbuffered_p3_EAX~0 0), Black: 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 32#L835true, 14#P2EXITtrue, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 159#true, P3Thread1of1ForFork3InUse, Black: 172#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 169#(= ~__unbuffered_cnt~0 0), 115#L787true, 185#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 74#L2true, Black: 150#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 156#(= ~__unbuffered_p1_EAX~0 0)]) [2023-09-01 09:46:57,361 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-09-01 09:46:57,369 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:46:57,370 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:46:57,370 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:46:57,421 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([471] L756-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.base_7| 0) (= |v_P0Thread1of1ForFork2_#res.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base][90], [170#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 161#(= ~__unbuffered_p3_EAX~0 0), 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 159#true, 32#L835true, 14#P2EXITtrue, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, Black: 172#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 169#(= ~__unbuffered_cnt~0 0), 115#L787true, 74#L2true, 181#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 78#P0EXITtrue, Black: 148#true, Black: 156#(= ~__unbuffered_p1_EAX~0 0)]) [2023-09-01 09:46:57,421 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-09-01 09:46:57,421 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:46:57,421 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:46:57,421 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:46:57,422 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([471] L756-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.base_7| 0) (= |v_P0Thread1of1ForFork2_#res.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base][90], [Black: 161#(= ~__unbuffered_p3_EAX~0 0), 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 159#true, 32#L835true, 14#P2EXITtrue, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, Black: 170#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork3InUse, 167#true, Black: 172#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 169#(= ~__unbuffered_cnt~0 0), 115#L787true, 74#L2true, 181#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 78#P0EXITtrue, Black: 148#true, Black: 156#(= ~__unbuffered_p1_EAX~0 0)]) [2023-09-01 09:46:57,422 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-09-01 09:46:57,422 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:46:57,423 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:46:57,423 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:46:57,435 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([471] L756-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.base_7| 0) (= |v_P0Thread1of1ForFork2_#res.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base][126], [Black: 161#(= ~__unbuffered_p3_EAX~0 0), 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 159#true, 32#L835true, 14#P2EXITtrue, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, Black: 170#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 167#true, P3Thread1of1ForFork3InUse, Black: 172#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 169#(= ~__unbuffered_cnt~0 0), 74#L2true, 181#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 78#P0EXITtrue, 35#P1EXITtrue, Black: 148#true, Black: 156#(= ~__unbuffered_p1_EAX~0 0)]) [2023-09-01 09:46:57,436 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-09-01 09:46:57,436 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-09-01 09:46:57,436 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-09-01 09:46:57,436 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-09-01 09:46:57,455 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([471] L756-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.base_7| 0) (= |v_P0Thread1of1ForFork2_#res.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base][126], [170#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 161#(= ~__unbuffered_p3_EAX~0 0), 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 159#true, 32#L835true, 14#P2EXITtrue, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, Black: 172#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 169#(= ~__unbuffered_cnt~0 0), 74#L2true, 181#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 78#P0EXITtrue, 35#P1EXITtrue, Black: 148#true, Black: 156#(= ~__unbuffered_p1_EAX~0 0)]) [2023-09-01 09:46:57,455 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-09-01 09:46:57,455 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-09-01 09:46:57,455 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-09-01 09:46:57,455 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-09-01 09:46:57,511 INFO L130 PetriNetUnfolder]: 5543/8513 cut-off events. [2023-09-01 09:46:57,511 INFO L131 PetriNetUnfolder]: For 9135/10165 co-relation queries the response was YES. [2023-09-01 09:46:57,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27824 conditions, 8513 events. 5543/8513 cut-off events. For 9135/10165 co-relation queries the response was YES. Maximal size of possible extension queue 557. Compared 54950 event pairs, 509 based on Foata normal form. 820/8810 useless extension candidates. Maximal degree in co-relation 27804. Up to 2851 conditions per place. [2023-09-01 09:46:57,563 INFO L137 encePairwiseOnDemand]: 233/240 looper letters, 99 selfloop transitions, 19 changer transitions 1/132 dead transitions. [2023-09-01 09:46:57,564 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 132 transitions, 864 flow [2023-09-01 09:46:57,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 09:46:57,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 09:46:57,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 868 transitions. [2023-09-01 09:46:57,567 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2023-09-01 09:46:57,567 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 868 transitions. [2023-09-01 09:46:57,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 868 transitions. [2023-09-01 09:46:57,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:46:57,567 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 868 transitions. [2023-09-01 09:46:57,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.0) internal successors, (868), 7 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:46:57,571 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 240.0) internal successors, (1920), 8 states have internal predecessors, (1920), 0 states have call successors, (0), 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:46:57,572 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 240.0) internal successors, (1920), 8 states have internal predecessors, (1920), 0 states have call successors, (0), 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:46:57,572 INFO L175 Difference]: Start difference. First operand has 51 places, 49 transitions, 260 flow. Second operand 7 states and 868 transitions. [2023-09-01 09:46:57,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 132 transitions, 864 flow [2023-09-01 09:46:57,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 132 transitions, 859 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 09:46:57,602 INFO L231 Difference]: Finished difference. Result has 59 places, 58 transitions, 389 flow [2023-09-01 09:46:57,603 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=389, PETRI_PLACES=59, PETRI_TRANSITIONS=58} [2023-09-01 09:46:57,605 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 17 predicate places. [2023-09-01 09:46:57,605 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 58 transitions, 389 flow [2023-09-01 09:46:57,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.0) internal successors, (570), 5 states have internal predecessors, (570), 0 states have call successors, (0), 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:46:57,606 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:46:57,606 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:46:57,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-01 09:46:57,606 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:46:57,607 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:46:57,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1573862046, now seen corresponding path program 1 times [2023-09-01 09:46:57,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:46:57,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511086250] [2023-09-01 09:46:57,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:46:57,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:46:57,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:46:57,884 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:46:57,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:46:57,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511086250] [2023-09-01 09:46:57,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511086250] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:46:57,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:46:57,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:46:57,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074091751] [2023-09-01 09:46:57,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:46:57,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:46:57,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:46:57,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:46:57,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:46:57,904 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 240 [2023-09-01 09:46:57,905 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 58 transitions, 389 flow. Second operand has 6 states, 6 states have (on average 113.83333333333333) internal successors, (683), 6 states have internal predecessors, (683), 0 states have call successors, (0), 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:46:57,905 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:46:57,905 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 240 [2023-09-01 09:46:57,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:46:58,610 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([471] L756-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.base_7| 0) (= |v_P0Thread1of1ForFork2_#res.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base][90], [201#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 170#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 161#(= ~__unbuffered_p3_EAX~0 0), 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 159#true, 32#L835true, 14#P2EXITtrue, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, Black: 172#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 169#(= ~__unbuffered_cnt~0 0), 74#L2true, 181#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 78#P0EXITtrue, Black: 148#true, 21#L768true, Black: 185#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 180#(<= ~__unbuffered_cnt~0 1)]) [2023-09-01 09:46:58,611 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-09-01 09:46:58,611 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-09-01 09:46:58,611 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-09-01 09:46:58,611 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-09-01 09:46:58,690 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([471] L756-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.base_7| 0) (= |v_P0Thread1of1ForFork2_#res.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base][90], [201#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 170#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 161#(= ~__unbuffered_p3_EAX~0 0), 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 110#L771true, 32#L835true, Black: 159#true, 14#P2EXITtrue, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, Black: 172#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 169#(= ~__unbuffered_cnt~0 0), 74#L2true, 181#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 78#P0EXITtrue, Black: 148#true, Black: 185#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 180#(<= ~__unbuffered_cnt~0 1), Black: 156#(= ~__unbuffered_p1_EAX~0 0)]) [2023-09-01 09:46:58,690 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-09-01 09:46:58,690 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:46:58,690 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:46:58,690 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:46:58,691 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([371] L771-->L787: Formula: (let ((.cse8 (= (mod v_~y$r_buff1_thd2~0_52 256) 0)) (.cse3 (= (mod v_~y$r_buff0_thd2~0_52 256) 0))) (let ((.cse6 (not .cse3)) (.cse12 (= (mod v_~y$w_buff0_used~0_128 256) 0)) (.cse5 (and .cse3 .cse8)) (.cse11 (and (= 0 (mod v_~y$w_buff1_used~0_115 256)) .cse3))) (let ((.cse9 (or .cse12 .cse5 .cse11)) (.cse10 (and (not .cse12) .cse6))) (let ((.cse4 (= (mod v_~y$w_buff1_used~0_114 256) 0)) (.cse1 (ite .cse9 v_~y~0_86 (ite .cse10 v_~y$w_buff0~0_59 v_~y$w_buff1~0_52))) (.cse0 (not (= (mod v_~weak$$choice2~0_40 256) 0))) (.cse2 (= (mod v_~y$w_buff0_used~0_127 256) 0))) (and (= v_~y~0_86 v_~y$mem_tmp~0_24) (= v_~y$w_buff0~0_59 v_~y$w_buff0~0_58) (= v_~y~0_84 (ite .cse0 v_~y$mem_tmp~0_24 .cse1)) (= v_~y$r_buff0_thd2~0_51 (ite .cse0 v_~y$r_buff0_thd2~0_52 (ite (or .cse2 (and .cse3 .cse4) .cse5) v_~y$r_buff0_thd2~0_52 (ite (and .cse6 (not .cse2)) 0 v_~y$r_buff0_thd2~0_52)))) (= (ite .cse0 v_~y$r_buff1_thd2~0_52 (ite (let ((.cse7 (= (mod v_~y$r_buff0_thd2~0_51 256) 0))) (or .cse2 (and .cse7 .cse8) (and .cse7 .cse4))) v_~y$r_buff1_thd2~0_52 0)) v_~y$r_buff1_thd2~0_51) (= 0 v_~y$flush_delayed~0_27) (= v_~y$w_buff0_used~0_127 (ite .cse0 v_~y$w_buff0_used~0_128 (ite .cse9 v_~y$w_buff0_used~0_128 (ite .cse10 0 v_~y$w_buff0_used~0_128)))) (= v_~__unbuffered_p1_EBX~0_12 .cse1) (= v_~y$w_buff1~0_52 v_~y$w_buff1~0_51) (= v_~y$w_buff1_used~0_114 (ite .cse0 v_~y$w_buff1_used~0_115 (ite (or .cse2 .cse5 .cse11) v_~y$w_buff1_used~0_115 0)))))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_52, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_128, ~y$w_buff1~0=v_~y$w_buff1~0_52, ~y$w_buff0~0=v_~y$w_buff0~0_59, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_52, ~y~0=v_~y~0_86, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_115} OutVars{P1Thread1of1ForFork0_#t~nondet3=|v_P1Thread1of1ForFork0_#t~nondet3_1|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_12, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_127, P1Thread1of1ForFork0_#t~nondet4=|v_P1Thread1of1ForFork0_#t~nondet4_1|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_51, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~y$mem_tmp~0=v_~y$mem_tmp~0_24, ~y$w_buff1~0=v_~y$w_buff1~0_51, ~y$w_buff0~0=v_~y$w_buff0~0_58, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_51, ~y$flush_delayed~0=v_~y$flush_delayed~0_27, ~y~0=v_~y~0_84, ~weak$$choice2~0=v_~weak$$choice2~0_40, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_114} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~nondet3, ~__unbuffered_p1_EBX~0, ~y$w_buff0_used~0, P1Thread1of1ForFork0_#t~nondet4, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0][114], [42#L756true, 170#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 161#(= ~__unbuffered_p3_EAX~0 0), Black: 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 32#L835true, 14#P2EXITtrue, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 159#true, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, Black: 172#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 169#(= ~__unbuffered_cnt~0 0), 115#L787true, 185#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 74#L2true, 199#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 150#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 181#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 180#(<= ~__unbuffered_cnt~0 1), Black: 156#(= ~__unbuffered_p1_EAX~0 0)]) [2023-09-01 09:46:58,691 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-09-01 09:46:58,691 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:46:58,691 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:46:58,691 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:46:58,739 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([471] L756-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.base_7| 0) (= |v_P0Thread1of1ForFork2_#res.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base][90], [201#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 170#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 161#(= ~__unbuffered_p3_EAX~0 0), 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 32#L835true, Black: 159#true, 14#P2EXITtrue, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, Black: 172#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 169#(= ~__unbuffered_cnt~0 0), 115#L787true, 74#L2true, 181#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 78#P0EXITtrue, Black: 148#true, Black: 185#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 180#(<= ~__unbuffered_cnt~0 1), Black: 156#(= ~__unbuffered_p1_EAX~0 0)]) [2023-09-01 09:46:58,740 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-09-01 09:46:58,740 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:46:58,740 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:46:58,740 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:46:58,741 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([471] L756-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.base_7| 0) (= |v_P0Thread1of1ForFork2_#res.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base][90], [201#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 161#(= ~__unbuffered_p3_EAX~0 0), 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 159#true, 32#L835true, 14#P2EXITtrue, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, Black: 170#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork3InUse, Black: 172#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 169#(= ~__unbuffered_cnt~0 0), 115#L787true, 74#L2true, 181#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 78#P0EXITtrue, Black: 148#true, Black: 185#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 180#(<= ~__unbuffered_cnt~0 1), Black: 156#(= ~__unbuffered_p1_EAX~0 0)]) [2023-09-01 09:46:58,741 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-09-01 09:46:58,741 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:46:58,741 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:46:58,742 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:46:58,756 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([471] L756-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.base_7| 0) (= |v_P0Thread1of1ForFork2_#res.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base][126], [Black: 161#(= ~__unbuffered_p3_EAX~0 0), 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 32#L835true, Black: 159#true, 14#P2EXITtrue, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, Black: 170#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork3InUse, Black: 172#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 169#(= ~__unbuffered_cnt~0 0), 74#L2true, 195#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 181#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 78#P0EXITtrue, 35#P1EXITtrue, Black: 148#true, Black: 185#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 180#(<= ~__unbuffered_cnt~0 1), Black: 156#(= ~__unbuffered_p1_EAX~0 0)]) [2023-09-01 09:46:58,756 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-09-01 09:46:58,756 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-09-01 09:46:58,756 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-09-01 09:46:58,756 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-09-01 09:46:58,771 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([471] L756-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.base_7| 0) (= |v_P0Thread1of1ForFork2_#res.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base][126], [170#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 161#(= ~__unbuffered_p3_EAX~0 0), 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 32#L835true, Black: 159#true, 14#P2EXITtrue, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, Black: 172#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 169#(= ~__unbuffered_cnt~0 0), 74#L2true, 195#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 181#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 78#P0EXITtrue, 35#P1EXITtrue, Black: 148#true, Black: 185#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 180#(<= ~__unbuffered_cnt~0 1), Black: 156#(= ~__unbuffered_p1_EAX~0 0)]) [2023-09-01 09:46:58,771 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-09-01 09:46:58,772 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-09-01 09:46:58,772 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-09-01 09:46:58,772 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-09-01 09:46:58,810 INFO L130 PetriNetUnfolder]: 5135/7896 cut-off events. [2023-09-01 09:46:58,810 INFO L131 PetriNetUnfolder]: For 16012/17974 co-relation queries the response was YES. [2023-09-01 09:46:58,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30238 conditions, 7896 events. 5135/7896 cut-off events. For 16012/17974 co-relation queries the response was YES. Maximal size of possible extension queue 554. Compared 51089 event pairs, 411 based on Foata normal form. 663/8070 useless extension candidates. Maximal degree in co-relation 30214. Up to 2703 conditions per place. [2023-09-01 09:46:58,871 INFO L137 encePairwiseOnDemand]: 233/240 looper letters, 110 selfloop transitions, 28 changer transitions 12/163 dead transitions. [2023-09-01 09:46:58,872 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 163 transitions, 1191 flow [2023-09-01 09:46:58,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-01 09:46:58,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-09-01 09:46:58,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1115 transitions. [2023-09-01 09:46:58,875 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5162037037037037 [2023-09-01 09:46:58,875 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1115 transitions. [2023-09-01 09:46:58,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1115 transitions. [2023-09-01 09:46:58,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:46:58,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1115 transitions. [2023-09-01 09:46:58,878 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 123.88888888888889) internal successors, (1115), 9 states have internal predecessors, (1115), 0 states have call successors, (0), 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:46:58,881 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 240.0) internal successors, (2400), 10 states have internal predecessors, (2400), 0 states have call successors, (0), 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:46:58,882 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 240.0) internal successors, (2400), 10 states have internal predecessors, (2400), 0 states have call successors, (0), 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:46:58,882 INFO L175 Difference]: Start difference. First operand has 59 places, 58 transitions, 389 flow. Second operand 9 states and 1115 transitions. [2023-09-01 09:46:58,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 163 transitions, 1191 flow [2023-09-01 09:46:59,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 163 transitions, 1141 flow, removed 17 selfloop flow, removed 3 redundant places. [2023-09-01 09:46:59,319 INFO L231 Difference]: Finished difference. Result has 67 places, 67 transitions, 517 flow [2023-09-01 09:46:59,319 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=517, PETRI_PLACES=67, PETRI_TRANSITIONS=67} [2023-09-01 09:46:59,320 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 25 predicate places. [2023-09-01 09:46:59,320 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 67 transitions, 517 flow [2023-09-01 09:46:59,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.83333333333333) internal successors, (683), 6 states have internal predecessors, (683), 0 states have call successors, (0), 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:46:59,321 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:46:59,321 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:46:59,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-01 09:46:59,321 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:46:59,322 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:46:59,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1227694174, now seen corresponding path program 1 times [2023-09-01 09:46:59,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:46:59,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451588147] [2023-09-01 09:46:59,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:46:59,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:46:59,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:46:59,570 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:46:59,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:46:59,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451588147] [2023-09-01 09:46:59,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451588147] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:46:59,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:46:59,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:46:59,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840025556] [2023-09-01 09:46:59,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:46:59,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:46:59,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:46:59,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:46:59,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:46:59,587 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 240 [2023-09-01 09:46:59,588 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 67 transitions, 517 flow. Second operand has 4 states, 4 states have (on average 107.75) internal successors, (431), 4 states have internal predecessors, (431), 0 states have call successors, (0), 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:46:59,588 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:46:59,588 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 240 [2023-09-01 09:46:59,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:47:00,724 INFO L130 PetriNetUnfolder]: 8927/13028 cut-off events. [2023-09-01 09:47:00,724 INFO L131 PetriNetUnfolder]: For 37703/37703 co-relation queries the response was YES. [2023-09-01 09:47:00,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53030 conditions, 13028 events. 8927/13028 cut-off events. For 37703/37703 co-relation queries the response was YES. Maximal size of possible extension queue 513. Compared 75470 event pairs, 749 based on Foata normal form. 11/13039 useless extension candidates. Maximal degree in co-relation 53003. Up to 5901 conditions per place. [2023-09-01 09:47:00,827 INFO L137 encePairwiseOnDemand]: 229/240 looper letters, 104 selfloop transitions, 30 changer transitions 60/194 dead transitions. [2023-09-01 09:47:00,827 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 194 transitions, 1915 flow [2023-09-01 09:47:00,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:47:00,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:47:00,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 601 transitions. [2023-09-01 09:47:00,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5008333333333334 [2023-09-01 09:47:00,829 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 601 transitions. [2023-09-01 09:47:00,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 601 transitions. [2023-09-01 09:47:00,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:47:00,830 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 601 transitions. [2023-09-01 09:47:00,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.2) internal successors, (601), 5 states have internal predecessors, (601), 0 states have call successors, (0), 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:00,832 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 240.0) internal successors, (1440), 6 states have internal predecessors, (1440), 0 states have call successors, (0), 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:00,833 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 240.0) internal successors, (1440), 6 states have internal predecessors, (1440), 0 states have call successors, (0), 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:00,833 INFO L175 Difference]: Start difference. First operand has 67 places, 67 transitions, 517 flow. Second operand 5 states and 601 transitions. [2023-09-01 09:47:00,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 194 transitions, 1915 flow [2023-09-01 09:47:01,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 194 transitions, 1574 flow, removed 120 selfloop flow, removed 4 redundant places. [2023-09-01 09:47:01,595 INFO L231 Difference]: Finished difference. Result has 70 places, 70 transitions, 549 flow [2023-09-01 09:47:01,595 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=549, PETRI_PLACES=70, PETRI_TRANSITIONS=70} [2023-09-01 09:47:01,595 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 28 predicate places. [2023-09-01 09:47:01,595 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 70 transitions, 549 flow [2023-09-01 09:47:01,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.75) internal successors, (431), 4 states have internal predecessors, (431), 0 states have call successors, (0), 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:01,596 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:47:01,596 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:01,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-09-01 09:47:01,596 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:01,596 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:47:01,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1406818500, now seen corresponding path program 2 times [2023-09-01 09:47:01,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:47:01,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452375794] [2023-09-01 09:47:01,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:47:01,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:47:01,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:47:01,811 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:01,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:47:01,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452375794] [2023-09-01 09:47:01,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452375794] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:47:01,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:47:01,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:47:01,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532316797] [2023-09-01 09:47:01,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:47:01,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:47:01,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:47:01,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:47:01,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:47:01,832 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 240 [2023-09-01 09:47:01,832 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 70 transitions, 549 flow. Second operand has 5 states, 5 states have (on average 106.6) internal successors, (533), 5 states have internal predecessors, (533), 0 states have call successors, (0), 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:01,832 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:47:01,832 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 240 [2023-09-01 09:47:01,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:47:02,493 INFO L130 PetriNetUnfolder]: 4322/6511 cut-off events. [2023-09-01 09:47:02,494 INFO L131 PetriNetUnfolder]: For 17286/17286 co-relation queries the response was YES. [2023-09-01 09:47:02,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27383 conditions, 6511 events. 4322/6511 cut-off events. For 17286/17286 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 34958 event pairs, 392 based on Foata normal form. 11/6522 useless extension candidates. Maximal degree in co-relation 27352. Up to 2067 conditions per place. [2023-09-01 09:47:02,528 INFO L137 encePairwiseOnDemand]: 229/240 looper letters, 102 selfloop transitions, 27 changer transitions 41/170 dead transitions. [2023-09-01 09:47:02,529 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 170 transitions, 1503 flow [2023-09-01 09:47:02,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 09:47:02,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 09:47:02,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 717 transitions. [2023-09-01 09:47:02,531 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4979166666666667 [2023-09-01 09:47:02,531 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 717 transitions. [2023-09-01 09:47:02,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 717 transitions. [2023-09-01 09:47:02,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:47:02,532 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 717 transitions. [2023-09-01 09:47:02,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 119.5) internal successors, (717), 6 states have internal predecessors, (717), 0 states have call successors, (0), 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:02,535 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 240.0) internal successors, (1680), 7 states have internal predecessors, (1680), 0 states have call successors, (0), 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:02,535 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 240.0) internal successors, (1680), 7 states have internal predecessors, (1680), 0 states have call successors, (0), 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:02,535 INFO L175 Difference]: Start difference. First operand has 70 places, 70 transitions, 549 flow. Second operand 6 states and 717 transitions. [2023-09-01 09:47:02,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 170 transitions, 1503 flow [2023-09-01 09:47:02,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 170 transitions, 1429 flow, removed 37 selfloop flow, removed 5 redundant places. [2023-09-01 09:47:02,632 INFO L231 Difference]: Finished difference. Result has 65 places, 64 transitions, 533 flow [2023-09-01 09:47:02,633 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=533, PETRI_PLACES=65, PETRI_TRANSITIONS=64} [2023-09-01 09:47:02,633 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 23 predicate places. [2023-09-01 09:47:02,633 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 64 transitions, 533 flow [2023-09-01 09:47:02,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.6) internal successors, (533), 5 states have internal predecessors, (533), 0 states have call successors, (0), 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:02,634 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:47:02,634 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:02,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-09-01 09:47:02,634 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:02,634 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:47:02,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1650390084, now seen corresponding path program 3 times [2023-09-01 09:47:02,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:47:02,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608000230] [2023-09-01 09:47:02,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:47:02,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:47:02,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:47:02,791 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:02,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:47:02,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608000230] [2023-09-01 09:47:02,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608000230] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:47:02,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:47:02,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:47:02,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819819588] [2023-09-01 09:47:02,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:47:02,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:47:02,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:47:02,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:47:02,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:47:02,807 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 240 [2023-09-01 09:47:02,808 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 64 transitions, 533 flow. Second operand has 4 states, 4 states have (on average 109.75) internal successors, (439), 4 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:47:02,808 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:47:02,808 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 240 [2023-09-01 09:47:02,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:47:03,346 INFO L130 PetriNetUnfolder]: 4245/6666 cut-off events. [2023-09-01 09:47:03,346 INFO L131 PetriNetUnfolder]: For 20452/20452 co-relation queries the response was YES. [2023-09-01 09:47:03,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28374 conditions, 6666 events. 4245/6666 cut-off events. For 20452/20452 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 38505 event pairs, 716 based on Foata normal form. 11/6677 useless extension candidates. Maximal degree in co-relation 28345. Up to 2932 conditions per place. [2023-09-01 09:47:03,367 INFO L137 encePairwiseOnDemand]: 230/240 looper letters, 88 selfloop transitions, 27 changer transitions 18/133 dead transitions. [2023-09-01 09:47:03,367 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 133 transitions, 1255 flow [2023-09-01 09:47:03,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:47:03,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:47:03,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 488 transitions. [2023-09-01 09:47:03,369 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5083333333333333 [2023-09-01 09:47:03,369 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 488 transitions. [2023-09-01 09:47:03,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 488 transitions. [2023-09-01 09:47:03,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:47:03,370 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 488 transitions. [2023-09-01 09:47:03,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 0 states have call successors, (0), 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:03,372 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 0 states have call successors, (0), 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:03,372 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 0 states have call successors, (0), 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:03,372 INFO L175 Difference]: Start difference. First operand has 65 places, 64 transitions, 533 flow. Second operand 4 states and 488 transitions. [2023-09-01 09:47:03,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 133 transitions, 1255 flow [2023-09-01 09:47:03,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 133 transitions, 1162 flow, removed 1 selfloop flow, removed 6 redundant places. [2023-09-01 09:47:03,451 INFO L231 Difference]: Finished difference. Result has 65 places, 70 transitions, 642 flow [2023-09-01 09:47:03,451 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=642, PETRI_PLACES=65, PETRI_TRANSITIONS=70} [2023-09-01 09:47:03,452 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 23 predicate places. [2023-09-01 09:47:03,452 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 70 transitions, 642 flow [2023-09-01 09:47:03,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.75) internal successors, (439), 4 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:47:03,452 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:47:03,452 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:03,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-09-01 09:47:03,453 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:03,453 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:47:03,453 INFO L85 PathProgramCache]: Analyzing trace with hash -443683906, now seen corresponding path program 4 times [2023-09-01 09:47:03,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:47:03,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778262314] [2023-09-01 09:47:03,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:47:03,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:47:03,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:47:03,621 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:03,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:47:03,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778262314] [2023-09-01 09:47:03,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778262314] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:47:03,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:47:03,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-01 09:47:03,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358038859] [2023-09-01 09:47:03,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:47:03,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 09:47:03,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:47:03,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 09:47:03,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-09-01 09:47:03,633 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 240 [2023-09-01 09:47:03,634 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 70 transitions, 642 flow. Second operand has 7 states, 7 states have (on average 113.71428571428571) internal successors, (796), 7 states have internal predecessors, (796), 0 states have call successors, (0), 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:03,635 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:47:03,635 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 240 [2023-09-01 09:47:03,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:47:04,032 INFO L130 PetriNetUnfolder]: 2500/4243 cut-off events. [2023-09-01 09:47:04,032 INFO L131 PetriNetUnfolder]: For 13166/13795 co-relation queries the response was YES. [2023-09-01 09:47:04,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16684 conditions, 4243 events. 2500/4243 cut-off events. For 13166/13795 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 27819 event pairs, 367 based on Foata normal form. 160/4283 useless extension candidates. Maximal degree in co-relation 16654. Up to 1582 conditions per place. [2023-09-01 09:47:04,048 INFO L137 encePairwiseOnDemand]: 233/240 looper letters, 43 selfloop transitions, 18 changer transitions 76/149 dead transitions. [2023-09-01 09:47:04,049 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 149 transitions, 1524 flow [2023-09-01 09:47:04,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 09:47:04,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 09:47:04,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 969 transitions. [2023-09-01 09:47:04,052 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5046875 [2023-09-01 09:47:04,052 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 969 transitions. [2023-09-01 09:47:04,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 969 transitions. [2023-09-01 09:47:04,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:47:04,052 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 969 transitions. [2023-09-01 09:47:04,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 121.125) internal successors, (969), 8 states have internal predecessors, (969), 0 states have call successors, (0), 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:04,056 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 240.0) internal successors, (2160), 9 states have internal predecessors, (2160), 0 states have call successors, (0), 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:04,056 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 240.0) internal successors, (2160), 9 states have internal predecessors, (2160), 0 states have call successors, (0), 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:04,057 INFO L175 Difference]: Start difference. First operand has 65 places, 70 transitions, 642 flow. Second operand 8 states and 969 transitions. [2023-09-01 09:47:04,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 149 transitions, 1524 flow [2023-09-01 09:47:04,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 149 transitions, 1493 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-09-01 09:47:04,142 INFO L231 Difference]: Finished difference. Result has 73 places, 49 transitions, 411 flow [2023-09-01 09:47:04,143 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=619, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=411, PETRI_PLACES=73, PETRI_TRANSITIONS=49} [2023-09-01 09:47:04,143 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 31 predicate places. [2023-09-01 09:47:04,143 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 49 transitions, 411 flow [2023-09-01 09:47:04,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.71428571428571) internal successors, (796), 7 states have internal predecessors, (796), 0 states have call successors, (0), 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:04,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:47:04,144 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] [2023-09-01 09:47:04,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-09-01 09:47:04,144 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:04,144 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:47:04,144 INFO L85 PathProgramCache]: Analyzing trace with hash 561952180, now seen corresponding path program 1 times [2023-09-01 09:47:04,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:47:04,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712829113] [2023-09-01 09:47:04,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:47:04,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:47:04,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:47:04,327 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:04,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:47:04,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712829113] [2023-09-01 09:47:04,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712829113] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:47:04,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:47:04,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:47:04,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789871506] [2023-09-01 09:47:04,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:47:04,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:47:04,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:47:04,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:47:04,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:47:04,342 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 240 [2023-09-01 09:47:04,343 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 49 transitions, 411 flow. Second operand has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 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:04,343 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:47:04,343 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 240 [2023-09-01 09:47:04,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:47:04,508 INFO L130 PetriNetUnfolder]: 878/1519 cut-off events. [2023-09-01 09:47:04,508 INFO L131 PetriNetUnfolder]: For 6863/6863 co-relation queries the response was YES. [2023-09-01 09:47:04,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6990 conditions, 1519 events. 878/1519 cut-off events. For 6863/6863 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 7329 event pairs, 205 based on Foata normal form. 1/1520 useless extension candidates. Maximal degree in co-relation 6957. Up to 827 conditions per place. [2023-09-01 09:47:04,513 INFO L137 encePairwiseOnDemand]: 234/240 looper letters, 49 selfloop transitions, 5 changer transitions 40/94 dead transitions. [2023-09-01 09:47:04,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 94 transitions, 947 flow [2023-09-01 09:47:04,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:47:04,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:47:04,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 472 transitions. [2023-09-01 09:47:04,514 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49166666666666664 [2023-09-01 09:47:04,515 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 472 transitions. [2023-09-01 09:47:04,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 472 transitions. [2023-09-01 09:47:04,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:47:04,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 472 transitions. [2023-09-01 09:47:04,516 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:04,517 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 0 states have call successors, (0), 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:04,517 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 0 states have call successors, (0), 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:04,517 INFO L175 Difference]: Start difference. First operand has 73 places, 49 transitions, 411 flow. Second operand 4 states and 472 transitions. [2023-09-01 09:47:04,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 94 transitions, 947 flow [2023-09-01 09:47:04,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 94 transitions, 720 flow, removed 43 selfloop flow, removed 13 redundant places. [2023-09-01 09:47:04,529 INFO L231 Difference]: Finished difference. Result has 62 places, 39 transitions, 217 flow [2023-09-01 09:47:04,529 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=217, PETRI_PLACES=62, PETRI_TRANSITIONS=39} [2023-09-01 09:47:04,529 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 20 predicate places. [2023-09-01 09:47:04,529 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 39 transitions, 217 flow [2023-09-01 09:47:04,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 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:04,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:47:04,530 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] [2023-09-01 09:47:04,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-09-01 09:47:04,530 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:04,530 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:47:04,530 INFO L85 PathProgramCache]: Analyzing trace with hash -488438028, now seen corresponding path program 2 times [2023-09-01 09:47:04,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:47:04,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407782859] [2023-09-01 09:47:04,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:47:04,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:47:04,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:47:04,912 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:04,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:47:04,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407782859] [2023-09-01 09:47:04,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407782859] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:47:04,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:47:04,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:47:04,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113701015] [2023-09-01 09:47:04,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:47:04,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 09:47:04,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:47:04,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 09:47:04,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-09-01 09:47:04,929 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 240 [2023-09-01 09:47:04,930 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 39 transitions, 217 flow. Second operand has 7 states, 7 states have (on average 114.14285714285714) internal successors, (799), 7 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:47:04,930 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:47:04,930 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 240 [2023-09-01 09:47:04,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:47:05,051 INFO L130 PetriNetUnfolder]: 192/366 cut-off events. [2023-09-01 09:47:05,051 INFO L131 PetriNetUnfolder]: For 955/964 co-relation queries the response was YES. [2023-09-01 09:47:05,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1316 conditions, 366 events. 192/366 cut-off events. For 955/964 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1356 event pairs, 39 based on Foata normal form. 2/355 useless extension candidates. Maximal degree in co-relation 1293. Up to 123 conditions per place. [2023-09-01 09:47:05,052 INFO L137 encePairwiseOnDemand]: 234/240 looper letters, 38 selfloop transitions, 3 changer transitions 36/82 dead transitions. [2023-09-01 09:47:05,053 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 82 transitions, 603 flow [2023-09-01 09:47:05,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 09:47:05,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 09:47:05,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 823 transitions. [2023-09-01 09:47:05,055 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48988095238095236 [2023-09-01 09:47:05,055 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 823 transitions. [2023-09-01 09:47:05,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 823 transitions. [2023-09-01 09:47:05,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:47:05,055 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 823 transitions. [2023-09-01 09:47:05,057 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.57142857142857) internal successors, (823), 7 states have internal predecessors, (823), 0 states have call successors, (0), 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:05,058 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 240.0) internal successors, (1920), 8 states have internal predecessors, (1920), 0 states have call successors, (0), 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:05,059 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 240.0) internal successors, (1920), 8 states have internal predecessors, (1920), 0 states have call successors, (0), 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:05,059 INFO L175 Difference]: Start difference. First operand has 62 places, 39 transitions, 217 flow. Second operand 7 states and 823 transitions. [2023-09-01 09:47:05,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 82 transitions, 603 flow [2023-09-01 09:47:05,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 82 transitions, 540 flow, removed 9 selfloop flow, removed 12 redundant places. [2023-09-01 09:47:05,061 INFO L231 Difference]: Finished difference. Result has 58 places, 39 transitions, 186 flow [2023-09-01 09:47:05,061 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=186, PETRI_PLACES=58, PETRI_TRANSITIONS=39} [2023-09-01 09:47:05,062 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 16 predicate places. [2023-09-01 09:47:05,062 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 39 transitions, 186 flow [2023-09-01 09:47:05,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.14285714285714) internal successors, (799), 7 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:47:05,062 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:47:05,062 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] [2023-09-01 09:47:05,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-09-01 09:47:05,063 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:05,063 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:47:05,063 INFO L85 PathProgramCache]: Analyzing trace with hash 415072522, now seen corresponding path program 3 times [2023-09-01 09:47:05,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:47:05,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391142817] [2023-09-01 09:47:05,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:47:05,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:47:05,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:47:05,087 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-01 09:47:05,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:47:05,126 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-01 09:47:05,126 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-09-01 09:47:05,126 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-09-01 09:47:05,128 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-09-01 09:47:05,128 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-09-01 09:47:05,128 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-09-01 09:47:05,128 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-09-01 09:47:05,128 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-09-01 09:47:05,128 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-09-01 09:47:05,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-09-01 09:47:05,129 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:47:05,133 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-01 09:47:05,133 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-01 09:47:05,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.09 09:47:05 BasicIcfg [2023-09-01 09:47:05,179 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-01 09:47:05,179 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-09-01 09:47:05,179 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-09-01 09:47:05,180 INFO L275 PluginConnector]: Witness Printer initialized [2023-09-01 09:47:05,180 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:46:45" (3/4) ... [2023-09-01 09:47:05,181 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-09-01 09:47:05,244 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-09-01 09:47:05,244 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-09-01 09:47:05,245 INFO L158 Benchmark]: Toolchain (without parser) took 20473.16ms. Allocated memory was 109.1MB in the beginning and 3.3GB in the end (delta: 3.2GB). Free memory was 86.2MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2023-09-01 09:47:05,245 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 65.0MB. Free memory was 42.1MB in the beginning and 42.1MB in the end (delta: 37.7kB). There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 09:47:05,245 INFO L158 Benchmark]: CACSL2BoogieTranslator took 413.25ms. Allocated memory is still 109.1MB. Free memory was 85.9MB in the beginning and 62.7MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-09-01 09:47:05,245 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.44ms. Allocated memory is still 109.1MB. Free memory was 62.7MB in the beginning and 87.0MB in the end (delta: -24.4MB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. [2023-09-01 09:47:05,246 INFO L158 Benchmark]: Boogie Preprocessor took 35.14ms. Allocated memory is still 109.1MB. Free memory was 87.0MB in the beginning and 84.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 09:47:05,246 INFO L158 Benchmark]: RCFGBuilder took 548.77ms. Allocated memory is still 109.1MB. Free memory was 84.9MB in the beginning and 49.9MB in the end (delta: 35.1MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2023-09-01 09:47:05,246 INFO L158 Benchmark]: TraceAbstraction took 19329.99ms. Allocated memory was 109.1MB in the beginning and 3.3GB in the end (delta: 3.2GB). Free memory was 49.3MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2023-09-01 09:47:05,246 INFO L158 Benchmark]: Witness Printer took 64.84ms. Allocated memory is still 3.3GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-09-01 09:47:05,249 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.16ms. Allocated memory is still 65.0MB. Free memory was 42.1MB in the beginning and 42.1MB in the end (delta: 37.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 413.25ms. Allocated memory is still 109.1MB. Free memory was 85.9MB in the beginning and 62.7MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.44ms. Allocated memory is still 109.1MB. Free memory was 62.7MB in the beginning and 87.0MB in the end (delta: -24.4MB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.14ms. Allocated memory is still 109.1MB. Free memory was 87.0MB in the beginning and 84.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 548.77ms. Allocated memory is still 109.1MB. Free memory was 84.9MB in the beginning and 49.9MB in the end (delta: 35.1MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 19329.99ms. Allocated memory was 109.1MB in the beginning and 3.3GB in the end (delta: 3.2GB). Free memory was 49.3MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 64.84ms. Allocated memory is still 3.3GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.0s, 137 PlacesBefore, 42 PlacesAfterwards, 126 TransitionsBefore, 30 TransitionsAfterwards, 2986 CoEnabledTransitionPairs, 6 FixpointIterations, 43 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 110 TotalNumberOfCompositions, 7942 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3394, independent: 3189, independent conditional: 0, independent unconditional: 3189, dependent: 205, dependent conditional: 0, dependent unconditional: 205, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1610, independent: 1567, independent conditional: 0, independent unconditional: 1567, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3394, independent: 1622, independent conditional: 0, independent unconditional: 1622, dependent: 162, dependent conditional: 0, dependent unconditional: 162, unknown: 1610, unknown conditional: 0, unknown unconditional: 1610] , Statistics on independence cache: Total cache size (in pairs): 131, Positive cache size: 114, Positive conditional cache size: 0, Positive unconditional cache size: 114, 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_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 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; [L859] 0 pthread_t t605; [L860] FCALL, FORK 0 pthread_create(&t605, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t605, ((void *)0), P0, ((void *)0))=-3, t605={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] [L861] 0 pthread_t t606; [L862] FCALL, FORK 0 pthread_create(&t606, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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(&t606, ((void *)0), P1, ((void *)0))=-2, t605={5:0}, t606={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] [L863] 0 pthread_t t607; [L864] FCALL, FORK 0 pthread_create(&t607, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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(&t607, ((void *)0), P2, ((void *)0))=-1, t605={5:0}, t606={6:0}, t607={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] [L865] 0 pthread_t t608; [L866] FCALL, FORK 0 pthread_create(&t608, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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(&t608, ((void *)0), P3, ((void *)0))=0, t605={5:0}, t606={6:0}, t607={7:0}, t608={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] [L798] 3 y$w_buff1 = y$w_buff0 [L799] 3 y$w_buff0 = 1 [L800] 3 y$w_buff1_used = y$w_buff0_used [L801] 3 y$w_buff0_used = (_Bool)1 [L802] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L802] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L803] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L804] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L805] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L806] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L807] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L808] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L811] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L828] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L831] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L834] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_p1_EAX=0, __unbuffered_p1_EBX=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 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=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] [L767] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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] [L837] 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) [L838] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L839] 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 [L840] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L841] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L844] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L846] 4 return 0; [L773] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L774] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L775] 2 y$flush_delayed = weak$$choice2 [L776] 2 y$mem_tmp = y [L777] 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) [L778] 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)) [L779] 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)) [L780] 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)) [L781] 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)) [L782] 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)) [L783] 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)) [L784] 2 __unbuffered_p1_EBX = y [L785] 2 y = y$flush_delayed ? y$mem_tmp : y [L786] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=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=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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] [L814] 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) [L815] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L816] 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 [L817] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L818] 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}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=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=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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] [L821] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 3 return 0; [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L868] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L870] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L870] RET 0 assume_abort_if_not(main$tmp_guard0) [L872] 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) [L873] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L874] 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 [L875] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L876] 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_p1_EAX=2, __unbuffered_p1_EBX=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, t605={5:0}, t606={6:0}, t607={7:0}, t608={3:0}, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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] [L879] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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: 864]: 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: 860]: 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: 862]: 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: 866]: 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, 166 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: 19.2s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 12.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 670 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 550 mSDsluCounter, 184 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 99 mSDsCounter, 102 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1425 IncrementalHoareTripleChecker+Invalid, 1527 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 102 mSolverCounterUnsat, 85 mSDtfsCounter, 1425 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=642occurred in iteration=10, InterpolantAutomatonStates: 68, 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.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 269 NumberOfCodeBlocks, 269 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 229 ConstructedInterpolants, 0 QuantifiedInterpolants, 1636 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:05,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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