./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix018_power.oepc_pso.oepc_rmo.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --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/mix018_power.oepc_pso.oepc_rmo.oepc.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 5a744aa24a15b244d86986861038a45981c329f5578e2da992d82373e2f73c5a --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 16:46:03,130 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 16:46:03,133 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 16:46:03,181 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 16:46:03,183 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 16:46:03,186 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 16:46:03,189 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 16:46:03,191 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 16:46:03,193 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 16:46:03,198 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 16:46:03,199 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 16:46:03,201 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 16:46:03,202 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 16:46:03,204 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 16:46:03,205 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 16:46:03,211 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 16:46:03,212 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 16:46:03,214 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 16:46:03,216 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 16:46:03,223 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 16:46:03,228 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 16:46:03,230 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 16:46:03,231 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 16:46:03,232 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 16:46:03,238 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 16:46:03,239 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 16:46:03,239 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 16:46:03,241 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 16:46:03,242 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 16:46:03,242 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 16:46:03,243 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 16:46:03,248 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 16:46:03,250 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 16:46:03,252 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 16:46:03,253 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 16:46:03,253 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 16:46:03,254 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 16:46:03,254 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 16:46:03,254 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 16:46:03,255 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 16:46:03,255 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 16:46:03,257 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 16:46:03,293 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 16:46:03,294 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 16:46:03,295 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 16:46:03,295 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 16:46:03,296 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 16:46:03,296 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 16:46:03,297 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 16:46:03,297 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 16:46:03,297 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 16:46:03,297 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 16:46:03,298 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 16:46:03,299 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 16:46:03,299 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 16:46:03,299 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 16:46:03,299 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 16:46:03,299 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 16:46:03,300 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 16:46:03,300 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 16:46:03,300 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 16:46:03,300 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 16:46:03,300 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 16:46:03,301 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 16:46:03,301 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 16:46:03,301 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 16:46:03,301 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:46:03,301 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 16:46:03,302 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 16:46:03,302 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 16:46:03,302 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 16:46:03,302 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 16:46:03,302 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 16:46:03,303 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 16:46:03,303 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 16:46:03,303 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 16:46:03,303 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 16:46:03,303 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 -> 5a744aa24a15b244d86986861038a45981c329f5578e2da992d82373e2f73c5a 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 -> AFTER [2023-08-30 16:46:03,639 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 16:46:03,665 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 16:46:03,668 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 16:46:03,669 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 16:46:03,672 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 16:46:03,674 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix018_power.oepc_pso.oepc_rmo.oepc.i [2023-08-30 16:46:04,896 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 16:46:05,203 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 16:46:05,204 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix018_power.oepc_pso.oepc_rmo.oepc.i [2023-08-30 16:46:05,223 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97da1913e/6cf672f9cb73470099657bb106af85ce/FLAGcdf391939 [2023-08-30 16:46:05,239 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97da1913e/6cf672f9cb73470099657bb106af85ce [2023-08-30 16:46:05,242 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 16:46:05,243 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 16:46:05,244 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 16:46:05,244 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 16:46:05,250 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 16:46:05,250 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:46:05" (1/1) ... [2023-08-30 16:46:05,251 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@286534de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:46:05, skipping insertion in model container [2023-08-30 16:46:05,251 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:46:05" (1/1) ... [2023-08-30 16:46:05,255 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 16:46:05,292 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 16:46:05,420 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/mix018_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-30 16:46:05,670 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:46:05,682 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 16:46:05,695 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/mix018_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-30 16:46:05,770 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:46:05,798 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:46:05,801 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:46:05,807 INFO L208 MainTranslator]: Completed translation [2023-08-30 16:46:05,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:46:05 WrapperNode [2023-08-30 16:46:05,808 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 16:46:05,809 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 16:46:05,809 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 16:46:05,809 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 16:46:05,815 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:46:05" (1/1) ... [2023-08-30 16:46:05,858 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:46:05" (1/1) ... [2023-08-30 16:46:05,881 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2023-08-30 16:46:05,885 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 16:46:05,886 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 16:46:05,886 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 16:46:05,886 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 16:46:05,894 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:46:05" (1/1) ... [2023-08-30 16:46:05,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:46:05" (1/1) ... [2023-08-30 16:46:05,908 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:46:05" (1/1) ... [2023-08-30 16:46:05,909 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:46:05" (1/1) ... [2023-08-30 16:46:05,921 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:46:05" (1/1) ... [2023-08-30 16:46:05,934 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:46:05" (1/1) ... [2023-08-30 16:46:05,937 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:46:05" (1/1) ... [2023-08-30 16:46:05,945 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:46:05" (1/1) ... [2023-08-30 16:46:05,948 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 16:46:05,952 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 16:46:05,953 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 16:46:05,953 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 16:46:05,954 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:46:05" (1/1) ... [2023-08-30 16:46:05,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:46:05,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:46:05,982 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 16:46:06,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 16:46:06,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 16:46:06,023 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 16:46:06,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 16:46:06,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 16:46:06,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 16:46:06,024 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 16:46:06,024 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 16:46:06,024 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 16:46:06,024 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 16:46:06,024 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 16:46:06,025 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 16:46:06,025 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 16:46:06,025 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 16:46:06,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 16:46:06,025 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 16:46:06,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 16:46:06,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 16:46:06,027 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 16:46:06,215 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 16:46:06,217 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 16:46:06,502 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 16:46:06,646 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 16:46:06,646 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 16:46:06,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:46:06 BoogieIcfgContainer [2023-08-30 16:46:06,648 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 16:46:06,657 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 16:46:06,657 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 16:46:06,660 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 16:46:06,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 04:46:05" (1/3) ... [2023-08-30 16:46:06,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b53137a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:46:06, skipping insertion in model container [2023-08-30 16:46:06,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:46:05" (2/3) ... [2023-08-30 16:46:06,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b53137a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:46:06, skipping insertion in model container [2023-08-30 16:46:06,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:46:06" (3/3) ... [2023-08-30 16:46:06,663 INFO L112 eAbstractionObserver]: Analyzing ICFG mix018_power.oepc_pso.oepc_rmo.oepc.i [2023-08-30 16:46:06,671 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 16:46:06,679 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 16:46:06,679 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 16:46:06,680 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 16:46:06,750 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 16:46:06,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 131 transitions, 282 flow [2023-08-30 16:46:06,826 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2023-08-30 16:46:06,826 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:46:06,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2023-08-30 16:46:06,833 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 131 transitions, 282 flow [2023-08-30 16:46:06,837 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 127 transitions, 266 flow [2023-08-30 16:46:06,841 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 16:46:06,850 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 127 transitions, 266 flow [2023-08-30 16:46:06,852 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 127 transitions, 266 flow [2023-08-30 16:46:06,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 127 transitions, 266 flow [2023-08-30 16:46:06,888 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2023-08-30 16:46:06,888 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:46:06,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2023-08-30 16:46:06,891 INFO L119 LiptonReduction]: Number of co-enabled transitions 3164 [2023-08-30 16:46:10,815 INFO L134 LiptonReduction]: Checked pairs total: 9238 [2023-08-30 16:46:10,816 INFO L136 LiptonReduction]: Total number of compositions: 110 [2023-08-30 16:46:10,835 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 16:46:10,842 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;@788a2004, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 16:46:10,842 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-30 16:46:10,852 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2023-08-30 16:46:10,852 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:46:10,852 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:46:10,853 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 16:46:10,854 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:46:10,859 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:46:10,859 INFO L85 PathProgramCache]: Analyzing trace with hash 549528, now seen corresponding path program 1 times [2023-08-30 16:46:10,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:46:10,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748233148] [2023-08-30 16:46:10,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:46:10,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:46:11,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:46:11,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:46:11,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:46:11,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748233148] [2023-08-30 16:46:11,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748233148] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:46:11,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:46:11,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:46:11,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420321880] [2023-08-30 16:46:11,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:46:11,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:46:11,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:46:11,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:46:11,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:46:11,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 241 [2023-08-30 16:46:11,312 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:11,313 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:46:11,313 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 241 [2023-08-30 16:46:11,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:46:12,246 INFO L130 PetriNetUnfolder]: 4903/7131 cut-off events. [2023-08-30 16:46:12,247 INFO L131 PetriNetUnfolder]: For 73/73 co-relation queries the response was YES. [2023-08-30 16:46:12,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13979 conditions, 7131 events. 4903/7131 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 41983 event pairs, 895 based on Foata normal form. 0/6791 useless extension candidates. Maximal degree in co-relation 13967. Up to 5335 conditions per place. [2023-08-30 16:46:12,289 INFO L137 encePairwiseOnDemand]: 237/241 looper letters, 41 selfloop transitions, 2 changer transitions 2/49 dead transitions. [2023-08-30 16:46:12,290 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 49 transitions, 209 flow [2023-08-30 16:46:12,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:46:12,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:46:12,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 393 transitions. [2023-08-30 16:46:12,302 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5435684647302904 [2023-08-30 16:46:12,303 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 393 transitions. [2023-08-30 16:46:12,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 393 transitions. [2023-08-30 16:46:12,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:46:12,307 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 393 transitions. [2023-08-30 16:46:12,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:12,314 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:12,315 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:12,317 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 74 flow. Second operand 3 states and 393 transitions. [2023-08-30 16:46:12,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 49 transitions, 209 flow [2023-08-30 16:46:12,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 49 transitions, 202 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 16:46:12,323 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 68 flow [2023-08-30 16:46:12,324 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2023-08-30 16:46:12,328 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2023-08-30 16:46:12,328 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 68 flow [2023-08-30 16:46:12,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:12,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:46:12,329 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:46:12,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 16:46:12,329 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:46:12,330 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:46:12,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1011822437, now seen corresponding path program 1 times [2023-08-30 16:46:12,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:46:12,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156095510] [2023-08-30 16:46:12,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:46:12,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:46:12,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:46:12,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:46:12,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:46:12,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156095510] [2023-08-30 16:46:12,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156095510] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:46:12,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:46:12,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:46:12,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901924303] [2023-08-30 16:46:12,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:46:12,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:46:12,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:46:12,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:46:12,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:46:12,646 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 241 [2023-08-30 16:46:12,647 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:12,647 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:46:12,647 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 241 [2023-08-30 16:46:12,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:46:14,625 INFO L130 PetriNetUnfolder]: 14433/19638 cut-off events. [2023-08-30 16:46:14,626 INFO L131 PetriNetUnfolder]: For 657/657 co-relation queries the response was YES. [2023-08-30 16:46:14,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40412 conditions, 19638 events. 14433/19638 cut-off events. For 657/657 co-relation queries the response was YES. Maximal size of possible extension queue 615. Compared 101856 event pairs, 5265 based on Foata normal form. 458/20096 useless extension candidates. Maximal degree in co-relation 40402. Up to 13647 conditions per place. [2023-08-30 16:46:14,744 INFO L137 encePairwiseOnDemand]: 233/241 looper letters, 44 selfloop transitions, 7 changer transitions 0/51 dead transitions. [2023-08-30 16:46:14,744 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 51 transitions, 222 flow [2023-08-30 16:46:14,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:46:14,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:46:14,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2023-08-30 16:46:14,748 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5117565698478561 [2023-08-30 16:46:14,748 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 370 transitions. [2023-08-30 16:46:14,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 370 transitions. [2023-08-30 16:46:14,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:46:14,749 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 370 transitions. [2023-08-30 16:46:14,750 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:14,753 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:14,754 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:14,754 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 68 flow. Second operand 3 states and 370 transitions. [2023-08-30 16:46:14,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 51 transitions, 222 flow [2023-08-30 16:46:14,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 51 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:46:14,756 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 118 flow [2023-08-30 16:46:14,757 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2023-08-30 16:46:14,757 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2023-08-30 16:46:14,758 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 118 flow [2023-08-30 16:46:14,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:14,758 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:46:14,759 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:46:14,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 16:46:14,759 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:46:14,759 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:46:14,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1301726837, now seen corresponding path program 1 times [2023-08-30 16:46:14,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:46:14,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795198442] [2023-08-30 16:46:14,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:46:14,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:46:14,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:46:14,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:46:14,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:46:14,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795198442] [2023-08-30 16:46:14,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795198442] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:46:14,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:46:14,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:46:14,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694644622] [2023-08-30 16:46:14,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:46:14,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:46:14,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:46:14,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:46:14,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:46:14,987 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 241 [2023-08-30 16:46:14,988 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:14,988 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:46:14,988 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 241 [2023-08-30 16:46:14,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:46:16,637 INFO L130 PetriNetUnfolder]: 13351/18188 cut-off events. [2023-08-30 16:46:16,637 INFO L131 PetriNetUnfolder]: For 6617/6617 co-relation queries the response was YES. [2023-08-30 16:46:16,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44457 conditions, 18188 events. 13351/18188 cut-off events. For 6617/6617 co-relation queries the response was YES. Maximal size of possible extension queue 552. Compared 90012 event pairs, 3910 based on Foata normal form. 230/18418 useless extension candidates. Maximal degree in co-relation 44445. Up to 9003 conditions per place. [2023-08-30 16:46:16,749 INFO L137 encePairwiseOnDemand]: 233/241 looper letters, 54 selfloop transitions, 8 changer transitions 0/62 dead transitions. [2023-08-30 16:46:16,750 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 62 transitions, 320 flow [2023-08-30 16:46:16,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:46:16,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:46:16,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 482 transitions. [2023-08-30 16:46:16,752 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-08-30 16:46:16,752 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 482 transitions. [2023-08-30 16:46:16,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 482 transitions. [2023-08-30 16:46:16,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:46:16,752 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 482 transitions. [2023-08-30 16:46:16,754 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.5) internal successors, (482), 4 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:16,756 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:16,756 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:16,757 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 118 flow. Second operand 4 states and 482 transitions. [2023-08-30 16:46:16,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 62 transitions, 320 flow [2023-08-30 16:46:16,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 62 transitions, 298 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:46:16,795 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 162 flow [2023-08-30 16:46:16,795 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=162, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2023-08-30 16:46:16,796 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2023-08-30 16:46:16,796 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 162 flow [2023-08-30 16:46:16,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:16,797 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:46:16,797 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:46:16,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 16:46:16,797 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:46:16,798 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:46:16,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1732554692, now seen corresponding path program 1 times [2023-08-30 16:46:16,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:46:16,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941377888] [2023-08-30 16:46:16,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:46:16,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:46:16,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:46:17,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:46:17,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:46:17,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941377888] [2023-08-30 16:46:17,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941377888] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:46:17,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:46:17,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:46:17,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877379849] [2023-08-30 16:46:17,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:46:17,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:46:17,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:46:17,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:46:17,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:46:17,060 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 241 [2023-08-30 16:46:17,060 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 162 flow. Second operand has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:17,060 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:46:17,061 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 241 [2023-08-30 16:46:17,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:46:18,624 INFO L130 PetriNetUnfolder]: 13076/17813 cut-off events. [2023-08-30 16:46:18,625 INFO L131 PetriNetUnfolder]: For 11142/11142 co-relation queries the response was YES. [2023-08-30 16:46:18,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46098 conditions, 17813 events. 13076/17813 cut-off events. For 11142/11142 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 91430 event pairs, 3313 based on Foata normal form. 40/17853 useless extension candidates. Maximal degree in co-relation 46083. Up to 11817 conditions per place. [2023-08-30 16:46:18,721 INFO L137 encePairwiseOnDemand]: 233/241 looper letters, 62 selfloop transitions, 16 changer transitions 0/78 dead transitions. [2023-08-30 16:46:18,721 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 78 transitions, 444 flow [2023-08-30 16:46:18,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:46:18,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:46:18,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 494 transitions. [2023-08-30 16:46:18,723 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5124481327800829 [2023-08-30 16:46:18,723 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 494 transitions. [2023-08-30 16:46:18,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 494 transitions. [2023-08-30 16:46:18,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:46:18,723 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 494 transitions. [2023-08-30 16:46:18,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 123.5) internal successors, (494), 4 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:18,726 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:18,727 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:18,727 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 162 flow. Second operand 4 states and 494 transitions. [2023-08-30 16:46:18,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 78 transitions, 444 flow [2023-08-30 16:46:18,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 78 transitions, 439 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 16:46:18,773 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 255 flow [2023-08-30 16:46:18,773 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=255, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2023-08-30 16:46:18,775 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 6 predicate places. [2023-08-30 16:46:18,775 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 255 flow [2023-08-30 16:46:18,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:18,775 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:46:18,776 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:46:18,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 16:46:18,776 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:46:18,776 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:46:18,776 INFO L85 PathProgramCache]: Analyzing trace with hash 2125398424, now seen corresponding path program 1 times [2023-08-30 16:46:18,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:46:18,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929261026] [2023-08-30 16:46:18,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:46:18,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:46:18,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:46:19,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:46:19,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:46:19,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929261026] [2023-08-30 16:46:19,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929261026] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:46:19,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:46:19,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:46:19,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580562508] [2023-08-30 16:46:19,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:46:19,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:46:19,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:46:19,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:46:19,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:46:19,166 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 241 [2023-08-30 16:46:19,167 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 255 flow. Second operand has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:19,167 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:46:19,167 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 241 [2023-08-30 16:46:19,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:46:20,301 INFO L130 PetriNetUnfolder]: 8363/12342 cut-off events. [2023-08-30 16:46:20,301 INFO L131 PetriNetUnfolder]: For 8700/9182 co-relation queries the response was YES. [2023-08-30 16:46:20,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31307 conditions, 12342 events. 8363/12342 cut-off events. For 8700/9182 co-relation queries the response was YES. Maximal size of possible extension queue 582. Compared 76216 event pairs, 1618 based on Foata normal form. 1085/12992 useless extension candidates. Maximal degree in co-relation 31289. Up to 5185 conditions per place. [2023-08-30 16:46:20,373 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 64 selfloop transitions, 6 changer transitions 0/85 dead transitions. [2023-08-30 16:46:20,374 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 85 transitions, 555 flow [2023-08-30 16:46:20,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:46:20,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:46:20,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 495 transitions. [2023-08-30 16:46:20,375 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5134854771784232 [2023-08-30 16:46:20,376 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 495 transitions. [2023-08-30 16:46:20,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 495 transitions. [2023-08-30 16:46:20,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:46:20,376 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 495 transitions. [2023-08-30 16:46:20,377 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:20,379 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:20,380 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:20,380 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 255 flow. Second operand 4 states and 495 transitions. [2023-08-30 16:46:20,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 85 transitions, 555 flow [2023-08-30 16:46:20,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 85 transitions, 555 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 16:46:20,394 INFO L231 Difference]: Finished difference. Result has 54 places, 49 transitions, 301 flow [2023-08-30 16:46:20,394 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=301, PETRI_PLACES=54, PETRI_TRANSITIONS=49} [2023-08-30 16:46:20,396 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 11 predicate places. [2023-08-30 16:46:20,397 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 49 transitions, 301 flow [2023-08-30 16:46:20,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:20,397 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:46:20,397 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:46:20,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 16:46:20,398 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:46:20,398 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:46:20,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1780258109, now seen corresponding path program 1 times [2023-08-30 16:46:20,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:46:20,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457193622] [2023-08-30 16:46:20,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:46:20,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:46:20,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:46:20,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:46:20,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:46:20,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457193622] [2023-08-30 16:46:20,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457193622] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:46:20,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:46:20,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:46:20,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828996081] [2023-08-30 16:46:20,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:46:20,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:46:20,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:46:20,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:46:20,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:46:20,826 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 241 [2023-08-30 16:46:20,828 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 49 transitions, 301 flow. Second operand has 5 states, 5 states have (on average 112.2) internal successors, (561), 5 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:20,828 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:46:20,828 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 241 [2023-08-30 16:46:20,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:46:21,725 INFO L130 PetriNetUnfolder]: 6716/10207 cut-off events. [2023-08-30 16:46:21,725 INFO L131 PetriNetUnfolder]: For 9961/10345 co-relation queries the response was YES. [2023-08-30 16:46:21,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31184 conditions, 10207 events. 6716/10207 cut-off events. For 9961/10345 co-relation queries the response was YES. Maximal size of possible extension queue 488. Compared 64594 event pairs, 1463 based on Foata normal form. 739/10553 useless extension candidates. Maximal degree in co-relation 31162. Up to 3895 conditions per place. [2023-08-30 16:46:21,775 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 82 selfloop transitions, 10 changer transitions 0/107 dead transitions. [2023-08-30 16:46:21,775 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 107 transitions, 738 flow [2023-08-30 16:46:21,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:46:21,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:46:21,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 622 transitions. [2023-08-30 16:46:21,777 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5161825726141079 [2023-08-30 16:46:21,777 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 622 transitions. [2023-08-30 16:46:21,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 622 transitions. [2023-08-30 16:46:21,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:46:21,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 622 transitions. [2023-08-30 16:46:21,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 124.4) internal successors, (622), 5 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:21,783 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:21,783 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:21,784 INFO L175 Difference]: Start difference. First operand has 54 places, 49 transitions, 301 flow. Second operand 5 states and 622 transitions. [2023-08-30 16:46:21,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 107 transitions, 738 flow [2023-08-30 16:46:21,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 107 transitions, 735 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 16:46:21,797 INFO L231 Difference]: Finished difference. Result has 59 places, 54 transitions, 366 flow [2023-08-30 16:46:21,798 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=366, PETRI_PLACES=59, PETRI_TRANSITIONS=54} [2023-08-30 16:46:21,801 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 16 predicate places. [2023-08-30 16:46:21,801 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 54 transitions, 366 flow [2023-08-30 16:46:21,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.2) internal successors, (561), 5 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:21,803 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:46:21,803 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:46:21,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 16:46:21,804 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:46:21,804 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:46:21,804 INFO L85 PathProgramCache]: Analyzing trace with hash -493523634, now seen corresponding path program 1 times [2023-08-30 16:46:21,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:46:21,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578840678] [2023-08-30 16:46:21,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:46:21,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:46:21,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:46:22,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:46:22,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:46:22,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578840678] [2023-08-30 16:46:22,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578840678] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:46:22,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:46:22,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:46:22,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770085817] [2023-08-30 16:46:22,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:46:22,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:46:22,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:46:22,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:46:22,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:46:22,143 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 241 [2023-08-30 16:46:22,144 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 54 transitions, 366 flow. Second operand has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:22,144 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:46:22,144 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 241 [2023-08-30 16:46:22,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:46:23,544 INFO L130 PetriNetUnfolder]: 11971/17356 cut-off events. [2023-08-30 16:46:23,545 INFO L131 PetriNetUnfolder]: For 39624/39624 co-relation queries the response was YES. [2023-08-30 16:46:23,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63357 conditions, 17356 events. 11971/17356 cut-off events. For 39624/39624 co-relation queries the response was YES. Maximal size of possible extension queue 603. Compared 100463 event pairs, 3093 based on Foata normal form. 76/17432 useless extension candidates. Maximal degree in co-relation 63332. Up to 9717 conditions per place. [2023-08-30 16:46:23,622 INFO L137 encePairwiseOnDemand]: 235/241 looper letters, 73 selfloop transitions, 11 changer transitions 10/94 dead transitions. [2023-08-30 16:46:23,623 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 94 transitions, 744 flow [2023-08-30 16:46:23,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:46:23,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:46:23,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 488 transitions. [2023-08-30 16:46:23,626 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5062240663900415 [2023-08-30 16:46:23,626 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 488 transitions. [2023-08-30 16:46:23,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 488 transitions. [2023-08-30 16:46:23,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:46:23,627 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 488 transitions. [2023-08-30 16:46:23,628 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-08-30 16:46:23,629 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:23,630 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:23,630 INFO L175 Difference]: Start difference. First operand has 59 places, 54 transitions, 366 flow. Second operand 4 states and 488 transitions. [2023-08-30 16:46:23,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 94 transitions, 744 flow [2023-08-30 16:46:23,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 94 transitions, 716 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-08-30 16:46:23,699 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 354 flow [2023-08-30 16:46:23,700 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=354, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2023-08-30 16:46:23,700 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 18 predicate places. [2023-08-30 16:46:23,701 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 354 flow [2023-08-30 16:46:23,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:23,701 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:46:23,701 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:46:23,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 16:46:23,702 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:46:23,702 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:46:23,702 INFO L85 PathProgramCache]: Analyzing trace with hash 166388660, now seen corresponding path program 1 times [2023-08-30 16:46:23,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:46:23,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148180201] [2023-08-30 16:46:23,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:46:23,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:46:23,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:46:24,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:46:24,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:46:24,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148180201] [2023-08-30 16:46:24,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148180201] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:46:24,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:46:24,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:46:24,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838209130] [2023-08-30 16:46:24,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:46:24,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:46:24,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:46:24,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:46:24,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:46:24,119 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 241 [2023-08-30 16:46:24,120 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 354 flow. Second operand has 6 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:24,120 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:46:24,120 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 241 [2023-08-30 16:46:24,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:46:24,859 INFO L130 PetriNetUnfolder]: 2994/4760 cut-off events. [2023-08-30 16:46:24,859 INFO L131 PetriNetUnfolder]: For 8732/8839 co-relation queries the response was YES. [2023-08-30 16:46:24,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16428 conditions, 4760 events. 2994/4760 cut-off events. For 8732/8839 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 27725 event pairs, 700 based on Foata normal form. 283/4914 useless extension candidates. Maximal degree in co-relation 16402. Up to 1596 conditions per place. [2023-08-30 16:46:24,883 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 90 selfloop transitions, 14 changer transitions 2/119 dead transitions. [2023-08-30 16:46:24,883 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 119 transitions, 902 flow [2023-08-30 16:46:24,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:46:24,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:46:24,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 745 transitions. [2023-08-30 16:46:24,886 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5152143845089903 [2023-08-30 16:46:24,886 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 745 transitions. [2023-08-30 16:46:24,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 745 transitions. [2023-08-30 16:46:24,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:46:24,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 745 transitions. [2023-08-30 16:46:24,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 124.16666666666667) internal successors, (745), 6 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:24,890 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:24,891 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:24,891 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 354 flow. Second operand 6 states and 745 transitions. [2023-08-30 16:46:24,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 119 transitions, 902 flow [2023-08-30 16:46:24,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 119 transitions, 815 flow, removed 12 selfloop flow, removed 5 redundant places. [2023-08-30 16:46:24,950 INFO L231 Difference]: Finished difference. Result has 63 places, 55 transitions, 380 flow [2023-08-30 16:46:24,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=380, PETRI_PLACES=63, PETRI_TRANSITIONS=55} [2023-08-30 16:46:24,950 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 20 predicate places. [2023-08-30 16:46:24,950 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 55 transitions, 380 flow [2023-08-30 16:46:24,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:24,952 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:46:24,952 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:46:24,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 16:46:24,952 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:46:24,952 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:46:24,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1751749529, now seen corresponding path program 1 times [2023-08-30 16:46:24,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:46:24,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457476182] [2023-08-30 16:46:24,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:46:24,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:46:25,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:46:25,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:46:25,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:46:25,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457476182] [2023-08-30 16:46:25,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457476182] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:46:25,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:46:25,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:46:25,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557098122] [2023-08-30 16:46:25,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:46:25,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:46:25,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:46:25,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:46:25,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:46:25,887 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 241 [2023-08-30 16:46:25,888 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 55 transitions, 380 flow. Second operand has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:25,889 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:46:25,889 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 241 [2023-08-30 16:46:25,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:46:26,888 INFO L130 PetriNetUnfolder]: 4812/7933 cut-off events. [2023-08-30 16:46:26,888 INFO L131 PetriNetUnfolder]: For 17449/17562 co-relation queries the response was YES. [2023-08-30 16:46:26,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29636 conditions, 7933 events. 4812/7933 cut-off events. For 17449/17562 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 53283 event pairs, 766 based on Foata normal form. 28/7874 useless extension candidates. Maximal degree in co-relation 29610. Up to 2587 conditions per place. [2023-08-30 16:46:26,926 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 100 selfloop transitions, 7 changer transitions 50/170 dead transitions. [2023-08-30 16:46:26,926 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 170 transitions, 1461 flow [2023-08-30 16:46:26,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:46:26,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:46:26,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 856 transitions. [2023-08-30 16:46:26,931 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5074096028452875 [2023-08-30 16:46:26,931 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 856 transitions. [2023-08-30 16:46:26,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 856 transitions. [2023-08-30 16:46:26,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:46:26,932 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 856 transitions. [2023-08-30 16:46:26,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.28571428571429) internal successors, (856), 7 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:26,936 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:26,937 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:26,937 INFO L175 Difference]: Start difference. First operand has 63 places, 55 transitions, 380 flow. Second operand 7 states and 856 transitions. [2023-08-30 16:46:26,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 170 transitions, 1461 flow [2023-08-30 16:46:27,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 170 transitions, 1309 flow, removed 40 selfloop flow, removed 4 redundant places. [2023-08-30 16:46:27,030 INFO L231 Difference]: Finished difference. Result has 68 places, 60 transitions, 400 flow [2023-08-30 16:46:27,030 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=400, PETRI_PLACES=68, PETRI_TRANSITIONS=60} [2023-08-30 16:46:27,031 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 25 predicate places. [2023-08-30 16:46:27,031 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 60 transitions, 400 flow [2023-08-30 16:46:27,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:27,031 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:46:27,031 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:46:27,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 16:46:27,032 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:46:27,032 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:46:27,032 INFO L85 PathProgramCache]: Analyzing trace with hash -646632411, now seen corresponding path program 2 times [2023-08-30 16:46:27,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:46:27,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429582401] [2023-08-30 16:46:27,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:46:27,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:46:27,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:46:27,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:46:27,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:46:27,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429582401] [2023-08-30 16:46:27,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429582401] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:46:27,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:46:27,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 16:46:27,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988168118] [2023-08-30 16:46:27,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:46:27,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:46:27,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:46:27,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:46:27,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:46:27,450 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 241 [2023-08-30 16:46:27,451 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 60 transitions, 400 flow. Second operand has 7 states, 7 states have (on average 112.0) internal successors, (784), 7 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:27,451 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:46:27,451 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 241 [2023-08-30 16:46:27,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:46:28,103 INFO L130 PetriNetUnfolder]: 3715/6053 cut-off events. [2023-08-30 16:46:28,104 INFO L131 PetriNetUnfolder]: For 9967/10098 co-relation queries the response was YES. [2023-08-30 16:46:28,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22246 conditions, 6053 events. 3715/6053 cut-off events. For 9967/10098 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 38455 event pairs, 687 based on Foata normal form. 127/6048 useless extension candidates. Maximal degree in co-relation 22223. Up to 1994 conditions per place. [2023-08-30 16:46:28,132 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 78 selfloop transitions, 18 changer transitions 9/116 dead transitions. [2023-08-30 16:46:28,132 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 116 transitions, 876 flow [2023-08-30 16:46:28,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:46:28,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:46:28,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 842 transitions. [2023-08-30 16:46:28,134 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4991108476585655 [2023-08-30 16:46:28,134 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 842 transitions. [2023-08-30 16:46:28,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 842 transitions. [2023-08-30 16:46:28,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:46:28,135 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 842 transitions. [2023-08-30 16:46:28,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.28571428571429) internal successors, (842), 7 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:28,139 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:28,140 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:28,140 INFO L175 Difference]: Start difference. First operand has 68 places, 60 transitions, 400 flow. Second operand 7 states and 842 transitions. [2023-08-30 16:46:28,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 116 transitions, 876 flow [2023-08-30 16:46:28,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 116 transitions, 867 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-30 16:46:28,266 INFO L231 Difference]: Finished difference. Result has 71 places, 56 transitions, 408 flow [2023-08-30 16:46:28,267 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=408, PETRI_PLACES=71, PETRI_TRANSITIONS=56} [2023-08-30 16:46:28,268 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 28 predicate places. [2023-08-30 16:46:28,268 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 56 transitions, 408 flow [2023-08-30 16:46:28,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.0) internal successors, (784), 7 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:28,269 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:46:28,269 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:46:28,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 16:46:28,269 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:46:28,270 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:46:28,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1679405713, now seen corresponding path program 1 times [2023-08-30 16:46:28,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:46:28,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021571299] [2023-08-30 16:46:28,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:46:28,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:46:28,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:46:28,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:46:28,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:46:28,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021571299] [2023-08-30 16:46:28,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021571299] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:46:28,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:46:28,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:46:28,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300309329] [2023-08-30 16:46:28,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:46:28,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:46:28,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:46:28,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:46:28,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:46:28,547 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 241 [2023-08-30 16:46:28,548 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 56 transitions, 408 flow. Second operand has 5 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:28,549 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:46:28,549 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 241 [2023-08-30 16:46:28,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:46:29,173 INFO L130 PetriNetUnfolder]: 3118/4803 cut-off events. [2023-08-30 16:46:29,174 INFO L131 PetriNetUnfolder]: For 11590/11590 co-relation queries the response was YES. [2023-08-30 16:46:29,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19308 conditions, 4803 events. 3118/4803 cut-off events. For 11590/11590 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 24999 event pairs, 256 based on Foata normal form. 1/4804 useless extension candidates. Maximal degree in co-relation 19279. Up to 2267 conditions per place. [2023-08-30 16:46:29,203 INFO L137 encePairwiseOnDemand]: 232/241 looper letters, 69 selfloop transitions, 8 changer transitions 74/151 dead transitions. [2023-08-30 16:46:29,203 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 151 transitions, 1341 flow [2023-08-30 16:46:29,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:46:29,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:46:29,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 717 transitions. [2023-08-30 16:46:29,206 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.495850622406639 [2023-08-30 16:46:29,206 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 717 transitions. [2023-08-30 16:46:29,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 717 transitions. [2023-08-30 16:46:29,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:46:29,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 717 transitions. [2023-08-30 16:46:29,209 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-08-30 16:46:29,212 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:29,212 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:29,212 INFO L175 Difference]: Start difference. First operand has 71 places, 56 transitions, 408 flow. Second operand 6 states and 717 transitions. [2023-08-30 16:46:29,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 151 transitions, 1341 flow [2023-08-30 16:46:29,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 151 transitions, 1179 flow, removed 26 selfloop flow, removed 7 redundant places. [2023-08-30 16:46:29,266 INFO L231 Difference]: Finished difference. Result has 71 places, 48 transitions, 301 flow [2023-08-30 16:46:29,267 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=301, PETRI_PLACES=71, PETRI_TRANSITIONS=48} [2023-08-30 16:46:29,267 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 28 predicate places. [2023-08-30 16:46:29,267 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 48 transitions, 301 flow [2023-08-30 16:46:29,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:29,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:46:29,268 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:46:29,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 16:46:29,268 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:46:29,269 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:46:29,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1017746163, now seen corresponding path program 2 times [2023-08-30 16:46:29,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:46:29,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607330844] [2023-08-30 16:46:29,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:46:29,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:46:29,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:46:29,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:46:29,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:46:29,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607330844] [2023-08-30 16:46:29,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607330844] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:46:29,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:46:29,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:46:29,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320895094] [2023-08-30 16:46:29,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:46:29,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:46:29,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:46:29,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:46:29,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:46:29,628 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 241 [2023-08-30 16:46:29,630 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 48 transitions, 301 flow. Second operand has 5 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:29,630 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:46:29,630 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 241 [2023-08-30 16:46:29,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:46:30,023 INFO L130 PetriNetUnfolder]: 1429/2263 cut-off events. [2023-08-30 16:46:30,023 INFO L131 PetriNetUnfolder]: For 3412/3412 co-relation queries the response was YES. [2023-08-30 16:46:30,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8297 conditions, 2263 events. 1429/2263 cut-off events. For 3412/3412 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 10584 event pairs, 164 based on Foata normal form. 1/2264 useless extension candidates. Maximal degree in co-relation 8277. Up to 939 conditions per place. [2023-08-30 16:46:30,031 INFO L137 encePairwiseOnDemand]: 233/241 looper letters, 59 selfloop transitions, 3 changer transitions 48/110 dead transitions. [2023-08-30 16:46:30,031 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 110 transitions, 884 flow [2023-08-30 16:46:30,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:46:30,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:46:30,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 695 transitions. [2023-08-30 16:46:30,034 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4806362378976487 [2023-08-30 16:46:30,034 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 695 transitions. [2023-08-30 16:46:30,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 695 transitions. [2023-08-30 16:46:30,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:46:30,035 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 695 transitions. [2023-08-30 16:46:30,036 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 115.83333333333333) internal successors, (695), 6 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:30,038 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:30,039 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:30,039 INFO L175 Difference]: Start difference. First operand has 71 places, 48 transitions, 301 flow. Second operand 6 states and 695 transitions. [2023-08-30 16:46:30,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 110 transitions, 884 flow [2023-08-30 16:46:30,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 110 transitions, 687 flow, removed 15 selfloop flow, removed 13 redundant places. [2023-08-30 16:46:30,058 INFO L231 Difference]: Finished difference. Result has 63 places, 42 transitions, 178 flow [2023-08-30 16:46:30,059 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=178, PETRI_PLACES=63, PETRI_TRANSITIONS=42} [2023-08-30 16:46:30,059 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 20 predicate places. [2023-08-30 16:46:30,059 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 42 transitions, 178 flow [2023-08-30 16:46:30,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:30,060 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:46:30,060 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:46:30,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 16:46:30,061 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:46:30,061 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:46:30,061 INFO L85 PathProgramCache]: Analyzing trace with hash -372646229, now seen corresponding path program 3 times [2023-08-30 16:46:30,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:46:30,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497446750] [2023-08-30 16:46:30,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:46:30,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:46:30,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:46:31,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:46:31,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:46:31,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497446750] [2023-08-30 16:46:31,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497446750] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:46:31,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:46:31,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 16:46:31,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120539173] [2023-08-30 16:46:31,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:46:31,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 16:46:31,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:46:31,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 16:46:31,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-30 16:46:31,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 241 [2023-08-30 16:46:31,224 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 42 transitions, 178 flow. Second operand has 8 states, 8 states have (on average 113.0) internal successors, (904), 8 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:31,224 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:46:31,224 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 241 [2023-08-30 16:46:31,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:46:31,560 INFO L130 PetriNetUnfolder]: 749/1263 cut-off events. [2023-08-30 16:46:31,561 INFO L131 PetriNetUnfolder]: For 1112/1166 co-relation queries the response was YES. [2023-08-30 16:46:31,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3734 conditions, 1263 events. 749/1263 cut-off events. For 1112/1166 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 6001 event pairs, 131 based on Foata normal form. 30/1271 useless extension candidates. Maximal degree in co-relation 3718. Up to 810 conditions per place. [2023-08-30 16:46:31,566 INFO L137 encePairwiseOnDemand]: 235/241 looper letters, 50 selfloop transitions, 5 changer transitions 30/89 dead transitions. [2023-08-30 16:46:31,566 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 89 transitions, 521 flow [2023-08-30 16:46:31,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:46:31,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:46:31,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 825 transitions. [2023-08-30 16:46:31,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4890337877889745 [2023-08-30 16:46:31,569 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 825 transitions. [2023-08-30 16:46:31,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 825 transitions. [2023-08-30 16:46:31,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:46:31,570 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 825 transitions. [2023-08-30 16:46:31,619 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.85714285714286) internal successors, (825), 7 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:31,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:31,621 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:31,622 INFO L175 Difference]: Start difference. First operand has 63 places, 42 transitions, 178 flow. Second operand 7 states and 825 transitions. [2023-08-30 16:46:31,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 89 transitions, 521 flow [2023-08-30 16:46:31,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 89 transitions, 502 flow, removed 3 selfloop flow, removed 7 redundant places. [2023-08-30 16:46:31,636 INFO L231 Difference]: Finished difference. Result has 61 places, 42 transitions, 181 flow [2023-08-30 16:46:31,637 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=181, PETRI_PLACES=61, PETRI_TRANSITIONS=42} [2023-08-30 16:46:31,638 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 18 predicate places. [2023-08-30 16:46:31,638 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 42 transitions, 181 flow [2023-08-30 16:46:31,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 113.0) internal successors, (904), 8 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:31,639 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:46:31,639 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:46:31,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 16:46:31,640 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:46:31,640 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:46:31,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1478385105, now seen corresponding path program 4 times [2023-08-30 16:46:31,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:46:31,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553020978] [2023-08-30 16:46:31,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:46:31,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:46:31,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:46:31,706 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 16:46:31,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:46:31,791 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 16:46:31,791 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 16:46:31,792 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-30 16:46:31,794 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-30 16:46:31,794 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-08-30 16:46:31,795 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-30 16:46:31,795 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-30 16:46:31,795 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-30 16:46:31,795 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-30 16:46:31,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 16:46:31,796 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:46:31,801 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 16:46:31,801 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 16:46:31,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 04:46:31 BasicIcfg [2023-08-30 16:46:31,876 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 16:46:31,878 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 16:46:31,878 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 16:46:31,878 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 16:46:31,879 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:46:06" (3/4) ... [2023-08-30 16:46:31,880 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 16:46:31,981 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 16:46:31,981 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 16:46:31,982 INFO L158 Benchmark]: Toolchain (without parser) took 26738.93ms. Allocated memory was 69.2MB in the beginning and 3.8GB in the end (delta: 3.8GB). Free memory was 41.7MB in the beginning and 3.6GB in the end (delta: -3.5GB). Peak memory consumption was 259.8MB. Max. memory is 16.1GB. [2023-08-30 16:46:31,982 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 69.2MB. Free memory is still 47.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 16:46:31,983 INFO L158 Benchmark]: CACSL2BoogieTranslator took 563.84ms. Allocated memory was 69.2MB in the beginning and 98.6MB in the end (delta: 29.4MB). Free memory was 41.5MB in the beginning and 67.8MB in the end (delta: -26.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-08-30 16:46:31,983 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.09ms. Allocated memory is still 98.6MB. Free memory was 67.8MB in the beginning and 65.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 16:46:31,983 INFO L158 Benchmark]: Boogie Preprocessor took 65.27ms. Allocated memory is still 98.6MB. Free memory was 65.1MB in the beginning and 63.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 16:46:31,984 INFO L158 Benchmark]: RCFGBuilder took 696.69ms. Allocated memory is still 98.6MB. Free memory was 63.1MB in the beginning and 61.0MB in the end (delta: 2.1MB). Peak memory consumption was 27.7MB. Max. memory is 16.1GB. [2023-08-30 16:46:31,985 INFO L158 Benchmark]: TraceAbstraction took 25219.32ms. Allocated memory was 98.6MB in the beginning and 3.8GB in the end (delta: 3.7GB). Free memory was 60.4MB in the beginning and 3.6GB in the end (delta: -3.5GB). Peak memory consumption was 232.1MB. Max. memory is 16.1GB. [2023-08-30 16:46:31,986 INFO L158 Benchmark]: Witness Printer took 103.81ms. Allocated memory is still 3.8GB. Free memory was 3.6GB in the beginning and 3.6GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-08-30 16:46:31,988 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.22ms. Allocated memory is still 69.2MB. Free memory is still 47.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 563.84ms. Allocated memory was 69.2MB in the beginning and 98.6MB in the end (delta: 29.4MB). Free memory was 41.5MB in the beginning and 67.8MB in the end (delta: -26.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.09ms. Allocated memory is still 98.6MB. Free memory was 67.8MB in the beginning and 65.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.27ms. Allocated memory is still 98.6MB. Free memory was 65.1MB in the beginning and 63.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 696.69ms. Allocated memory is still 98.6MB. Free memory was 63.1MB in the beginning and 61.0MB in the end (delta: 2.1MB). Peak memory consumption was 27.7MB. Max. memory is 16.1GB. * TraceAbstraction took 25219.32ms. Allocated memory was 98.6MB in the beginning and 3.8GB in the end (delta: 3.7GB). Free memory was 60.4MB in the beginning and 3.6GB in the end (delta: -3.5GB). Peak memory consumption was 232.1MB. Max. memory is 16.1GB. * Witness Printer took 103.81ms. Allocated memory is still 3.8GB. Free memory was 3.6GB in the beginning and 3.6GB in the end (delta: 16.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: 4.0s, 138 PlacesBefore, 43 PlacesAfterwards, 127 TransitionsBefore, 31 TransitionsAfterwards, 3164 CoEnabledTransitionPairs, 7 FixpointIterations, 43 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 110 TotalNumberOfCompositions, 9238 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3605, independent: 3360, independent conditional: 0, independent unconditional: 3360, dependent: 245, dependent conditional: 0, dependent unconditional: 245, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1694, independent: 1649, independent conditional: 0, independent unconditional: 1649, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3605, independent: 1711, independent conditional: 0, independent unconditional: 1711, dependent: 200, dependent conditional: 0, dependent unconditional: 200, unknown: 1694, unknown conditional: 0, unknown unconditional: 1694] , Statistics on independence cache: Total cache size (in pairs): 172, Positive cache size: 152, Positive conditional cache size: 0, Positive unconditional cache size: 152, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, 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_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool a$flush_delayed; [L722] 0 int a$mem_tmp; [L723] 0 _Bool a$r_buff0_thd0; [L724] 0 _Bool a$r_buff0_thd1; [L725] 0 _Bool a$r_buff0_thd2; [L726] 0 _Bool a$r_buff0_thd3; [L727] 0 _Bool a$r_buff0_thd4; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$r_buff1_thd4; [L733] 0 _Bool a$read_delayed; [L734] 0 int *a$read_delayed_var; [L735] 0 int a$w_buff0; [L736] 0 _Bool a$w_buff0_used; [L737] 0 int a$w_buff1; [L738] 0 _Bool a$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L866] 0 pthread_t t465; [L867] FCALL, FORK 0 pthread_create(&t465, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t465, ((void *)0), P0, ((void *)0))=-3, t465={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L868] 0 pthread_t t466; [L869] FCALL, FORK 0 pthread_create(&t466, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t466, ((void *)0), P1, ((void *)0))=-2, t465={5:0}, t466={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L870] 0 pthread_t t467; [L871] FCALL, FORK 0 pthread_create(&t467, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t467, ((void *)0), P2, ((void *)0))=-1, t465={5:0}, t466={6:0}, t467={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L872] 0 pthread_t t468; [L873] FCALL, FORK 0 pthread_create(&t468, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t468, ((void *)0), P3, ((void *)0))=0, t465={5:0}, t466={6:0}, t467={7:0}, t468={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=0, z=0] [L765] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=0, z=0] [L782] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=0, z=0] [L788] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L789] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L790] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L791] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L792] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=0, z=0] [L802] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=1, z=0] [L805] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=1, z=0] [L822] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L825] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L828] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 4 a$flush_delayed = weak$$choice2 [L831] 4 a$mem_tmp = a [L832] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L833] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L834] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L835] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L836] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L838] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 __unbuffered_p3_EBX = a [L840] 4 a = a$flush_delayed ? a$mem_tmp : a [L841] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1, z=1] [L844] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L845] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L846] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L847] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L848] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1, z=1] [L768] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=1, z=1] [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L808] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L809] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L810] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L811] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L812] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=1, z=1] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L851] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L853] 4 return 0; [L875] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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, t465={5:0}, t466={6:0}, t467={7:0}, t468={3:0}, weak$$choice2=0, x=2, y=1, z=1] [L877] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L877] RET 0 assume_abort_if_not(main$tmp_guard0) [L879] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L880] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L881] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L882] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L883] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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, t465={5:0}, t466={6:0}, t467={7:0}, t468={3:0}, weak$$choice2=0, x=2, y=1, z=1] [L886] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L888] 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=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=1, z=1] - 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: 867]: 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: 871]: 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: 873]: 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: 869]: 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, 168 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: 25.0s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 15.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 935 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 803 mSDsluCounter, 284 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 210 mSDsCounter, 135 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1711 IncrementalHoareTripleChecker+Invalid, 1846 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 135 mSolverCounterUnsat, 74 mSDtfsCounter, 1711 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=408occurred in iteration=10, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 271 NumberOfCodeBlocks, 271 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 230 ConstructedInterpolants, 0 QuantifiedInterpolants, 1856 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-08-30 16:46:32,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE